Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 627K May 29 14:33 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 1749106596664

Invoking MCC driver with
BK_TOOL=gold2024
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
[2025-06-05 06:56:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-05 06:56:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:56:39] [INFO ] Load time of PNML (sax parser for PT used): 442 ms
[2025-06-05 06:56:39] [INFO ] Transformed 1534 places.
[2025-06-05 06:56:39] [INFO ] Transformed 2136 transitions.
[2025-06-05 06:56:39] [INFO ] Found NUPN structural information;
[2025-06-05 06:56:39] [INFO ] Parsed PT model containing 1534 places and 2136 transitions and 8601 arcs in 709 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 20 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 8 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 1 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 315 ms. Remains 146 /1534 variables (removed 1388) and now considering 753/2136 (removed 1383) transitions.
[2025-06-05 06:56:40] [INFO ] Flow matrix only has 738 transitions (discarded 15 similar events)
// Phase 1: matrix 738 rows 146 cols
[2025-06-05 06:56:40] [INFO ] Computed 6 invariants in 43 ms
[2025-06-05 06:56:40] [INFO ] Implicit Places using invariants in 589 ms returned []
[2025-06-05 06:56:40] [INFO ] Flow matrix only has 738 transitions (discarded 15 similar events)
[2025-06-05 06:56:40] [INFO ] Invariant cache hit.
[2025-06-05 06:56:41] [INFO ] State equation strengthened by 101 read => feed constraints.
[2025-06-05 06:56:41] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 1521 ms to find 0 implicit places.
Running 726 sub problems to find dead transitions.
[2025-06-05 06:56:41] [INFO ] Flow matrix only has 738 transitions (discarded 15 similar events)
[2025-06-05 06:56:41] [INFO ] Invariant cache hit.
[2025-06-05 06:56:42] [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
[2025-06-05 06:56:59] [INFO ] Deduced a trap composed of 38 places in 534 ms of which 34 ms to minimize.
[2025-06-05 06:57:00] [INFO ] Deduced a trap composed of 38 places in 578 ms of which 4 ms to minimize.
[2025-06-05 06:57:00] [INFO ] Deduced a trap composed of 37 places in 469 ms of which 3 ms to minimize.
[2025-06-05 06:57:01] [INFO ] Deduced a trap composed of 37 places in 449 ms of which 3 ms to minimize.
[2025-06-05 06:57:01] [INFO ] Deduced a trap composed of 38 places in 409 ms of which 2 ms to minimize.
[2025-06-05 06:57:02] [INFO ] Deduced a trap composed of 45 places in 261 ms of which 1 ms to minimize.
[2025-06-05 06:57:02] [INFO ] Deduced a trap composed of 38 places in 359 ms of which 3 ms to minimize.
[2025-06-05 06:57:02] [INFO ] Deduced a trap composed of 37 places in 395 ms of which 3 ms to minimize.
[2025-06-05 06:57:03] [INFO ] Deduced a trap composed of 37 places in 455 ms of which 3 ms to minimize.
[2025-06-05 06:57:03] [INFO ] Deduced a trap composed of 37 places in 405 ms of which 2 ms to minimize.
[2025-06-05 06:57:04] [INFO ] Deduced a trap composed of 37 places in 417 ms of which 3 ms to minimize.
[2025-06-05 06:57:04] [INFO ] Deduced a trap composed of 37 places in 420 ms of which 3 ms to minimize.
[2025-06-05 06:57:05] [INFO ] Deduced a trap composed of 45 places in 417 ms of which 2 ms to minimize.
[2025-06-05 06:57:05] [INFO ] Deduced a trap composed of 40 places in 386 ms of which 2 ms to minimize.
[2025-06-05 06:57:05] [INFO ] Deduced a trap composed of 37 places in 406 ms of which 2 ms to minimize.
[2025-06-05 06:57:06] [INFO ] Deduced a trap composed of 37 places in 362 ms of which 2 ms to minimize.
[2025-06-05 06:57:06] [INFO ] Deduced a trap composed of 40 places in 449 ms of which 2 ms to minimize.
[2025-06-05 06:57:07] [INFO ] Deduced a trap composed of 37 places in 448 ms of which 2 ms to minimize.
[2025-06-05 06:57:07] [INFO ] Deduced a trap composed of 46 places in 428 ms of which 2 ms to minimize.
[2025-06-05 06:57:08] [INFO ] Deduced a trap composed of 37 places in 454 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2025-06-05 06:57:08] [INFO ] Deduced a trap composed of 37 places in 282 ms of which 2 ms to minimize.
[2025-06-05 06:57:09] [INFO ] Deduced a trap composed of 37 places in 337 ms of which 2 ms to minimize.
[2025-06-05 06:57:09] [INFO ] Deduced a trap composed of 48 places in 352 ms of which 2 ms to minimize.
[2025-06-05 06:57:09] [INFO ] Deduced a trap composed of 38 places in 318 ms of which 2 ms to minimize.
[2025-06-05 06:57:10] [INFO ] Deduced a trap composed of 37 places in 390 ms of which 3 ms to minimize.
[2025-06-05 06:57:10] [INFO ] Deduced a trap composed of 37 places in 399 ms of which 2 ms to minimize.
[2025-06-05 06:57:11] [INFO ] Deduced a trap composed of 38 places in 388 ms of which 2 ms to minimize.
[2025-06-05 06:57:11] [INFO ] Deduced a trap composed of 37 places in 359 ms of which 2 ms to minimize.
[2025-06-05 06:57:11] [INFO ] Deduced a trap composed of 38 places in 354 ms of which 2 ms to minimize.
[2025-06-05 06:57:12] [INFO ] Deduced a trap composed of 40 places in 366 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 146/884 variables, and 182 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30054 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: 30/30 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, 30/182 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2025-06-05 06:57:22] [INFO ] Deduced a trap composed of 37 places in 401 ms of which 3 ms to minimize.
[2025-06-05 06:57:23] [INFO ] Deduced a trap composed of 40 places in 361 ms of which 2 ms to minimize.
[2025-06-05 06:57:23] [INFO ] Deduced a trap composed of 45 places in 400 ms of which 2 ms to minimize.
[2025-06-05 06:57:24] [INFO ] Deduced a trap composed of 40 places in 400 ms of which 3 ms to minimize.
[2025-06-05 06:57:24] [INFO ] Deduced a trap composed of 37 places in 398 ms of which 6 ms to minimize.
[2025-06-05 06:57:25] [INFO ] Deduced a trap composed of 38 places in 359 ms of which 1 ms to minimize.
[2025-06-05 06:57:25] [INFO ] Deduced a trap composed of 37 places in 349 ms of which 2 ms to minimize.
[2025-06-05 06:57:26] [INFO ] Deduced a trap composed of 40 places in 385 ms of which 2 ms to minimize.
[2025-06-05 06:57:26] [INFO ] Deduced a trap composed of 37 places in 345 ms of which 2 ms to minimize.
[2025-06-05 06:57:26] [INFO ] Deduced a trap composed of 37 places in 359 ms of which 2 ms to minimize.
[2025-06-05 06:57:31] [INFO ] Deduced a trap composed of 48 places in 387 ms of which 2 ms to minimize.
[2025-06-05 06:57:31] [INFO ] Deduced a trap composed of 38 places in 376 ms of which 2 ms to minimize.
[2025-06-05 06:57:32] [INFO ] Deduced a trap composed of 37 places in 344 ms of which 2 ms to minimize.
[2025-06-05 06:57:32] [INFO ] Deduced a trap composed of 38 places in 347 ms of which 2 ms to minimize.
[2025-06-05 06:57:32] [INFO ] Deduced a trap composed of 38 places in 340 ms of which 2 ms to minimize.
[2025-06-05 06:57:33] [INFO ] Deduced a trap composed of 37 places in 352 ms of which 2 ms to minimize.
[2025-06-05 06:57:33] [INFO ] Deduced a trap composed of 37 places in 330 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 17/199 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2025-06-05 06:57:39] [INFO ] Deduced a trap composed of 38 places in 421 ms of which 3 ms to minimize.
[2025-06-05 06:57:40] [INFO ] Deduced a trap composed of 38 places in 360 ms of which 2 ms to minimize.
[2025-06-05 06:57:40] [INFO ] Deduced a trap composed of 38 places in 358 ms of which 2 ms to minimize.
[2025-06-05 06:57:41] [INFO ] Deduced a trap composed of 44 places in 362 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2025-06-05 06:57:42] [INFO ] Deduced a trap composed of 40 places in 373 ms of which 2 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 Int declared 146/884 variables, and 204 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30028 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: 0/726 constraints, Known Traps: 52/52 constraints]
After SMT, in 63944ms problems are : Problem set: 0 solved, 726 unsolved
Search for dead transitions found 0 dead transitions in 64005ms
Starting structural reductions in LIVENESS mode, iteration 1 : 146/1534 places, 753/2136 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 65920 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 (4925 resets) in 6127 ms. (6 steps per ms) remains 589/630 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 589/589 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 589/589 properties
Probabilistic random walk after 30001 steps, saw 9428 distinct states, run finished after 854 ms. (steps per millisecond=35 ) properties seen :122
[2025-06-05 06:57:48] [INFO ] Flow matrix only has 738 transitions (discarded 15 similar events)
[2025-06-05 06:57:48] [INFO ] Invariant cache hit.
[2025-06-05 06:57:48] [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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 146/884 variables, and 152 constraints, problems are : Problem set: 0 solved, 467 unsolved in 5019 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: 467/467 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 467 unsolved
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
[2025-06-05 06:57:58] [INFO ] Deduced a trap composed of 38 places in 285 ms of which 3 ms to minimize.
[2025-06-05 06:57:59] [INFO ] Deduced a trap composed of 38 places in 434 ms of which 3 ms to minimize.
[2025-06-05 06:57:59] [INFO ] Deduced a trap composed of 38 places in 429 ms of which 2 ms to minimize.
[2025-06-05 06:57:59] [INFO ] Deduced a trap composed of 38 places in 348 ms of which 12 ms to minimize.
[2025-06-05 06:58:00] [INFO ] Deduced a trap composed of 37 places in 262 ms of which 2 ms to minimize.
[2025-06-05 06:58:00] [INFO ] Deduced a trap composed of 37 places in 283 ms of which 1 ms to minimize.
[2025-06-05 06:58:00] [INFO ] Deduced a trap composed of 38 places in 315 ms of which 2 ms to minimize.
[2025-06-05 06:58:01] [INFO ] Deduced a trap composed of 37 places in 332 ms of which 2 ms to minimize.
SMT process timed out in 12339ms, 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 195 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 196 ms. Remains : 129/146 places, 679/753 transitions.
RANDOM walk for 4000000 steps (440382 resets) in 104187 ms. (38 steps per ms) remains 66/467 properties
BEST_FIRST walk for 400004 steps (4578 resets) in 815 ms. (490 steps per ms) remains 63/66 properties
BEST_FIRST walk for 400004 steps (4514 resets) in 1015 ms. (393 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (4518 resets) in 439 ms. (909 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (4542 resets) in 417 ms. (956 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3357 resets) in 380 ms. (1049 steps per ms) remains 56/63 properties
BEST_FIRST walk for 400004 steps (54 resets) in 456 ms. (875 steps per ms) remains 55/56 properties
BEST_FIRST walk for 400004 steps (23 resets) in 576 ms. (693 steps per ms) remains 54/55 properties
BEST_FIRST walk for 400003 steps (70 resets) in 668 ms. (597 steps per ms) remains 53/54 properties
BEST_FIRST walk for 400003 steps (51 resets) in 566 ms. (705 steps per ms) remains 52/53 properties
BEST_FIRST walk for 400003 steps (2722 resets) in 343 ms. (1162 steps per ms) remains 50/52 properties
BEST_FIRST walk for 400003 steps (2238 resets) in 297 ms. (1342 steps per ms) remains 48/50 properties
BEST_FIRST walk for 400004 steps (58 resets) in 438 ms. (911 steps per ms) remains 47/48 properties
BEST_FIRST walk for 400004 steps (51 resets) in 436 ms. (915 steps per ms) remains 46/47 properties
BEST_FIRST walk for 400004 steps (58 resets) in 430 ms. (928 steps per ms) remains 45/46 properties
BEST_FIRST walk for 400003 steps (35 resets) in 431 ms. (925 steps per ms) remains 44/45 properties
BEST_FIRST walk for 400004 steps (92 resets) in 430 ms. (928 steps per ms) remains 43/44 properties
BEST_FIRST walk for 400004 steps (73 resets) in 360 ms. (1108 steps per ms) remains 42/43 properties
BEST_FIRST walk for 400004 steps (110 resets) in 424 ms. (941 steps per ms) remains 41/42 properties
BEST_FIRST walk for 400003 steps (62 resets) in 657 ms. (607 steps per ms) remains 40/41 properties
BEST_FIRST walk for 400004 steps (31 resets) in 523 ms. (763 steps per ms) remains 39/40 properties
BEST_FIRST walk for 400004 steps (35 resets) in 425 ms. (938 steps per ms) remains 38/39 properties
BEST_FIRST walk for 400004 steps (36 resets) in 416 ms. (959 steps per ms) remains 37/38 properties
BEST_FIRST walk for 400004 steps (27 resets) in 410 ms. (973 steps per ms) remains 36/37 properties
BEST_FIRST walk for 400004 steps (35 resets) in 654 ms. (610 steps per ms) remains 35/36 properties
BEST_FIRST walk for 400004 steps (55 resets) in 557 ms. (716 steps per ms) remains 34/35 properties
BEST_FIRST walk for 400004 steps (79 resets) in 584 ms. (683 steps per ms) remains 33/34 properties
BEST_FIRST walk for 400004 steps (45 resets) in 395 ms. (1010 steps per ms) remains 32/33 properties
BEST_FIRST walk for 400004 steps (54 resets) in 394 ms. (1012 steps per ms) remains 31/32 properties
BEST_FIRST walk for 400004 steps (36 resets) in 302 ms. (1320 steps per ms) remains 30/31 properties
BEST_FIRST walk for 400002 steps (36 resets) in 389 ms. (1025 steps per ms) remains 29/30 properties
BEST_FIRST walk for 400004 steps (61 resets) in 295 ms. (1351 steps per ms) remains 28/29 properties
BEST_FIRST walk for 400002 steps (2634 resets) in 352 ms. (1133 steps per ms) remains 21/28 properties
BEST_FIRST walk for 400004 steps (2636 resets) in 366 ms. (1089 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (2649 resets) in 374 ms. (1066 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (2643 resets) in 364 ms. (1095 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (2640 resets) in 364 ms. (1095 steps per ms) remains 20/21 properties
BEST_FIRST walk for 400003 steps (2654 resets) in 352 ms. (1133 steps per ms) remains 19/20 properties
BEST_FIRST walk for 400004 steps (2649 resets) in 339 ms. (1176 steps per ms) remains 10/19 properties
BEST_FIRST walk for 400004 steps (2638 resets) in 270 ms. (1476 steps per ms) remains 10/10 properties
BEST_FIRST walk for 400003 steps (2645 resets) in 263 ms. (1515 steps per ms) remains 9/10 properties
BEST_FIRST walk for 400004 steps (2648 resets) in 257 ms. (1550 steps per ms) remains 8/9 properties
BEST_FIRST walk for 400004 steps (2652 resets) in 259 ms. (1538 steps per ms) remains 8/8 properties
// Phase 1: matrix 679 rows 129 cols
[2025-06-05 06:58:33] [INFO ] Computed 6 invariants in 6 ms
[2025-06-05 06:58:33] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 116/129 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 679/808 variables, 129/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/808 variables, 85/220 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/808 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/808 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 808/808 variables, and 220 constraints, problems are : Problem set: 0 solved, 8 unsolved in 845 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 129/129 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 116/129 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 679/808 variables, 129/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/808 variables, 85/220 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/808 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-05 06:58:35] [INFO ] Deduced a trap composed of 34 places in 223 ms of which 1 ms to minimize.
[2025-06-05 06:58:35] [INFO ] Deduced a trap composed of 34 places in 265 ms of which 2 ms to minimize.
[2025-06-05 06:58:35] [INFO ] Deduced a trap composed of 34 places in 266 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/808 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/808 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/808 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 808/808 variables, and 231 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2304 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 129/129 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 3195ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 2305 ms.
Support contains 13 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 679/679 transitions.
Graph (complete) has 535 edges and 129 vertex of which 124 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 124 transition count 674
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 38 place count 92 transition count 221
Iterating global reduction 1 with 32 rules applied. Total rules applied 70 place count 92 transition count 221
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 86 place count 92 transition count 205
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 97 place count 81 transition count 194
Iterating global reduction 2 with 11 rules applied. Total rules applied 108 place count 81 transition count 194
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 112 place count 77 transition count 190
Iterating global reduction 2 with 4 rules applied. Total rules applied 116 place count 77 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 118 place count 77 transition count 188
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 124 place count 74 transition count 185
Free-agglomeration rule applied 17 times.
Iterating global reduction 3 with 17 rules applied. Total rules applied 141 place count 74 transition count 168
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 158 place count 57 transition count 168
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 165 place count 57 transition count 168
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 170 place count 57 transition count 163
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 171 place count 56 transition count 161
Iterating global reduction 4 with 1 rules applied. Total rules applied 172 place count 56 transition count 161
Applied a total of 172 rules in 90 ms. Remains 56 /129 variables (removed 73) and now considering 161/679 (removed 518) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 56/129 places, 161/679 transitions.
RANDOM walk for 726885 steps (71933 resets) in 5667 ms. (128 steps per ms) remains 0/8 properties
Able to resolve query QuasiLiveness after proving 631 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 123420 ms.
ITS solved all properties within timeout

BK_STOP 1749106722571

--------------------
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="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is 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 r238-smll-174903502800027"
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.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 ;