forked from leanprover/lean4
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
test:
big_omega
benchmark (leanprover#5817)
Extracted from leanprover#5614
- Loading branch information
1 parent
0d7f32a
commit bbf206e
Showing
3 changed files
with
53 additions
and
1 deletion.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,40 @@ | ||
/-! | ||
This benchmark exercises `omega` in a way that creates a big proof, exercising `instantiateMVars` | ||
and `shareCommonPreDefs` as well. In particular, running it with `internal.cmdlineSnapshots=false`, | ||
like the language server does, uncovered a significant slowdown in `instantiateMVars` (#5614). | ||
-/ | ||
|
||
set_option maxHeartbeats 0 | ||
theorem memcpy_extracted_2 (six0 s0x0 : BitVec 64) | ||
(h_six0_nonzero : six0 ≠ 0) | ||
(h_s0x1 : s0x1 + 16#64 * (s0x0 - six0) + 16#64 = s0x1 + 16#64 * (s0x0 - (six0 - 1#64))) | ||
(h_s0x2 : s0x2 + 16#64 * (s0x0 - six0) + 16#64 = s0x2 + 16#64 * (s0x0 - (six0 - 1#64))) | ||
(h_assert_1 : six0 ≤ s0x0) | ||
(h_assert_3 : six1 = s0x1 + 16#64 * (s0x0 - six0)) | ||
(h_assert_4 : six2 = s0x2 + 16#64 * (s0x0 - six0)) | ||
(n : Nat) | ||
(addr : BitVec 64) | ||
(h_le : (s0x0 - (six0 - 1#64)).toNat ≤ s0x0.toNat) | ||
(h_upper_bound : addr.toNat + n ≤ 2 ^ 64) | ||
(h_upper_bound₂ : s0x2.toNat + s0x0.toNat * 16 ≤ 2 ^ 64) | ||
(h_upper_bound₃ : s0x2.toNat + (16#64 * (s0x0 - (six0 - 1#64))).toNat ≤ 2 ^ 64) | ||
(h_width_lt : (16#64).toNat * (s0x0 - (six0 - 1#64)).toNat < 2 ^ 64) | ||
(hmemSeparate_omega : s0x1.toNat + s0x0.toNat * 16 ≤ 2 ^ 64 ∧ | ||
s0x2.toNat + s0x0.toNat * 16 ≤ 2 ^ 64 ∧ | ||
(s0x1.toNat + s0x0.toNat * 16 ≤ s0x2.toNat ∨ s0x1.toNat ≥ s0x2.toNat + s0x0.toNat * 16)) | ||
(hmemLegal_omega : s0x1.toNat + s0x0.toNat * 16 ≤ 2 ^ 64) | ||
(hmemLegal_omega : s0x2.toNat + s0x0.toNat * 16 ≤ 2 ^ 64) | ||
(hmemSeparate_omega : s0x2.toNat + 16 % 2 ^ 64 * ((2 ^ 64 - (2 ^ 64 - 1 % 2 ^ 64 + six0.toNat) % 2 ^ 64 + s0x0.toNat) % 2 ^ 64) % 2 ^ 64 ≤ | ||
2 ^ 64 ∧ | ||
addr.toNat + n ≤ 2 ^ 64 ∧ | ||
(s0x2.toNat + | ||
16 % 2 ^ 64 * ((2 ^ 64 - (2 ^ 64 - 1 % 2 ^ 64 + six0.toNat) % 2 ^ 64 + s0x0.toNat) % 2 ^ 64) % 2 ^ 64 ≤ | ||
addr.toNat ∨ | ||
s0x2.toNat ≥ addr.toNat + n)) | ||
(hmemLegal_omega : s0x2.toNat + 16 % 2 ^ 64 * ((2 ^ 64 - (2 ^ 64 - 1 % 2 ^ 64 + six0.toNat) % 2 ^ 64 + s0x0.toNat) % 2 ^ 64) % 2 ^ 64 ≤ | ||
2 ^ 64) | ||
(hmemLegal_omega : addr.toNat + n ≤ 2 ^ 64) : | ||
s0x2.toNat + (16#64 * (s0x0 - six0)).toNat ≤ 2 ^ 64 ∧ | ||
addr.toNat + n ≤ 2 ^ 64 ∧ | ||
(s0x2.toNat + (16#64 * (s0x0 - six0)).toNat ≤ addr.toNat ∨ s0x2.toNat ≥ addr.toNat + n) := by | ||
bv_omega |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters