Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r084-tall-174860080700472.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is EisenbergMcGuire-PT-03, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r084-tall-174860080700472
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 121K May 29 14:32 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 1748741081873

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 01:24:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-01 01:24:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:24:43] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2025-06-01 01:24:43] [INFO ] Transformed 117 places.
[2025-06-01 01:24:43] [INFO ] Transformed 216 transitions.
[2025-06-01 01:24:43] [INFO ] Found NUPN structural information;
[2025-06-01 01:24:43] [INFO ] Parsed PT model containing 117 places and 216 transitions and 900 arcs in 195 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 117/117 places, 216/216 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 117 transition count 213
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 114 transition count 213
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 6 place count 114 transition count 183
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 66 place count 84 transition count 183
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 78 place count 78 transition count 177
Applied a total of 78 rules in 54 ms. Remains 78 /117 variables (removed 39) and now considering 177/216 (removed 39) transitions.
[2025-06-01 01:24:43] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
// Phase 1: matrix 114 rows 78 cols
[2025-06-01 01:24:43] [INFO ] Computed 10 invariants in 12 ms
[2025-06-01 01:24:44] [INFO ] Implicit Places using invariants in 285 ms returned []
[2025-06-01 01:24:44] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2025-06-01 01:24:44] [INFO ] Invariant cache hit.
[2025-06-01 01:24:44] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-01 01:24:44] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2025-06-01 01:24:44] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2025-06-01 01:24:44] [INFO ] Invariant cache hit.
[2025-06-01 01:24:44] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2025-06-01 01:24:44] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 13 ms to minimize.
[2025-06-01 01:24:45] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
[2025-06-01 01:24:45] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
[2025-06-01 01:24:45] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2025-06-01 01:24:45] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:24:45] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2025-06-01 01:24:45] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2025-06-01 01:24:45] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:24:45] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:24:45] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2025-06-01 01:24:45] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 2 ms to minimize.
[2025-06-01 01:24:45] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2025-06-01 01:24:45] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:24:45] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2025-06-01 01:24:45] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2025-06-01 01:24:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2025-06-01 01:24:45] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:24:45] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2025-06-01 01:24:46] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2025-06-01 01:24:46] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2025-06-01 01:24:46] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2025-06-01 01:24:46] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2025-06-01 01:24:46] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2025-06-01 01:24:47] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 3 ms to minimize.
[2025-06-01 01:24:47] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:24:47] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2025-06-01 01:24:47] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2025-06-01 01:24:47] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 114/192 variables, 78/194 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 56/250 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2025-06-01 01:24:50] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/192 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 13 (OVERLAPS) 0/192 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 251 constraints, problems are : Problem set: 0 solved, 174 unsolved in 10126 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 29/117 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 114/192 variables, 78/195 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 56/251 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 174/425 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2025-06-01 01:24:56] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 426 constraints, problems are : Problem set: 0 solved, 174 unsolved in 6327 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 30/30 constraints]
After SMT, in 16549ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 16569ms
Starting structural reductions in LIVENESS mode, iteration 1 : 78/117 places, 177/216 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 17147 ms. Remains : 78/117 places, 177/216 transitions.
Initial state reduction rules removed 3 formulas.
RANDOM walk for 40000 steps (8 resets) in 2233 ms. (17 steps per ms) remains 87/174 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 86/87 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 84/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 82/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 81/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 77/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 75/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 69/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 66/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 65/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 64/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 62/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 59/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 53/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 53/53 properties
[2025-06-01 01:25:01] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2025-06-01 01:25:01] [INFO ] Invariant cache hit.
[2025-06-01 01:25:01] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 41/78 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 41/85 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-06-01 01:25:02] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:25:02] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2025-06-01 01:25:02] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2025-06-01 01:25:02] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2025-06-01 01:25:02] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 5 ms to minimize.
[2025-06-01 01:25:02] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2025-06-01 01:25:02] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2025-06-01 01:25:02] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2025-06-01 01:25:02] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2025-06-01 01:25:02] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
[2025-06-01 01:25:02] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2025-06-01 01:25:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2025-06-01 01:25:02] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2025-06-01 01:25:02] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2025-06-01 01:25:02] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2025-06-01 01:25:02] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2025-06-01 01:25:02] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2025-06-01 01:25:02] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2025-06-01 01:25:03] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 19/107 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-06-01 01:25:03] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2025-06-01 01:25:03] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-06-01 01:25:03] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2025-06-01 01:25:03] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 114/192 variables, 78/189 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 56/245 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-06-01 01:25:04] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:25:04] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2025-06-01 01:25:04] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2025-06-01 01:25:04] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2025-06-01 01:25:04] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 5/250 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-06-01 01:25:04] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/192 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/192 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 16 (OVERLAPS) 0/192 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 251 constraints, problems are : Problem set: 0 solved, 53 unsolved in 4037 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 41/78 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 41/85 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 29/117 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-06-01 01:25:06] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 114/192 variables, 78/196 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 56/252 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 53/305 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-06-01 01:25:07] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-06-01 01:25:07] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/192 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 15 (OVERLAPS) 0/192 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 307 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2914 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 32/32 constraints]
After SMT, in 6984ms problems are : Problem set: 0 solved, 53 unsolved
Parikh walk visited 11 properties in 1729 ms.
Support contains 32 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 177/177 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 74 transition count 165
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 74 transition count 165
Applied a total of 8 rules in 14 ms. Remains 74 /78 variables (removed 4) and now considering 165/177 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 74/78 places, 165/177 transitions.
RANDOM walk for 4000000 steps (8 resets) in 24121 ms. (165 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 627 ms. (636 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 606 ms. (658 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 613 ms. (651 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 586 ms. (681 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 607 ms. (657 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 611 ms. (653 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 588 ms. (679 steps per ms) remains 41/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 612 ms. (652 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 598 ms. (667 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 601 ms. (664 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 610 ms. (654 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 610 ms. (654 steps per ms) remains 38/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 631 ms. (632 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 595 ms. (671 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 588 ms. (679 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 599 ms. (666 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 608 ms. (656 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 604 ms. (661 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 612 ms. (652 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 562 ms. (710 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 557 ms. (716 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 631 ms. (632 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 683 ms. (584 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 604 ms. (661 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 617 ms. (647 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 569 ms. (701 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 567 ms. (704 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 564 ms. (707 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 564 ms. (707 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 565 ms. (706 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 607 ms. (657 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 615 ms. (649 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 602 ms. (663 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 605 ms. (660 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 610 ms. (654 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 581 ms. (687 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 623 ms. (641 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 602 ms. (663 steps per ms) remains 38/38 properties
[2025-06-01 01:25:23] [INFO ] Flow matrix only has 102 transitions (discarded 63 similar events)
// Phase 1: matrix 102 rows 74 cols
[2025-06-01 01:25:23] [INFO ] Computed 10 invariants in 2 ms
[2025-06-01 01:25:23] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 45/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 01:25:23] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2025-06-01 01:25:23] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2025-06-01 01:25:23] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2025-06-01 01:25:23] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2025-06-01 01:25:23] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2025-06-01 01:25:23] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2025-06-01 01:25:23] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2025-06-01 01:25:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 01:25:24] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 1/74 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 01:25:24] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:25:24] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2025-06-01 01:25:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2025-06-01 01:25:24] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 01:25:24] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 01:25:24] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 01:25:24] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/74 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 01:25:25] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/74 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 01:25:25] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/74 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/74 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 14 (OVERLAPS) 102/176 variables, 74/102 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/176 variables, 48/150 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/176 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 17 (OVERLAPS) 0/176 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 150 constraints, problems are : Problem set: 0 solved, 38 unsolved in 2536 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 45/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 1/74 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 102/176 variables, 74/102 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 48/150 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 38/188 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/176 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 0/176 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 188 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1047 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 18/18 constraints]
After SMT, in 3601ms problems are : Problem set: 0 solved, 38 unsolved
Fused 38 Parikh solutions to 37 different solutions.
Parikh walk visited 2 properties in 1300 ms.
Support contains 27 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 165/165 transitions.
Applied a total of 0 rules in 6 ms. Remains 74 /74 variables (removed 0) and now considering 165/165 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 74/74 places, 165/165 transitions.
RANDOM walk for 4000000 steps (8 resets) in 22474 ms. (177 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 608 ms. (656 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 597 ms. (668 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 611 ms. (653 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 565 ms. (706 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 593 ms. (673 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 656 ms. (608 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 597 ms. (668 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 610 ms. (654 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 607 ms. (657 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 599 ms. (666 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 623 ms. (641 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 640 ms. (624 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 623 ms. (641 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 661 ms. (604 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 623 ms. (641 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 623 ms. (641 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 623 ms. (641 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 616 ms. (648 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 618 ms. (646 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 575 ms. (694 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 578 ms. (690 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 598 ms. (667 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 593 ms. (673 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 587 ms. (680 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 574 ms. (695 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 570 ms. (700 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 572 ms. (698 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 567 ms. (704 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 566 ms. (705 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 605 ms. (660 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 604 ms. (661 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 611 ms. (653 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 598 ms. (667 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 581 ms. (687 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 619 ms. (645 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 603 ms. (662 steps per ms) remains 36/36 properties
Finished probabilistic random walk after 21925 steps, run visited all 36 properties in 161 ms. (steps per millisecond=136 )
Probabilistic random walk after 21925 steps, saw 5773 distinct states, run finished after 168 ms. (steps per millisecond=130 ) properties seen :36
Able to resolve query QuasiLiveness after proving 177 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 57185 ms.
ITS solved all properties within timeout

BK_STOP 1748741140642

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

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="EisenbergMcGuire-PT-03"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is EisenbergMcGuire-PT-03, 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 r084-tall-174860080700472"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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