Benchmark
non-incremental/QF_NIA/LassoRanker/ChawdharyCookGulwaniSagivYang-ESOP2008-aaron12_true-termination.c_Iteration1_Loop+nonterminationTemplate_0.smt2
SMT script generated by Ultimate LassoRanker [1].
Ultimate LassoRanker is a tool that analyzes termination and nontermination of
lasso-shaped programs. This script contains the SMT commands that Ultimate
LassoRanker used while checking if a lasso-shaped program has a geometric
nontermination argument. (See [2] for a preliminary definition of
geometric nontermination argument.)
This SMT script belongs to a set of SMT scripts that was generated by applying
Ultimate Buchi Automizer [3,4] to benchmarks from the SV-COMP 2016 [5,6]
which are available at [7]. Ultimate Buchi Automizer takes omega-traces
(lasso-shaped programs) and uses LassoRanker in order to check if the
lasso-shaped program is terminating.
2016-04-30, Matthias Heizmann (heizmann@informatik.uni-freiburg.de)
[1] https://ultimate.informatik.uni-freiburg.de/LassoRanker/
[2] Jan Leike, Matthias Heizmann: Geometric Series as Nontermination
Arguments for Linear Lasso Programs. CoRR abs/1405.4413 (2014)
http://arxiv.org/abs/1405.4413
[3] http://ultimate.informatik.uni-freiburg.de/BuchiAutomizer/
[4] Matthias Heizmann, Jochen Hoenicke, Andreas Podelski: Software Model
Checking for People Who Love Automata. CAV 2013:36-52
[5] http://sv-comp.sosy-lab.org/2016/
[6] Dirk Beyer: Reliable and Reproducible Competition Results with BenchExec
and Witnesses (Report on SV-COMP 2016). TACAS 2016: 887-904
[7] https://github.com/dbeyer/sv-benchmarks
| Benchmark |
|---|
| Size | 7720 |
| Compressed Size | 1433 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | industrial |
| First Occurrence | 2014-07-21 |
| Generated By | — |
| Generated On | — |
| Generator | — |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | unsat |
| Inferred Status | unsat |
| Size | 7712 |
| Compressed Size | 1427 |
| Max. Term Depth | 7 |
| Asserts | 1 |
| Declared Functions | 0 |
| Declared Constants | 15 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 1 |
or | 2 |
and | 3 |
= | 4 |
+ | 50 |
- | 25 |
* | 130 |
>= | 23 |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2016
|
0.57 (3/7) |
AProVE |
AProVE NIA 2014 default |
unknown ❌
|
2400.02000
|
2416.06000
|
| |
CVC4 |
CVC4-master-2016-05-27-cfef263-main default |
unknown ❌
|
2400.12000
|
2398.24000
|
| |
ProB |
ProB competition |
unknown ❌
|
1.10588
|
1.10680
|
| |
raSAT |
raSAT 0.3 default.sh |
unsat ✅
|
2400.07000
|
2401.64000
|
| |
|
raSAT 0.4 exp - final default.py |
unknown ❌
|
2400.02000
|
4818.67000
|
| |
SMT-RAT |
SMT-RAT default |
unknown ❌
|
2400.04000
|
2401.62000
|
| |
Yices2 |
Yices-2.4.2 default |
unsat ✅
|
0.02314
|
0.02310
|
| |
Z3 |
z3-4.4.1 default |
unsat ✅
|
140.46800
|
140.55000
|
|
SMT-COMP 2017
|
0.40 (3/5) |
AProVE |
AProVE NIA 2014 default |
unknown ❌
|
600.02900
|
608.14000
|
| |
CVC4 |
CVC4-smtcomp2017-main default |
unsat ✅
|
0.05257
|
0.05278
|
| |
SMT-RAT |
SMTRAT-comp2017_2 default |
unknown ❌
|
600.01500
|
599.90000
|
| |
Yices2 |
Yices2-Main default |
unsat ✅
|
0.04658
|
0.04654
|
| |
Z3 |
z3-4.5.0 default |
unsat ✅
|
69.84200
|
69.83640
|
|
SMT-COMP 2018
|
0.40 (3/5) |
AProVE |
AProVE NIA 2014_default |
unknown ❌
|
1200.02000
|
1210.90000
|
| |
CVC4 |
master-2018-06-10-b19c840-competition-default_default |
unsat ✅
|
0.05059
|
0.05084
|
| |
SMT-RAT |
SMTRAT-Rat-final_default |
unknown ❌
|
1200.01000
|
1199.95000
|
| |
Yices2 |
Yices 2.6.0_default |
unsat ✅
|
0.04883
|
0.04873
|
| |
Z3 |
z3-4.7.1_default |
unsat ✅
|
2.24007
|
2.24023
|
|
SMT-COMP 2024
|
0.25 (3/4) |
cvc5 |
cvc5 |
unsat ✅
|
0.31128
|
0.21156
|
| |
SMTInterpol |
SMTInterpol |
unknown ❌
|
0.46750
|
0.53654
|
| |
Yices2 |
Yices2 |
unsat ✅
|
0.22550
|
0.12591
|
| |
Z3alpha |
Z3-alpha |
unsat ✅
|
0.46216
|
0.36274
|