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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K 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 359K 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 1749106462819

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-03b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-05 06:54:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-05 06:54:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:54:25] [INFO ] Load time of PNML (sax parser for PT used): 320 ms
[2025-06-05 06:54:25] [INFO ] Transformed 1231 places.
[2025-06-05 06:54:25] [INFO ] Transformed 1476 transitions.
[2025-06-05 06:54:25] [INFO ] Found NUPN structural information;
[2025-06-05 06:54:26] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 556 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Graph (trivial) has 1222 edges and 1231 vertex of which 84 / 1231 are part of one of the 12 SCC in 14 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 924 transitions
Trivial Post-agglo rules discarded 924 transitions
Performed 924 trivial Post agglomeration. Transition count delta: 924
Iterating post reduction 0 with 924 rules applied. Total rules applied 925 place count 1159 transition count 472
Reduce places removed 924 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 940 rules applied. Total rules applied 1865 place count 235 transition count 456
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1869 place count 231 transition count 456
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 1869 place count 231 transition count 412
Deduced a syphon composed of 44 places in 2 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 1957 place count 187 transition count 412
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 2077 place count 127 transition count 352
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 2097 place count 117 transition count 370
Applied a total of 2097 rules in 320 ms. Remains 117 /1231 variables (removed 1114) and now considering 370/1476 (removed 1106) transitions.
[2025-06-05 06:54:26] [INFO ] Flow matrix only has 358 transitions (discarded 12 similar events)
// Phase 1: matrix 358 rows 117 cols
[2025-06-05 06:54:26] [INFO ] Computed 5 invariants in 38 ms
[2025-06-05 06:54:26] [INFO ] Implicit Places using invariants in 470 ms returned []
[2025-06-05 06:54:26] [INFO ] Flow matrix only has 358 transitions (discarded 12 similar events)
[2025-06-05 06:54:26] [INFO ] Invariant cache hit.
[2025-06-05 06:54:27] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-06-05 06:54:27] [INFO ] Implicit Places using invariants and state equation in 677 ms returned []
Implicit Place search using SMT with State Equation took 1194 ms to find 0 implicit places.
Running 343 sub problems to find dead transitions.
[2025-06-05 06:54:27] [INFO ] Flow matrix only has 358 transitions (discarded 12 similar events)
[2025-06-05 06:54:27] [INFO ] Invariant cache hit.
[2025-06-05 06:54:27] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 2 (OVERLAPS) 1/117 variables, 5/121 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2025-06-05 06:54:34] [INFO ] Deduced a trap composed of 37 places in 281 ms of which 26 ms to minimize.
[2025-06-05 06:54:34] [INFO ] Deduced a trap composed of 38 places in 222 ms of which 4 ms to minimize.
[2025-06-05 06:54:34] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 2 ms to minimize.
[2025-06-05 06:54:34] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 2 ms to minimize.
[2025-06-05 06:54:34] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 2 ms to minimize.
[2025-06-05 06:54:35] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 3 ms to minimize.
[2025-06-05 06:54:35] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 2 ms to minimize.
[2025-06-05 06:54:35] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 3 ms to minimize.
[2025-06-05 06:54:35] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 1 ms to minimize.
[2025-06-05 06:54:35] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 3 ms to minimize.
[2025-06-05 06:54:36] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 4 ms to minimize.
[2025-06-05 06:54:36] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 3 ms to minimize.
[2025-06-05 06:54:36] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 1 ms to minimize.
[2025-06-05 06:54:36] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 11 ms to minimize.
[2025-06-05 06:54:36] [INFO ] Deduced a trap composed of 40 places in 177 ms of which 3 ms to minimize.
[2025-06-05 06:54:36] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 2 ms to minimize.
[2025-06-05 06:54:36] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 4 ms to minimize.
[2025-06-05 06:54:37] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 2 ms to minimize.
[2025-06-05 06:54:37] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 3 ms to minimize.
[2025-06-05 06:54:37] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2025-06-05 06:54:37] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 2 ms to minimize.
[2025-06-05 06:54:38] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 2 ms to minimize.
[2025-06-05 06:54:38] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 2 ms to minimize.
[2025-06-05 06:54:38] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2025-06-05 06:54:38] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 3 ms to minimize.
[2025-06-05 06:54:39] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 2 ms to minimize.
[2025-06-05 06:54:40] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 1 ms to minimize.
[2025-06-05 06:54:40] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 1 ms to minimize.
[2025-06-05 06:54:40] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
[2025-06-05 06:54:40] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 1 ms to minimize.
[2025-06-05 06:54:40] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 11/153 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2025-06-05 06:54:41] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 2 ms to minimize.
[2025-06-05 06:54:43] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 8 (OVERLAPS) 357/474 variables, 117/272 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 70/342 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 11 (OVERLAPS) 1/475 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 475/475 variables, and 343 constraints, problems are : Problem set: 0 solved, 343 unsolved in 30033 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 117/117 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 343/343 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 343 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 2 (OVERLAPS) 1/117 variables, 5/121 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 33/155 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 6 (OVERLAPS) 357/474 variables, 117/272 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 70/342 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 343/685 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2025-06-05 06:55:14] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 1/686 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2025-06-05 06:55:25] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 474/475 variables, and 687 constraints, problems are : Problem set: 0 solved, 343 unsolved in 30016 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 117/117 constraints, ReadFeed: 70/71 constraints, PredecessorRefiner: 343/343 constraints, Known Traps: 35/35 constraints]
After SMT, in 61107ms problems are : Problem set: 0 solved, 343 unsolved
Search for dead transitions found 0 dead transitions in 61157ms
Starting structural reductions in LIVENESS mode, iteration 1 : 117/1231 places, 370/1476 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 62742 ms. Remains : 117/1231 places, 370/1476 transitions.
Discarding 102 transitions out of 370. Remains 268
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (6043 resets) in 4844 ms. (8 steps per ms) remains 215/267 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 215/215 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 215/215 properties
[2025-06-05 06:55:30] [INFO ] Flow matrix only has 358 transitions (discarded 12 similar events)
[2025-06-05 06:55:30] [INFO ] Invariant cache hit.
[2025-06-05 06:55:30] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 33/117 variables, 5/89 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 33/122 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2025-06-05 06:55:33] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 2 ms to minimize.
[2025-06-05 06:55:33] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 2 ms to minimize.
[2025-06-05 06:55:33] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 2 ms to minimize.
[2025-06-05 06:55:33] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 2 ms to minimize.
[2025-06-05 06:55:34] [INFO ] Deduced a trap composed of 37 places in 220 ms of which 4 ms to minimize.
[2025-06-05 06:55:34] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 3 ms to minimize.
[2025-06-05 06:55:34] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 2 ms to minimize.
[2025-06-05 06:55:34] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 2 ms to minimize.
[2025-06-05 06:55:35] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 2 ms to minimize.
SMT process timed out in 5492ms, After SMT, problems are : Problem set: 0 solved, 215 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 84 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 370/370 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 117 transition count 357
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 19 place count 111 transition count 351
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 111 transition count 351
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 107 transition count 347
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 107 transition count 347
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 103 transition count 343
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 103 transition count 343
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 61 place count 103 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 77 place count 103 transition count 307
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 103 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 102 transition count 306
Applied a total of 79 rules in 155 ms. Remains 102 /117 variables (removed 15) and now considering 306/370 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 102/117 places, 306/370 transitions.
RANDOM walk for 4000000 steps (552211 resets) in 30254 ms. (132 steps per ms) remains 12/215 properties
BEST_FIRST walk for 4000004 steps (35329 resets) in 4255 ms. (939 steps per ms) remains 4/12 properties
BEST_FIRST walk for 4000002 steps (35352 resets) in 1753 ms. (2280 steps per ms) remains 0/4 properties
Able to resolve query QuasiLiveness after proving 268 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 79972 ms.
ITS solved all properties within timeout

BK_STOP 1749106545437

--------------------
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-03b"
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-03b, 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-174903502800017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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