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.r168-tall-174881266800307.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 PolyORBLF-PT-S04J06T08, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-174881266800307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.1M
-rw-r--r-- 1 mcc users 15K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 299K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 54K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 201K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 62K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 326K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 72K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 356K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 3.5M May 29 14:32 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 1748900154231

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S04J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 21:35:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-02 21:35:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:35:55] [INFO ] Load time of PNML (sax parser for PT used): 264 ms
[2025-06-02 21:35:55] [INFO ] Transformed 792 places.
[2025-06-02 21:35:55] [INFO ] Transformed 4268 transitions.
[2025-06-02 21:35:55] [INFO ] Parsed PT model containing 792 places and 4268 transitions and 28832 arcs in 403 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 792/792 places, 4268/4268 transitions.
Ensure Unique test removed 4 places
Ensure Unique test removed 2168 transitions
Reduce isomorphic transitions removed 2168 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 2244 rules applied. Total rules applied 2244 place count 788 transition count 2028
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 2316 place count 716 transition count 2028
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 2316 place count 716 transition count 1932
Deduced a syphon composed of 96 places in 8 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 2508 place count 620 transition count 1932
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 6 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 2668 place count 540 transition count 1852
Applied a total of 2668 rules in 161 ms. Remains 540 /792 variables (removed 252) and now considering 1852/4268 (removed 2416) transitions.
Running 1848 sub problems to find dead transitions.
[2025-06-02 21:35:56] [INFO ] Flow matrix only has 1820 transitions (discarded 32 similar events)
// Phase 1: matrix 1820 rows 540 cols
[2025-06-02 21:35:56] [INFO ] Computed 54 invariants in 112 ms
[2025-06-02 21:35:56] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 1848 unsolved
[2025-06-02 21:36:18] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 11 ms to minimize.
[2025-06-02 21:36:20] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 2.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 4.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 1.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 2.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 2.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 4.0)
(s122 0.0)
(s123 0.0)
(s124 3.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 2.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 4.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 4.0)
(s179 10.0)
(s180 0.0)
(s181 3.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 4.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 2.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 4.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 4.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 2.0)
(s260 0.0)
(s261 1.0)
(s262 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/2360 variables, and 47 constraints, problems are : Problem set: 0 solved, 1848 unsolved in 20082 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 26/34 constraints, State Equation: 0/540 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1848/1848 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1848 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 1848 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/536 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1848 unsolved
[2025-06-02 21:36:25] [INFO ] Deduced a trap composed of 52 places in 338 ms of which 4 ms to minimize.
[2025-06-02 21:36:26] [INFO ] Deduced a trap composed of 54 places in 293 ms of which 3 ms to minimize.
[2025-06-02 21:36:26] [INFO ] Deduced a trap composed of 53 places in 287 ms of which 3 ms to minimize.
[2025-06-02 21:36:26] [INFO ] Deduced a trap composed of 53 places in 269 ms of which 2 ms to minimize.
[2025-06-02 21:36:26] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2025-06-02 21:36:26] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 0 ms to minimize.
[2025-06-02 21:36:27] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 3 ms to minimize.
[2025-06-02 21:36:27] [INFO ] Deduced a trap composed of 73 places in 190 ms of which 2 ms to minimize.
[2025-06-02 21:36:31] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2025-06-02 21:36:31] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 3 ms to minimize.
[2025-06-02 21:36:32] [INFO ] Deduced a trap composed of 72 places in 256 ms of which 2 ms to minimize.
[2025-06-02 21:36:33] [INFO ] Deduced a trap composed of 45 places in 195 ms of which 2 ms to minimize.
[2025-06-02 21:36:34] [INFO ] Deduced a trap composed of 33 places in 212 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 536/2360 variables, and 60 constraints, problems are : Problem set: 0 solved, 1848 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 26/34 constraints, State Equation: 0/540 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1848 constraints, Known Traps: 15/15 constraints]
After SMT, in 47745ms problems are : Problem set: 0 solved, 1848 unsolved
Search for dead transitions found 0 dead transitions in 47792ms
[2025-06-02 21:36:43] [INFO ] Flow matrix only has 1820 transitions (discarded 32 similar events)
[2025-06-02 21:36:43] [INFO ] Invariant cache hit.
[2025-06-02 21:36:44] [INFO ] Implicit Places using invariants in 728 ms returned [2, 89, 100, 147, 200, 236, 263, 397]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 734 ms to find 8 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 532/792 places, 1852/4268 transitions.
Applied a total of 0 rules in 12 ms. Remains 532 /532 variables (removed 0) and now considering 1852/1852 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 48758 ms. Remains : 532/792 places, 1852/4268 transitions.
Initial state reduction rules removed 4 formulas.
RANDOM walk for 40001 steps (9 resets) in 4562 ms. (8 steps per ms) remains 449/1848 properties
BEST_FIRST walk for 404 steps (8 resets) in 29 ms. (13 steps per ms) remains 449/449 properties
BEST_FIRST walk for 403 steps (8 resets) in 31 ms. (12 steps per ms) remains 449/449 properties
BEST_FIRST walk for 403 steps (8 resets) in 29 ms. (13 steps per ms) remains 449/449 properties
BEST_FIRST walk for 404 steps (8 resets) in 42 ms. (9 steps per ms) remains 449/449 properties
BEST_FIRST walk for 403 steps (8 resets) in 26 ms. (14 steps per ms) remains 449/449 properties
BEST_FIRST walk for 402 steps (8 resets) in 28 ms. (13 steps per ms) remains 449/449 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 448/449 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 448/448 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 448/448 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 447/448 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 447/447 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 447/447 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 447/447 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 447/447 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 447/447 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 447/447 properties
BEST_FIRST walk for 400 steps (8 resets) in 12 ms. (30 steps per ms) remains 447/447 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 447/447 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 447/447 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 447/447 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 447/447 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 447/447 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 447/447 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 447/447 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 447/447 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 447/447 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 447/447 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 447/447 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 447/447 properties
BEST_FIRST walk for 401 steps (8 resets) in 9 ms. (40 steps per ms) remains 447/447 properties
BEST_FIRST walk for 400 steps (8 resets) in 236 ms. (1 steps per ms) remains 447/447 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 402 steps (8 resets) in 16 ms. (23 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 447/447 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 447/447 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 447/447 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 447/447 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 447/447 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 447/447 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 447/447 properties
[2025-06-02 21:36:46] [INFO ] Flow matrix only has 1820 transitions (discarded 32 similar events)
// Phase 1: matrix 1820 rows 532 cols
[2025-06-02 21:36:46] [INFO ] Computed 46 invariants in 49 ms
[2025-06-02 21:36:46] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Problem qltransition_24 is UNSAT
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK SMT_REFINEMENT BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
SMT process timed out in 4722ms, After SMT, problems are : Problem set: 0 solved, 447 unsolved
Fused 447 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 29 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1852/1852 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 525 transition count 1845
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 525 transition count 1845
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 22 place count 525 transition count 1837
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 30 place count 517 transition count 1837
Applied a total of 30 rules in 202 ms. Remains 517 /532 variables (removed 15) and now considering 1837/1852 (removed 15) transitions.
Running 1833 sub problems to find dead transitions.
[2025-06-02 21:36:51] [INFO ] Flow matrix only has 1805 transitions (discarded 32 similar events)
// Phase 1: matrix 1805 rows 517 cols
[2025-06-02 21:36:51] [INFO ] Computed 46 invariants in 32 ms
[2025-06-02 21:36:51] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/513 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
[2025-06-02 21:37:16] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 1 ms to minimize.
[2025-06-02 21:37:16] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 1 ms to minimize.
[2025-06-02 21:37:16] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:37:17] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 1 ms to minimize.
[2025-06-02 21:37:17] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 513/2322 variables, and 46 constraints, problems are : Problem set: 0 solved, 1833 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/517 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1833/1833 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/513 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
[2025-06-02 21:37:20] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2025-06-02 21:37:20] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 0 ms to minimize.
[2025-06-02 21:37:20] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
[2025-06-02 21:37:20] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 1 ms to minimize.
[2025-06-02 21:37:20] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2025-06-02 21:37:20] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 0 ms to minimize.
[2025-06-02 21:37:21] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2025-06-02 21:37:23] [INFO ] Deduced a trap composed of 33 places in 290 ms of which 3 ms to minimize.
[2025-06-02 21:37:24] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
[2025-06-02 21:37:29] [INFO ] Deduced a trap composed of 52 places in 192 ms of which 2 ms to minimize.
[2025-06-02 21:37:29] [INFO ] Deduced a trap composed of 89 places in 187 ms of which 4 ms to minimize.
[2025-06-02 21:37:29] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 2 ms to minimize.
[2025-06-02 21:37:29] [INFO ] Deduced a trap composed of 92 places in 187 ms of which 2 ms to minimize.
[2025-06-02 21:37:30] [INFO ] Deduced a trap composed of 78 places in 194 ms of which 4 ms to minimize.
[2025-06-02 21:37:30] [INFO ] Deduced a trap composed of 77 places in 193 ms of which 6 ms to minimize.
[2025-06-02 21:37:30] [INFO ] Deduced a trap composed of 71 places in 189 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/2322 variables, and 62 constraints, problems are : Problem set: 0 solved, 1833 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/517 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1833 constraints, Known Traps: 21/21 constraints]
After SMT, in 47012ms problems are : Problem set: 0 solved, 1833 unsolved
Search for dead transitions found 0 dead transitions in 47027ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47235 ms. Remains : 517/532 places, 1837/1852 transitions.
Total runtime 102893 ms.
ITS solved all properties within timeout

BK_STOP 1748900258400

--------------------
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="PolyORBLF-PT-S04J06T08"
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 PolyORBLF-PT-S04J06T08, 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 r168-tall-174881266800307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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