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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 18:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 11 18:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 11 18:56 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 203K 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 1717102904209

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-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:01:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-30 21:01:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:01:45] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-05-30 21:01:45] [INFO ] Transformed 563 places.
[2024-05-30 21:01:45] [INFO ] Transformed 780 transitions.
[2024-05-30 21:01:45] [INFO ] Found NUPN structural information;
[2024-05-30 21:01:45] [INFO ] Parsed PT model containing 563 places and 780 transitions and 2680 arcs in 189 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 563/563 places, 780/780 transitions.
Graph (trivial) has 574 edges and 563 vertex of which 84 / 563 are part of one of the 12 SCC in 20 ms
Free SCC test removed 72 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 356 transitions
Trivial Post-agglo rules discarded 356 transitions
Performed 356 trivial Post agglomeration. Transition count delta: 356
Iterating post reduction 0 with 356 rules applied. Total rules applied 357 place count 491 transition count 344
Reduce places removed 356 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 364 rules applied. Total rules applied 721 place count 135 transition count 336
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 725 place count 131 transition count 336
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 725 place count 131 transition count 324
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 749 place count 119 transition count 324
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 829 place count 79 transition count 284
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 855 place count 66 transition count 308
Applied a total of 855 rules in 85 ms. Remains 66 /563 variables (removed 497) and now considering 308/780 (removed 472) transitions.
[2024-05-30 21:01:45] [INFO ] Flow matrix only has 296 transitions (discarded 12 similar events)
// Phase 1: matrix 296 rows 66 cols
[2024-05-30 21:01:45] [INFO ] Computed 5 invariants in 18 ms
[2024-05-30 21:01:45] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-30 21:01:45] [INFO ] Flow matrix only has 296 transitions (discarded 12 similar events)
[2024-05-30 21:01:45] [INFO ] Invariant cache hit.
[2024-05-30 21:01:45] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-30 21:01:46] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2024-05-30 21:01:46] [INFO ] Flow matrix only has 296 transitions (discarded 12 similar events)
[2024-05-30 21:01:46] [INFO ] Invariant cache hit.
[2024-05-30 21:01:46] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-30 21:01:48] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 9 ms to minimize.
[2024-05-30 21:01:48] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 0 ms to minimize.
[2024-05-30 21:01:48] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-05-30 21:01:48] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
[2024-05-30 21:01:48] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-30 21:01:48] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-30 21:01:48] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-30 21:01:48] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-30 21:01:48] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-30 21:01:48] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-30 21:01:49] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2024-05-30 21:01:49] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2024-05-30 21:01:49] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-30 21:01:49] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2024-05-30 21:01:49] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 15/86 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-30 21:01:49] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 295/361 variables, 66/153 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 39/192 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (OVERLAPS) 1/362 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 12 (OVERLAPS) 0/362 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 193 constraints, problems are : Problem set: 0 solved, 292 unsolved in 11830 ms.
Refiners :[Domain max(s): 66/66 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 66/66 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 16/87 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-30 21:01:59] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 295/361 variables, 66/154 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 39/193 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 292/485 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-30 21:02:02] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-30 21:02:02] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2024-05-30 21:02:04] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 3/488 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-30 21:02:07] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-30 21:02:07] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 2/490 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-30 21:02:11] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 0 ms to minimize.
[2024-05-30 21:02:11] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 2/492 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 14 (OVERLAPS) 1/362 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-30 21:02:19] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/362 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/362 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/362 variables, and 494 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30021 ms.
Refiners :[Domain max(s): 66/66 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 66/66 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 25/25 constraints]
After SMT, in 42407ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 42422ms
Starting structural reductions in LIVENESS mode, iteration 1 : 66/563 places, 308/780 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 42985 ms. Remains : 66/563 places, 308/780 transitions.
Discarding 91 transitions out of 308. Remains 217
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (6159 resets) in 1918 ms. (20 steps per ms) remains 80/216 properties
BEST_FIRST walk for 4004 steps (19 resets) in 31 ms. (125 steps per ms) remains 79/80 properties
BEST_FIRST walk for 4002 steps (23 resets) in 20 ms. (190 steps per ms) remains 78/79 properties
BEST_FIRST walk for 4004 steps (22 resets) in 23 ms. (166 steps per ms) remains 77/78 properties
BEST_FIRST walk for 4003 steps (18 resets) in 18 ms. (210 steps per ms) remains 76/77 properties
BEST_FIRST walk for 4003 steps (14 resets) in 33 ms. (117 steps per ms) remains 75/76 properties
BEST_FIRST walk for 4004 steps (18 resets) in 20 ms. (190 steps per ms) remains 74/75 properties
BEST_FIRST walk for 4004 steps (24 resets) in 22 ms. (174 steps per ms) remains 73/74 properties
BEST_FIRST walk for 4003 steps (20 resets) in 24 ms. (160 steps per ms) remains 72/73 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 71/72 properties
BEST_FIRST walk for 4002 steps (15 resets) in 12 ms. (307 steps per ms) remains 70/71 properties
BEST_FIRST walk for 4001 steps (12 resets) in 8 ms. (444 steps per ms) remains 69/70 properties
BEST_FIRST walk for 4004 steps (17 resets) in 8 ms. (444 steps per ms) remains 68/69 properties
BEST_FIRST walk for 4002 steps (12 resets) in 8 ms. (444 steps per ms) remains 67/68 properties
BEST_FIRST walk for 4004 steps (19 resets) in 8 ms. (444 steps per ms) remains 66/67 properties
BEST_FIRST walk for 4004 steps (13 resets) in 9 ms. (400 steps per ms) remains 65/66 properties
BEST_FIRST walk for 4004 steps (25 resets) in 12 ms. (308 steps per ms) remains 64/65 properties
BEST_FIRST walk for 4004 steps (18 resets) in 10 ms. (364 steps per ms) remains 63/64 properties
BEST_FIRST walk for 4004 steps (21 resets) in 8 ms. (444 steps per ms) remains 62/63 properties
BEST_FIRST walk for 4004 steps (14 resets) in 13 ms. (286 steps per ms) remains 61/62 properties
BEST_FIRST walk for 4003 steps (29 resets) in 15 ms. (250 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4004 steps (22 resets) in 14 ms. (266 steps per ms) remains 59/60 properties
BEST_FIRST walk for 4003 steps (15 resets) in 14 ms. (266 steps per ms) remains 58/59 properties
BEST_FIRST walk for 4004 steps (28 resets) in 9 ms. (400 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4002 steps (21 resets) in 12 ms. (307 steps per ms) remains 56/57 properties
BEST_FIRST walk for 4003 steps (20 resets) in 11 ms. (333 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4004 steps (26 resets) in 10 ms. (364 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4004 steps (23 resets) in 9 ms. (400 steps per ms) remains 53/54 properties
BEST_FIRST walk for 4004 steps (20 resets) in 9 ms. (400 steps per ms) remains 52/53 properties
BEST_FIRST walk for 4004 steps (17 resets) in 13 ms. (286 steps per ms) remains 51/52 properties
BEST_FIRST walk for 4001 steps (21 resets) in 11 ms. (333 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4003 steps (15 resets) in 19 ms. (200 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4004 steps (22 resets) in 8 ms. (444 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4004 steps (30 resets) in 9 ms. (400 steps per ms) remains 47/48 properties
BEST_FIRST walk for 4003 steps (19 resets) in 11 ms. (333 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4003 steps (23 resets) in 8 ms. (444 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4004 steps (34 resets) in 12 ms. (308 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4004 steps (14 resets) in 11 ms. (333 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4003 steps (25 resets) in 24 ms. (160 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4004 steps (20 resets) in 12 ms. (308 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4003 steps (21 resets) in 9 ms. (400 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4004 steps (18 resets) in 8 ms. (444 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (29 resets) in 7 ms. (500 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4003 steps (17 resets) in 8 ms. (444 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4002 steps (19 resets) in 8 ms. (444 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4004 steps (13 resets) in 9 ms. (400 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4003 steps (18 resets) in 6 ms. (571 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4004 steps (11 resets) in 8 ms. (444 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (16 resets) in 17 ms. (222 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4003 steps (17 resets) in 11 ms. (333 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4004 steps (18 resets) in 9 ms. (400 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 8 ms. (444 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4003 steps (21 resets) in 13 ms. (285 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4004 steps (25 resets) in 8 ms. (444 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4003 steps (21 resets) in 9 ms. (400 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4004 steps (14 resets) in 8 ms. (444 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (16 resets) in 9 ms. (400 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4004 steps (21 resets) in 9 ms. (400 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (19 resets) in 9 ms. (400 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 9 ms. (400 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (33 resets) in 8 ms. (444 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (20 resets) in 8 ms. (444 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (19 resets) in 9 ms. (400 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (16 resets) in 8 ms. (444 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (23 resets) in 10 ms. (364 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (15 resets) in 9 ms. (400 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (25 resets) in 9 ms. (400 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4004 steps (28 resets) in 8 ms. (444 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4004 steps (22 resets) in 9 ms. (400 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4004 steps (23 resets) in 8 ms. (444 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4003 steps (24 resets) in 9 ms. (400 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4003 steps (22 resets) in 8 ms. (444 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4004 steps (21 resets) in 6 ms. (572 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4004 steps (9 resets) in 8 ms. (444 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4002 steps (18 resets) in 19 ms. (200 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4004 steps (21 resets) in 8 ms. (444 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4004 steps (15 resets) in 7 ms. (500 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4004 steps (18 resets) in 8 ms. (444 steps per ms) remains 2/3 properties
BEST_FIRST walk for 4003 steps (18 resets) in 7 ms. (500 steps per ms) remains 1/2 properties
BEST_FIRST walk for 1103 steps (10 resets) in 5 ms. (183 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 217 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 44257 ms.
ITS solved all properties within timeout

BK_STOP 1717102949583

--------------------
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-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 StigmergyElection-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-171690546400182"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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