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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K 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 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K 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.8K 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 428K 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 1749117718538

Invoking MCC driver with
BK_TOOL=gold2024
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
[2025-06-05 10:02:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-05 10:02:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 10:02:01] [INFO ] Load time of PNML (sax parser for PT used): 363 ms
[2025-06-05 10:02:01] [INFO ] Transformed 699 places.
[2025-06-05 10:02:01] [INFO ] Transformed 1266 transitions.
[2025-06-05 10:02:01] [INFO ] Found NUPN structural information;
[2025-06-05 10:02:01] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 744 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 17 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 8 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 3 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 2 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 308 ms. Remains 85 /699 variables (removed 614) and now considering 658/1266 (removed 608) transitions.
[2025-06-05 10:02:02] [INFO ] Flow matrix only has 643 transitions (discarded 15 similar events)
// Phase 1: matrix 643 rows 85 cols
[2025-06-05 10:02:02] [INFO ] Computed 6 invariants in 63 ms
[2025-06-05 10:02:03] [INFO ] Implicit Places using invariants in 743 ms returned []
[2025-06-05 10:02:03] [INFO ] Flow matrix only has 643 transitions (discarded 15 similar events)
[2025-06-05 10:02:03] [INFO ] Invariant cache hit.
[2025-06-05 10:02:03] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-05 10:02:03] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1681 ms to find 0 implicit places.
Running 642 sub problems to find dead transitions.
[2025-06-05 10:02:04] [INFO ] Flow matrix only has 643 transitions (discarded 15 similar events)
[2025-06-05 10:02:04] [INFO ] Invariant cache hit.
[2025-06-05 10:02:04] [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
[2025-06-05 10:02:17] [INFO ] Deduced a trap composed of 25 places in 515 ms of which 26 ms to minimize.
[2025-06-05 10:02:17] [INFO ] Deduced a trap composed of 26 places in 493 ms of which 2 ms to minimize.
[2025-06-05 10:02:18] [INFO ] Deduced a trap composed of 26 places in 307 ms of which 2 ms to minimize.
[2025-06-05 10:02:18] [INFO ] Deduced a trap composed of 26 places in 244 ms of which 2 ms to minimize.
[2025-06-05 10:02:18] [INFO ] Deduced a trap composed of 26 places in 245 ms of which 1 ms to minimize.
[2025-06-05 10:02:18] [INFO ] Deduced a trap composed of 26 places in 219 ms of which 1 ms to minimize.
[2025-06-05 10:02:19] [INFO ] Deduced a trap composed of 25 places in 246 ms of which 1 ms to minimize.
[2025-06-05 10:02:19] [INFO ] Deduced a trap composed of 25 places in 317 ms of which 2 ms to minimize.
[2025-06-05 10:02:19] [INFO ] Deduced a trap composed of 25 places in 405 ms of which 2 ms to minimize.
[2025-06-05 10:02:20] [INFO ] Deduced a trap composed of 25 places in 398 ms of which 2 ms to minimize.
[2025-06-05 10:02:20] [INFO ] Deduced a trap composed of 25 places in 384 ms of which 2 ms to minimize.
[2025-06-05 10:02:21] [INFO ] Deduced a trap composed of 25 places in 341 ms of which 1 ms to minimize.
[2025-06-05 10:02:21] [INFO ] Deduced a trap composed of 25 places in 365 ms of which 2 ms to minimize.
[2025-06-05 10:02:21] [INFO ] Deduced a trap composed of 25 places in 382 ms of which 2 ms to minimize.
[2025-06-05 10:02:22] [INFO ] Deduced a trap composed of 25 places in 384 ms of which 2 ms to minimize.
[2025-06-05 10:02:22] [INFO ] Deduced a trap composed of 25 places in 365 ms of which 2 ms to minimize.
[2025-06-05 10:02:23] [INFO ] Deduced a trap composed of 25 places in 471 ms of which 2 ms to minimize.
[2025-06-05 10:02:23] [INFO ] Deduced a trap composed of 25 places in 336 ms of which 2 ms to minimize.
[2025-06-05 10:02:26] [INFO ] Deduced a trap composed of 25 places in 355 ms of which 2 ms to minimize.
[2025-06-05 10:02:27] [INFO ] Deduced a trap composed of 25 places in 371 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2025-06-05 10:02:28] [INFO ] Deduced a trap composed of 26 places in 383 ms of which 2 ms to minimize.
[2025-06-05 10:02:28] [INFO ] Deduced a trap composed of 26 places in 401 ms of which 2 ms to minimize.
[2025-06-05 10:02:28] [INFO ] Deduced a trap composed of 26 places in 382 ms of which 2 ms to minimize.
[2025-06-05 10:02:29] [INFO ] Deduced a trap composed of 26 places in 337 ms of which 2 ms to minimize.
[2025-06-05 10:02:29] [INFO ] Deduced a trap composed of 26 places in 325 ms of which 2 ms to minimize.
[2025-06-05 10:02:30] [INFO ] Deduced a trap composed of 26 places in 322 ms of which 2 ms to minimize.
[2025-06-05 10:02:30] [INFO ] Deduced a trap composed of 26 places in 404 ms of which 2 ms to minimize.
[2025-06-05 10:02:30] [INFO ] Deduced a trap composed of 25 places in 375 ms of which 2 ms to minimize.
[2025-06-05 10:02:31] [INFO ] Deduced a trap composed of 25 places in 351 ms of which 2 ms to minimize.
[2025-06-05 10:02:34] [INFO ] Deduced a trap composed of 25 places in 375 ms of which 2 ms to minimize.
[2025-06-05 10:02:35] [INFO ] Deduced a trap composed of 26 places in 362 ms of which 2 ms to minimize.
[2025-06-05 10:02:35] [INFO ] Deduced a trap composed of 25 places in 383 ms of which 2 ms to minimize.
[2025-06-05 10:02:35] [INFO ] Deduced a trap composed of 26 places in 369 ms of which 2 ms to minimize.
[2025-06-05 10:02:36] [INFO ] Deduced a trap composed of 25 places in 371 ms of which 3 ms to minimize.
[2025-06-05 10:02:36] [INFO ] Deduced a trap composed of 26 places in 341 ms of which 2 ms to minimize.
[2025-06-05 10:02:37] [INFO ] Deduced a trap composed of 25 places in 418 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 16/127 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2025-06-05 10:02:38] [INFO ] Deduced a trap composed of 26 places in 364 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 85/728 variables, and 128 constraints, problems are : Problem set: 0 solved, 642 unsolved in 30051 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: 642/642 constraints, Known Traps: 37/37 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, 37/128 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2025-06-05 10:02:42] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 1 ms to minimize.
[2025-06-05 10:02:42] [INFO ] Deduced a trap composed of 26 places in 255 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2025-06-05 10:02:47] [INFO ] Deduced a trap composed of 25 places in 392 ms of which 4 ms to minimize.
[2025-06-05 10:02:47] [INFO ] Deduced a trap composed of 25 places in 362 ms of which 2 ms to minimize.
[2025-06-05 10:02:50] [INFO ] Deduced a trap composed of 25 places in 384 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2025-06-05 10:02:51] [INFO ] Deduced a trap composed of 26 places in 315 ms of which 2 ms to minimize.
[2025-06-05 10:02:52] [INFO ] Deduced a trap composed of 26 places in 384 ms of which 3 ms to minimize.
[2025-06-05 10:02:52] [INFO ] Deduced a trap composed of 26 places in 360 ms of which 2 ms to minimize.
[2025-06-05 10:02:52] [INFO ] Deduced a trap composed of 26 places in 340 ms of which 1 ms to minimize.
[2025-06-05 10:02:53] [INFO ] Deduced a trap composed of 26 places in 389 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 9 (OVERLAPS) 642/727 variables, 85/223 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/727 variables, 40/263 constraints. Problems are: Problem set: 0 solved, 642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 727/728 variables, and 905 constraints, problems are : Problem set: 0 solved, 642 unsolved in 30292 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: 47/47 constraints]
After SMT, in 64414ms problems are : Problem set: 0 solved, 642 unsolved
Search for dead transitions found 0 dead transitions in 64475ms
Starting structural reductions in LIVENESS mode, iteration 1 : 85/699 places, 658/1266 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 66536 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 (4991 resets) in 6164 ms. (6 steps per ms) remains 511/569 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 11 ms. (10 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 4 ms. (24 steps per ms) remains 511/511 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 511/511 properties
[2025-06-05 10:03:10] [INFO ] Flow matrix only has 643 transitions (discarded 15 similar events)
[2025-06-05 10:03:10] [INFO ] Invariant cache hit.
[2025-06-05 10:03:10] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 2 (OVERLAPS) 23/85 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 511 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 23/91 constraints. Problems are: Problem set: 0 solved, 511 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 85/728 variables, and 91 constraints, problems are : Problem set: 0 solved, 511 unsolved in 5033 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: 511/511 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 511 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 2 (OVERLAPS) 23/85 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 23/91 constraints. Problems are: Problem set: 0 solved, 511 unsolved
[2025-06-05 10:03:21] [INFO ] Deduced a trap composed of 25 places in 269 ms of which 2 ms to minimize.
[2025-06-05 10:03:21] [INFO ] Deduced a trap composed of 25 places in 269 ms of which 1 ms to minimize.
[2025-06-05 10:03:21] [INFO ] Deduced a trap composed of 25 places in 250 ms of which 1 ms to minimize.
[2025-06-05 10:03:22] [INFO ] Deduced a trap composed of 26 places in 437 ms of which 1 ms to minimize.
[2025-06-05 10:03:22] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 1 ms to minimize.
[2025-06-05 10:03:22] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 1 ms to minimize.
[2025-06-05 10:03:22] [INFO ] Deduced a trap composed of 25 places in 252 ms of which 2 ms to minimize.
[2025-06-05 10:03:23] [INFO ] Deduced a trap composed of 26 places in 259 ms of which 1 ms to minimize.
[2025-06-05 10:03:23] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 2 ms to minimize.
SMT process timed out in 12886ms, After SMT, problems are : Problem set: 0 solved, 511 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 62 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 658/658 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 85 transition count 642
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 82 transition count 639
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 82 transition count 639
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 80 transition count 631
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 80 transition count 631
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 80 transition count 607
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 80 transition count 606
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 79 transition count 606
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 53 place count 79 transition count 605
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 78 transition count 604
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 78 transition count 604
Applied a total of 55 rules in 185 ms. Remains 78 /85 variables (removed 7) and now considering 604/658 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 78/85 places, 604/658 transitions.
RANDOM walk for 4000000 steps (475150 resets) in 79702 ms. (50 steps per ms) remains 0/511 properties
Able to resolve query QuasiLiveness after proving 570 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 103544 ms.
ITS solved all properties within timeout

BK_STOP 1749117824545

--------------------
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="StigmergyElection-PT-05b"
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 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 r238-smll-174903503100137"
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.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 ;