Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r590-smll-171734924800072.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is MedleyA-PT-15, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r590-smll-171734924800072
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 110K Jun 2 16: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 1717352395268

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:19:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 18:19:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:19:58] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2024-06-02 18:19:58] [INFO ] Transformed 192 places.
[2024-06-02 18:19:58] [INFO ] Transformed 475 transitions.
[2024-06-02 18:19:58] [INFO ] Found NUPN structural information;
[2024-06-02 18:19:58] [INFO ] Parsed PT model containing 192 places and 475 transitions and 1522 arcs in 472 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 192/192 places, 475/475 transitions.
Graph (trivial) has 227 edges and 192 vertex of which 9 / 192 are part of one of the 3 SCC in 10 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 186 transition count 438
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 157 transition count 436
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 61 place count 157 transition count 430
Deduced a syphon composed of 6 places in 7 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 73 place count 151 transition count 430
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 147 place count 114 transition count 393
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 152 place count 114 transition count 388
Performed 43 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 43 places in 3 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 238 place count 71 transition count 601
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 270 place count 71 transition count 569
Applied a total of 270 rules in 230 ms. Remains 71 /192 variables (removed 121) and now considering 569/475 (removed -94) transitions.
[2024-06-02 18:19:58] [INFO ] Flow matrix only has 440 transitions (discarded 129 similar events)
// Phase 1: matrix 440 rows 71 cols
[2024-06-02 18:19:58] [INFO ] Computed 7 invariants in 53 ms
[2024-06-02 18:19:59] [INFO ] Implicit Places using invariants in 582 ms returned [21, 40]
[2024-06-02 18:19:59] [INFO ] Actually due to overlaps returned [40]
Discarding 1 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 652 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 70/192 places, 567/475 transitions.
Graph (trivial) has 84 edges and 70 vertex of which 8 / 70 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Applied a total of 1 rules in 11 ms. Remains 66 /70 variables (removed 4) and now considering 515/567 (removed 52) transitions.
[2024-06-02 18:19:59] [INFO ] Flow matrix only has 357 transitions (discarded 158 similar events)
// Phase 1: matrix 357 rows 66 cols
[2024-06-02 18:19:59] [INFO ] Computed 6 invariants in 10 ms
[2024-06-02 18:19:59] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-06-02 18:19:59] [INFO ] Flow matrix only has 357 transitions (discarded 158 similar events)
[2024-06-02 18:19:59] [INFO ] Invariant cache hit.
[2024-06-02 18:19:59] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 18:20:00] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 66/192 places, 515/475 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1684 ms. Remains : 66/192 places, 515/475 transitions.
Discarding 335 transitions out of 515. Remains 180
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (6542 resets) in 3722 ms. (10 steps per ms) remains 65/179 properties
BEST_FIRST walk for 4003 steps (155 resets) in 45 ms. (87 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (146 resets) in 36 ms. (108 steps per ms) remains 61/65 properties
BEST_FIRST walk for 4003 steps (158 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (141 resets) in 29 ms. (133 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (151 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (144 resets) in 79 ms. (50 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (142 resets) in 67 ms. (58 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (152 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (148 resets) in 35 ms. (111 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (168 resets) in 47 ms. (83 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (169 resets) in 43 ms. (91 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (145 resets) in 39 ms. (100 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4004 steps (160 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (155 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (155 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (153 resets) in 21 ms. (181 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (149 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (138 resets) in 22 ms. (174 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (152 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (162 resets) in 40 ms. (97 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (164 resets) in 19 ms. (200 steps per ms) remains 59/60 properties
BEST_FIRST walk for 4003 steps (160 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (155 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (159 resets) in 21 ms. (181 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (143 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (158 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (163 resets) in 29 ms. (133 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (146 resets) in 21 ms. (182 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (138 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (158 resets) in 18 ms. (210 steps per ms) remains 58/59 properties
BEST_FIRST walk for 4002 steps (150 resets) in 25 ms. (153 steps per ms) remains 56/58 properties
BEST_FIRST walk for 4003 steps (160 resets) in 30 ms. (129 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (153 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (157 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (169 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (149 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (154 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (150 resets) in 22 ms. (174 steps per ms) remains 54/56 properties
BEST_FIRST walk for 4003 steps (147 resets) in 19 ms. (200 steps per ms) remains 53/54 properties
BEST_FIRST walk for 4003 steps (150 resets) in 18 ms. (210 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (140 resets) in 45 ms. (87 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (152 resets) in 28 ms. (138 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (164 resets) in 28 ms. (138 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (156 resets) in 21 ms. (181 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (160 resets) in 53 ms. (74 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (162 resets) in 22 ms. (174 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (156 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (156 resets) in 23 ms. (166 steps per ms) remains 50/53 properties
BEST_FIRST walk for 4004 steps (161 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (156 resets) in 26 ms. (148 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (146 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (155 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (154 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (165 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (153 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (160 resets) in 21 ms. (182 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (158 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
[2024-06-02 18:20:02] [INFO ] Flow matrix only has 357 transitions (discarded 158 similar events)
[2024-06-02 18:20:02] [INFO ] Invariant cache hit.
[2024-06-02 18:20:02] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 21/42 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 21/44 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 24/66 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 24/72 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-02 18:20:03] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 356/422 variables, 66/139 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 62/201 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-02 18:20:04] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 50 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 13 (OVERLAPS) 1/423 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 50 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 423/423 variables, and 203 constraints, problems are : Problem set: 0 solved, 50 unsolved in 5016 ms.
Refiners :[Domain max(s): 66/66 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 66/66 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 21/42 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 21/44 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 24/66 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 24/72 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 356/422 variables, 66/140 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 62/202 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 50/252 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 13 (OVERLAPS) 1/423 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 253 constraints, problems are : Problem set: 0 solved, 50 unsolved in 5014 ms.
Refiners :[Domain max(s): 66/66 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 66/66 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 2/2 constraints]
After SMT, in 10242ms problems are : Problem set: 0 solved, 50 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 515/515 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 66 transition count 484
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 61 transition count 450
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 61 transition count 450
Drop transitions (Redundant composition of simpler transitions.) removed 164 transitions
Redundant transition composition rules discarded 164 transitions
Iterating global reduction 1 with 164 rules applied. Total rules applied 205 place count 61 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 207 place count 60 transition count 285
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 214 place count 60 transition count 278
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 221 place count 53 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 222 place count 52 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 223 place count 51 transition count 277
Drop transitions (Redundant composition of simpler transitions.) removed 86 transitions
Redundant transition composition rules discarded 86 transitions
Iterating global reduction 3 with 86 rules applied. Total rules applied 309 place count 51 transition count 191
Applied a total of 309 rules in 138 ms. Remains 51 /66 variables (removed 15) and now considering 191/515 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 51/66 places, 191/515 transitions.
RANDOM walk for 4000000 steps (106 resets) in 27012 ms. (148 steps per ms) remains 43/50 properties
BEST_FIRST walk for 400002 steps (127 resets) in 2454 ms. (162 steps per ms) remains 38/43 properties
BEST_FIRST walk for 400000 steps (89 resets) in 2571 ms. (155 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400000 steps (121 resets) in 2019 ms. (198 steps per ms) remains 35/38 properties
BEST_FIRST walk for 400000 steps (114 resets) in 2155 ms. (185 steps per ms) remains 34/35 properties
BEST_FIRST walk for 400000 steps (104 resets) in 2115 ms. (189 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400001 steps (153 resets) in 2352 ms. (169 steps per ms) remains 26/34 properties
BEST_FIRST walk for 400001 steps (183 resets) in 921 ms. (433 steps per ms) remains 24/26 properties
BEST_FIRST walk for 400003 steps (46 resets) in 1440 ms. (277 steps per ms) remains 23/24 properties
BEST_FIRST walk for 400000 steps (220 resets) in 2004 ms. (199 steps per ms) remains 18/23 properties
BEST_FIRST walk for 400002 steps (96 resets) in 2414 ms. (165 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (350 resets) in 1713 ms. (233 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (205 resets) in 2661 ms. (150 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (53 resets) in 2263 ms. (176 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (48 resets) in 1821 ms. (219 steps per ms) remains 17/18 properties
BEST_FIRST walk for 400001 steps (62 resets) in 1267 ms. (315 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (164 resets) in 1759 ms. (227 steps per ms) remains 16/17 properties
BEST_FIRST walk for 400001 steps (83 resets) in 1704 ms. (234 steps per ms) remains 15/16 properties
BEST_FIRST walk for 400003 steps (117 resets) in 1087 ms. (367 steps per ms) remains 12/15 properties
[2024-06-02 18:20:34] [INFO ] Flow matrix only has 177 transitions (discarded 14 similar events)
// Phase 1: matrix 177 rows 51 cols
[2024-06-02 18:20:34] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:20:34] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 26/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 119/156 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 68/224 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/228 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 24/90 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/228 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 90 constraints, problems are : Problem set: 0 solved, 12 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 51/51 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 26/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 119/156 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 68/224 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 4/228 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 24/102 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 0/228 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 102 constraints, problems are : Problem set: 0 solved, 12 unsolved in 858 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 51/51 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 1475ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 5 properties in 1763 ms.
Support contains 9 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 191/191 transitions.
Graph (trivial) has 33 edges and 51 vertex of which 9 / 51 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 46 transition count 177
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 43 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 42 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 42 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 42 transition count 173
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 40 transition count 180
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 24 place count 40 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24 place count 40 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 39 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 38 transition count 168
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 38 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 32 place count 36 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 36 transition count 165
Applied a total of 33 rules in 43 ms. Remains 36 /51 variables (removed 15) and now considering 165/191 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 36/51 places, 165/191 transitions.
RANDOM walk for 4000000 steps (146 resets) in 12769 ms. (313 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4000000 steps (145 resets) in 9356 ms. (427 steps per ms) remains 4/6 properties
BEST_FIRST walk for 4000001 steps (116 resets) in 7840 ms. (510 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000001 steps (32 resets) in 6409 ms. (624 steps per ms) remains 4/4 properties
BEST_FIRST walk for 3776035 steps (22 resets) in 7145 ms. (528 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4000001 steps (223 resets) in 6848 ms. (584 steps per ms) remains 2/3 properties
[2024-06-02 18:20:58] [INFO ] Flow matrix only has 148 transitions (discarded 17 similar events)
// Phase 1: matrix 148 rows 36 cols
[2024-06-02 18:20:58] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:20:58] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 90/112 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 68/180 variables, 12/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/184 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 24/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/184 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 76 constraints, problems are : Problem set: 0 solved, 2 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 90/112 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 68/180 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/184 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 24/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/184 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 78 constraints, problems are : Problem set: 0 solved, 2 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 283ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 1607 steps, including 336 resets, run visited all 2 properties in 15 ms. (steps per millisecond=107 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 21 ms.
Able to resolve query QuasiLiveness after proving 180 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 60554 ms.
ITS solved all properties within timeout

BK_STOP 1717352458451

--------------------
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-15"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is MedleyA-PT-15, 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 r590-smll-171734924800072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-15.tgz
mv MedleyA-PT-15 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;