Benchmark

incremental/UFDTNIA/20201212-Barrett/ModifiesSchemaTest.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	49119
Compressed Size	7759
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	35858
Compressed Size	6477
Max. Term Depth	46
Asserts	67
Declared Functions	52
Declared Constants	34
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	18	false	9	Bool	3	ite	26
not	11	or	14	and	100	=>	69
=	156	forall	65	let	56	Int	60
div	1	+	10	-	8	*	1
<	21	<=	30	>	1	>=	15

Query 2

Status	unsat
Inferred Status	None
Size	32032
Compressed Size	5843
Max. Term Depth	31
Asserts	69
Declared Functions	53
Declared Constants	39
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	14	false	8	Bool	3	ite	26
not	9	or	15	and	75	=>	42
=	121	forall	67	let	41	Int	63
div	1	+	9	-	7	*	1
<	21	<=	28	>	1	>=	15

Query 3

Status	unknown
Inferred Status	None
Size	34725
Compressed Size	6090
Max. Term Depth	37
Asserts	69
Declared Functions	53
Declared Constants	47
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	17	false	8	Bool	3	ite	26
not	11	or	15	and	81	=>	57
=	132	forall	67	let	47	Int	63
div	1	+	9	-	8	*	1
<	21	<=	28	>	1	>=	15