fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r079-tall-171620515800107
Last Updated
July 7, 2024

About the Execution of ITS-Tools for CANInsertWithFailure-PT-100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11613.231 550673.00 940610.00 1677.20 T normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r079-tall-171620515800107.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is CANInsertWithFailure-PT-100, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r079-tall-171620515800107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 61M
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 60M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1716214104323

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CANInsertWithFailure-PT-100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202405141337
[2024-05-20 14:08:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-20 14:08:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 14:08:26] [INFO ] Load time of PNML (sax parser for PT used): 1197 ms
[2024-05-20 14:08:26] [INFO ] Transformed 21204 places.
[2024-05-20 14:08:27] [INFO ] Transformed 60600 transitions.
[2024-05-20 14:08:27] [INFO ] Parsed PT model containing 21204 places and 60600 transitions and 162000 arcs in 1554 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 21204/21204 places, 60600/60600 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1401 place count 20503 transition count 59900
Performed 9900 Post agglomeration using F-continuation condition.Transition count delta: 9900
Deduced a syphon composed of 9900 places in 80 ms
Reduce places removed 9900 places and 0 transitions.
Iterating global reduction 2 with 19800 rules applied. Total rules applied 21201 place count 10603 transition count 50000
Applied a total of 21201 rules in 8718 ms. Remains 10603 /21204 variables (removed 10601) and now considering 50000/60600 (removed 10600) transitions.
[2024-05-20 14:08:36] [INFO ] Flow matrix only has 40298 transitions (discarded 9702 similar events)
// Phase 1: matrix 40298 rows 10603 cols
[2024-05-20 14:08:48] [INFO ] Computed 102 invariants in 12684 ms
[2024-05-20 14:09:15] [INFO ] Implicit Places using invariants in 39403 ms returned []
Implicit Place search using SMT only with invariants took 39435 ms to find 0 implicit places.
Running 49900 sub problems to find dead transitions.
[2024-05-20 14:09:16] [INFO ] Flow matrix only has 40298 transitions (discarded 9702 similar events)
[2024-05-20 14:09:16] [INFO ] Invariant cache hit.
[2024-05-20 14:09:16] [INFO ] State equation strengthened by 29898 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10602/50901 variables, and 100 constraints, problems are : Problem set: 0 solved, 49900 unsolved in 31117 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10603 constraints, ReadFeed: 0/29898 constraints, PredecessorRefiner: 49900/49900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10602/50901 variables, and 100 constraints, problems are : Problem set: 0 solved, 49900 unsolved in 30449 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10603 constraints, ReadFeed: 0/29898 constraints, PredecessorRefiner: 0/49900 constraints, Known Traps: 0/0 constraints]
After SMT, in 307507ms problems are : Problem set: 0 solved, 49900 unsolved
Search for dead transitions found 0 dead transitions in 307968ms
Starting structural reductions in LIVENESS mode, iteration 1 : 10603/21204 places, 50000/60600 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 356422 ms. Remains : 10603/21204 places, 50000/60600 transitions.
Discarding 29600 transitions out of 50000. Remains 20400
Initial state reduction rules removed 100 formulas.
RANDOM walk for 40000 steps (77 resets) in 13258 ms. (3 steps per ms) remains 8954/20300 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 70 ms. (1 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 36 ms. (3 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 10 ms. (11 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 35 ms. (3 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 15 ms. (7 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 37 ms. (3 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 27 ms. (4 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 20 ms. (5 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 15 ms. (7 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 10 ms. (11 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 27 ms. (4 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 23 ms. (5 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 10 ms. (11 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 20 ms. (5 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 17 ms. (6 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 22 ms. (5 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 46 ms. (2 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 44 ms. (2 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 25 ms. (4 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 18 ms. (6 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 26 ms. (4 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 8954/8954 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 8954/8954 properties
[2024-05-20 14:14:28] [INFO ] Flow matrix only has 40298 transitions (discarded 9702 similar events)
[2024-05-20 14:14:28] [INFO ] Invariant cache hit.
[2024-05-20 14:14:29] [INFO ] State equation strengthened by 29898 read => feed constraints.
[2024-05-20 14:14:29] [INFO ] Flatten gal took : 2925 ms
[2024-05-20 14:14:30] [INFO ] Flatten gal took : 902 ms
[2024-05-20 14:14:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17331457837871376952.gal : 228 ms
[2024-05-20 14:14:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15312199488495683296.prop : 418 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17331457837871376952.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15312199488495683296.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality15312199488495683296.prop.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6829/50901 variables, and 0 constraints, problems are : Problem set: 0 solved, 8954 unsolved in 5289 ms.
Refiners :[Positive P Invariants (semi-flows): 0/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10603 constraints, ReadFeed: 0/29898 constraints, PredecessorRefiner: 8954/8954 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6829/50901 variables, and 0 constraints, problems are : Problem set: 0 solved, 8954 unsolved in 5101 ms.
Refiners :[Positive P Invariants (semi-flows): 0/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10603 constraints, ReadFeed: 0/29898 constraints, PredecessorRefiner: 0/8954 constraints, Known Traps: 0/0 constraints]
After SMT, in 57106ms problems are : Problem set: 0 solved, 8954 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6829 out of 10603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10603/10603 places, 50000/50000 transitions.
Partial Free-agglomeration rule applied 3381 times.
Drop transitions (Partial Free agglomeration) removed 3381 transitions
Iterating global reduction 0 with 3381 rules applied. Total rules applied 3381 place count 10603 transition count 50000
Applied a total of 3381 rules in 2314 ms. Remains 10603 /10603 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2318 ms. Remains : 10603/10603 places, 50000/50000 transitions.
RANDOM walk for 139755 steps (263 resets) in 120010 ms. (1 steps per ms) remains 156/8954 properties
BEST_FIRST walk for 40004 steps (8 resets) in 572 ms. (69 steps per ms) remains 154/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 152/154 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 149/152 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 148/149 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 147/148 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 146/147 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 145/146 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 142/145 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 139/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 138/139 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 137/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 136/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 134/136 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 134/134 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 132/134 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 131/132 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (8 resets) in 171 ms. (232 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 130/131 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 129/130 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 127/129 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 126/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 122/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 121/122 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 120/121 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 119/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 118/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 117/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 116/117 properties
BEST_FIRST walk for 40004 steps (8 resets) in 430 ms. (92 steps per ms) remains 115/116 properties
BEST_FIRST walk for 40003 steps (8 resets) in 211 ms. (188 steps per ms) remains 114/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 113/114 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 111/113 properties
BEST_FIRST walk for 40003 steps (8 resets) in 172 ms. (231 steps per ms) remains 109/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 108/109 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 106/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 104/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 103/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 102/103 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 99/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 98/99 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 97/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 95/97 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 93/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 90/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 88/90 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 87/88 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 86/87 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 85/86 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 84/85 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 83/84 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 79/83 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 78/79 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 77/78 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 76/77 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 75/76 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 74/75 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 73/74 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 71/73 properties
BEST_FIRST walk for 40003 steps (8 resets) in 172 ms. (231 steps per ms) remains 70/71 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 69/70 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 67/69 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 66/67 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 64/66 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 63/64 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 62/63 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 60/62 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 59/60 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 58/59 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 57/58 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 53/57 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 52/53 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 51/52 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 49/51 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 48/49 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 47/48 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 46/47 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 43/46 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 41/43 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 40/41 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 39/40 properties
BEST_FIRST walk for 40003 steps (8 resets) in 182 ms. (218 steps per ms) remains 37/39 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 36/37 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 23/36 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 13/23 properties
[2024-05-20 14:16:05] [INFO ] Flow matrix only has 43609 transitions (discarded 6391 similar events)
// Phase 1: matrix 43609 rows 10603 cols
[2024-05-20 14:16:14] [INFO ] Computed 102 invariants in 9367 ms
[2024-05-20 14:16:15] [INFO ] State equation strengthened by 36581 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 10391/10403 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-20 14:16:17] [INFO ] Deduced a trap composed of 2 places in 780 ms of which 14 ms to minimize.
[2024-05-20 14:16:18] [INFO ] Deduced a trap composed of 2 places in 714 ms of which 2 ms to minimize.
[2024-05-20 14:16:19] [INFO ] Deduced a trap composed of 2 places in 688 ms of which 2 ms to minimize.
[2024-05-20 14:16:19] [INFO ] Deduced a trap composed of 2 places in 677 ms of which 2 ms to minimize.
[2024-05-20 14:16:20] [INFO ] Deduced a trap composed of 2 places in 657 ms of which 1 ms to minimize.
[2024-05-20 14:16:21] [INFO ] Deduced a trap composed of 2 places in 650 ms of which 2 ms to minimize.
[2024-05-20 14:16:22] [INFO ] Deduced a trap composed of 2 places in 647 ms of which 1 ms to minimize.
[2024-05-20 14:16:22] [INFO ] Deduced a trap composed of 2 places in 663 ms of which 2 ms to minimize.
[2024-05-20 14:16:23] [INFO ] Deduced a trap composed of 2 places in 654 ms of which 3 ms to minimize.
[2024-05-20 14:16:24] [INFO ] Deduced a trap composed of 2 places in 647 ms of which 1 ms to minimize.
[2024-05-20 14:16:25] [INFO ] Deduced a trap composed of 2 places in 651 ms of which 1 ms to minimize.
[2024-05-20 14:16:26] [INFO ] Deduced a trap composed of 2 places in 649 ms of which 2 ms to minimize.
[2024-05-20 14:16:26] [INFO ] Deduced a trap composed of 2 places in 644 ms of which 1 ms to minimize.
[2024-05-20 14:16:27] [INFO ] Deduced a trap composed of 2 places in 649 ms of which 1 ms to minimize.
[2024-05-20 14:16:28] [INFO ] Deduced a trap composed of 2 places in 645 ms of which 2 ms to minimize.
[2024-05-20 14:16:29] [INFO ] Deduced a trap composed of 2 places in 650 ms of which 1 ms to minimize.
[2024-05-20 14:16:29] [INFO ] Deduced a trap composed of 2 places in 657 ms of which 2 ms to minimize.
[2024-05-20 14:16:30] [INFO ] Deduced a trap composed of 2 places in 733 ms of which 1 ms to minimize.
[2024-05-20 14:16:31] [INFO ] Deduced a trap composed of 2 places in 747 ms of which 2 ms to minimize.
[2024-05-20 14:16:32] [INFO ] Deduced a trap composed of 2 places in 687 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10403 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-20 14:16:33] [INFO ] Deduced a trap composed of 2 places in 653 ms of which 1 ms to minimize.
[2024-05-20 14:16:34] [INFO ] Deduced a trap composed of 2 places in 719 ms of which 2 ms to minimize.
[2024-05-20 14:16:34] [INFO ] Deduced a trap composed of 2 places in 660 ms of which 1 ms to minimize.
[2024-05-20 14:16:35] [INFO ] Deduced a trap composed of 2 places in 659 ms of which 2 ms to minimize.
[2024-05-20 14:16:36] [INFO ] Deduced a trap composed of 2 places in 759 ms of which 1 ms to minimize.
[2024-05-20 14:16:37] [INFO ] Deduced a trap composed of 2 places in 646 ms of which 1 ms to minimize.
[2024-05-20 14:16:38] [INFO ] Deduced a trap composed of 2 places in 691 ms of which 2 ms to minimize.
[2024-05-20 14:16:39] [INFO ] Deduced a trap composed of 2 places in 653 ms of which 2 ms to minimize.
[2024-05-20 14:16:39] [INFO ] Deduced a trap composed of 2 places in 647 ms of which 1 ms to minimize.
[2024-05-20 14:16:40] [INFO ] Deduced a trap composed of 2 places in 650 ms of which 1 ms to minimize.
[2024-05-20 14:16:41] [INFO ] Deduced a trap composed of 2 places in 641 ms of which 1 ms to minimize.
[2024-05-20 14:16:42] [INFO ] Deduced a trap composed of 2 places in 641 ms of which 1 ms to minimize.
[2024-05-20 14:16:42] [INFO ] Deduced a trap composed of 2 places in 645 ms of which 1 ms to minimize.
[2024-05-20 14:16:43] [INFO ] Deduced a trap composed of 2 places in 653 ms of which 1 ms to minimize.
[2024-05-20 14:16:44] [INFO ] Deduced a trap composed of 2 places in 667 ms of which 6 ms to minimize.
[2024-05-20 14:16:45] [INFO ] Deduced a trap composed of 2 places in 643 ms of which 1 ms to minimize.
[2024-05-20 14:16:46] [INFO ] Deduced a trap composed of 2 places in 664 ms of which 1 ms to minimize.
[2024-05-20 14:16:46] [INFO ] Deduced a trap composed of 2 places in 665 ms of which 1 ms to minimize.
[2024-05-20 14:16:47] [INFO ] Deduced a trap composed of 2 places in 640 ms of which 1 ms to minimize.
[2024-05-20 14:16:48] [INFO ] Deduced a trap composed of 2 places in 638 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/10403 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-20 14:16:50] [INFO ] Deduced a trap composed of 2 places in 699 ms of which 1 ms to minimize.
[2024-05-20 14:16:51] [INFO ] Deduced a trap composed of 2 places in 656 ms of which 1 ms to minimize.
[2024-05-20 14:16:52] [INFO ] Deduced a trap composed of 2 places in 647 ms of which 1 ms to minimize.
[2024-05-20 14:16:53] [INFO ] Deduced a trap composed of 2 places in 652 ms of which 1 ms to minimize.
[2024-05-20 14:16:53] [INFO ] Deduced a trap composed of 2 places in 645 ms of which 1 ms to minimize.
[2024-05-20 14:16:54] [INFO ] Deduced a trap composed of 2 places in 649 ms of which 2 ms to minimize.
[2024-05-20 14:16:55] [INFO ] Deduced a trap composed of 2 places in 653 ms of which 2 ms to minimize.
[2024-05-20 14:16:56] [INFO ] Deduced a trap composed of 2 places in 646 ms of which 1 ms to minimize.
[2024-05-20 14:16:56] [INFO ] Deduced a trap composed of 2 places in 665 ms of which 1 ms to minimize.
[2024-05-20 14:16:57] [INFO ] Deduced a trap composed of 2 places in 655 ms of which 1 ms to minimize.
[2024-05-20 14:16:58] [INFO ] Deduced a trap composed of 2 places in 642 ms of which 2 ms to minimize.
[2024-05-20 14:16:59] [INFO ] Deduced a trap composed of 2 places in 631 ms of which 1 ms to minimize.
[2024-05-20 14:16:59] [INFO ] Deduced a trap composed of 2 places in 648 ms of which 1 ms to minimize.
[2024-05-20 14:17:00] [INFO ] Deduced a trap composed of 2 places in 655 ms of which 1 ms to minimize.
SMT process timed out in 55563ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 12 out of 10603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10603/10603 places, 50000/50000 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10603 transition count 49999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10602 transition count 49999
Partial Free-agglomeration rule applied 6529 times.
Drop transitions (Partial Free agglomeration) removed 6529 transitions
Iterating global reduction 1 with 6529 rules applied. Total rules applied 6531 place count 10602 transition count 49999
Applied a total of 6531 rules in 17243 ms. Remains 10602 /10603 variables (removed 1) and now considering 49999/50000 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17245 ms. Remains : 10602/10603 places, 49999/50000 transitions.
RANDOM walk for 821855 steps (1369 resets) in 55871 ms. (14 steps per ms) remains 0/13 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 20400 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 549343 ms.

BK_STOP 1716214654996

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-100"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CANInsertWithFailure-PT-100, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r079-tall-171620515800107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-100.tgz
mv CANInsertWithFailure-PT-100 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;