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.r482-tall-171624201600297.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 DBSingleClientW-PT-d0m09, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r482-tall-171624201600297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 119K May 18 16:42 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 1717179121174

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DBSingleClientW-PT-d0m09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:12:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-31 18:12:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:12:02] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-31 18:12:02] [INFO ] Transformed 553 places.
[2024-05-31 18:12:02] [INFO ] Transformed 150 transitions.
[2024-05-31 18:12:02] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 175 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 553/553 places, 150/150 transitions.
Reduce places removed 451 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 462 rules applied. Total rules applied 462 place count 102 transition count 139
Applied a total of 462 rules in 30 ms. Remains 102 /553 variables (removed 451) and now considering 139/150 (removed 11) transitions.
// Phase 1: matrix 139 rows 102 cols
[2024-05-31 18:12:02] [INFO ] Computed 2 invariants in 15 ms
[2024-05-31 18:12:02] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-31 18:12:02] [INFO ] Invariant cache hit.
[2024-05-31 18:12:02] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-31 18:12:03] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2024-05-31 18:12:03] [INFO ] Invariant cache hit.
[2024-05-31 18:12:03] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/241 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 63/167 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-31 18:12:05] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 10 ms to minimize.
[2024-05-31 18:12:05] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 3 ms to minimize.
[2024-05-31 18:12:05] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 2 ms to minimize.
[2024-05-31 18:12:05] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-31 18:12:05] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-31 18:12:05] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/241 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 173 constraints, problems are : Problem set: 0 solved, 138 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 139/241 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 63/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 138/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/241 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 311 constraints, problems are : Problem set: 0 solved, 138 unsolved in 7036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 6/6 constraints]
After SMT, in 12328ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 12351ms
Starting structural reductions in LIVENESS mode, iteration 1 : 102/553 places, 139/150 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 12897 ms. Remains : 102/553 places, 139/150 transitions.
Discarding 48 transitions out of 139. Remains 91
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (9153 resets) in 2469 ms. (16 steps per ms) remains 53/90 properties
BEST_FIRST walk for 4003 steps (189 resets) in 31 ms. (125 steps per ms) remains 52/53 properties
BEST_FIRST walk for 4004 steps (214 resets) in 23 ms. (166 steps per ms) remains 50/52 properties
BEST_FIRST walk for 4002 steps (214 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (178 resets) in 44 ms. (88 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (203 resets) in 37 ms. (105 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (209 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (222 resets) in 13 ms. (285 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (213 resets) in 12 ms. (307 steps per ms) remains 47/50 properties
BEST_FIRST walk for 4004 steps (193 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (183 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (204 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (176 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (196 resets) in 13 ms. (285 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (200 resets) in 16 ms. (235 steps per ms) remains 45/47 properties
BEST_FIRST walk for 4004 steps (195 resets) in 14 ms. (266 steps per ms) remains 43/45 properties
BEST_FIRST walk for 4002 steps (207 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (206 resets) in 38 ms. (102 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (173 resets) in 26 ms. (148 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (184 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (176 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (209 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (192 resets) in 13 ms. (286 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (194 resets) in 13 ms. (285 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4000 steps (196 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (192 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (197 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (198 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4000 steps (800 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4000 steps (800 resets) in 21 ms. (181 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (417 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (411 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (401 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4000 steps (363 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (389 resets) in 28 ms. (138 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (410 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (393 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (424 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (410 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (404 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (409 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (407 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (435 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (392 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (412 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (392 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (405 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (420 resets) in 22 ms. (173 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (398 resets) in 33 ms. (117 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (409 resets) in 21 ms. (181 steps per ms) remains 43/43 properties
[2024-05-31 18:12:16] [INFO ] Invariant cache hit.
[2024-05-31 18:12:16] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 18/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 21/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 123/213 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 43 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 47/139 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 28/241 variables, 12/151 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 16/167 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 0/241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 167 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1525 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 18/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 21/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 123/213 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 47/139 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 16/155 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 28/241 variables, 12/167 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 16/183 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 27/210 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 13 (OVERLAPS) 0/241 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 210 constraints, problems are : Problem set: 0 solved, 43 unsolved in 2199 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 3765ms problems are : Problem set: 0 solved, 43 unsolved
Fused 43 Parikh solutions to 41 different solutions.
Parikh walk visited 2 properties in 1623 ms.
Support contains 49 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 94 transition count 127
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 94 transition count 127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 92 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 92 transition count 125
Applied a total of 20 rules in 20 ms. Remains 92 /102 variables (removed 10) and now considering 125/139 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 92/102 places, 125/139 transitions.
RANDOM walk for 4000000 steps (915908 resets) in 18513 ms. (216 steps per ms) remains 19/41 properties
BEST_FIRST walk for 400003 steps (19706 resets) in 583 ms. (684 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (19749 resets) in 548 ms. (728 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (19993 resets) in 569 ms. (701 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (19849 resets) in 561 ms. (711 steps per ms) remains 17/19 properties
BEST_FIRST walk for 400002 steps (19975 resets) in 503 ms. (793 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (19829 resets) in 496 ms. (804 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (19846 resets) in 500 ms. (798 steps per ms) remains 16/17 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 855 ms. (467 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 907 ms. (440 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400002 steps (40485 resets) in 661 ms. (604 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400001 steps (40437 resets) in 874 ms. (457 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (40309 resets) in 651 ms. (613 steps per ms) remains 13/16 properties
BEST_FIRST walk for 400002 steps (40159 resets) in 601 ms. (664 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400002 steps (40448 resets) in 612 ms. (652 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400003 steps (40570 resets) in 599 ms. (666 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400000 steps (40435 resets) in 640 ms. (624 steps per ms) remains 13/13 properties
// Phase 1: matrix 125 rows 92 cols
[2024-05-31 18:12:30] [INFO ] Computed 2 invariants in 6 ms
[2024-05-31 18:12:30] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 25/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 23/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 100/167 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 30/99 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 44/211 variables, 22/121 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 22/143 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 6/217 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/217 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 149 constraints, problems are : Problem set: 0 solved, 13 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 25/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 23/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 100/167 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 30/99 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 44/211 variables, 22/123 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 22/145 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 11/156 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 6/217 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/217 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/217 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 0/217 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 162 constraints, problems are : Problem set: 0 solved, 13 unsolved in 780 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 1160ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 3751 ms.
Support contains 19 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 125/125 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 83 transition count 108
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 83 transition count 108
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 76 transition count 101
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 76 transition count 101
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 74 transition count 98
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 74 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 74 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 73 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 73 transition count 95
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 72 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 72 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 71 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 71 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 71 transition count 91
Applied a total of 45 rules in 20 ms. Remains 71 /92 variables (removed 21) and now considering 91/125 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 71/92 places, 91/125 transitions.
RANDOM walk for 4000000 steps (916451 resets) in 10665 ms. (375 steps per ms) remains 8/13 properties
BEST_FIRST walk for 4000002 steps (199840 resets) in 2994 ms. (1335 steps per ms) remains 5/8 properties
BEST_FIRST walk for 4000000 steps (800000 resets) in 3930 ms. (1017 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (405511 resets) in 3076 ms. (1299 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000002 steps (405308 resets) in 3097 ms. (1291 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000001 steps (405269 resets) in 3211 ms. (1245 steps per ms) remains 4/5 properties
// Phase 1: matrix 91 rows 71 cols
[2024-05-31 18:12:43] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 18:12:43] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 22/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 21/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 66/117 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 41/158 variables, 18/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 23/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 4/162 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 108 constraints, problems are : Problem set: 0 solved, 4 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 22/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 21/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 66/117 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 41/158 variables, 18/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 23/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 4/162 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/162 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 112 constraints, problems are : Problem set: 0 solved, 4 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 328ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 178 ms.
Support contains 8 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 91/91 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 79
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 79
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 62 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 61 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 60 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 60 transition count 68
Applied a total of 26 rules in 12 ms. Remains 60 /71 variables (removed 11) and now considering 68/91 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 60/71 places, 68/91 transitions.
RANDOM walk for 4000000 steps (917005 resets) in 5455 ms. (733 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4000004 steps (202284 resets) in 1891 ms. (2114 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000001 steps (407189 resets) in 2445 ms. (1635 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000000 steps (407536 resets) in 2438 ms. (1640 steps per ms) remains 3/3 properties
// Phase 1: matrix 68 rows 60 cols
[2024-05-31 18:12:47] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 18:12:47] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 19/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 50/93 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 31/124 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/128 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 86 constraints, problems are : Problem set: 0 solved, 3 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 19/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 50/93 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 31/124 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 4/128 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/128 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/128 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 89 constraints, problems are : Problem set: 0 solved, 3 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 200ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 70 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 68/68 transitions.
Graph (complete) has 174 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 59 transition count 66
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 57 transition count 64
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 57 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 57 transition count 63
Applied a total of 8 rules in 10 ms. Remains 57 /60 variables (removed 3) and now considering 63/68 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 57/60 places, 63/68 transitions.
RANDOM walk for 4000000 steps (916342 resets) in 2928 ms. (1365 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (407851 resets) in 1637 ms. (2442 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4148 steps, run visited all 1 properties in 20 ms. (steps per millisecond=207 )
Probabilistic random walk after 4148 steps, saw 1898 distinct states, run finished after 23 ms. (steps per millisecond=180 ) properties seen :1
Able to resolve query QuasiLiveness after proving 91 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 47064 ms.
ITS solved all properties within timeout

BK_STOP 1717179169394

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="DBSingleClientW-PT-d0m09"
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 DBSingleClientW-PT-d0m09, 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 r482-tall-171624201600297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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