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-171690546400192.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 StigmergyElection-PT-05b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r408-tall-171690546400192
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 852K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 18:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 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 428K 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 1717102948229

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=StigmergyElection-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:02:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-30 21:02:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:02:29] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2024-05-30 21:02:29] [INFO ] Transformed 699 places.
[2024-05-30 21:02:29] [INFO ] Transformed 1266 transitions.
[2024-05-30 21:02:29] [INFO ] Found NUPN structural information;
[2024-05-30 21:02:29] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 243 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 699/699 places, 1266/1266 transitions.
Graph (trivial) has 713 edges and 699 vertex of which 105 / 699 are part of one of the 15 SCC in 7 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 442 transitions
Trivial Post-agglo rules discarded 442 transitions
Performed 442 trivial Post agglomeration. Transition count delta: 442
Iterating post reduction 0 with 442 rules applied. Total rules applied 443 place count 609 transition count 724
Reduce places removed 442 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 452 rules applied. Total rules applied 895 place count 167 transition count 714
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 900 place count 162 transition count 714
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 900 place count 162 transition count 699
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 930 place count 147 transition count 699
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 1028 place count 98 transition count 650
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 1054 place count 85 transition count 658
Applied a total of 1054 rules in 124 ms. Remains 85 /699 variables (removed 614) and now considering 658/1266 (removed 608) transitions.
[2024-05-30 21:02:29] [INFO ] Flow matrix only has 643 transitions (discarded 15 similar events)
// Phase 1: matrix 643 rows 85 cols
[2024-05-30 21:02:29] [INFO ] Computed 6 invariants in 28 ms
[2024-05-30 21:02:30] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-30 21:02:30] [INFO ] Flow matrix only has 643 transitions (discarded 15 similar events)
[2024-05-30 21:02:30] [INFO ] Invariant cache hit.
[2024-05-30 21:02:30] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-30 21:02:30] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
Running 642 sub problems to find dead transitions.
[2024-05-30 21:02:30] [INFO ] Flow matrix only has 643 transitions (discarded 15 similar events)
[2024-05-30 21:02:30] [INFO ] Invariant cache hit.
[2024-05-30 21:02:30] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 6/90 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-05-30 21:02:37] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 9 ms to minimize.
[2024-05-30 21:02:37] [INFO ] Deduced a trap composed of 26 places in 459 ms of which 1 ms to minimize.
[2024-05-30 21:02:37] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 1 ms to minimize.
[2024-05-30 21:02:38] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 1 ms to minimize.
[2024-05-30 21:02:38] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 3 ms to minimize.
[2024-05-30 21:02:38] [INFO ] Deduced a trap composed of 26 places in 242 ms of which 1 ms to minimize.
[2024-05-30 21:02:38] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 1 ms to minimize.
[2024-05-30 21:02:38] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 2 ms to minimize.
[2024-05-30 21:02:38] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 1 ms to minimize.
[2024-05-30 21:02:39] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 0 ms to minimize.
[2024-05-30 21:02:39] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 1 ms to minimize.
[2024-05-30 21:02:39] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 1 ms to minimize.
[2024-05-30 21:02:39] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 1 ms to minimize.
[2024-05-30 21:02:39] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 1 ms to minimize.
[2024-05-30 21:02:39] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2024-05-30 21:02:39] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 5 ms to minimize.
[2024-05-30 21:02:40] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 1 ms to minimize.
[2024-05-30 21:02:40] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 1 ms to minimize.
[2024-05-30 21:02:42] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 2 ms to minimize.
[2024-05-30 21:02:42] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-05-30 21:02:42] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 1 ms to minimize.
[2024-05-30 21:02:42] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 1 ms to minimize.
[2024-05-30 21:02:42] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 1 ms to minimize.
[2024-05-30 21:02:42] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 1 ms to minimize.
[2024-05-30 21:02:43] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 1 ms to minimize.
[2024-05-30 21:02:43] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 1 ms to minimize.
[2024-05-30 21:02:43] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 1 ms to minimize.
[2024-05-30 21:02:43] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 1 ms to minimize.
[2024-05-30 21:02:43] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 0 ms to minimize.
[2024-05-30 21:02:45] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 1 ms to minimize.
[2024-05-30 21:02:45] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 0 ms to minimize.
[2024-05-30 21:02:45] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 1 ms to minimize.
[2024-05-30 21:02:45] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 1 ms to minimize.
[2024-05-30 21:02:46] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 0 ms to minimize.
[2024-05-30 21:02:46] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 2 ms to minimize.
[2024-05-30 21:02:46] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 16/127 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-05-30 21:02:46] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 1 ms to minimize.
[2024-05-30 21:02:46] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 0 ms to minimize.
[2024-05-30 21:02:47] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 0 ms to minimize.
[2024-05-30 21:02:47] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 3 ms to minimize.
[2024-05-30 21:02:47] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 1 ms to minimize.
[2024-05-30 21:02:47] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 1 ms to minimize.
[2024-05-30 21:02:47] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 1 ms to minimize.
[2024-05-30 21:02:47] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 0 ms to minimize.
[2024-05-30 21:02:47] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 0 ms to minimize.
[2024-05-30 21:02:48] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 0 ms to minimize.
[2024-05-30 21:02:48] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 1 ms to minimize.
[2024-05-30 21:02:48] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 12/139 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-05-30 21:02:51] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 0 ms to minimize.
[2024-05-30 21:02:53] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 1 ms to minimize.
[2024-05-30 21:02:53] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 9 (OVERLAPS) 642/727 variables, 85/227 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/727 variables, 40/267 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-05-30 21:03:00] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 727/728 variables, and 268 constraints, problems are : Problem set: 0 solved, 642 unsolved in 30034 ms.
Refiners :[Domain max(s): 85/85 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 85/85 constraints, ReadFeed: 40/41 constraints, PredecessorRefiner: 642/642 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 642 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 6/90 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 52/143 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-05-30 21:03:05] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 1 ms to minimize.
[2024-05-30 21:03:05] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 7 (OVERLAPS) 642/727 variables, 85/230 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/727 variables, 40/270 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/727 variables, 642/912 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-05-30 21:03:22] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 727/728 variables, and 913 constraints, problems are : Problem set: 0 solved, 642 unsolved in 30034 ms.
Refiners :[Domain max(s): 85/85 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 85/85 constraints, ReadFeed: 40/41 constraints, PredecessorRefiner: 642/642 constraints, Known Traps: 55/55 constraints]
After SMT, in 62774ms problems are : Problem set: 0 solved, 642 unsolved
Search for dead transitions found 0 dead transitions in 62802ms
Starting structural reductions in LIVENESS mode, iteration 1 : 85/699 places, 658/1266 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 63702 ms. Remains : 85/699 places, 658/1266 transitions.
Discarding 88 transitions out of 658. Remains 570
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (4953 resets) in 2485 ms. (16 steps per ms) remains 510/569 properties
BEST_FIRST walk for 124 steps (4 resets) in 12 ms. (9 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 17 ms. (6 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 510/510 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 510/510 properties
[2024-05-30 21:03:34] [INFO ] Flow matrix only has 643 transitions (discarded 15 similar events)
[2024-05-30 21:03:34] [INFO ] Invariant cache hit.
[2024-05-30 21:03:34] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (OVERLAPS) 28/85 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 28/91 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-05-30 21:03:39] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 1 ms to minimize.
[2024-05-30 21:03:39] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 1 ms to minimize.
[2024-05-30 21:03:39] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 0 ms to minimize.
[2024-05-30 21:03:39] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 0 ms to minimize.
[2024-05-30 21:03:39] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 0 ms to minimize.
[2024-05-30 21:03:40] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 1 ms to minimize.
[2024-05-30 21:03:40] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 85/728 variables, and 98 constraints, problems are : Problem set: 0 solved, 510 unsolved in 5013 ms.
Refiners :[Domain max(s): 85/85 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/85 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 510 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (OVERLAPS) 28/85 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 28/91 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-05-30 21:03:44] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 7 (OVERLAPS) 642/727 variables, 85/184 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/727 variables, 40/224 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 727/728 variables, and 734 constraints, problems are : Problem set: 0 solved, 510 unsolved in 5683 ms.
Refiners :[Domain max(s): 85/85 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 85/85 constraints, ReadFeed: 40/41 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 8/8 constraints]
After SMT, in 12685ms problems are : Problem set: 0 solved, 510 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 658/658 transitions.
Graph (complete) has 461 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 17 place count 84 transition count 641
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 81 transition count 638
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 81 transition count 638
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 78 transition count 626
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 78 transition count 626
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 1 with 22 rules applied. Total rules applied 51 place count 78 transition count 604
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 78 transition count 603
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 77 transition count 603
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 77 transition count 602
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 76 transition count 601
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 76 transition count 601
Applied a total of 56 rules in 135 ms. Remains 76 /85 variables (removed 9) and now considering 601/658 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 76/85 places, 601/658 transitions.
RANDOM walk for 4000000 steps (475217 resets) in 73844 ms. (54 steps per ms) remains 0/510 properties
Able to resolve query QuasiLiveness after proving 570 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 101225 ms.
ITS solved all properties within timeout

BK_STOP 1717103050573

--------------------
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="StigmergyElection-PT-05b"
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 StigmergyElection-PT-05b, 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-171690546400192"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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