Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 11 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 11 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 627K May 18 16:43 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 1717100263201

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=StigmergyCommit-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 20:17:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-30 20:17:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 20:17:44] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2024-05-30 20:17:44] [INFO ] Transformed 1534 places.
[2024-05-30 20:17:44] [INFO ] Transformed 2136 transitions.
[2024-05-30 20:17:44] [INFO ] Found NUPN structural information;
[2024-05-30 20:17:44] [INFO ] Parsed PT model containing 1534 places and 2136 transitions and 8601 arcs in 291 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1534/1534 places, 2136/2136 transitions.
Graph (trivial) has 1523 edges and 1534 vertex of which 105 / 1534 are part of one of the 15 SCC in 10 ms
Free SCC test removed 90 places
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1152 transitions
Trivial Post-agglo rules discarded 1152 transitions
Performed 1152 trivial Post agglomeration. Transition count delta: 1152
Iterating post reduction 0 with 1152 rules applied. Total rules applied 1153 place count 1444 transition count 884
Reduce places removed 1152 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 1172 rules applied. Total rules applied 2325 place count 292 transition count 864
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 2330 place count 287 transition count 864
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 2330 place count 287 transition count 809
Deduced a syphon composed of 55 places in 4 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2440 place count 232 transition count 809
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 2 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 2588 place count 158 transition count 735
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 2612 place count 146 transition count 753
Applied a total of 2612 rules in 144 ms. Remains 146 /1534 variables (removed 1388) and now considering 753/2136 (removed 1383) transitions.
[2024-05-30 20:17:44] [INFO ] Flow matrix only has 738 transitions (discarded 15 similar events)
// Phase 1: matrix 738 rows 146 cols
[2024-05-30 20:17:44] [INFO ] Computed 6 invariants in 24 ms
[2024-05-30 20:17:45] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-30 20:17:45] [INFO ] Flow matrix only has 738 transitions (discarded 15 similar events)
[2024-05-30 20:17:45] [INFO ] Invariant cache hit.
[2024-05-30 20:17:45] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-30 20:17:45] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
Running 726 sub problems to find dead transitions.
[2024-05-30 20:17:45] [INFO ] Flow matrix only has 738 transitions (discarded 15 similar events)
[2024-05-30 20:17:45] [INFO ] Invariant cache hit.
[2024-05-30 20:17:45] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 145/145 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 6/151 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-30 20:17:54] [INFO ] Deduced a trap composed of 38 places in 217 ms of which 22 ms to minimize.
[2024-05-30 20:17:54] [INFO ] Deduced a trap composed of 38 places in 238 ms of which 1 ms to minimize.
[2024-05-30 20:17:54] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 1 ms to minimize.
[2024-05-30 20:17:55] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 2 ms to minimize.
[2024-05-30 20:17:55] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 1 ms to minimize.
[2024-05-30 20:17:55] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 2 ms to minimize.
[2024-05-30 20:17:55] [INFO ] Deduced a trap composed of 38 places in 258 ms of which 1 ms to minimize.
[2024-05-30 20:17:55] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 1 ms to minimize.
[2024-05-30 20:17:56] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 1 ms to minimize.
[2024-05-30 20:17:56] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 1 ms to minimize.
[2024-05-30 20:17:56] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 2 ms to minimize.
[2024-05-30 20:17:56] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 1 ms to minimize.
[2024-05-30 20:17:56] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 1 ms to minimize.
[2024-05-30 20:17:56] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 1 ms to minimize.
[2024-05-30 20:17:57] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 1 ms to minimize.
[2024-05-30 20:17:57] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 1 ms to minimize.
[2024-05-30 20:17:57] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 2 ms to minimize.
[2024-05-30 20:17:57] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 1 ms to minimize.
[2024-05-30 20:17:57] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 1 ms to minimize.
[2024-05-30 20:17:58] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-30 20:17:58] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 1 ms to minimize.
[2024-05-30 20:17:58] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 1 ms to minimize.
[2024-05-30 20:17:58] [INFO ] Deduced a trap composed of 48 places in 181 ms of which 1 ms to minimize.
[2024-05-30 20:17:58] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 1 ms to minimize.
[2024-05-30 20:17:59] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 1 ms to minimize.
[2024-05-30 20:17:59] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 1 ms to minimize.
[2024-05-30 20:17:59] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 1 ms to minimize.
[2024-05-30 20:17:59] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 1 ms to minimize.
[2024-05-30 20:17:59] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 1 ms to minimize.
[2024-05-30 20:17:59] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 1 ms to minimize.
[2024-05-30 20:18:02] [INFO ] Deduced a trap composed of 48 places in 146 ms of which 1 ms to minimize.
[2024-05-30 20:18:02] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 1 ms to minimize.
[2024-05-30 20:18:02] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 1 ms to minimize.
[2024-05-30 20:18:03] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 1 ms to minimize.
[2024-05-30 20:18:03] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 3 ms to minimize.
[2024-05-30 20:18:03] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 0 ms to minimize.
[2024-05-30 20:18:03] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 17/189 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-30 20:18:04] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 1 ms to minimize.
[2024-05-30 20:18:04] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 1 ms to minimize.
[2024-05-30 20:18:04] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 2 ms to minimize.
[2024-05-30 20:18:04] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 2 ms to minimize.
[2024-05-30 20:18:05] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 1 ms to minimize.
[2024-05-30 20:18:05] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 0 ms to minimize.
[2024-05-30 20:18:05] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 7/196 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-30 20:18:10] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 1 ms to minimize.
[2024-05-30 20:18:10] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 0 ms to minimize.
[2024-05-30 20:18:10] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 0 ms to minimize.
[2024-05-30 20:18:11] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 1 ms to minimize.
[2024-05-30 20:18:13] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 1 ms to minimize.
[2024-05-30 20:18:13] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 1 ms to minimize.
[2024-05-30 20:18:14] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 7/203 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-30 20:18:14] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-30 20:18:18] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 146/884 variables, and 205 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30031 ms.
Refiners :[Domain max(s): 146/146 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/146 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 726 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 145/145 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 6/151 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 53/205 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-30 20:18:23] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 1 ms to minimize.
[2024-05-30 20:18:23] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 1 ms to minimize.
[2024-05-30 20:18:24] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 7 (OVERLAPS) 737/883 variables, 146/354 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/883 variables, 100/454 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/883 variables, 726/1180 constraints. Problems are: Problem set: 0 solved, 726 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 883/884 variables, and 1180 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30027 ms.
Refiners :[Domain max(s): 146/146 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 146/146 constraints, ReadFeed: 100/101 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 56/56 constraints]
After SMT, in 62770ms problems are : Problem set: 0 solved, 726 unsolved
Search for dead transitions found 0 dead transitions in 62797ms
Starting structural reductions in LIVENESS mode, iteration 1 : 146/1534 places, 753/2136 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 63825 ms. Remains : 146/1534 places, 753/2136 transitions.
Discarding 122 transitions out of 753. Remains 631
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (4914 resets) in 3358 ms. (11 steps per ms) remains 594/630 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 16 ms. (7 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 594/594 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 594/594 properties
Probabilistic random walk after 30001 steps, saw 9428 distinct states, run finished after 679 ms. (steps per millisecond=44 ) properties seen :127
[2024-05-30 20:18:50] [INFO ] Flow matrix only has 738 transitions (discarded 15 similar events)
[2024-05-30 20:18:50] [INFO ] Invariant cache hit.
[2024-05-30 20:18:50] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (OVERLAPS) 43/146 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 43/152 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-30 20:18:56] [INFO ] Deduced a trap composed of 38 places in 221 ms of which 17 ms to minimize.
[2024-05-30 20:18:56] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 1 ms to minimize.
[2024-05-30 20:18:56] [INFO ] Deduced a trap composed of 38 places in 350 ms of which 1 ms to minimize.
[2024-05-30 20:18:56] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 1 ms to minimize.
[2024-05-30 20:18:57] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 1 ms to minimize.
[2024-05-30 20:18:57] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 1 ms to minimize.
SMT process timed out in 6943ms, After SMT, problems are : Problem set: 0 solved, 467 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 103 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 753/753 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 146 transition count 737
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 141 transition count 732
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 141 transition count 732
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 136 transition count 727
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 136 transition count 727
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 131 transition count 722
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 131 transition count 722
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 67 place count 131 transition count 701
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 87 place count 131 transition count 681
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 131 transition count 679
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 129 transition count 679
Applied a total of 91 rules in 286 ms. Remains 129 /146 variables (removed 17) and now considering 679/753 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 286 ms. Remains : 129/146 places, 679/753 transitions.
RANDOM walk for 4000000 steps (440417 resets) in 76170 ms. (52 steps per ms) remains 83/467 properties
BEST_FIRST walk for 400004 steps (4543 resets) in 1048 ms. (381 steps per ms) remains 82/83 properties
BEST_FIRST walk for 400002 steps (3334 resets) in 1204 ms. (331 steps per ms) remains 78/82 properties
BEST_FIRST walk for 400003 steps (19 resets) in 679 ms. (588 steps per ms) remains 77/78 properties
BEST_FIRST walk for 400004 steps (3343 resets) in 352 ms. (1133 steps per ms) remains 74/77 properties
BEST_FIRST walk for 400004 steps (42 resets) in 471 ms. (847 steps per ms) remains 73/74 properties
BEST_FIRST walk for 400004 steps (54 resets) in 371 ms. (1075 steps per ms) remains 72/73 properties
BEST_FIRST walk for 400003 steps (37 resets) in 371 ms. (1075 steps per ms) remains 71/72 properties
BEST_FIRST walk for 400004 steps (24 resets) in 479 ms. (833 steps per ms) remains 70/71 properties
BEST_FIRST walk for 400002 steps (42 resets) in 372 ms. (1072 steps per ms) remains 69/70 properties
BEST_FIRST walk for 400002 steps (53 resets) in 557 ms. (716 steps per ms) remains 68/69 properties
BEST_FIRST walk for 400003 steps (53 resets) in 459 ms. (869 steps per ms) remains 67/68 properties
BEST_FIRST walk for 400004 steps (38 resets) in 367 ms. (1086 steps per ms) remains 66/67 properties
BEST_FIRST walk for 400002 steps (65 resets) in 375 ms. (1063 steps per ms) remains 65/66 properties
BEST_FIRST walk for 400002 steps (69 resets) in 579 ms. (689 steps per ms) remains 64/65 properties
BEST_FIRST walk for 400004 steps (29 resets) in 490 ms. (814 steps per ms) remains 63/64 properties
BEST_FIRST walk for 400004 steps (140 resets) in 360 ms. (1108 steps per ms) remains 62/63 properties
BEST_FIRST walk for 400003 steps (2739 resets) in 278 ms. (1433 steps per ms) remains 60/62 properties
BEST_FIRST walk for 400004 steps (51 resets) in 345 ms. (1156 steps per ms) remains 59/60 properties
BEST_FIRST walk for 400004 steps (60 resets) in 387 ms. (1030 steps per ms) remains 58/59 properties
BEST_FIRST walk for 400002 steps (49 resets) in 375 ms. (1063 steps per ms) remains 57/58 properties
BEST_FIRST walk for 400004 steps (63 resets) in 255 ms. (1562 steps per ms) remains 56/57 properties
BEST_FIRST walk for 400004 steps (70 resets) in 253 ms. (1574 steps per ms) remains 55/56 properties
BEST_FIRST walk for 400004 steps (79 resets) in 333 ms. (1197 steps per ms) remains 54/55 properties
BEST_FIRST walk for 400003 steps (53 resets) in 334 ms. (1194 steps per ms) remains 53/54 properties
BEST_FIRST walk for 400003 steps (45 resets) in 484 ms. (824 steps per ms) remains 52/53 properties
BEST_FIRST walk for 400004 steps (78 resets) in 472 ms. (845 steps per ms) remains 51/52 properties
BEST_FIRST walk for 400004 steps (85 resets) in 335 ms. (1190 steps per ms) remains 50/51 properties
BEST_FIRST walk for 400004 steps (24 resets) in 325 ms. (1227 steps per ms) remains 49/50 properties
BEST_FIRST walk for 400003 steps (40 resets) in 329 ms. (1212 steps per ms) remains 48/49 properties
BEST_FIRST walk for 400004 steps (19 resets) in 415 ms. (961 steps per ms) remains 47/48 properties
BEST_FIRST walk for 400003 steps (45 resets) in 321 ms. (1242 steps per ms) remains 46/47 properties
BEST_FIRST walk for 400004 steps (103 resets) in 400 ms. (997 steps per ms) remains 45/46 properties
BEST_FIRST walk for 400004 steps (46 resets) in 247 ms. (1612 steps per ms) remains 44/45 properties
BEST_FIRST walk for 400004 steps (43 resets) in 242 ms. (1646 steps per ms) remains 43/44 properties
BEST_FIRST walk for 400003 steps (30 resets) in 310 ms. (1286 steps per ms) remains 42/43 properties
BEST_FIRST walk for 400004 steps (55 resets) in 313 ms. (1273 steps per ms) remains 41/42 properties
BEST_FIRST walk for 400004 steps (2233 resets) in 222 ms. (1793 steps per ms) remains 40/41 properties
BEST_FIRST walk for 400004 steps (2657 resets) in 303 ms. (1315 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400002 steps (2663 resets) in 307 ms. (1298 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2654 resets) in 300 ms. (1328 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (2657 resets) in 300 ms. (1328 steps per ms) remains 31/40 properties
BEST_FIRST walk for 400004 steps (2652 resets) in 286 ms. (1393 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2647 resets) in 298 ms. (1337 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (2641 resets) in 288 ms. (1384 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2658 resets) in 283 ms. (1408 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (2647 resets) in 288 ms. (1384 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2654 resets) in 289 ms. (1379 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2655 resets) in 291 ms. (1369 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (2657 resets) in 301 ms. (1324 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (2645 resets) in 292 ms. (1365 steps per ms) remains 23/31 properties
BEST_FIRST walk for 400003 steps (2639 resets) in 309 ms. (1290 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (2639 resets) in 311 ms. (1282 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (2661 resets) in 304 ms. (1311 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (2664 resets) in 321 ms. (1242 steps per ms) remains 17/23 properties
BEST_FIRST walk for 400003 steps (2644 resets) in 257 ms. (1550 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (2657 resets) in 263 ms. (1515 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2636 resets) in 270 ms. (1476 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (2652 resets) in 265 ms. (1503 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2648 resets) in 269 ms. (1481 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (2648 resets) in 283 ms. (1408 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2652 resets) in 261 ms. (1526 steps per ms) remains 17/17 properties
// Phase 1: matrix 679 rows 129 cols
[2024-05-30 20:19:23] [INFO ] Computed 6 invariants in 6 ms
[2024-05-30 20:19:23] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 111/129 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 679/808 variables, 129/135 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/808 variables, 85/220 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/808 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/808 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 808/808 variables, and 220 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1175 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 129/129 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 111/129 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 679/808 variables, 129/135 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/808 variables, 85/220 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/808 variables, 17/237 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-30 20:19:25] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 1 ms to minimize.
[2024-05-30 20:19:25] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 3 ms to minimize.
[2024-05-30 20:19:26] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 1 ms to minimize.
[2024-05-30 20:19:26] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 1 ms to minimize.
[2024-05-30 20:19:26] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/808 variables, 5/242 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/808 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/808 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 808/808 variables, and 242 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2174 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 129/129 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 5/5 constraints]
After SMT, in 3380ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 16 different solutions.
Finished Parikh walk after 2725 steps, including 67 resets, run visited all 1 properties in 6 ms. (steps per millisecond=454 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 17 properties in 118 ms.
Able to resolve query QuasiLiveness after proving 631 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 103175 ms.
ITS solved all properties within timeout

BK_STOP 1717100367539

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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="StigmergyCommit-PT-04b"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is StigmergyCommit-PT-04b, 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 r408-tall-171690546200082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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