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.r140-smll-174876533500147.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 MedleyA-PT-18, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-smll-174876533500147
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 158K 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 1748928690956

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-03 05:31:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-03 05:31:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 05:31:33] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2025-06-03 05:31:33] [INFO ] Transformed 252 places.
[2025-06-03 05:31:33] [INFO ] Transformed 543 transitions.
[2025-06-03 05:31:33] [INFO ] Found NUPN structural information;
[2025-06-03 05:31:33] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 344 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 252/252 places, 543/543 transitions.
Graph (trivial) has 293 edges and 252 vertex of which 13 / 252 are part of one of the 3 SCC in 7 ms
Free SCC test removed 10 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 242 transition count 474
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 61 rules applied. Total rules applied 119 place count 185 transition count 470
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 121 place count 183 transition count 470
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 121 place count 183 transition count 462
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 137 place count 175 transition count 462
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 219 place count 134 transition count 421
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 225 place count 134 transition count 415
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: -216
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 311 place count 91 transition count 631
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 331 place count 91 transition count 611
Applied a total of 331 rules in 183 ms. Remains 91 /252 variables (removed 161) and now considering 611/543 (removed -68) transitions.
[2025-06-03 05:31:33] [INFO ] Flow matrix only has 553 transitions (discarded 58 similar events)
// Phase 1: matrix 553 rows 91 cols
[2025-06-03 05:31:34] [INFO ] Computed 7 invariants in 29 ms
[2025-06-03 05:31:34] [INFO ] Implicit Places using invariants in 475 ms returned []
[2025-06-03 05:31:34] [INFO ] Flow matrix only has 553 transitions (discarded 58 similar events)
[2025-06-03 05:31:34] [INFO ] Invariant cache hit.
[2025-06-03 05:31:34] [INFO ] State equation strengthened by 93 read => feed constraints.
[2025-06-03 05:31:35] [INFO ] Implicit Places using invariants and state equation in 822 ms returned []
Implicit Place search using SMT with State Equation took 1543 ms to find 0 implicit places.
Running 610 sub problems to find dead transitions.
[2025-06-03 05:31:35] [INFO ] Flow matrix only has 553 transitions (discarded 58 similar events)
[2025-06-03 05:31:35] [INFO ] Invariant cache hit.
[2025-06-03 05:31:35] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 7/97 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 610 unsolved
[2025-06-03 05:31:43] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 9 ms to minimize.
[2025-06-03 05:31:44] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 2 ms to minimize.
[2025-06-03 05:31:44] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 2 ms to minimize.
[2025-06-03 05:31:44] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 2 ms to minimize.
[2025-06-03 05:31:44] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 2 ms to minimize.
[2025-06-03 05:31:44] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 2 ms to minimize.
[2025-06-03 05:31:45] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 2 ms to minimize.
[2025-06-03 05:31:45] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 2 ms to minimize.
[2025-06-03 05:31:45] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2025-06-03 05:31:45] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2025-06-03 05:31:45] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 2 ms to minimize.
[2025-06-03 05:31:45] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 1 ms to minimize.
[2025-06-03 05:31:45] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 1 ms to minimize.
[2025-06-03 05:31:46] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2025-06-03 05:31:46] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2025-06-03 05:31:46] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 1 ms to minimize.
[2025-06-03 05:31:46] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 2 ms to minimize.
[2025-06-03 05:31:46] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 1 ms to minimize.
[2025-06-03 05:31:46] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 1 ms to minimize.
[2025-06-03 05:31:47] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 610 unsolved
[2025-06-03 05:31:47] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 2 ms to minimize.
[2025-06-03 05:31:47] [INFO ] Deduced a trap composed of 28 places in 216 ms of which 2 ms to minimize.
[2025-06-03 05:31:48] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 2 ms to minimize.
[2025-06-03 05:31:48] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 2 ms to minimize.
[2025-06-03 05:31:49] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 2 ms to minimize.
[2025-06-03 05:31:49] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 6/124 constraints. Problems are: Problem set: 0 solved, 610 unsolved
[2025-06-03 05:31:51] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 1 ms to minimize.
[2025-06-03 05:31:51] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 610 unsolved
[2025-06-03 05:31:56] [INFO ] Deduced a trap composed of 29 places in 211 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 610 unsolved
[2025-06-03 05:32:00] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 610 unsolved
SMT process timed out in 31982ms, After SMT, problems are : Problem set: 0 solved, 610 unsolved
Search for dead transitions found 0 dead transitions in 32032ms
Starting structural reductions in LIVENESS mode, iteration 1 : 91/252 places, 611/543 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 33814 ms. Remains : 91/252 places, 611/543 transitions.
Discarding 339 transitions out of 611. Remains 272
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (5245 resets) in 4236 ms. (9 steps per ms) remains 212/271 properties
BEST_FIRST walk for 402 steps (14 resets) in 15 ms. (25 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (16 resets) in 20 ms. (19 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (13 resets) in 16 ms. (23 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (15 resets) in 15 ms. (25 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (9 resets) in 17 ms. (22 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (16 resets) in 22 ms. (17 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (16 resets) in 23 ms. (16 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (10 resets) in 19 ms. (20 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (14 resets) in 16 ms. (23 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (16 resets) in 26 ms. (14 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (11 resets) in 15 ms. (25 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (12 resets) in 12 ms. (30 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (10 resets) in 6 ms. (57 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (9 resets) in 11 ms. (33 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (11 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (9 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (10 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (10 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (9 resets) in 9 ms. (40 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 400 steps (20 resets) in 11 ms. (33 steps per ms) remains 212/212 properties
BEST_FIRST walk for 400 steps (20 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 400 steps (20 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 400 steps (20 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 400 steps (20 resets) in 10 ms. (36 steps per ms) remains 212/212 properties
BEST_FIRST walk for 400 steps (20 resets) in 10 ms. (36 steps per ms) remains 212/212 properties
BEST_FIRST walk for 400 steps (20 resets) in 9 ms. (40 steps per ms) remains 212/212 properties
[2025-06-03 05:32:08] [INFO ] Flow matrix only has 553 transitions (discarded 58 similar events)
[2025-06-03 05:32:08] [INFO ] Invariant cache hit.
[2025-06-03 05:32:08] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 19/91 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 19/98 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2025-06-03 05:32:11] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 2 ms to minimize.
[2025-06-03 05:32:12] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
[2025-06-03 05:32:12] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 1 ms to minimize.
[2025-06-03 05:32:12] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 3 ms to minimize.
[2025-06-03 05:32:12] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 8 ms to minimize.
[2025-06-03 05:32:12] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 2 ms to minimize.
[2025-06-03 05:32:13] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 2 ms to minimize.
[2025-06-03 05:32:13] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 1 ms to minimize.
[2025-06-03 05:32:13] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 2 ms to minimize.
[2025-06-03 05:32:13] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 1 ms to minimize.
[2025-06-03 05:32:13] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 2 ms to minimize.
[2025-06-03 05:32:14] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 2 ms to minimize.
[2025-06-03 05:32:14] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 2 ms to minimize.
[2025-06-03 05:32:14] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 1 ms to minimize.
[2025-06-03 05:32:14] [INFO ] Deduced a trap composed of 50 places in 195 ms of which 1 ms to minimize.
SMT process timed out in 5812ms, After SMT, problems are : Problem set: 0 solved, 212 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 72 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 611/611 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 91 transition count 608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 88 transition count 602
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 88 transition count 602
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 1 with 42 rules applied. Total rules applied 51 place count 88 transition count 560
Applied a total of 51 rules in 92 ms. Remains 88 /91 variables (removed 3) and now considering 560/611 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 88/91 places, 560/611 transitions.
RANDOM walk for 4000000 steps (554690 resets) in 74924 ms. (53 steps per ms) remains 163/212 properties
BEST_FIRST walk for 40003 steps (1795 resets) in 240 ms. (165 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (1784 resets) in 323 ms. (123 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (1807 resets) in 445 ms. (89 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40001 steps (1816 resets) in 438 ms. (91 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40000 steps (1789 resets) in 226 ms. (176 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (781 resets) in 289 ms. (137 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (488 resets) in 259 ms. (153 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (488 resets) in 302 ms. (132 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40002 steps (802 resets) in 262 ms. (152 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (489 resets) in 195 ms. (204 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (486 resets) in 152 ms. (261 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (838 resets) in 160 ms. (248 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (821 resets) in 167 ms. (238 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (517 resets) in 148 ms. (268 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40001 steps (517 resets) in 150 ms. (264 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (858 resets) in 163 ms. (243 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (517 resets) in 150 ms. (264 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40002 steps (515 resets) in 152 ms. (261 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (487 resets) in 151 ms. (263 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (489 resets) in 152 ms. (261 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (488 resets) in 151 ms. (263 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40002 steps (489 resets) in 153 ms. (259 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (880 resets) in 167 ms. (238 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (864 resets) in 165 ms. (240 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40002 steps (513 resets) in 151 ms. (263 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (848 resets) in 165 ms. (240 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (513 resets) in 148 ms. (268 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (517 resets) in 147 ms. (270 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40000 steps (2500 resets) in 257 ms. (155 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40000 steps (2500 resets) in 259 ms. (153 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40000 steps (2500 resets) in 251 ms. (158 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40000 steps (2500 resets) in 264 ms. (150 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40000 steps (2500 resets) in 254 ms. (156 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40000 steps (2500 resets) in 262 ms. (152 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40000 steps (2500 resets) in 253 ms. (157 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40000 steps (2500 resets) in 284 ms. (140 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40000 steps (2500 resets) in 255 ms. (156 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40000 steps (2500 resets) in 269 ms. (148 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40000 steps (2500 resets) in 254 ms. (156 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40000 steps (2500 resets) in 263 ms. (151 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40000 steps (2500 resets) in 252 ms. (158 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40000 steps (2500 resets) in 264 ms. (150 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (1814 resets) in 226 ms. (176 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40000 steps (2500 resets) in 265 ms. (150 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40000 steps (2500 resets) in 257 ms. (155 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40000 steps (2500 resets) in 264 ms. (150 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (1962 resets) in 237 ms. (168 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40000 steps (2500 resets) in 275 ms. (144 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40000 steps (2500 resets) in 257 ms. (155 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40000 steps (2500 resets) in 269 ms. (148 steps per ms) remains 163/163 properties
[2025-06-03 05:32:37] [INFO ] Flow matrix only has 504 transitions (discarded 56 similar events)
// Phase 1: matrix 504 rows 88 cols
[2025-06-03 05:32:37] [INFO ] Computed 7 invariants in 7 ms
[2025-06-03 05:32:37] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 28/88 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2025-06-03 05:32:39] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 1 ms to minimize.
[2025-06-03 05:32:39] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 2 ms to minimize.
[2025-06-03 05:32:39] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 2 ms to minimize.
[2025-06-03 05:32:39] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 1 ms to minimize.
[2025-06-03 05:32:40] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 2 ms to minimize.
[2025-06-03 05:32:40] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 1 ms to minimize.
[2025-06-03 05:32:40] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 1 ms to minimize.
[2025-06-03 05:32:40] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 1 ms to minimize.
[2025-06-03 05:32:40] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 1 ms to minimize.
[2025-06-03 05:32:40] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
[2025-06-03 05:32:40] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2025-06-03 05:32:41] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 2 ms to minimize.
[2025-06-03 05:32:41] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 2 ms to minimize.
[2025-06-03 05:32:41] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 2 ms to minimize.
[2025-06-03 05:32:41] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 1 ms to minimize.
[2025-06-03 05:32:42] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 2 ms to minimize.
[2025-06-03 05:32:42] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 1 ms to minimize.
[2025-06-03 05:32:42] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
[2025-06-03 05:32:42] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 2 ms to minimize.
[2025-06-03 05:32:42] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 504/592 variables, 88/115 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 92/207 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2025-06-03 05:32:44] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 2 ms to minimize.
[2025-06-03 05:32:45] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/592 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/592 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (OVERLAPS) 0/592 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 592/592 variables, and 209 constraints, problems are : Problem set: 0 solved, 163 unsolved in 21546 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 88/88 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 28/88 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Problem qltransition_140 is UNSAT
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
SMT process timed out in 23757ms, After SMT, problems are : Problem set: 0 solved, 163 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 560/560 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 86 transition count 556
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 86 transition count 556
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 86 transition count 554
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 84 transition count 554
Applied a total of 8 rules in 43 ms. Remains 84 /88 variables (removed 4) and now considering 554/560 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 84/88 places, 554/560 transitions.
Total runtime 88300 ms.
ITS solved all properties within timeout

BK_STOP 1748928781805

--------------------
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="MedleyA-PT-18"
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 MedleyA-PT-18, 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 r140-smll-174876533500147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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