Benchmark
incremental/UFDTNIA/20201212-Barrett/DiemVersion.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>.
| Benchmark |
|---|
| Size | 154202 |
| Compressed Size | 13120 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | industrial |
| First Occurrence | — |
| Generated By | — |
| Generated On | — |
| Generator | — |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 2 |
| Status | unsat |
| Inferred Status | None |
| Size | 79898 |
| Compressed Size | 9034 |
| Max. Term Depth | 54 |
| Asserts | 94 |
| Declared Functions | 58 |
| Declared Constants | 67 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 20 |
false | 7 |
Bool | 3 |
ite | 26 |
not | 123 |
or | 70 |
and | 191 |
=> | 183 |
= | 244 |
distinct | 1 |
forall | 80 |
let | 70 |
Int | 72 |
div | 1 |
+ | 11 |
- | 25 |
* | 1 |
< | 24 |
<= | 36 |
> | 2 |
>= | 21 |
| | | | | |
| Status | unsat |
| Inferred Status | None |
| Size | 106577 |
| Compressed Size | 10297 |
| Max. Term Depth | 79 |
| Asserts | 94 |
| Declared Functions | 58 |
| Declared Constants | 100 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 27 |
false | 9 |
Bool | 3 |
ite | 26 |
not | 103 |
or | 61 |
and | 296 |
=> | 211 |
= | 288 |
distinct | 1 |
forall | 89 |
let | 108 |
Int | 81 |
div | 1 |
+ | 11 |
- | 21 |
* | 1 |
< | 49 |
<= | 53 |
> | 11 |
>= | 40 |
| | | | | |