Benchmark

incremental/UFDTNIA/20201212-Barrett/mut_ref_unpack.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	60626
Compressed Size	9263
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	3

Query 1

Status	unsat
Inferred Status	None
Size	35615
Compressed Size	6356
Max. Term Depth	46
Asserts	65
Declared Functions	50
Declared Constants	34
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	14	false	10	Bool	1	ite	26
not	14	or	13	and	101	=>	76
=	160	forall	62	let	57	Int	56
div	1	+	11	-	10	*	1
<	21	<=	30	>	1	>=	15

Query 2

Status	unsat
Inferred Status	None
Size	43809
Compressed Size	7373
Max. Term Depth	67
Asserts	65
Declared Functions	50
Declared Constants	65
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	20	false	10	Bool	1	ite	26
not	18	or	14	and	129	=>	110
=	204	forall	63	let	80	Int	57
div	1	+	12	-	10	*	1
<	22	<=	33	>	1	>=	17

Query 3

Status	unknown
Inferred Status	None
Size	34016
Compressed Size	6148
Max. Term Depth	37
Asserts	65
Declared Functions	50
Declared Constants	76
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	13	false	8	Bool	1	ite	26
not	9	or	13	and	82	=>	53
=	131	forall	62	let	48	Int	56
div	1	+	11	-	9	*	1
<	21	<=	28	>	1	>=	15