Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r252-tall-174915605600219.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is TokenRing-PT-015, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r252-tall-174915605600219
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 47M
-rw-r--r-- 1 mcc users 404K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8M May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 11M May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 124K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 460K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.9M May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 426K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.1M May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6M May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17M May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 28K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 71K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.7M May 29 14:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1749200596267

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=TokenRing-PT-015
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-06 09:03:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-06 09:03:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 09:03:17] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2025-06-06 09:03:17] [INFO ] Transformed 256 places.
[2025-06-06 09:03:17] [INFO ] Transformed 3616 transitions.
[2025-06-06 09:03:17] [INFO ] Found NUPN structural information;
[2025-06-06 09:03:17] [INFO ] Parsed PT model containing 256 places and 3616 transitions and 14464 arcs in 320 ms.
Built sparse matrix representations for Structural reductions in 16 ms.29928KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 131 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 146 ms. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 84 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
// Phase 1: matrix 3616 rows 256 cols
[2025-06-06 09:03:18] [INFO ] Computed 16 invariants in 38 ms
[2025-06-06 09:03:18] [INFO ] Implicit Places using invariants in 288 ms returned []
[2025-06-06 09:03:18] [INFO ] Invariant cache hit.
[2025-06-06 09:03:19] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 09:03:19] [INFO ] Implicit Places using invariants and state equation in 1134 ms returned []
Implicit Place search using SMT with State Equation took 1464 ms to find 0 implicit places.
[2025-06-06 09:03:20] [INFO ] Redundant transitions in 285 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 09:03:20] [INFO ] Invariant cache hit.
[2025-06-06 09:03:20] [INFO ] State equation strengthened by 3390 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
[2025-06-06 09:03:45] [INFO ] Deduced a trap composed of 147 places in 307 ms of which 24 ms to minimize.
[2025-06-06 09:03:45] [INFO ] Deduced a trap composed of 140 places in 282 ms of which 2 ms to minimize.
[2025-06-06 09:03:46] [INFO ] Deduced a trap composed of 145 places in 298 ms of which 4 ms to minimize.
[2025-06-06 09:03:46] [INFO ] Deduced a trap composed of 145 places in 284 ms of which 2 ms to minimize.
[2025-06-06 09:03:46] [INFO ] Deduced a trap composed of 146 places in 281 ms of which 2 ms to minimize.
[2025-06-06 09:03:47] [INFO ] Deduced a trap composed of 145 places in 292 ms of which 2 ms to minimize.
[2025-06-06 09:03:47] [INFO ] Deduced a trap composed of 141 places in 258 ms of which 2 ms to minimize.
[2025-06-06 09:03:47] [INFO ] Deduced a trap composed of 142 places in 262 ms of which 2 ms to minimize.
[2025-06-06 09:03:47] [INFO ] Deduced a trap composed of 148 places in 257 ms of which 2 ms to minimize.
[2025-06-06 09:03:48] [INFO ] Deduced a trap composed of 147 places in 269 ms of which 2 ms to minimize.
[2025-06-06 09:03:48] [INFO ] Deduced a trap composed of 139 places in 345 ms of which 2 ms to minimize.
[2025-06-06 09:03:48] [INFO ] Deduced a trap composed of 137 places in 255 ms of which 2 ms to minimize.
[2025-06-06 09:03:49] [INFO ] Deduced a trap composed of 143 places in 259 ms of which 2 ms to minimize.
[2025-06-06 09:03:49] [INFO ] Deduced a trap composed of 140 places in 243 ms of which 2 ms to minimize.
[2025-06-06 09:03:49] [INFO ] Deduced a trap composed of 141 places in 262 ms of which 2 ms to minimize.
[2025-06-06 09:03:49] [INFO ] Deduced a trap composed of 148 places in 265 ms of which 2 ms to minimize.
[2025-06-06 09:03:50] [INFO ] Deduced a trap composed of 142 places in 221 ms of which 1 ms to minimize.
[2025-06-06 09:03:50] [INFO ] Deduced a trap composed of 142 places in 229 ms of which 2 ms to minimize.
[2025-06-06 09:03:51] [INFO ] Deduced a trap composed of 142 places in 266 ms of which 2 ms to minimize.
[2025-06-06 09:03:51] [INFO ] Deduced a trap composed of 141 places in 260 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 20/292 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
[2025-06-06 09:03:53] [INFO ] Deduced a trap composed of 144 places in 259 ms of which 2 ms to minimize.
[2025-06-06 09:03:53] [INFO ] Deduced a trap composed of 145 places in 261 ms of which 2 ms to minimize.
[2025-06-06 09:03:54] [INFO ] Deduced a trap composed of 139 places in 238 ms of which 1 ms to minimize.
[2025-06-06 09:03:54] [INFO ] Deduced a trap composed of 140 places in 243 ms of which 2 ms to minimize.
[2025-06-06 09:03:54] [INFO ] Deduced a trap composed of 140 places in 248 ms of which 2 ms to minimize.
[2025-06-06 09:03:54] [INFO ] Deduced a trap composed of 138 places in 259 ms of which 2 ms to minimize.
[2025-06-06 09:03:55] [INFO ] Deduced a trap composed of 146 places in 277 ms of which 2 ms to minimize.
SMT process timed out in 34992ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 35054ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 36932 ms. Remains : 256/256 places, 3616/3616 transitions.
Random walk for 1250000 steps, including 0 resets, run took 5910 ms (no deadlock found). (steps per millisecond=211 )
Random directed walk for 1250000 steps, including 0 resets, run took 5157 ms (no deadlock found). (steps per millisecond=242 )
[2025-06-06 09:04:06] [INFO ] Invariant cache hit.
[2025-06-06 09:04:06] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 18 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 09:04:06] [INFO ] Invariant cache hit.
[2025-06-06 09:04:07] [INFO ] Implicit Places using invariants in 377 ms returned []
[2025-06-06 09:04:07] [INFO ] Invariant cache hit.
[2025-06-06 09:04:07] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 09:04:14] [INFO ] Implicit Places using invariants and state equation in 7452 ms returned []
Implicit Place search using SMT with State Equation took 7850 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 09:04:14] [INFO ] Invariant cache hit.
[2025-06-06 09:04:14] [INFO ] State equation strengthened by 3390 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
[2025-06-06 09:04:39] [INFO ] Deduced a trap composed of 147 places in 240 ms of which 2 ms to minimize.
[2025-06-06 09:04:39] [INFO ] Deduced a trap composed of 140 places in 240 ms of which 1 ms to minimize.
[2025-06-06 09:04:39] [INFO ] Deduced a trap composed of 145 places in 235 ms of which 2 ms to minimize.
[2025-06-06 09:04:40] [INFO ] Deduced a trap composed of 145 places in 231 ms of which 2 ms to minimize.
[2025-06-06 09:04:40] [INFO ] Deduced a trap composed of 146 places in 233 ms of which 2 ms to minimize.
[2025-06-06 09:04:40] [INFO ] Deduced a trap composed of 145 places in 236 ms of which 2 ms to minimize.
[2025-06-06 09:04:40] [INFO ] Deduced a trap composed of 141 places in 240 ms of which 5 ms to minimize.
[2025-06-06 09:04:41] [INFO ] Deduced a trap composed of 142 places in 237 ms of which 3 ms to minimize.
[2025-06-06 09:04:41] [INFO ] Deduced a trap composed of 148 places in 234 ms of which 2 ms to minimize.
[2025-06-06 09:04:41] [INFO ] Deduced a trap composed of 147 places in 234 ms of which 2 ms to minimize.
[2025-06-06 09:04:41] [INFO ] Deduced a trap composed of 139 places in 227 ms of which 2 ms to minimize.
[2025-06-06 09:04:42] [INFO ] Deduced a trap composed of 137 places in 227 ms of which 2 ms to minimize.
[2025-06-06 09:04:42] [INFO ] Deduced a trap composed of 143 places in 236 ms of which 3 ms to minimize.
[2025-06-06 09:04:42] [INFO ] Deduced a trap composed of 140 places in 238 ms of which 2 ms to minimize.
[2025-06-06 09:04:42] [INFO ] Deduced a trap composed of 141 places in 228 ms of which 2 ms to minimize.
[2025-06-06 09:04:43] [INFO ] Deduced a trap composed of 148 places in 233 ms of which 1 ms to minimize.
[2025-06-06 09:04:43] [INFO ] Deduced a trap composed of 142 places in 249 ms of which 1 ms to minimize.
[2025-06-06 09:04:43] [INFO ] Deduced a trap composed of 142 places in 236 ms of which 2 ms to minimize.
[2025-06-06 09:04:44] [INFO ] Deduced a trap composed of 142 places in 246 ms of which 2 ms to minimize.
[2025-06-06 09:04:44] [INFO ] Deduced a trap composed of 141 places in 231 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 20/292 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
[2025-06-06 09:04:46] [INFO ] Deduced a trap composed of 144 places in 240 ms of which 2 ms to minimize.
[2025-06-06 09:04:46] [INFO ] Deduced a trap composed of 145 places in 240 ms of which 1 ms to minimize.
[2025-06-06 09:04:47] [INFO ] Deduced a trap composed of 139 places in 234 ms of which 1 ms to minimize.
[2025-06-06 09:04:47] [INFO ] Deduced a trap composed of 140 places in 234 ms of which 2 ms to minimize.
[2025-06-06 09:04:47] [INFO ] Deduced a trap composed of 140 places in 238 ms of which 2 ms to minimize.
[2025-06-06 09:04:47] [INFO ] Deduced a trap composed of 138 places in 240 ms of which 2 ms to minimize.
[2025-06-06 09:04:48] [INFO ] Deduced a trap composed of 146 places in 243 ms of which 2 ms to minimize.
[2025-06-06 09:04:48] [INFO ] Deduced a trap composed of 144 places in 236 ms of which 2 ms to minimize.
[2025-06-06 09:04:48] [INFO ] Deduced a trap composed of 141 places in 240 ms of which 2 ms to minimize.
[2025-06-06 09:04:48] [INFO ] Deduced a trap composed of 140 places in 237 ms of which 5 ms to minimize.
[2025-06-06 09:04:49] [INFO ] Deduced a trap composed of 141 places in 237 ms of which 1 ms to minimize.
SMT process timed out in 34500ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 34537ms
Finished structural reductions in LIVENESS mode , in 1 iterations and 42418 ms. Remains : 256/256 places, 3616/3616 transitions.
Initial state reduction rules removed 15 formulas.
RANDOM walk for 40000 steps (8 resets) in 18205 ms. (2 steps per ms) remains 3073/3601 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 9 ms. (12 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 9 ms. (12 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 9 ms. (12 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 11 ms. (10 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 10 ms. (11 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 33 ms. (3 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 6 ms. (17 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 9 ms. (12 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 7 ms. (15 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 9 ms. (12 steps per ms) remains 3073/3073 properties
BEST_FIRST walk for 124 steps (4 resets) in 5 ms. (20 steps per ms) remains 3073/3073 properties
[2025-06-06 09:04:54] [INFO ] Invariant cache hit.
[2025-06-06 09:04:54] [INFO ] State equation strengthened by 3390 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3073 unsolved
SMT process timed out in 9104ms, After SMT, problems are : Problem set: 0 solved, 3073 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 50 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 256/256 places, 3616/3616 transitions.
RANDOM walk for 586716 steps (0 resets) in 120004 ms. (4 steps per ms) remains 3030/3073 properties
BEST_FIRST walk for 4000 steps (8 resets) in 300 ms. (13 steps per ms) remains 2993/3030 properties
BEST_FIRST walk for 4000 steps (8 resets) in 214 ms. (18 steps per ms) remains 2901/2993 properties
BEST_FIRST walk for 4000 steps (8 resets) in 221 ms. (18 steps per ms) remains 2865/2901 properties
BEST_FIRST walk for 4000 steps (8 resets) in 277 ms. (14 steps per ms) remains 2843/2865 properties
BEST_FIRST walk for 4001 steps (8 resets) in 225 ms. (17 steps per ms) remains 2816/2843 properties
BEST_FIRST walk for 4000 steps (8 resets) in 264 ms. (15 steps per ms) remains 2801/2816 properties
BEST_FIRST walk for 4000 steps (8 resets) in 226 ms. (17 steps per ms) remains 2797/2801 properties
BEST_FIRST walk for 4000 steps (8 resets) in 196 ms. (20 steps per ms) remains 2784/2797 properties
BEST_FIRST walk for 4000 steps (8 resets) in 248 ms. (16 steps per ms) remains 2772/2784 properties
BEST_FIRST walk for 4000 steps (8 resets) in 219 ms. (18 steps per ms) remains 2768/2772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 204 ms. (19 steps per ms) remains 2762/2768 properties
BEST_FIRST walk for 4000 steps (8 resets) in 237 ms. (16 steps per ms) remains 2752/2762 properties
BEST_FIRST walk for 4000 steps (8 resets) in 282 ms. (14 steps per ms) remains 2748/2752 properties
BEST_FIRST walk for 4000 steps (8 resets) in 262 ms. (15 steps per ms) remains 2747/2748 properties
BEST_FIRST walk for 4000 steps (8 resets) in 279 ms. (14 steps per ms) remains 2746/2747 properties
BEST_FIRST walk for 4000 steps (8 resets) in 229 ms. (17 steps per ms) remains 2742/2746 properties
BEST_FIRST walk for 4000 steps (8 resets) in 271 ms. (14 steps per ms) remains 2737/2742 properties
BEST_FIRST walk for 4000 steps (8 resets) in 258 ms. (15 steps per ms) remains 2736/2737 properties
BEST_FIRST walk for 4000 steps (8 resets) in 334 ms. (11 steps per ms) remains 2735/2736 properties
BEST_FIRST walk for 4000 steps (8 resets) in 398 ms. (10 steps per ms) remains 2733/2735 properties
BEST_FIRST walk for 4001 steps (8 resets) in 188 ms. (21 steps per ms) remains 2726/2733 properties
BEST_FIRST walk for 4000 steps (8 resets) in 287 ms. (13 steps per ms) remains 2721/2726 properties
BEST_FIRST walk for 4001 steps (8 resets) in 193 ms. (20 steps per ms) remains 2721/2721 properties
BEST_FIRST walk for 4000 steps (8 resets) in 222 ms. (17 steps per ms) remains 2719/2721 properties
BEST_FIRST walk for 4000 steps (8 resets) in 191 ms. (20 steps per ms) remains 2719/2719 properties
BEST_FIRST walk for 4000 steps (8 resets) in 237 ms. (16 steps per ms) remains 2718/2719 properties
BEST_FIRST walk for 4001 steps (8 resets) in 229 ms. (17 steps per ms) remains 2718/2718 properties
BEST_FIRST walk for 4000 steps (8 resets) in 212 ms. (18 steps per ms) remains 2717/2718 properties
BEST_FIRST walk for 4000 steps (8 resets) in 265 ms. (15 steps per ms) remains 2717/2717 properties
BEST_FIRST walk for 4001 steps (8 resets) in 213 ms. (18 steps per ms) remains 2716/2717 properties
BEST_FIRST walk for 4000 steps (8 resets) in 290 ms. (13 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 4000 steps (8 resets) in 304 ms. (13 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 4000 steps (8 resets) in 253 ms. (15 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 4000 steps (8 resets) in 322 ms. (12 steps per ms) remains 2714/2716 properties
BEST_FIRST walk for 4000 steps (8 resets) in 253 ms. (15 steps per ms) remains 2714/2714 properties
BEST_FIRST walk for 4000 steps (8 resets) in 327 ms. (12 steps per ms) remains 2713/2714 properties
BEST_FIRST walk for 4000 steps (8 resets) in 255 ms. (15 steps per ms) remains 2713/2713 properties
BEST_FIRST walk for 4001 steps (8 resets) in 286 ms. (13 steps per ms) remains 2713/2713 properties
BEST_FIRST walk for 4000 steps (8 resets) in 297 ms. (13 steps per ms) remains 2712/2713 properties
BEST_FIRST walk for 4000 steps (8 resets) in 292 ms. (13 steps per ms) remains 2711/2712 properties
BEST_FIRST walk for 4000 steps (8 resets) in 243 ms. (16 steps per ms) remains 2711/2711 properties
BEST_FIRST walk for 4002 steps (8 resets) in 241 ms. (16 steps per ms) remains 2710/2711 properties
BEST_FIRST walk for 4001 steps (8 resets) in 219 ms. (18 steps per ms) remains 2709/2710 properties
BEST_FIRST walk for 4000 steps (8 resets) in 272 ms. (14 steps per ms) remains 2707/2709 properties
BEST_FIRST walk for 4000 steps (8 resets) in 266 ms. (14 steps per ms) remains 2707/2707 properties
BEST_FIRST walk for 4000 steps (8 resets) in 315 ms. (12 steps per ms) remains 2706/2707 properties
BEST_FIRST walk for 4000 steps (8 resets) in 240 ms. (16 steps per ms) remains 2706/2706 properties
BEST_FIRST walk for 4000 steps (8 resets) in 312 ms. (12 steps per ms) remains 2706/2706 properties
BEST_FIRST walk for 4000 steps (8 resets) in 278 ms. (14 steps per ms) remains 2706/2706 properties
BEST_FIRST walk for 4000 steps (8 resets) in 358 ms. (11 steps per ms) remains 2706/2706 properties
BEST_FIRST walk for 4000 steps (8 resets) in 283 ms. (14 steps per ms) remains 2704/2706 properties
BEST_FIRST walk for 4000 steps (8 resets) in 264 ms. (15 steps per ms) remains 2704/2704 properties
BEST_FIRST walk for 4002 steps (8 resets) in 203 ms. (19 steps per ms) remains 2704/2704 properties
BEST_FIRST walk for 4000 steps (8 resets) in 278 ms. (14 steps per ms) remains 2704/2704 properties
BEST_FIRST walk for 4000 steps (8 resets) in 218 ms. (18 steps per ms) remains 2704/2704 properties
BEST_FIRST walk for 4000 steps (8 resets) in 303 ms. (13 steps per ms) remains 2703/2704 properties
BEST_FIRST walk for 4000 steps (8 resets) in 294 ms. (13 steps per ms) remains 2703/2703 properties
BEST_FIRST walk for 4000 steps (8 resets) in 271 ms. (14 steps per ms) remains 2703/2703 properties
BEST_FIRST walk for 4000 steps (8 resets) in 273 ms. (14 steps per ms) remains 2703/2703 properties
BEST_FIRST walk for 4001 steps (8 resets) in 270 ms. (14 steps per ms) remains 2703/2703 properties
BEST_FIRST walk for 4000 steps (8 resets) in 309 ms. (12 steps per ms) remains 2703/2703 properties
BEST_FIRST walk for 4000 steps (8 resets) in 292 ms. (13 steps per ms) remains 2702/2703 properties
BEST_FIRST walk for 4000 steps (8 resets) in 286 ms. (13 steps per ms) remains 2700/2702 properties
BEST_FIRST walk for 4000 steps (8 resets) in 336 ms. (11 steps per ms) remains 2700/2700 properties
BEST_FIRST walk for 4000 steps (8 resets) in 234 ms. (17 steps per ms) remains 2700/2700 properties
BEST_FIRST walk for 4000 steps (8 resets) in 242 ms. (16 steps per ms) remains 2699/2700 properties
BEST_FIRST walk for 4000 steps (8 resets) in 302 ms. (13 steps per ms) remains 2698/2699 properties
BEST_FIRST walk for 4000 steps (8 resets) in 350 ms. (11 steps per ms) remains 2698/2698 properties
BEST_FIRST walk for 4000 steps (8 resets) in 247 ms. (16 steps per ms) remains 2698/2698 properties
BEST_FIRST walk for 4000 steps (8 resets) in 297 ms. (13 steps per ms) remains 2697/2698 properties
BEST_FIRST walk for 4001 steps (8 resets) in 241 ms. (16 steps per ms) remains 2697/2697 properties
BEST_FIRST walk for 4000 steps (8 resets) in 260 ms. (15 steps per ms) remains 2697/2697 properties
BEST_FIRST walk for 4000 steps (8 resets) in 311 ms. (12 steps per ms) remains 2697/2697 properties
BEST_FIRST walk for 4000 steps (8 resets) in 283 ms. (14 steps per ms) remains 2696/2697 properties
BEST_FIRST walk for 4000 steps (8 resets) in 280 ms. (14 steps per ms) remains 2696/2696 properties
BEST_FIRST walk for 4000 steps (8 resets) in 325 ms. (12 steps per ms) remains 2694/2696 properties
BEST_FIRST walk for 4001 steps (8 resets) in 250 ms. (15 steps per ms) remains 2694/2694 properties
BEST_FIRST walk for 4000 steps (8 resets) in 281 ms. (14 steps per ms) remains 2694/2694 properties
BEST_FIRST walk for 4000 steps (8 resets) in 243 ms. (16 steps per ms) remains 2694/2694 properties
BEST_FIRST walk for 4000 steps (8 resets) in 299 ms. (13 steps per ms) remains 2694/2694 properties
BEST_FIRST walk for 4000 steps (8 resets) in 239 ms. (16 steps per ms) remains 2694/2694 properties
BEST_FIRST walk for 4000 steps (8 resets) in 290 ms. (13 steps per ms) remains 2694/2694 properties
BEST_FIRST walk for 4001 steps (8 resets) in 258 ms. (15 steps per ms) remains 2694/2694 properties
BEST_FIRST walk for 4000 steps (8 resets) in 317 ms. (12 steps per ms) remains 2692/2694 properties
BEST_FIRST walk for 4000 steps (8 resets) in 294 ms. (13 steps per ms) remains 2692/2692 properties
BEST_FIRST walk for 4000 steps (8 resets) in 275 ms. (14 steps per ms) remains 2691/2692 properties
BEST_FIRST walk for 4000 steps (8 resets) in 229 ms. (17 steps per ms) remains 2691/2691 properties
BEST_FIRST walk for 4000 steps (8 resets) in 219 ms. (18 steps per ms) remains 2691/2691 properties
BEST_FIRST walk for 4000 steps (8 resets) in 234 ms. (17 steps per ms) remains 2690/2691 properties
BEST_FIRST walk for 4000 steps (8 resets) in 244 ms. (16 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4001 steps (8 resets) in 202 ms. (19 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 248 ms. (16 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 214 ms. (18 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 236 ms. (16 steps per ms) remains 2689/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 237 ms. (16 steps per ms) remains 2689/2689 properties
BEST_FIRST walk for 4000 steps (8 resets) in 244 ms. (16 steps per ms) remains 2689/2689 properties
BEST_FIRST walk for 4001 steps (8 resets) in 219 ms. (18 steps per ms) remains 2689/2689 properties
BEST_FIRST walk for 4000 steps (8 resets) in 231 ms. (17 steps per ms) remains 2689/2689 properties
BEST_FIRST walk for 4000 steps (8 resets) in 274 ms. (14 steps per ms) remains 2689/2689 properties
BEST_FIRST walk for 4000 steps (8 resets) in 234 ms. (17 steps per ms) remains 2689/2689 properties
BEST_FIRST walk for 4000 steps (8 resets) in 247 ms. (16 steps per ms) remains 2689/2689 properties
BEST_FIRST walk for 4000 steps (8 resets) in 204 ms. (19 steps per ms) remains 2689/2689 properties
BEST_FIRST walk for 4000 steps (8 resets) in 243 ms. (16 steps per ms) remains 2689/2689 properties
BEST_FIRST walk for 4001 steps (8 resets) in 213 ms. (18 steps per ms) remains 2689/2689 properties
BEST_FIRST walk for 4001 steps (8 resets) in 209 ms. (19 steps per ms) remains 2686/2689 properties
BEST_FIRST walk for 4001 steps (8 resets) in 231 ms. (17 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 231 ms. (17 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 218 ms. (18 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 165 ms. (24 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 188 ms. (21 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 285 ms. (13 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 257 ms. (15 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 261 ms. (15 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 235 ms. (16 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 354 ms. (11 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 311 ms. (12 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 253 ms. (15 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 228 ms. (17 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 319 ms. (12 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4001 steps (8 resets) in 268 ms. (14 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 383 ms. (10 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 348 ms. (11 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 330 ms. (12 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 355 ms. (11 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 271 ms. (14 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 334 ms. (11 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 323 ms. (12 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 233 ms. (17 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 257 ms. (15 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 289 ms. (13 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 204 ms. (19 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 262 ms. (15 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 236 ms. (16 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4001 steps (8 resets) in 298 ms. (13 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 230 ms. (17 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 311 ms. (12 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4002 steps (8 resets) in 214 ms. (18 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 299 ms. (13 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 184 ms. (21 steps per ms) remains 2685/2686 properties
BEST_FIRST walk for 4001 steps (8 resets) in 271 ms. (14 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 300 ms. (13 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 250 ms. (15 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 379 ms. (10 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 274 ms. (14 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 207 ms. (19 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 289 ms. (13 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 305 ms. (13 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 264 ms. (15 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 386 ms. (10 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 303 ms. (13 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 342 ms. (11 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 376 ms. (10 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4001 steps (8 resets) in 271 ms. (14 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 235 ms. (16 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 282 ms. (14 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 247 ms. (16 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 287 ms. (13 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4001 steps (8 resets) in 314 ms. (12 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 259 ms. (15 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 306 ms. (13 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 288 ms. (13 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 254 ms. (15 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 299 ms. (13 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 362 ms. (11 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 200 ms. (19 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 203 ms. (19 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 248 ms. (16 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 235 ms. (16 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4001 steps (8 resets) in 224 ms. (17 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4001 steps (8 resets) in 196 ms. (20 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 195 ms. (20 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 261 ms. (15 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 243 ms. (16 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 269 ms. (14 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 247 ms. (16 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 233 ms. (17 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 271 ms. (14 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 212 ms. (18 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4001 steps (8 resets) in 266 ms. (14 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4001 steps (8 resets) in 204 ms. (19 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 238 ms. (16 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4001 steps (8 resets) in 191 ms. (20 steps per ms) remains 2684/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 206 ms. (19 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 235 ms. (16 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 269 ms. (14 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 219 ms. (18 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 229 ms. (17 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4001 steps (8 resets) in 191 ms. (20 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 213 ms. (18 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 201 ms. (19 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 229 ms. (17 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 219 ms. (18 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 209 ms. (19 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4001 steps (8 resets) in 181 ms. (21 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 216 ms. (18 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 213 ms. (18 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 220 ms. (18 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4001 steps (8 resets) in 212 ms. (18 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 244 ms. (16 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 203 ms. (19 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 279 ms. (14 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4001 steps (8 resets) in 201 ms. (19 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 209 ms. (19 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 215 ms. (18 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 241 ms. (16 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 226 ms. (17 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 204 ms. (19 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 232 ms. (17 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 176 ms. (22 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 221 ms. (18 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4001 steps (8 resets) in 195 ms. (20 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 216 ms. (18 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 273 ms. (14 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 205 ms. (19 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 230 ms. (17 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 227 ms. (17 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 220 ms. (18 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 295 ms. (13 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 234 ms. (17 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 225 ms. (17 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 240 ms. (16 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 262 ms. (15 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 199 ms. (20 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 236 ms. (16 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 232 ms. (17 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 276 ms. (14 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 233 ms. (17 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4001 steps (8 resets) in 257 ms. (15 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 227 ms. (17 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4001 steps (8 resets) in 234 ms. (17 steps per ms) remains 2684/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 226 ms. (17 steps per ms) remains 2683/2684 properties
BEST_FIRST walk for 4000 steps (8 resets) in 290 ms. (13 steps per ms) remains 2683/2683 properties
BEST_FIRST walk for 4000 steps (8 resets) in 242 ms. (16 steps per ms) remains 2683/2683 properties
BEST_FIRST walk for 4000 steps (8 resets) in 222 ms. (17 steps per ms) remains 2683/2683 properties
BEST_FIRST walk for 4000 steps (8 resets) in 242 ms. (16 steps per ms) remains 2683/2683 properties
BEST_FIRST walk for 4002 steps (8 resets) in 209 ms. (19 steps per ms) remains 2683/2683 properties
BEST_FIRST walk for 4000 steps (8 resets) in 203 ms. (19 steps per ms) remains 2681/2683 properties
BEST_FIRST walk for 4001 steps (8 resets) in 209 ms. (19 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 198 ms. (20 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 267 ms. (14 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 259 ms. (15 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 216 ms. (18 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 269 ms. (14 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 245 ms. (16 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 230 ms. (17 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 279 ms. (14 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 207 ms. (19 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 219 ms. (18 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 229 ms. (17 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4001 steps (8 resets) in 231 ms. (17 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4001 steps (8 resets) in 200 ms. (19 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 227 ms. (17 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 203 ms. (19 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 240 ms. (16 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 205 ms. (19 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 223 ms. (17 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4001 steps (8 resets) in 199 ms. (20 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4001 steps (8 resets) in 230 ms. (17 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4001 steps (8 resets) in 207 ms. (19 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 242 ms. (16 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 295 ms. (13 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 245 ms. (16 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 191 ms. (20 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 265 ms. (15 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4001 steps (8 resets) in 220 ms. (18 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4002 steps (8 resets) in 208 ms. (19 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 243 ms. (16 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 254 ms. (15 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 233 ms. (17 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 214 ms. (18 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 209 ms. (19 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 226 ms. (17 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 272 ms. (14 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 241 ms. (16 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 193 ms. (20 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4001 steps (8 resets) in 219 ms. (18 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4001 steps (8 resets) in 191 ms. (20 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 219 ms. (18 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 210 ms. (18 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 250 ms. (15 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 206 ms. (19 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 231 ms. (17 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 234 ms. (17 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 202 ms. (19 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 252 ms. (15 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 217 ms. (18 steps per ms) remains 2681/2681 properties
[2025-06-06 09:05:56] [INFO ] Invariant cache hit.
[2025-06-06 09:05:57] [INFO ] State equation strengthened by 3390 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 2681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 15/269 constraints. Problems are: Problem set: 0 solved, 2681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 254/3872 variables, and 269 constraints, problems are : Problem set: 0 solved, 2681 unsolved in 45045 ms.
Refiners :[Domain max(s): 254/256 constraints, Positive P Invariants (semi-flows): 15/16 constraints, State Equation: 0/256 constraints, ReadFeed: 0/3390 constraints, PredecessorRefiner: 2681/2681 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2681 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 2681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 15/269 constraints. Problems are: Problem set: 0 solved, 2681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 254/3872 variables, and 269 constraints, problems are : Problem set: 0 solved, 2681 unsolved in 45045 ms.
Refiners :[Domain max(s): 254/256 constraints, Positive P Invariants (semi-flows): 15/16 constraints, State Equation: 0/256 constraints, ReadFeed: 0/3390 constraints, PredecessorRefiner: 0/2681 constraints, Known Traps: 0/0 constraints]
After SMT, in 93074ms problems are : Problem set: 0 solved, 2681 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 254 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 68 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 256/256 places, 3616/3616 transitions.
RANDOM walk for 577025 steps (0 resets) in 120004 ms. (4 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 255 ms. (15 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4001 steps (8 resets) in 203 ms. (19 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 210 ms. (18 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 261 ms. (15 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 248 ms. (16 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4001 steps (8 resets) in 223 ms. (17 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4001 steps (8 resets) in 206 ms. (19 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 245 ms. (16 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 235 ms. (16 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 224 ms. (17 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 242 ms. (16 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 267 ms. (14 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 224 ms. (17 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 248 ms. (16 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 201 ms. (19 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 222 ms. (17 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 238 ms. (16 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 238 ms. (16 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 179 ms. (22 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 290 ms. (13 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 257 ms. (15 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 522 ms. (7 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 189 ms. (21 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 227 ms. (17 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 225 ms. (17 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 243 ms. (16 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 201 ms. (19 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 232 ms. (17 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 252 ms. (15 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 220 ms. (18 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 248 ms. (16 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 337 ms. (11 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 449 ms. (8 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 449 ms. (8 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 339 ms. (11 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 382 ms. (10 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 327 ms. (12 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 336 ms. (11 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 363 ms. (10 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 391 ms. (10 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 359 ms. (11 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 329 ms. (12 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 353 ms. (11 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4001 steps (8 resets) in 367 ms. (10 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 463 ms. (8 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 307 ms. (12 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 269 ms. (14 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 324 ms. (12 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 294 ms. (13 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 516 ms. (7 steps per ms) remains 2681/2681 properties
Probabilistic random walk after 1000001 steps, saw 163864 distinct states, run finished after 53440 ms. (steps per millisecond=18 ) properties seen :0
[2025-06-06 09:08:58] [INFO ] Invariant cache hit.
[2025-06-06 09:08:58] [INFO ] State equation strengthened by 3390 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 2681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 15/269 constraints. Problems are: Problem set: 0 solved, 2681 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2681 unsolved
At refinement iteration 3 (OVERLAPS) 2/256 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 2681 unsolved
SMT process timed out in 78203ms, After SMT, problems are : Problem set: 0 solved, 2681 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 254 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 47 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 50 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 09:10:16] [INFO ] Invariant cache hit.
[2025-06-06 09:10:16] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-06 09:10:16] [INFO ] Invariant cache hit.
[2025-06-06 09:10:17] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 09:10:17] [INFO ] Implicit Places using invariants and state equation in 927 ms returned []
Implicit Place search using SMT with State Equation took 1003 ms to find 0 implicit places.
[2025-06-06 09:10:17] [INFO ] Redundant transitions in 234 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 09:10:17] [INFO ] Invariant cache hit.
[2025-06-06 09:10:17] [INFO ] State equation strengthened by 3390 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
[2025-06-06 09:10:42] [INFO ] Deduced a trap composed of 147 places in 234 ms of which 2 ms to minimize.
[2025-06-06 09:10:42] [INFO ] Deduced a trap composed of 140 places in 231 ms of which 2 ms to minimize.
[2025-06-06 09:10:42] [INFO ] Deduced a trap composed of 145 places in 230 ms of which 2 ms to minimize.
[2025-06-06 09:10:42] [INFO ] Deduced a trap composed of 145 places in 229 ms of which 1 ms to minimize.
[2025-06-06 09:10:42] [INFO ] Deduced a trap composed of 146 places in 229 ms of which 1 ms to minimize.
[2025-06-06 09:10:43] [INFO ] Deduced a trap composed of 145 places in 233 ms of which 2 ms to minimize.
[2025-06-06 09:10:43] [INFO ] Deduced a trap composed of 141 places in 250 ms of which 1 ms to minimize.
[2025-06-06 09:10:43] [INFO ] Deduced a trap composed of 142 places in 235 ms of which 1 ms to minimize.
[2025-06-06 09:10:43] [INFO ] Deduced a trap composed of 148 places in 233 ms of which 2 ms to minimize.
[2025-06-06 09:10:44] [INFO ] Deduced a trap composed of 147 places in 235 ms of which 2 ms to minimize.
[2025-06-06 09:10:44] [INFO ] Deduced a trap composed of 139 places in 232 ms of which 2 ms to minimize.
[2025-06-06 09:10:44] [INFO ] Deduced a trap composed of 137 places in 235 ms of which 1 ms to minimize.
[2025-06-06 09:10:44] [INFO ] Deduced a trap composed of 143 places in 238 ms of which 2 ms to minimize.
[2025-06-06 09:10:45] [INFO ] Deduced a trap composed of 140 places in 259 ms of which 2 ms to minimize.
[2025-06-06 09:10:45] [INFO ] Deduced a trap composed of 141 places in 246 ms of which 2 ms to minimize.
[2025-06-06 09:10:45] [INFO ] Deduced a trap composed of 148 places in 230 ms of which 2 ms to minimize.
[2025-06-06 09:10:46] [INFO ] Deduced a trap composed of 142 places in 237 ms of which 2 ms to minimize.
[2025-06-06 09:10:46] [INFO ] Deduced a trap composed of 142 places in 231 ms of which 1 ms to minimize.
[2025-06-06 09:10:46] [INFO ] Deduced a trap composed of 142 places in 239 ms of which 2 ms to minimize.
[2025-06-06 09:10:47] [INFO ] Deduced a trap composed of 141 places in 233 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 20/292 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
[2025-06-06 09:10:49] [INFO ] Deduced a trap composed of 144 places in 240 ms of which 2 ms to minimize.
[2025-06-06 09:10:49] [INFO ] Deduced a trap composed of 145 places in 229 ms of which 2 ms to minimize.
[2025-06-06 09:10:49] [INFO ] Deduced a trap composed of 139 places in 235 ms of which 2 ms to minimize.
[2025-06-06 09:10:50] [INFO ] Deduced a trap composed of 140 places in 232 ms of which 2 ms to minimize.
[2025-06-06 09:10:50] [INFO ] Deduced a trap composed of 140 places in 236 ms of which 2 ms to minimize.
[2025-06-06 09:10:50] [INFO ] Deduced a trap composed of 138 places in 233 ms of which 2 ms to minimize.
[2025-06-06 09:10:50] [INFO ] Deduced a trap composed of 146 places in 233 ms of which 1 ms to minimize.
[2025-06-06 09:10:51] [INFO ] Deduced a trap composed of 144 places in 237 ms of which 2 ms to minimize.
[2025-06-06 09:10:51] [INFO ] Deduced a trap composed of 141 places in 260 ms of which 2 ms to minimize.
[2025-06-06 09:10:51] [INFO ] Deduced a trap composed of 140 places in 236 ms of which 2 ms to minimize.
[2025-06-06 09:10:51] [INFO ] Deduced a trap composed of 141 places in 232 ms of which 1 ms to minimize.
[2025-06-06 09:10:52] [INFO ] Deduced a trap composed of 143 places in 301 ms of which 1 ms to minimize.
[2025-06-06 09:10:52] [INFO ] Deduced a trap composed of 142 places in 235 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 256/3872 variables, and 305 constraints, problems are : Problem set: 0 solved, 3601 unsolved in 30062 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/256 constraints, ReadFeed: 0/3390 constraints, PredecessorRefiner: 3601/3601 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 33/305 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
[2025-06-06 09:10:57] [INFO ] Deduced a trap composed of 141 places in 248 ms of which 1 ms to minimize.
[2025-06-06 09:10:57] [INFO ] Deduced a trap composed of 141 places in 259 ms of which 1 ms to minimize.
[2025-06-06 09:10:57] [INFO ] Deduced a trap composed of 140 places in 229 ms of which 1 ms to minimize.
[2025-06-06 09:10:57] [INFO ] Deduced a trap composed of 142 places in 227 ms of which 1 ms to minimize.
[2025-06-06 09:10:58] [INFO ] Deduced a trap composed of 142 places in 260 ms of which 2 ms to minimize.
[2025-06-06 09:10:58] [INFO ] Deduced a trap composed of 141 places in 259 ms of which 2 ms to minimize.
[2025-06-06 09:10:58] [INFO ] Deduced a trap composed of 145 places in 256 ms of which 2 ms to minimize.
[2025-06-06 09:10:59] [INFO ] Deduced a trap composed of 142 places in 231 ms of which 2 ms to minimize.
[2025-06-06 09:10:59] [INFO ] Deduced a trap composed of 142 places in 254 ms of which 2 ms to minimize.
[2025-06-06 09:10:59] [INFO ] Deduced a trap composed of 141 places in 252 ms of which 2 ms to minimize.
[2025-06-06 09:10:59] [INFO ] Deduced a trap composed of 143 places in 231 ms of which 2 ms to minimize.
[2025-06-06 09:11:00] [INFO ] Deduced a trap composed of 142 places in 252 ms of which 2 ms to minimize.
[2025-06-06 09:11:00] [INFO ] Deduced a trap composed of 141 places in 255 ms of which 2 ms to minimize.
[2025-06-06 09:11:00] [INFO ] Deduced a trap composed of 140 places in 252 ms of which 2 ms to minimize.
[2025-06-06 09:11:00] [INFO ] Deduced a trap composed of 141 places in 252 ms of which 2 ms to minimize.
[2025-06-06 09:11:01] [INFO ] Deduced a trap composed of 142 places in 258 ms of which 1 ms to minimize.
[2025-06-06 09:11:01] [INFO ] Deduced a trap composed of 140 places in 252 ms of which 2 ms to minimize.
[2025-06-06 09:11:01] [INFO ] Deduced a trap composed of 141 places in 250 ms of which 2 ms to minimize.
[2025-06-06 09:11:01] [INFO ] Deduced a trap composed of 143 places in 230 ms of which 1 ms to minimize.
[2025-06-06 09:11:02] [INFO ] Deduced a trap composed of 137 places in 229 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 20/325 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
[2025-06-06 09:11:06] [INFO ] Deduced a trap composed of 144 places in 256 ms of which 2 ms to minimize.
[2025-06-06 09:11:07] [INFO ] Deduced a trap composed of 140 places in 264 ms of which 2 ms to minimize.
[2025-06-06 09:11:07] [INFO ] Deduced a trap composed of 141 places in 257 ms of which 1 ms to minimize.
[2025-06-06 09:11:07] [INFO ] Deduced a trap composed of 138 places in 257 ms of which 2 ms to minimize.
[2025-06-06 09:11:07] [INFO ] Deduced a trap composed of 144 places in 252 ms of which 2 ms to minimize.
[2025-06-06 09:11:08] [INFO ] Deduced a trap composed of 142 places in 261 ms of which 2 ms to minimize.
[2025-06-06 09:11:08] [INFO ] Deduced a trap composed of 142 places in 258 ms of which 2 ms to minimize.
[2025-06-06 09:11:08] [INFO ] Deduced a trap composed of 142 places in 233 ms of which 2 ms to minimize.
[2025-06-06 09:11:08] [INFO ] Deduced a trap composed of 147 places in 225 ms of which 2 ms to minimize.
[2025-06-06 09:11:09] [INFO ] Deduced a trap composed of 142 places in 234 ms of which 1 ms to minimize.
[2025-06-06 09:11:09] [INFO ] Deduced a trap composed of 142 places in 252 ms of which 1 ms to minimize.
[2025-06-06 09:11:09] [INFO ] Deduced a trap composed of 142 places in 257 ms of which 2 ms to minimize.
[2025-06-06 09:11:10] [INFO ] Deduced a trap composed of 138 places in 257 ms of which 2 ms to minimize.
[2025-06-06 09:11:10] [INFO ] Deduced a trap composed of 142 places in 255 ms of which 2 ms to minimize.
[2025-06-06 09:11:10] [INFO ] Deduced a trap composed of 142 places in 250 ms of which 1 ms to minimize.
[2025-06-06 09:11:10] [INFO ] Deduced a trap composed of 144 places in 248 ms of which 2 ms to minimize.
[2025-06-06 09:11:11] [INFO ] Deduced a trap composed of 144 places in 253 ms of which 2 ms to minimize.
[2025-06-06 09:11:11] [INFO ] Deduced a trap composed of 143 places in 232 ms of which 2 ms to minimize.
[2025-06-06 09:11:11] [INFO ] Deduced a trap composed of 142 places in 238 ms of which 2 ms to minimize.
[2025-06-06 09:11:11] [INFO ] Deduced a trap composed of 142 places in 230 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 20/345 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
[2025-06-06 09:11:17] [INFO ] Deduced a trap composed of 139 places in 226 ms of which 2 ms to minimize.
[2025-06-06 09:11:18] [INFO ] Deduced a trap composed of 141 places in 225 ms of which 2 ms to minimize.
[2025-06-06 09:11:18] [INFO ] Deduced a trap composed of 143 places in 243 ms of which 2 ms to minimize.
[2025-06-06 09:11:18] [INFO ] Deduced a trap composed of 139 places in 228 ms of which 2 ms to minimize.
[2025-06-06 09:11:18] [INFO ] Deduced a trap composed of 138 places in 227 ms of which 2 ms to minimize.
[2025-06-06 09:11:19] [INFO ] Deduced a trap composed of 142 places in 256 ms of which 2 ms to minimize.
[2025-06-06 09:11:19] [INFO ] Deduced a trap composed of 137 places in 260 ms of which 2 ms to minimize.
[2025-06-06 09:11:19] [INFO ] Deduced a trap composed of 143 places in 253 ms of which 2 ms to minimize.
[2025-06-06 09:11:19] [INFO ] Deduced a trap composed of 143 places in 252 ms of which 1 ms to minimize.
[2025-06-06 09:11:20] [INFO ] Deduced a trap composed of 142 places in 252 ms of which 1 ms to minimize.
[2025-06-06 09:11:20] [INFO ] Deduced a trap composed of 140 places in 252 ms of which 1 ms to minimize.
[2025-06-06 09:11:20] [INFO ] Deduced a trap composed of 144 places in 251 ms of which 3 ms to minimize.
[2025-06-06 09:11:20] [INFO ] Deduced a trap composed of 143 places in 256 ms of which 2 ms to minimize.
[2025-06-06 09:11:21] [INFO ] Deduced a trap composed of 142 places in 251 ms of which 2 ms to minimize.
[2025-06-06 09:11:21] [INFO ] Deduced a trap composed of 147 places in 245 ms of which 2 ms to minimize.
[2025-06-06 09:11:21] [INFO ] Deduced a trap composed of 142 places in 247 ms of which 1 ms to minimize.
[2025-06-06 09:11:22] [INFO ] Deduced a trap composed of 141 places in 253 ms of which 2 ms to minimize.
[2025-06-06 09:11:22] [INFO ] Deduced a trap composed of 142 places in 250 ms of which 1 ms to minimize.
[2025-06-06 09:11:22] [INFO ] Deduced a trap composed of 141 places in 255 ms of which 2 ms to minimize.
SMT process timed out in 65085ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 65122ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66422 ms. Remains : 256/256 places, 3616/3616 transitions.
RANDOM walk for 1124 steps (0 resets) in 155 ms. (7 steps per ms) remains 0/254 properties
RANDOM walk for 396995 steps (0 resets) in 120004 ms. (3 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 421 ms. (9 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 355 ms. (11 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4001 steps (8 resets) in 357 ms. (11 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 360 ms. (11 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 323 ms. (12 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 388 ms. (10 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 420 ms. (9 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4001 steps (8 resets) in 331 ms. (12 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 333 ms. (11 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 376 ms. (10 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 300 ms. (13 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 364 ms. (10 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 449 ms. (8 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 445 ms. (8 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 416 ms. (9 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4001 steps (8 resets) in 371 ms. (10 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 377 ms. (10 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 367 ms. (10 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4001 steps (8 resets) in 313 ms. (12 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 559 ms. (7 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4001 steps (8 resets) in 401 ms. (9 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 371 ms. (10 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4001 steps (8 resets) in 419 ms. (9 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 486 ms. (8 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 373 ms. (10 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 287 ms. (13 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 509 ms. (7 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 429 ms. (9 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 389 ms. (10 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 333 ms. (11 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 375 ms. (10 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 515 ms. (7 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 330 ms. (12 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 409 ms. (9 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 333 ms. (11 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4001 steps (8 resets) in 397 ms. (10 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 285 ms. (13 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 343 ms. (11 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 302 ms. (13 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 380 ms. (10 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4001 steps (8 resets) in 369 ms. (10 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4001 steps (8 resets) in 391 ms. (10 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 344 ms. (11 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 375 ms. (10 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 383 ms. (10 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 480 ms. (8 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 284 ms. (14 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 447 ms. (8 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4002 steps (8 resets) in 441 ms. (9 steps per ms) remains 2681/2681 properties
BEST_FIRST walk for 4000 steps (8 resets) in 467 ms. (8 steps per ms) remains 2681/2681 properties
Probabilistic random walk after 1000001 steps, saw 163864 distinct states, run finished after 47418 ms. (steps per millisecond=21 ) properties seen :0
[2025-06-06 09:12:46] [INFO ] Invariant cache hit.
[2025-06-06 09:12:46] [INFO ] State equation strengthened by 3390 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 2681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 15/269 constraints. Problems are: Problem set: 0 solved, 2681 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2681 unsolved
At refinement iteration 3 (OVERLAPS) 2/256 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 2681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 2681 unsolved
[2025-06-06 09:14:16] [INFO ] Deduced a trap composed of 143 places in 258 ms of which 2 ms to minimize.
[2025-06-06 09:14:16] [INFO ] Deduced a trap composed of 144 places in 251 ms of which 2 ms to minimize.
[2025-06-06 09:14:17] [INFO ] Deduced a trap composed of 143 places in 263 ms of which 2 ms to minimize.
[2025-06-06 09:14:17] [INFO ] Deduced a trap composed of 140 places in 259 ms of which 2 ms to minimize.
[2025-06-06 09:14:17] [INFO ] Deduced a trap composed of 141 places in 247 ms of which 2 ms to minimize.
[2025-06-06 09:14:18] [INFO ] Deduced a trap composed of 140 places in 254 ms of which 2 ms to minimize.
[2025-06-06 09:14:18] [INFO ] Deduced a trap composed of 139 places in 252 ms of which 2 ms to minimize.
[2025-06-06 09:14:18] [INFO ] Deduced a trap composed of 140 places in 258 ms of which 2 ms to minimize.
[2025-06-06 09:14:18] [INFO ] Deduced a trap composed of 141 places in 253 ms of which 2 ms to minimize.
[2025-06-06 09:14:19] [INFO ] Deduced a trap composed of 140 places in 263 ms of which 2 ms to minimize.
[2025-06-06 09:14:19] [INFO ] Deduced a trap composed of 142 places in 260 ms of which 2 ms to minimize.
SMT process timed out in 93326ms, After SMT, problems are : Problem set: 0 solved, 2681 unsolved
Fused 2681 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 254 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 45 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 44 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 09:14:19] [INFO ] Invariant cache hit.
[2025-06-06 09:14:19] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-06 09:14:19] [INFO ] Invariant cache hit.
[2025-06-06 09:14:20] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 09:14:20] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
[2025-06-06 09:14:20] [INFO ] Redundant transitions in 176 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 09:14:20] [INFO ] Invariant cache hit.
[2025-06-06 09:14:20] [INFO ] State equation strengthened by 3390 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
[2025-06-06 09:14:46] [INFO ] Deduced a trap composed of 147 places in 245 ms of which 2 ms to minimize.
[2025-06-06 09:14:46] [INFO ] Deduced a trap composed of 140 places in 245 ms of which 2 ms to minimize.
[2025-06-06 09:14:46] [INFO ] Deduced a trap composed of 145 places in 240 ms of which 1 ms to minimize.
[2025-06-06 09:14:46] [INFO ] Deduced a trap composed of 145 places in 238 ms of which 2 ms to minimize.
[2025-06-06 09:14:47] [INFO ] Deduced a trap composed of 146 places in 258 ms of which 2 ms to minimize.
[2025-06-06 09:14:47] [INFO ] Deduced a trap composed of 145 places in 258 ms of which 2 ms to minimize.
[2025-06-06 09:14:47] [INFO ] Deduced a trap composed of 141 places in 235 ms of which 2 ms to minimize.
[2025-06-06 09:14:47] [INFO ] Deduced a trap composed of 142 places in 239 ms of which 2 ms to minimize.
[2025-06-06 09:14:48] [INFO ] Deduced a trap composed of 148 places in 238 ms of which 2 ms to minimize.
[2025-06-06 09:14:48] [INFO ] Deduced a trap composed of 147 places in 240 ms of which 1 ms to minimize.
[2025-06-06 09:14:48] [INFO ] Deduced a trap composed of 139 places in 232 ms of which 2 ms to minimize.
[2025-06-06 09:14:48] [INFO ] Deduced a trap composed of 137 places in 243 ms of which 2 ms to minimize.
[2025-06-06 09:14:49] [INFO ] Deduced a trap composed of 143 places in 238 ms of which 1 ms to minimize.
[2025-06-06 09:14:49] [INFO ] Deduced a trap composed of 140 places in 252 ms of which 2 ms to minimize.
[2025-06-06 09:14:49] [INFO ] Deduced a trap composed of 141 places in 234 ms of which 2 ms to minimize.
[2025-06-06 09:14:49] [INFO ] Deduced a trap composed of 148 places in 231 ms of which 1 ms to minimize.
[2025-06-06 09:14:50] [INFO ] Deduced a trap composed of 142 places in 238 ms of which 1 ms to minimize.
[2025-06-06 09:14:50] [INFO ] Deduced a trap composed of 142 places in 287 ms of which 2 ms to minimize.
[2025-06-06 09:14:51] [INFO ] Deduced a trap composed of 142 places in 227 ms of which 1 ms to minimize.
[2025-06-06 09:14:51] [INFO ] Deduced a trap composed of 141 places in 235 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 20/292 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
[2025-06-06 09:14:53] [INFO ] Deduced a trap composed of 144 places in 229 ms of which 1 ms to minimize.
[2025-06-06 09:14:53] [INFO ] Deduced a trap composed of 145 places in 261 ms of which 2 ms to minimize.
[2025-06-06 09:14:54] [INFO ] Deduced a trap composed of 139 places in 233 ms of which 1 ms to minimize.
[2025-06-06 09:14:54] [INFO ] Deduced a trap composed of 140 places in 245 ms of which 2 ms to minimize.
[2025-06-06 09:14:54] [INFO ] Deduced a trap composed of 140 places in 223 ms of which 2 ms to minimize.
[2025-06-06 09:14:54] [INFO ] Deduced a trap composed of 138 places in 229 ms of which 1 ms to minimize.
[2025-06-06 09:14:55] [INFO ] Deduced a trap composed of 146 places in 231 ms of which 2 ms to minimize.
SMT process timed out in 34367ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 34397ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35573 ms. Remains : 256/256 places, 3616/3616 transitions.
RANDOM walk for 1118 steps (0 resets) in 52 ms. (21 steps per ms) remains 0/254 properties
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2 edges and 256 vertex of which 2 / 256 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3079 transitions
Redundant transition composition rules discarded 3079 transitions
Iterating global reduction 0 with 3079 rules applied. Total rules applied 3080 place count 255 transition count 507
Applied a total of 3080 rules in 45 ms. Remains 255 /256 variables (removed 1) and now considering 507/3616 (removed 3109) transitions.
Running SMT prover for 2681 properties.
// Phase 1: matrix 507 rows 255 cols
[2025-06-06 09:14:55] [INFO ] Computed 16 invariants in 5 ms
[2025-06-06 09:15:06] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-06 09:16:04] [INFO ] After 47861ms SMT Verify possible using state equation in real domain returned unsat :0 sat :292 real:2389
TRAPS : Iteration 0
[2025-06-06 09:16:11] [INFO ] After 54871ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :292 real:2389
[2025-06-06 09:16:15] [INFO ] After 79740ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :292 real:2389
[2025-06-06 09:16:25] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-06 09:17:12] [INFO ] After 36593ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2681
TRAPS : Iteration 0
[2025-06-06 09:18:16] [INFO ] After 100661ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2681
[2025-06-06 09:18:53] [INFO ] After 157841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2681
Over-approximation ignoring read arcs solved 0 properties in 238060 ms.
Unable to solve all queries for examination QuasiLiveness. Remains :2681 assertions to prove.
Starting structural reductions in LIVENESS mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 13 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
// Phase 1: matrix 3616 rows 256 cols
[2025-06-06 09:18:53] [INFO ] Computed 16 invariants in 9 ms
[2025-06-06 09:18:53] [INFO ] Implicit Places using invariants in 347 ms returned []
[2025-06-06 09:18:53] [INFO ] Invariant cache hit.
[2025-06-06 09:18:54] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 09:19:00] [INFO ] Implicit Places using invariants and state equation in 6752 ms returned []
Implicit Place search using SMT with State Equation took 7107 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 09:19:00] [INFO ] Invariant cache hit.
[2025-06-06 09:19:00] [INFO ] State equation strengthened by 3390 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
[2025-06-06 09:19:26] [INFO ] Deduced a trap composed of 147 places in 232 ms of which 2 ms to minimize.
[2025-06-06 09:19:26] [INFO ] Deduced a trap composed of 140 places in 234 ms of which 2 ms to minimize.
[2025-06-06 09:19:26] [INFO ] Deduced a trap composed of 145 places in 238 ms of which 2 ms to minimize.
[2025-06-06 09:19:26] [INFO ] Deduced a trap composed of 145 places in 233 ms of which 1 ms to minimize.
[2025-06-06 09:19:27] [INFO ] Deduced a trap composed of 146 places in 240 ms of which 2 ms to minimize.
[2025-06-06 09:19:27] [INFO ] Deduced a trap composed of 145 places in 231 ms of which 2 ms to minimize.
[2025-06-06 09:19:27] [INFO ] Deduced a trap composed of 141 places in 239 ms of which 2 ms to minimize.
[2025-06-06 09:19:27] [INFO ] Deduced a trap composed of 142 places in 235 ms of which 1 ms to minimize.
[2025-06-06 09:19:28] [INFO ] Deduced a trap composed of 148 places in 234 ms of which 2 ms to minimize.
[2025-06-06 09:19:28] [INFO ] Deduced a trap composed of 147 places in 246 ms of which 2 ms to minimize.
[2025-06-06 09:19:28] [INFO ] Deduced a trap composed of 139 places in 238 ms of which 1 ms to minimize.
[2025-06-06 09:19:28] [INFO ] Deduced a trap composed of 137 places in 242 ms of which 2 ms to minimize.
[2025-06-06 09:19:29] [INFO ] Deduced a trap composed of 143 places in 244 ms of which 2 ms to minimize.
[2025-06-06 09:19:29] [INFO ] Deduced a trap composed of 140 places in 238 ms of which 2 ms to minimize.
[2025-06-06 09:19:29] [INFO ] Deduced a trap composed of 141 places in 235 ms of which 2 ms to minimize.
[2025-06-06 09:19:29] [INFO ] Deduced a trap composed of 148 places in 234 ms of which 2 ms to minimize.
[2025-06-06 09:19:30] [INFO ] Deduced a trap composed of 142 places in 242 ms of which 2 ms to minimize.
[2025-06-06 09:19:30] [INFO ] Deduced a trap composed of 142 places in 234 ms of which 2 ms to minimize.
[2025-06-06 09:19:31] [INFO ] Deduced a trap composed of 142 places in 243 ms of which 1 ms to minimize.
[2025-06-06 09:19:31] [INFO ] Deduced a trap composed of 141 places in 234 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 20/292 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
[2025-06-06 09:19:33] [INFO ] Deduced a trap composed of 144 places in 232 ms of which 1 ms to minimize.
[2025-06-06 09:19:33] [INFO ] Deduced a trap composed of 145 places in 242 ms of which 2 ms to minimize.
[2025-06-06 09:19:34] [INFO ] Deduced a trap composed of 139 places in 238 ms of which 1 ms to minimize.
[2025-06-06 09:19:34] [INFO ] Deduced a trap composed of 140 places in 237 ms of which 2 ms to minimize.
[2025-06-06 09:19:34] [INFO ] Deduced a trap composed of 140 places in 236 ms of which 2 ms to minimize.
[2025-06-06 09:19:34] [INFO ] Deduced a trap composed of 138 places in 226 ms of which 2 ms to minimize.
SMT process timed out in 34455ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 34487ms
Finished structural reductions in LIVENESS mode , in 1 iterations and 41620 ms. Remains : 256/256 places, 3616/3616 transitions.
Unable to solve all queries for examination Liveness. Remains :3616 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 3616 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 977354 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running TokenRing-PT-015

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 256
TRANSITIONS: 3616
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 14464
NUPN UNITS: 17
LOADING TIME: 2.038

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.101
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 2.532
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1368
MODEL NAME: /home/mcc/execution/model
256 places, 3616 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

--------------------
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 Liveness -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="TokenRing-PT-015"
export BK_EXAMINATION="Liveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is TokenRing-PT-015, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r252-tall-174915605600219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TokenRing-PT-015.tgz
mv TokenRing-PT-015 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;