Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r032-smll-177946790700072.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is AutonomousCar-PT-08a, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r032-smll-177946790700072
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 6.3K Mar 5 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 5 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 5 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 5 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 07:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 5 16:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Mar 5 16:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 5 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 5 16:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 448K Mar 3 18:30 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 1779472866195

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=AutonomousCar-PT-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202505121319
[2026-05-22 18:01:08] [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]
[2026-05-22 18:01:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 18:01:09] [INFO ] Load time of PNML (sax parser for PT used): 251 ms
[2026-05-22 18:01:09] [INFO ] Transformed 81 places.
[2026-05-22 18:01:09] [INFO ] Transformed 849 transitions.
[2026-05-22 18:01:09] [INFO ] Found NUPN structural information;
[2026-05-22 18:01:09] [INFO ] Parsed PT model containing 81 places and 849 transitions and 8894 arcs in 468 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 81/81 places, 849/849 transitions.
Ensure Unique test removed 275 transitions
Reduce isomorphic transitions removed 275 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 284 rules applied. Total rules applied 284 place count 81 transition count 565
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 293 place count 72 transition count 565
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 297 place count 70 transition count 563
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 299 place count 69 transition count 563
Applied a total of 299 rules in 113 ms. Remains 69 /81 variables (removed 12) and now considering 563/849 (removed 286) transitions.
[2026-05-22 18:01:09] [INFO ] Flow matrix only has 562 transitions (discarded 1 similar events)
// Phase 1: matrix 562 rows 69 cols
[2026-05-22 18:01:09] [INFO ] Computed 13 invariants in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 18:01:10] [INFO ] Implicit Places using invariants in 1062 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1122 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 68/81 places, 563/849 transitions.
Applied a total of 0 rules in 13 ms. Remains 68 /68 variables (removed 0) and now considering 563/563 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1275 ms. Remains : 68/81 places, 563/849 transitions.
Discarding 44 transitions out of 563. Remains 519
Initial state reduction rules removed 1 formulas.
[2026-05-22 18:01:12] [INFO ] Flatten gal took : 424 ms
[2026-05-22 18:01:12] [INFO ] Flatten gal took : 201 ms
RANDOM walk for 40000 steps (2691 resets) in 6959 ms. (5 steps per ms) remains 214/518 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 214/214 properties
[2026-05-22 18:01:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8984652677824642935.gal : 165 ms
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 214/214 properties
[2026-05-22 18:01:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8240663137888726197.prop : 24 ms
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 214/214 properties
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8984652677824642935.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8240663137888726197.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 214/214 properties

BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 214/214 properties
its-reach command run as :

BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 214/214 properties
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 214/214 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 214/214 properties
[2026-05-22 18:01:12] [INFO ] Flow matrix only has 562 transitions (discarded 1 similar events)
// Phase 1: matrix 562 rows 68 cols
[2026-05-22 18:01:12] [INFO ] Computed 12 invariants in 8 ms
[2026-05-22 18:01:12] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality8240663137888726197.prop.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,214 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,214 properties remain. new max is 8
SDD size :9 after 41
SDD proceeding with computation,214 properties remain. new max is 16
SDD size :41 after 43
SDD proceeding with computation,214 properties remain. new max is 32
SDD size :43 after 225
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,214 properties remain. new max is 64
SDD size :225 after 5759
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Reachability property qltransition_162 is true.
Reachability property qltransition_159 is true.
Reachability property qltransition_153 is true.
Reachability property qltransition_150 is true.
Reachability property qltransition_141 is true.
Reachability property qltransition_138 is true.
Reachability property qltransition_137 is true.
Reachability property qltransition_136 is true.
Reachability property qltransition_135 is true.
Reachability property qltransition_134 is true.
Reachability property qltransition_133 is true.
Reachability property qltransition_131 is true.
Reachability property qltransition_130 is true.
Reachability property qltransition_128 is true.
Reachability property qltransition_118 is true.
Reachability property qltransition_117 is true.
Reachability property qltransition_116 is true.
Reachability property qltransition_114 is true.
Reachability property qltransition_109 is true.
Reachability property qltransition_106 is true.
Reachability property qltransition_105 is true.
Reachability property qltransition_101 is true.
SDD proceeding with computation,192 properties remain. new max is 64
SDD size :5759 after 160147
Reachability property qltransition_465 is true.
Reachability property qltransition_457 is true.
Reachability property qltransition_441 is true.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 11 solved, 203 unsolved
SDD proceeding with computation,189 properties remain. new max is 64
SDD size :160147 after 509883
Reachability property qltransition_513 is true.
Reachability property qltransition_482 is true.
Reachability property qltransition_466 is true.
Reachability property qltransition_458 is true.
Reachability property qltransition_450 is true.
Reachability property qltransition_442 is true.
Reachability property qltransition_426 is true.
SDD proceeding with computation,182 properties remain. new max is 64
SDD size :509883 after 866643
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 32 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 11/61 constraints. Problems are: Problem set: 32 solved, 182 unsolved
Reachability property qltransition_498 is true.
Reachability property qltransition_475 is true.
Reachability property qltransition_459 is true.
Reachability property qltransition_451 is true.
Reachability property qltransition_443 is true.
Reachability property qltransition_427 is true.
Reachability property qltransition_411 is true.
Reachability property qltransition_394 is true.
Reachability property qltransition_378 is true.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 16/77 constraints. Problems are: Problem set: 32 solved, 182 unsolved
Reachability property qltransition_346 is true.
SDD proceeding with computation,172 properties remain. new max is 64
SDD size :866643 after 1.23265e+06
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/77 constraints. Problems are: Problem set: 42 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 2/68 variables, 1/78 constraints. Problems are: Problem set: 42 solved, 172 unsolved
Reachability property qltransition_515 is true.
Reachability property qltransition_499 is true.
Reachability property qltransition_483 is true.
Reachability property qltransition_467 is true.
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 2/80 constraints. Problems are: Problem set: 42 solved, 172 unsolved
Solver is answering 'unknown', stopping.
Reachability property qltransition_395 is true.
After SMT solving in domain Real declared 68/630 variables, and 80 constraints, problems are : Problem set: 46 solved, 168 unsolved in 5049 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/68 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 203/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Reachability property qltransition_379 is true.
Escalating to Integer solving :Problem set: 46 solved, 168 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 48 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 48 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 17/66 variables, 11/60 constraints. Problems are: Problem set: 48 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 17/77 constraints. Problems are: Problem set: 48 solved, 166 unsolved
SDD proceeding with computation,166 properties remain. new max is 64
SDD size :1.23265e+06 after 1.27634e+06
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/77 constraints. Problems are: Problem set: 48 solved, 166 unsolved
Reachability property qltransition_540 is true.
Reachability property qltransition_516 is true.
At refinement iteration 5 (OVERLAPS) 2/68 variables, 1/78 constraints. Problems are: Problem set: 50 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 2/80 constraints. Problems are: Problem set: 50 solved, 164 unsolved
Reachability property qltransition_500 is true.
Reachability property qltransition_484 is true.
Reachability property qltransition_476 is true.
Reachability property qltransition_468 is true.
Reachability property qltransition_460 is true.
Reachability property qltransition_452 is true.
Reachability property qltransition_444 is true.
Reachability property qltransition_428 is true.
Reachability property qltransition_420 is true.
Reachability property qltransition_412 is true.
Reachability property qltransition_380 is true.
Reachability property qltransition_363 is true.
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/80 constraints. Problems are: Problem set: 62 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 561/629 variables, 68/148 constraints. Problems are: Problem set: 62 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 629/630 variables, and 148 constraints, problems are : Problem set: 62 solved, 152 unsolved in 5024 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 68/68 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 166/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11138ms problems are : Problem set: 62 solved, 152 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 563/563 transitions.
Graph (complete) has 815 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reachability property qltransition_347 is true.
Applied a total of 1 rules in 133 ms. Remains 66 /68 variables (removed 2) and now considering 561/563 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 66/68 places, 561/563 transitions.
Reachability property qltransition_324 is true.
SDD proceeding with computation,150 properties remain. new max is 64
SDD size :1.27634e+06 after 1.63684e+06
Reachability property qltransition_541 is true.
Reachability property qltransition_517 is true.
Reachability property qltransition_509 is true.
Reachability property qltransition_501 is true.
Reachability property qltransition_485 is true.
Reachability property qltransition_477 is true.
Reachability property qltransition_469 is true.
Reachability property qltransition_461 is true.
Reachability property qltransition_453 is true.
Reachability property qltransition_445 is true.
Reachability property qltransition_429 is true.
Reachability property qltransition_421 is true.
Reachability property qltransition_413 is true.
Reachability property qltransition_397 is true.
Reachability property qltransition_389 is true.
Reachability property qltransition_381 is true.
Reachability property qltransition_364 is true.
Reachability property qltransition_357 is true.
Reachability property qltransition_348 is true.
Reachability property qltransition_325 is true.
SDD proceeding with computation,130 properties remain. new max is 64
SDD size :1.63684e+06 after 2.00551e+06
Reachability property qltransition_542 is true.
Reachability property qltransition_510 is true.
Reachability property qltransition_486 is true.
Reachability property qltransition_478 is true.
Reachability property qltransition_470 is true.
Reachability property qltransition_462 is true.
Reachability property qltransition_454 is true.
Reachability property qltransition_446 is true.
Reachability property qltransition_430 is true.
Reachability property qltransition_422 is true.
Reachability property qltransition_414 is true.
Reachability property qltransition_398 is true.
Reachability property qltransition_390 is true.
Reachability property qltransition_382 is true.
Reachability property qltransition_365 is true.
Reachability property qltransition_358 is true.
Reachability property qltransition_349 is true.
RANDOM walk for 4000000 steps (269247 resets) in 68155 ms. (58 steps per ms) remains 19/151 properties
Reachability property qltransition_326 is true.
SDD proceeding with computation,112 properties remain. new max is 64
SDD size :2.00551e+06 after 2.35188e+06
BEST_FIRST walk for 400004 steps (1525 resets) in 1008 ms. (396 steps per ms) remains 18/19 properties
Reachability property qltransition_518 is true.
Reachability property qltransition_502 is true.
BEST_FIRST walk for 400003 steps (1504 resets) in 904 ms. (441 steps per ms) remains 16/18 properties
Reachability property qltransition_366 is true.
BEST_FIRST walk for 400003 steps (1488 resets) in 821 ms. (486 steps per ms) remains 14/16 properties
BEST_FIRST walk for 400004 steps (1531 resets) in 607 ms. (657 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400003 steps (1801 resets) in 769 ms. (519 steps per ms) remains 14/14 properties
Reachability property qltransition_350 is true.
SDD proceeding with computation,108 properties remain. new max is 64
SDD size :2.35188e+06 after 2.70946e+06
BEST_FIRST walk for 400004 steps (1813 resets) in 696 ms. (573 steps per ms) remains 13/14 properties
BEST_FIRST walk for 400003 steps (1545 resets) in 631 ms. (632 steps per ms) remains 12/13 properties
BEST_FIRST walk for 400004 steps (1544 resets) in 690 ms. (578 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400004 steps (1810 resets) in 690 ms. (578 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400004 steps (1808 resets) in 652 ms. (612 steps per ms) remains 11/12 properties
BEST_FIRST walk for 400004 steps (1815 resets) in 669 ms. (597 steps per ms) remains 10/11 properties
BEST_FIRST walk for 400004 steps (1538 resets) in 704 ms. (567 steps per ms) remains 10/10 properties
BEST_FIRST walk for 400004 steps (1638 resets) in 606 ms. (658 steps per ms) remains 10/10 properties
// Phase 1: matrix 561 rows 66 cols
[2026-05-22 18:01:44] [INFO ] Computed 10 invariants in 10 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 17/24 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 38/62 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 38/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 561/623 variables, 62/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 18:01:45] [INFO ] Deduced a trap along path composed of 2 places in 125 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/623 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/623 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 4/627 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/627 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/627 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/627 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 627/627 variables, and 143 constraints, problems are : Problem set: 0 solved, 4 unsolved in 972 ms.
Refiners :[Domain max(s): 66/66 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 17/24 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 38/62 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 38/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 561/623 variables, 62/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/623 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 18:01:46] [INFO ] Deduced a trap along path composed of 2 places in 104 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 18:01:46] [INFO ] Deduced a trap along path composed of 2 places in 62 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 18:01:46] [INFO ] Deduced a trap along path composed of 2 places in 45 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/623 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/623 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 4/627 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/627 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/627 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/627 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 627/627 variables, and 146 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1184 ms.
Refiners :[Domain max(s): 66/66 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 2205ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Reachability property qltransition_550 is true.
Parikh walk visited 0 properties in 1742 ms.
Support contains 6 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 561/561 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 59 transition count 498
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 59 transition count 498
Free-agglomeration rule applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 22 place count 59 transition count 490
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 72 rules applied. Total rules applied 94 place count 51 transition count 426
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 50 transition count 425
Applied a total of 95 rules in 123 ms. Remains 50 /66 variables (removed 16) and now considering 425/561 (removed 136) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 50/66 places, 425/561 transitions.
Reachability property qltransition_549 is true.
Reachability property qltransition_548 is true.
RANDOM walk for 4000000 steps (30833 resets) in 34212 ms. (116 steps per ms) remains 1/3 properties
BEST_FIRST walk for 4000004 steps (23241 resets) in 4766 ms. (839 steps per ms) remains 1/1 properties
// Phase 1: matrix 425 rows 50 cols
[2026-05-22 18:01:58] [INFO ] Computed 10 invariants in 4 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 399/410 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/475 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 18:01:58] [INFO ] Deduced a trap along path composed of 2 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/475 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 475/475 variables, and 61 constraints, problems are : Problem set: 0 solved, 1 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 399/410 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/475 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 18:01:59] [INFO ] Deduced a trap along path composed of 2 places in 83 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 18:01:59] [INFO ] Deduced a trap along path composed of 2 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Reachability property qltransition_547 is true.
At refinement iteration 10 (OVERLAPS) 0/475 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 475/475 variables, and 63 constraints, problems are : Problem set: 0 solved, 1 unsolved in 526 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 836ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 425/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 49 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 49 transition count 416
Applied a total of 2 rules in 59 ms. Remains 49 /50 variables (removed 1) and now considering 416/425 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 49/50 places, 416/425 transitions.
Reachability property qltransition_534 is true.
RANDOM walk for 4000000 steps (30783 resets) in 32624 ms. (122 steps per ms) remains 1/1 properties
Reachability property qltransition_533 is true.
BEST_FIRST walk for 4000004 steps (23238 resets) in 3713 ms. (1077 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 70461 steps, run visited all 1 properties in 246 ms. (steps per millisecond=286 )
Probabilistic random walk after 70461 steps, saw 11804 distinct states, run finished after 256 ms. (steps per millisecond=275 ) properties seen :1
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 519 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 60461 ms.

BK_STOP 1779472929327

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="AutonomousCar-PT-08a"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is AutonomousCar-PT-08a, 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 r032-smll-177946790700072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-08a.tgz
mv AutonomousCar-PT-08a 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.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 ;