Benchmark
incremental/UFDTNIA/20201212-Barrett/aborts_if_with_code_partial_error.smt2
From the test suite for the Move Prover, a verifier for smart contracts in the
Move programming language. A paper about the tool is here:
https://doi.org/10.1007/978-3-030-53288-8_7
The Move Prover code and tests are available at:
https://github.com/diem/diem/tree/main/language/move-prover
The benchmarks were generated using the master branch and standard test suite
as of Dec 17, 2020. Submitted by Clark Barrett <barrett@cs.stanford.edu>.
| Status | unsat |
| Inferred Status | None |
| Size | 34277 |
| Compressed Size | 5887 |
| Max. Term Depth | 35 |
| Asserts | 63 |
| Declared Functions | 50 |
| Declared Constants | 17 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 14 |
false | 14 |
Bool | 1 |
ite | 26 |
not | 17 |
or | 16 |
and | 107 |
=> | 89 |
= | 133 |
forall | 69 |
let | 53 |
Int | 63 |
div | 1 |
+ | 9 |
- | 12 |
* | 1 |
< | 28 |
<= | 40 |
> | 2 |
>= | 23 |
| Status | unknown |
| Inferred Status | None |
| Size | 33401 |
| Compressed Size | 5787 |
| Max. Term Depth | 35 |
| Asserts | 63 |
| Declared Functions | 50 |
| Declared Constants | 23 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 14 |
false | 14 |
Bool | 1 |
ite | 26 |
not | 11 |
or | 16 |
and | 102 |
=> | 74 |
= | 129 |
forall | 69 |
let | 53 |
Int | 63 |
div | 1 |
+ | 9 |
- | 9 |
* | 1 |
< | 29 |
<= | 39 |
> | 2 |
>= | 23 |
| Status | unsat |
| Inferred Status | None |
| Size | 32679 |
| Compressed Size | 5721 |
| Max. Term Depth | 33 |
| Asserts | 63 |
| Declared Functions | 50 |
| Declared Constants | 30 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 13 |
false | 14 |
Bool | 1 |
ite | 26 |
not | 10 |
or | 16 |
and | 101 |
=> | 68 |
= | 126 |
forall | 69 |
let | 51 |
Int | 63 |
div | 1 |
+ | 9 |
- | 9 |
* | 1 |
< | 28 |
<= | 39 |
> | 1 |
>= | 23 |
| Status | unknown |
| Inferred Status | None |
| Size | 34051 |
| Compressed Size | 5840 |
| Max. Term Depth | 35 |
| Asserts | 63 |
| Declared Functions | 50 |
| Declared Constants | 36 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 14 |
false | 14 |
Bool | 1 |
ite | 26 |
not | 11 |
or | 16 |
and | 102 |
=> | 74 |
= | 129 |
forall | 69 |
let | 53 |
Int | 63 |
div | 1 |
+ | 9 |
- | 9 |
* | 1 |
< | 29 |
<= | 39 |
> | 2 |
>= | 23 |
| Status | unsat |
| Inferred Status | None |
| Size | 35702 |
| Compressed Size | 5954 |
| Max. Term Depth | 35 |
| Asserts | 63 |
| Declared Functions | 50 |
| Declared Constants | 43 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 14 |
false | 14 |
Bool | 1 |
ite | 26 |
not | 17 |
or | 16 |
and | 107 |
=> | 89 |
= | 133 |
forall | 69 |
let | 53 |
Int | 63 |
div | 1 |
+ | 9 |
- | 12 |
* | 1 |
< | 28 |
<= | 40 |
> | 2 |
>= | 23 |
| Status | unsat |
| Inferred Status | None |
| Size | 33703 |
| Compressed Size | 5858 |
| Max. Term Depth | 33 |
| Asserts | 63 |
| Declared Functions | 50 |
| Declared Constants | 50 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 13 |
false | 14 |
Bool | 1 |
ite | 26 |
not | 10 |
or | 16 |
and | 101 |
=> | 68 |
= | 126 |
forall | 69 |
let | 51 |
Int | 63 |
div | 1 |
+ | 9 |
- | 9 |
* | 1 |
< | 28 |
<= | 39 |
> | 1 |
>= | 23 |