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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 48K Apr 12 02:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 222K Apr 12 02:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 12 02:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 270K Apr 12 02:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 75K Apr 12 03:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 304K Apr 12 03:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 212K Apr 12 03:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 982K Apr 12 03:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 298K May 18 16:43 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 1717244714890

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:25:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 12:25:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:25:17] [INFO ] Load time of PNML (sax parser for PT used): 362 ms
[2024-06-01 12:25:17] [INFO ] Transformed 480 places.
[2024-06-01 12:25:17] [INFO ] Transformed 690 transitions.
[2024-06-01 12:25:17] [INFO ] Found NUPN structural information;
[2024-06-01 12:25:17] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 595 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 480 transition count 490
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 400 place count 280 transition count 390
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 600 place count 180 transition count 390
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 640 place count 160 transition count 370
Applied a total of 640 rules in 172 ms. Remains 160 /480 variables (removed 320) and now considering 370/690 (removed 320) transitions.
[2024-06-01 12:25:18] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
// Phase 1: matrix 310 rows 160 cols
[2024-06-01 12:25:18] [INFO ] Computed 19 invariants in 32 ms
[2024-06-01 12:25:18] [INFO ] Implicit Places using invariants in 736 ms returned [150, 151, 152, 153, 154]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 801 ms to find 5 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 155/480 places, 370/690 transitions.
Applied a total of 0 rules in 10 ms. Remains 155 /155 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1025 ms. Remains : 155/480 places, 370/690 transitions.
Discarding 5 transitions out of 370. Remains 365
RANDOM walk for 40000 steps (8 resets) in 3337 ms. (11 steps per ms) remains 115/365 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 114/115 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 114/114 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 114/114 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 114/114 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 112/114 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 112/112 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 112/112 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 111/112 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (8 resets) in 24 ms. (16 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 110/111 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 109/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 24 ms. (16 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
[2024-06-01 12:25:20] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
// Phase 1: matrix 310 rows 155 cols
[2024-06-01 12:25:20] [INFO ] Computed 14 invariants in 5 ms
[2024-06-01 12:25:20] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 61/154 variables, 10/106 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 61/167 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 12:25:22] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 29 ms to minimize.
[2024-06-01 12:25:22] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 3 ms to minimize.
[2024-06-01 12:25:23] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 3 ms to minimize.
[2024-06-01 12:25:23] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 3 ms to minimize.
[2024-06-01 12:25:23] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 3 ms to minimize.
[2024-06-01 12:25:23] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 3 ms to minimize.
[2024-06-01 12:25:23] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
[2024-06-01 12:25:23] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 4 ms to minimize.
[2024-06-01 12:25:24] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 3 ms to minimize.
[2024-06-01 12:25:24] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
[2024-06-01 12:25:24] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 3 ms to minimize.
[2024-06-01 12:25:24] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 3 ms to minimize.
[2024-06-01 12:25:24] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 3 ms to minimize.
[2024-06-01 12:25:24] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 2 ms to minimize.
[2024-06-01 12:25:24] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 2 ms to minimize.
[2024-06-01 12:25:25] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-06-01 12:25:25] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 2 ms to minimize.
[2024-06-01 12:25:25] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
[2024-06-01 12:25:25] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 3 ms to minimize.
SMT process timed out in 5311ms, After SMT, problems are : Problem set: 0 solved, 108 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 93 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 370/370 transitions.
Applied a total of 0 rules in 33 ms. Remains 155 /155 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 155/155 places, 370/370 transitions.
RANDOM walk for 4000000 steps (8 resets) in 39476 ms. (101 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 107/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 105/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 104/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 103/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 102/103 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 100/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 99/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 96/99 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 96/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 96/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 96/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 96/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 96/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 95/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 93/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 93/93 properties
[2024-06-01 12:25:38] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
[2024-06-01 12:25:38] [INFO ] Invariant cache hit.
[2024-06-01 12:25:38] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 68/154 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 68/167 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 12:25:40] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 3 ms to minimize.
[2024-06-01 12:25:40] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-06-01 12:25:40] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 2 ms to minimize.
[2024-06-01 12:25:40] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-06-01 12:25:40] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-06-01 12:25:40] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 2 ms to minimize.
[2024-06-01 12:25:41] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-06-01 12:25:41] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2024-06-01 12:25:41] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 3 ms to minimize.
[2024-06-01 12:25:41] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-06-01 12:25:41] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-06-01 12:25:41] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 3 ms to minimize.
[2024-06-01 12:25:41] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 3 ms to minimize.
[2024-06-01 12:25:42] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 2 ms to minimize.
[2024-06-01 12:25:42] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 2 ms to minimize.
[2024-06-01 12:25:42] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 10 ms to minimize.
[2024-06-01 12:25:42] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 3 ms to minimize.
[2024-06-01 12:25:42] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
[2024-06-01 12:25:42] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:25:42] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 12:25:42] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 3 ms to minimize.
[2024-06-01 12:25:43] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-06-01 12:25:43] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:25:43] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-06-01 12:25:43] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 2 ms to minimize.
[2024-06-01 12:25:43] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:25:43] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:25:43] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:25:43] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-06-01 12:25:43] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-06-01 12:25:43] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-06-01 12:25:43] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:25:43] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:25:44] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-06-01 12:25:44] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-06-01 12:25:44] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-06-01 12:25:44] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-06-01 12:25:44] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 3 ms to minimize.
[2024-06-01 12:25:44] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-06-01 12:25:44] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 12:25:45] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-06-01 12:25:45] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-01 12:25:45] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:25:45] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-06-01 12:25:45] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-06-01 12:25:45] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:25:45] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:25:45] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-06-01 12:25:45] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-06-01 12:25:46] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:25:46] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:25:46] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:25:46] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:25:46] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:25:46] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-06-01 12:25:46] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:25:46] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:25:46] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-06-01 12:25:46] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:25:46] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 12:25:47] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-06-01 12:25:47] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-06-01 12:25:47] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-06-01 12:25:47] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-06-01 12:25:47] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:25:47] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:25:47] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:25:47] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-06-01 12:25:47] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-06-01 12:25:47] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:25:47] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:25:47] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:25:48] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-06-01 12:25:48] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:25:48] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:25:48] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:25:48] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-06-01 12:25:48] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2024-06-01 12:25:48] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2024-06-01 12:25:48] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 12:25:48] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:25:48] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-06-01 12:25:49] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-06-01 12:25:49] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
[2024-06-01 12:25:49] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2024-06-01 12:25:49] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2024-06-01 12:25:49] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2024-06-01 12:25:49] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2024-06-01 12:25:49] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:25:49] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-06-01 12:25:49] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-06-01 12:25:50] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-06-01 12:25:50] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 ms to minimize.
[2024-06-01 12:25:50] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 1 ms to minimize.
[2024-06-01 12:25:50] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 2 ms to minimize.
[2024-06-01 12:25:50] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 1 ms to minimize.
[2024-06-01 12:25:50] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:25:50] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 1 ms to minimize.
[2024-06-01 12:25:50] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-06-01 12:25:51] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 12:25:52] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:25:52] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-06-01 12:25:52] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2024-06-01 12:25:52] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:25:52] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 1 ms to minimize.
[2024-06-01 12:25:52] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2024-06-01 12:25:52] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:25:53] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2024-06-01 12:25:53] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-06-01 12:25:53] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 2 ms to minimize.
[2024-06-01 12:25:53] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-01 12:25:53] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 12/279 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 12:25:54] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 12:25:55] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/154 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 12:25:57] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 1 ms to minimize.
[2024-06-01 12:25:57] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2024-06-01 12:25:57] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 3/284 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/154 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 15 (OVERLAPS) 1/155 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/155 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 12:26:00] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/155 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/155 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 19 (OVERLAPS) 310/465 variables, 155/442 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/465 variables, 116/558 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/465 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 22 (OVERLAPS) 0/465 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 558 constraints, problems are : Problem set: 0 solved, 93 unsolved in 42117 ms.
Refiners :[Domain max(s): 155/155 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 118/118 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 68/154 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 68/167 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 118/285 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 12:26:22] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 3 ms to minimize.
[2024-06-01 12:26:23] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 12:26:24] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 12:26:24] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-06-01 12:26:25] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2024-06-01 12:26:25] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 12:26:26] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 12:26:27] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 12:26:28] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 12:26:29] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 12:26:31] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/154 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 12:26:32] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2024-06-01 12:26:32] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/154 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 15 (OVERLAPS) 1/155 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/155 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 12:26:35] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/155 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/155 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 19 (OVERLAPS) 310/465 variables, 155/456 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/465 variables, 116/572 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/465 variables, 93/665 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/465 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 23 (OVERLAPS) 0/465 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 465/465 variables, and 665 constraints, problems are : Problem set: 0 solved, 93 unsolved in 44203 ms.
Refiners :[Domain max(s): 155/155 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 132/132 constraints]
After SMT, in 86395ms problems are : Problem set: 0 solved, 93 unsolved
Parikh walk visited 11 properties in 10396 ms.
Support contains 79 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 370/370 transitions.
Applied a total of 0 rules in 16 ms. Remains 155 /155 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 155/155 places, 370/370 transitions.
RANDOM walk for 4000000 steps (8 resets) in 30320 ms. (131 steps per ms) remains 82/82 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1397 ms. (286 steps per ms) remains 82/82 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1156 ms. (345 steps per ms) remains 82/82 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1389 ms. (287 steps per ms) remains 82/82 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1317 ms. (303 steps per ms) remains 82/82 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1447 ms. (276 steps per ms) remains 82/82 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1294 ms. (308 steps per ms) remains 82/82 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1122 ms. (356 steps per ms) remains 82/82 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1784 ms. (224 steps per ms) remains 82/82 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1630 ms. (245 steps per ms) remains 82/82 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1162 ms. (343 steps per ms) remains 80/82 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1266 ms. (315 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1320 ms. (302 steps per ms) remains 78/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1644 ms. (243 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1331 ms. (300 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1155 ms. (346 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1528 ms. (261 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1409 ms. (283 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1599 ms. (250 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1603 ms. (249 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1454 ms. (274 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1203 ms. (332 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1422 ms. (281 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1678 ms. (238 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1623 ms. (246 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1216 ms. (328 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1028 ms. (388 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1407 ms. (284 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1531 ms. (261 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1382 ms. (289 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1410 ms. (283 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1455 ms. (274 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1384 ms. (288 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1411 ms. (283 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1238 ms. (322 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1227 ms. (325 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 995 ms. (401 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1129 ms. (353 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1368 ms. (292 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1723 ms. (232 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1656 ms. (241 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1313 ms. (304 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1676 ms. (238 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1223 ms. (326 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1475 ms. (271 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 964 ms. (414 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1177 ms. (339 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1344 ms. (297 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1310 ms. (305 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1199 ms. (333 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1027 ms. (389 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1386 ms. (288 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1356 ms. (294 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1387 ms. (288 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1483 ms. (269 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1559 ms. (256 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1408 ms. (283 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1250 ms. (319 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1083 ms. (369 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1331 ms. (300 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1789 ms. (223 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1370 ms. (291 steps per ms) remains 78/78 properties
Finished probabilistic random walk after 12099549 steps, run visited all 78 properties in 105356 ms. (steps per millisecond=114 )
Probabilistic random walk after 12099549 steps, saw 2017270 distinct states, run finished after 105372 ms. (steps per millisecond=114 ) properties seen :78
Able to resolve query QuasiLiveness after proving 365 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 264388 ms.
ITS solved all properties within timeout

BK_STOP 1717244981602

--------------------
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="Peterson-PT-4"
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 Peterson-PT-4, 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 r514-smll-171654416900167"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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