About the Execution of GreatSPN+red for Peterson-PT-4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 553.563 | 245171.00 | 500262.00 | 552.50 | T | normal |
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.r276-smll-171654416100167.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 greatspnxred
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 r276-smll-171654416100167
=====================================================================
--------------------
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 1716821212250
Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 14:46:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-27 14:46:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 14:46:54] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2024-05-27 14:46:54] [INFO ] Transformed 480 places.
[2024-05-27 14:46:54] [INFO ] Transformed 690 transitions.
[2024-05-27 14:46:54] [INFO ] Found NUPN structural information;
[2024-05-27 14:46:54] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 347 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 1 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 124 ms. Remains 160 /480 variables (removed 320) and now considering 370/690 (removed 320) transitions.
[2024-05-27 14:46:54] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
// Phase 1: matrix 310 rows 160 cols
[2024-05-27 14:46:54] [INFO ] Computed 19 invariants in 22 ms
[2024-05-27 14:46:55] [INFO ] Implicit Places using invariants in 685 ms returned [150, 151, 152, 153, 154]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 732 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 12 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 900 ms. Remains : 155/480 places, 370/690 transitions.
Discarding 5 transitions out of 370. Remains 365
RANDOM walk for 40000 steps (8 resets) in 3319 ms. (12 steps per ms) remains 113/365 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 113/113 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 113/113 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 111/113 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 110/111 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 109/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 108/109 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 11 ms. (33 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 14 ms. (26 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 21 ms. (18 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 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 10 ms. (36 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 10 ms. (36 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 9 ms. (40 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 11 ms. (33 steps per ms) remains 107/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 107/107 properties
[2024-05-27 14:46:56] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
// Phase 1: matrix 310 rows 155 cols
[2024-05-27 14:46:56] [INFO ] Computed 14 invariants in 5 ms
[2024-05-27 14:46:56] [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, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 61/154 variables, 10/106 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 61/167 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-27 14:46:58] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 21 ms to minimize.
[2024-05-27 14:46:58] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 3 ms to minimize.
[2024-05-27 14:46:58] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 3 ms to minimize.
[2024-05-27 14:46:58] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-05-27 14:46:59] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 2 ms to minimize.
[2024-05-27 14:46:59] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-27 14:46:59] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 3 ms to minimize.
[2024-05-27 14:46:59] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-27 14:46:59] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-27 14:46:59] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-05-27 14:46:59] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-05-27 14:46:59] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-05-27 14:46:59] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
[2024-05-27 14:47:00] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-27 14:47:00] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 2 ms to minimize.
[2024-05-27 14:47:00] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-05-27 14:47:00] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-27 14:47:00] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-05-27 14:47:00] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-27 14:47:00] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-27 14:47:00] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2024-05-27 14:47:00] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-05-27 14:47:01] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-05-27 14:47:01] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-27 14:47:01] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-27 14:47:01] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-27 14:47:01] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-05-27 14:47:01] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-27 14:47:01] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-05-27 14:47:01] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2024-05-27 14:47:01] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
SMT process timed out in 5176ms, After SMT, problems are : Problem set: 0 solved, 107 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 26 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 26 ms. Remains : 155/155 places, 370/370 transitions.
RANDOM walk for 4000000 steps (8 resets) in 39062 ms. (102 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 106/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 105/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 102/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 101/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 100/101 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 99/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 98/99 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 96/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 94/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 93/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 92/93 properties
[2024-05-27 14:47:14] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
[2024-05-27 14:47:14] [INFO ] Invariant cache hit.
[2024-05-27 14:47:14] [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, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 68/154 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 68/167 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-27 14:47:15] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 3 ms to minimize.
[2024-05-27 14:47:15] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-27 14:47:15] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-05-27 14:47:15] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 6 ms to minimize.
[2024-05-27 14:47:15] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2024-05-27 14:47:15] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-05-27 14:47:16] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 3 ms to minimize.
[2024-05-27 14:47:16] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-27 14:47:16] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 3 ms to minimize.
[2024-05-27 14:47:16] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-27 14:47:16] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-27 14:47:16] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-27 14:47:16] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-05-27 14:47:16] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-05-27 14:47:16] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-05-27 14:47:16] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2024-05-27 14:47:16] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-05-27 14:47:17] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-05-27 14:47:17] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-27 14:47:17] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-27 14:47:17] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-05-27 14:47:17] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-27 14:47:17] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-27 14:47:17] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-27 14:47:17] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 6 ms to minimize.
[2024-05-27 14:47:17] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-05-27 14:47:17] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-27 14:47:17] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-05-27 14:47:18] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-05-27 14:47:18] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-05-27 14:47:18] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
[2024-05-27 14:47:18] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-27 14:47:18] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-05-27 14:47:18] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 2 ms to minimize.
[2024-05-27 14:47:18] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 2 ms to minimize.
[2024-05-27 14:47:18] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-27 14:47:18] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-27 14:47:18] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-27 14:47:19] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-05-27 14:47:19] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-27 14:47:19] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-27 14:47:19] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-27 14:47:19] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-27 14:47:20] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-27 14:47:20] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-27 14:47:20] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-27 14:47:20] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
[2024-05-27 14:47:20] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-27 14:47:20] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-27 14:47:20] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-27 14:47:20] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-27 14:47:20] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
[2024-05-27 14:47:20] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 2 ms to minimize.
[2024-05-27 14:47:20] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 3 ms to minimize.
[2024-05-27 14:47:20] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-05-27 14:47:20] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-27 14:47:21] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-27 14:47:21] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
[2024-05-27 14:47:21] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-05-27 14:47:21] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-27 14:47:21] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
[2024-05-27 14:47:21] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-27 14:47:21] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-27 14:47:21] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-27 14:47:21] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-05-27 14:47:21] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-27 14:47:22] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-27 14:47:22] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-27 14:47:22] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2024-05-27 14:47:22] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-05-27 14:47:22] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 1 ms to minimize.
[2024-05-27 14:47:22] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-27 14:47:22] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-27 14:47:22] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-27 14:47:22] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-05-27 14:47:22] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-27 14:47:22] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 2 ms to minimize.
[2024-05-27 14:47:22] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-27 14:47:23] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-27 14:47:23] [INFO ] Deduced a trap composed of 44 places in 58 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, 92 unsolved
[2024-05-27 14:47:23] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-27 14:47:23] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-05-27 14:47:23] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-27 14:47:23] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 2 ms to minimize.
[2024-05-27 14:47:24] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-05-27 14:47:24] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-27 14:47:24] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-27 14:47:24] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 8/255 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-27 14:47:26] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-27 14:47:26] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-27 14:47:26] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-27 14:47:26] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
[2024-05-27 14:47:26] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-05-27 14:47:26] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-05-27 14:47:26] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 7/262 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-27 14:47:27] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
[2024-05-27 14:47:27] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-27 14:47:27] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-27 14:47:27] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-27 14:47:27] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-27 14:47:28] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 6/268 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-27 14:47:28] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-27 14:47:28] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-27 14:47:29] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-27 14:47:29] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/154 variables, 4/272 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 14 (OVERLAPS) 1/155 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/155 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-27 14:47:33] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-27 14:47:33] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/155 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-27 14:47:34] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/155 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/155 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 19 (OVERLAPS) 310/465 variables, 155/432 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/465 variables, 116/548 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/465 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 22 (OVERLAPS) 0/465 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 548 constraints, problems are : Problem set: 0 solved, 92 unsolved in 36756 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: 92/92 constraints, Known Traps: 108/108 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 68/154 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 68/167 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 108/275 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-27 14:47:52] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-27 14:47:53] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-27 14:47:53] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-27 14:47:54] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-05-27 14:47:54] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 1/155 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-27 14:47:57] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-27 14:47:57] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/155 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/155 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 14 (OVERLAPS) 310/465 variables, 155/439 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/465 variables, 116/555 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/465 variables, 92/647 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/465 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 18 (OVERLAPS) 0/465 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 465/465 variables, and 647 constraints, problems are : Problem set: 0 solved, 92 unsolved in 34284 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: 92/92 constraints, Known Traps: 115/115 constraints]
After SMT, in 71093ms problems are : Problem set: 0 solved, 92 unsolved
Parikh walk visited 15 properties in 10464 ms.
Support contains 78 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 17 ms. Remains : 155/155 places, 370/370 transitions.
RANDOM walk for 4000000 steps (8 resets) in 32136 ms. (124 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1052 ms. (379 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 915 ms. (436 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1035 ms. (386 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1076 ms. (371 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1052 ms. (379 steps per ms) remains 76/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 864 ms. (462 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1405 ms. (284 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1026 ms. (389 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (8 resets) in 958 ms. (417 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (8 resets) in 941 ms. (424 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1014 ms. (394 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1093 ms. (365 steps per ms) remains 74/76 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1074 ms. (372 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 860 ms. (464 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 966 ms. (413 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1107 ms. (361 steps per ms) remains 73/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 967 ms. (413 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1095 ms. (364 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1015 ms. (393 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1137 ms. (351 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1075 ms. (371 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1073 ms. (372 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1246 ms. (320 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 924 ms. (432 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 938 ms. (425 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 923 ms. (432 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1042 ms. (383 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 927 ms. (431 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1518 ms. (263 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1185 ms. (337 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 971 ms. (411 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 981 ms. (407 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1013 ms. (394 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1146 ms. (348 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1006 ms. (397 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 834 ms. (479 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1099 ms. (363 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1027 ms. (389 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1012 ms. (394 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1074 ms. (372 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1036 ms. (385 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1053 ms. (379 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 940 ms. (425 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1127 ms. (354 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 947 ms. (421 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1292 ms. (309 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1083 ms. (369 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1265 ms. (315 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1127 ms. (354 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1149 ms. (347 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1050 ms. (380 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1006 ms. (397 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1184 ms. (337 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 955 ms. (418 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 985 ms. (405 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1114 ms. (358 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1027 ms. (389 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1143 ms. (349 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1188 ms. (336 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 983 ms. (406 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1151 ms. (347 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1009 ms. (396 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1060 ms. (377 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1108 ms. (360 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1226 ms. (326 steps per ms) remains 73/73 properties
Finished probabilistic random walk after 12099549 steps, run visited all 73 properties in 103106 ms. (steps per millisecond=117 )
Probabilistic random walk after 12099549 steps, saw 2017270 distinct states, run finished after 103115 ms. (steps per millisecond=117 ) properties seen :73
Able to resolve query QuasiLiveness after proving 365 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 243317 ms.
ITS solved all properties within timeout
BK_STOP 1716821457421
--------------------
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="greatspnxred"
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 greatspnxred"
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 r276-smll-171654416100167"
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 '
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 ;