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-174915605600217.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 QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r252-tall-174915605600217
=====================================================================

--------------------
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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1749200579110

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
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:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-06 09:03:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 09:03:00] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2025-06-06 09:03:00] [INFO ] Transformed 256 places.
[2025-06-06 09:03:00] [INFO ] Transformed 3616 transitions.
[2025-06-06 09:03:00] [INFO ] Found NUPN structural information;
[2025-06-06 09:03:00] [INFO ] Parsed PT model containing 256 places and 3616 transitions and 14464 arcs in 317 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 54 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:00] [INFO ] Computed 16 invariants in 45 ms
[2025-06-06 09:03:01] [INFO ] Implicit Places using invariants in 660 ms returned []
[2025-06-06 09:03:01] [INFO ] Invariant cache hit.
[2025-06-06 09:03:02] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 09:03:08] [INFO ] Implicit Places using invariants and state equation in 6722 ms returned []
Implicit Place search using SMT with State Equation took 7416 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 09:03:08] [INFO ] Invariant cache hit.
[2025-06-06 09:03:08] [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:32] [INFO ] Deduced a trap composed of 147 places in 319 ms of which 20 ms to minimize.
[2025-06-06 09:03:32] [INFO ] Deduced a trap composed of 140 places in 325 ms of which 3 ms to minimize.
[2025-06-06 09:03:32] [INFO ] Deduced a trap composed of 145 places in 284 ms of which 3 ms to minimize.
[2025-06-06 09:03:33] [INFO ] Deduced a trap composed of 145 places in 258 ms of which 2 ms to minimize.
[2025-06-06 09:03:33] [INFO ] Deduced a trap composed of 146 places in 252 ms of which 1 ms to minimize.
[2025-06-06 09:03:33] [INFO ] Deduced a trap composed of 145 places in 238 ms of which 6 ms to minimize.
[2025-06-06 09:03:33] [INFO ] Deduced a trap composed of 141 places in 221 ms of which 2 ms to minimize.
[2025-06-06 09:03:34] [INFO ] Deduced a trap composed of 142 places in 231 ms of which 2 ms to minimize.
[2025-06-06 09:03:34] [INFO ] Deduced a trap composed of 148 places in 288 ms of which 2 ms to minimize.
[2025-06-06 09:03:34] [INFO ] Deduced a trap composed of 147 places in 247 ms of which 2 ms to minimize.
[2025-06-06 09:03:34] [INFO ] Deduced a trap composed of 139 places in 215 ms of which 1 ms to minimize.
[2025-06-06 09:03:35] [INFO ] Deduced a trap composed of 137 places in 224 ms of which 3 ms to minimize.
[2025-06-06 09:03:35] [INFO ] Deduced a trap composed of 143 places in 217 ms of which 2 ms to minimize.
[2025-06-06 09:03:35] [INFO ] Deduced a trap composed of 140 places in 219 ms of which 2 ms to minimize.
[2025-06-06 09:03:35] [INFO ] Deduced a trap composed of 141 places in 219 ms of which 2 ms to minimize.
[2025-06-06 09:03:36] [INFO ] Deduced a trap composed of 148 places in 227 ms of which 2 ms to minimize.
[2025-06-06 09:03:36] [INFO ] Deduced a trap composed of 142 places in 236 ms of which 2 ms to minimize.
[2025-06-06 09:03:37] [INFO ] Deduced a trap composed of 142 places in 229 ms of which 2 ms to minimize.
[2025-06-06 09:03:37] [INFO ] Deduced a trap composed of 142 places in 220 ms of which 1 ms to minimize.
[2025-06-06 09:03:37] [INFO ] Deduced a trap composed of 141 places in 227 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:03:39] [INFO ] Deduced a trap composed of 144 places in 224 ms of which 2 ms to minimize.
[2025-06-06 09:03:39] [INFO ] Deduced a trap composed of 145 places in 228 ms of which 1 ms to minimize.
[2025-06-06 09:03:40] [INFO ] Deduced a trap composed of 139 places in 225 ms of which 2 ms to minimize.
[2025-06-06 09:03:40] [INFO ] Deduced a trap composed of 140 places in 223 ms of which 1 ms to minimize.
[2025-06-06 09:03:40] [INFO ] Deduced a trap composed of 140 places in 222 ms of which 2 ms to minimize.
[2025-06-06 09:03:40] [INFO ] Deduced a trap composed of 138 places in 225 ms of which 2 ms to minimize.
[2025-06-06 09:03:41] [INFO ] Deduced a trap composed of 146 places in 236 ms of which 2 ms to minimize.
[2025-06-06 09:03:41] [INFO ] Deduced a trap composed of 144 places in 228 ms of which 2 ms to minimize.
[2025-06-06 09:03:41] [INFO ] Deduced a trap composed of 141 places in 238 ms of which 2 ms to minimize.
[2025-06-06 09:03:41] [INFO ] Deduced a trap composed of 140 places in 225 ms of which 2 ms to minimize.
[2025-06-06 09:03:42] [INFO ] Deduced a trap composed of 141 places in 226 ms of which 1 ms to minimize.
[2025-06-06 09:03:42] [INFO ] Deduced a trap composed of 143 places in 222 ms of which 2 ms to minimize.
[2025-06-06 09:03:42] [INFO ] Deduced a trap composed of 142 places in 230 ms of which 2 ms to minimize.
[2025-06-06 09:03:42] [INFO ] Deduced a trap composed of 148 places in 226 ms of which 3 ms to minimize.
[2025-06-06 09:03:43] [INFO ] Deduced a trap composed of 143 places in 249 ms of which 2 ms to minimize.
SMT process timed out in 34778ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 34836ms
Finished structural reductions in LIVENESS mode , in 1 iterations and 42351 ms. Remains : 256/256 places, 3616/3616 transitions.
Initial state reduction rules removed 15 formulas.
RANDOM walk for 40000 steps (8 resets) in 18027 ms. (2 steps per ms) remains 3053/3601 properties
BEST_FIRST walk for 124 steps (4 resets) in 26 ms. (4 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 28 ms. (4 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 9 ms. (12 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 13 ms. (8 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 11 ms. (10 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 10 ms. (11 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 13 ms. (8 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 10 ms. (11 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 10 ms. (11 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 11 ms. (10 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 9 ms. (12 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 9 ms. (12 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 10 ms. (11 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 9 ms. (12 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 10 ms. (11 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 10 ms. (11 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 20 ms. (5 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 11 ms. (10 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 11 ms. (10 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 10 ms. (11 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 9 ms. (12 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 10 ms. (11 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 10 ms. (11 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 9 ms. (12 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 9 ms. (12 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 12 ms. (9 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 9 ms. (12 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 11 ms. (10 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 16 ms. (7 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 11 ms. (10 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 9 ms. (12 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 9 ms. (12 steps per ms) remains 3053/3053 properties
BEST_FIRST walk for 124 steps (4 resets) in 8 ms. (13 steps per ms) remains 3053/3053 properties
[2025-06-06 09:03:48] [INFO ] Invariant cache hit.
[2025-06-06 09:03:48] [INFO ] State equation strengthened by 3390 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3053 unsolved
SMT process timed out in 8859ms, After SMT, problems are : Problem set: 0 solved, 3053 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 97 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 98 ms. Remains : 256/256 places, 3616/3616 transitions.
RANDOM walk for 575278 steps (0 resets) in 120004 ms. (4 steps per ms) remains 3034/3053 properties
BEST_FIRST walk for 4000 steps (8 resets) in 320 ms. (12 steps per ms) remains 2991/3034 properties
BEST_FIRST walk for 4001 steps (8 resets) in 234 ms. (17 steps per ms) remains 2918/2991 properties
BEST_FIRST walk for 4000 steps (8 resets) in 248 ms. (16 steps per ms) remains 2858/2918 properties
BEST_FIRST walk for 4000 steps (8 resets) in 262 ms. (15 steps per ms) remains 2833/2858 properties
BEST_FIRST walk for 4001 steps (8 resets) in 254 ms. (15 steps per ms) remains 2813/2833 properties
BEST_FIRST walk for 4000 steps (8 resets) in 249 ms. (16 steps per ms) remains 2799/2813 properties
BEST_FIRST walk for 4000 steps (8 resets) in 263 ms. (15 steps per ms) remains 2786/2799 properties
BEST_FIRST walk for 4001 steps (8 resets) in 229 ms. (17 steps per ms) remains 2774/2786 properties
BEST_FIRST walk for 4001 steps (8 resets) in 230 ms. (17 steps per ms) remains 2761/2774 properties
BEST_FIRST walk for 4000 steps (8 resets) in 239 ms. (16 steps per ms) remains 2759/2761 properties
BEST_FIRST walk for 4000 steps (8 resets) in 215 ms. (18 steps per ms) remains 2757/2759 properties
BEST_FIRST walk for 4001 steps (8 resets) in 201 ms. (19 steps per ms) remains 2757/2757 properties
BEST_FIRST walk for 4000 steps (8 resets) in 299 ms. (13 steps per ms) remains 2754/2757 properties
BEST_FIRST walk for 4000 steps (8 resets) in 284 ms. (14 steps per ms) remains 2750/2754 properties
BEST_FIRST walk for 4001 steps (8 resets) in 313 ms. (12 steps per ms) remains 2746/2750 properties
BEST_FIRST walk for 4000 steps (8 resets) in 339 ms. (11 steps per ms) remains 2740/2746 properties
BEST_FIRST walk for 4000 steps (8 resets) in 249 ms. (16 steps per ms) remains 2739/2740 properties
BEST_FIRST walk for 4000 steps (8 resets) in 266 ms. (14 steps per ms) remains 2739/2739 properties
BEST_FIRST walk for 4000 steps (8 resets) in 235 ms. (16 steps per ms) remains 2736/2739 properties
BEST_FIRST walk for 4000 steps (8 resets) in 312 ms. (12 steps per ms) remains 2735/2736 properties
BEST_FIRST walk for 4000 steps (8 resets) in 238 ms. (16 steps per ms) remains 2734/2735 properties
BEST_FIRST walk for 4000 steps (8 resets) in 275 ms. (14 steps per ms) remains 2726/2734 properties
BEST_FIRST walk for 4000 steps (8 resets) in 192 ms. (20 steps per ms) remains 2724/2726 properties
BEST_FIRST walk for 4000 steps (8 resets) in 186 ms. (21 steps per ms) remains 2721/2724 properties
BEST_FIRST walk for 4000 steps (8 resets) in 224 ms. (17 steps per ms) remains 2719/2721 properties
BEST_FIRST walk for 4000 steps (8 resets) in 175 ms. (22 steps per ms) remains 2718/2719 properties
BEST_FIRST walk for 4000 steps (8 resets) in 282 ms. (14 steps per ms) remains 2718/2718 properties
BEST_FIRST walk for 4000 steps (8 resets) in 211 ms. (18 steps per ms) remains 2718/2718 properties
BEST_FIRST walk for 4000 steps (8 resets) in 264 ms. (15 steps per ms) remains 2717/2718 properties
BEST_FIRST walk for 4000 steps (8 resets) in 275 ms. (14 steps per ms) remains 2717/2717 properties
BEST_FIRST walk for 4000 steps (8 resets) in 222 ms. (17 steps per ms) remains 2717/2717 properties
BEST_FIRST walk for 4000 steps (8 resets) in 251 ms. (15 steps per ms) remains 2716/2717 properties
BEST_FIRST walk for 4000 steps (8 resets) in 266 ms. (14 steps per ms) remains 2715/2716 properties
BEST_FIRST walk for 4000 steps (8 resets) in 261 ms. (15 steps per ms) remains 2714/2715 properties
BEST_FIRST walk for 4000 steps (8 resets) in 243 ms. (16 steps per ms) remains 2713/2714 properties
BEST_FIRST walk for 4000 steps (8 resets) in 215 ms. (18 steps per ms) remains 2713/2713 properties
BEST_FIRST walk for 4000 steps (8 resets) in 251 ms. (15 steps per ms) remains 2713/2713 properties
BEST_FIRST walk for 4000 steps (8 resets) in 227 ms. (17 steps per ms) remains 2710/2713 properties
BEST_FIRST walk for 4000 steps (8 resets) in 194 ms. (20 steps per ms) remains 2710/2710 properties
BEST_FIRST walk for 4002 steps (8 resets) in 218 ms. (18 steps per ms) remains 2710/2710 properties
BEST_FIRST walk for 4000 steps (8 resets) in 224 ms. (17 steps per ms) remains 2710/2710 properties
BEST_FIRST walk for 4000 steps (8 resets) in 248 ms. (16 steps per ms) remains 2710/2710 properties
BEST_FIRST walk for 4000 steps (8 resets) in 227 ms. (17 steps per ms) remains 2709/2710 properties
BEST_FIRST walk for 4000 steps (8 resets) in 220 ms. (18 steps per ms) remains 2709/2709 properties
BEST_FIRST walk for 4000 steps (8 resets) in 245 ms. (16 steps per ms) remains 2709/2709 properties
BEST_FIRST walk for 4000 steps (8 resets) in 254 ms. (15 steps per ms) remains 2709/2709 properties
BEST_FIRST walk for 4000 steps (8 resets) in 267 ms. (14 steps per ms) remains 2709/2709 properties
BEST_FIRST walk for 4001 steps (8 resets) in 209 ms. (19 steps per ms) remains 2708/2709 properties
BEST_FIRST walk for 4000 steps (8 resets) in 248 ms. (16 steps per ms) remains 2708/2708 properties
BEST_FIRST walk for 4000 steps (8 resets) in 206 ms. (19 steps per ms) remains 2708/2708 properties
BEST_FIRST walk for 4000 steps (8 resets) in 252 ms. (15 steps per ms) remains 2708/2708 properties
BEST_FIRST walk for 4000 steps (8 resets) in 212 ms. (18 steps per ms) remains 2708/2708 properties
BEST_FIRST walk for 4000 steps (8 resets) in 230 ms. (17 steps per ms) remains 2707/2708 properties
BEST_FIRST walk for 4000 steps (8 resets) in 218 ms. (18 steps per ms) remains 2706/2707 properties
BEST_FIRST walk for 4000 steps (8 resets) in 212 ms. (18 steps per ms) remains 2706/2706 properties
BEST_FIRST walk for 4000 steps (8 resets) in 227 ms. (17 steps per ms) remains 2706/2706 properties
BEST_FIRST walk for 4000 steps (8 resets) in 329 ms. (12 steps per ms) remains 2706/2706 properties
BEST_FIRST walk for 4000 steps (8 resets) in 255 ms. (15 steps per ms) remains 2706/2706 properties
BEST_FIRST walk for 4000 steps (8 resets) in 236 ms. (16 steps per ms) remains 2706/2706 properties
BEST_FIRST walk for 4000 steps (8 resets) in 223 ms. (17 steps per ms) remains 2706/2706 properties
BEST_FIRST walk for 4000 steps (8 resets) in 235 ms. (16 steps per ms) remains 2706/2706 properties
BEST_FIRST walk for 4000 steps (8 resets) in 223 ms. (17 steps per ms) remains 2706/2706 properties
BEST_FIRST walk for 4000 steps (8 resets) in 223 ms. (17 steps per ms) remains 2706/2706 properties
BEST_FIRST walk for 4000 steps (8 resets) in 252 ms. (15 steps per ms) remains 2704/2706 properties
BEST_FIRST walk for 4000 steps (8 resets) in 215 ms. (18 steps per ms) remains 2704/2704 properties
BEST_FIRST walk for 4000 steps (8 resets) in 213 ms. (18 steps per ms) remains 2704/2704 properties
BEST_FIRST walk for 4000 steps (8 resets) in 201 ms. (19 steps per ms) remains 2703/2704 properties
BEST_FIRST walk for 4000 steps (8 resets) in 236 ms. (16 steps per ms) remains 2702/2703 properties
BEST_FIRST walk for 4000 steps (8 resets) in 283 ms. (14 steps per ms) remains 2702/2702 properties
BEST_FIRST walk for 4000 steps (8 resets) in 223 ms. (17 steps per ms) remains 2702/2702 properties
BEST_FIRST walk for 4000 steps (8 resets) in 211 ms. (18 steps per ms) remains 2702/2702 properties
BEST_FIRST walk for 4001 steps (8 resets) in 252 ms. (15 steps per ms) remains 2701/2702 properties
BEST_FIRST walk for 4000 steps (8 resets) in 211 ms. (18 steps per ms) remains 2701/2701 properties
BEST_FIRST walk for 4000 steps (8 resets) in 237 ms. (16 steps per ms) remains 2701/2701 properties
BEST_FIRST walk for 4000 steps (8 resets) in 216 ms. (18 steps per ms) remains 2701/2701 properties
BEST_FIRST walk for 4000 steps (8 resets) in 464 ms. (8 steps per ms) remains 2700/2701 properties
BEST_FIRST walk for 4000 steps (8 resets) in 163 ms. (24 steps per ms) remains 2700/2700 properties
BEST_FIRST walk for 4002 steps (8 resets) in 222 ms. (17 steps per ms) remains 2700/2700 properties
BEST_FIRST walk for 4000 steps (8 resets) in 271 ms. (14 steps per ms) remains 2700/2700 properties
BEST_FIRST walk for 4000 steps (8 resets) in 246 ms. (16 steps per ms) remains 2700/2700 properties
BEST_FIRST walk for 4000 steps (8 resets) in 209 ms. (19 steps per ms) remains 2700/2700 properties
BEST_FIRST walk for 4001 steps (8 resets) in 180 ms. (22 steps per ms) remains 2700/2700 properties
BEST_FIRST walk for 4000 steps (8 resets) in 227 ms. (17 steps per ms) remains 2700/2700 properties
BEST_FIRST walk for 4000 steps (8 resets) in 281 ms. (14 steps per ms) remains 2696/2700 properties
BEST_FIRST walk for 4000 steps (8 resets) in 236 ms. (16 steps per ms) remains 2695/2696 properties
BEST_FIRST walk for 4000 steps (8 resets) in 212 ms. (18 steps per ms) remains 2695/2695 properties
BEST_FIRST walk for 4002 steps (8 resets) in 196 ms. (20 steps per ms) remains 2695/2695 properties
BEST_FIRST walk for 4001 steps (8 resets) in 208 ms. (19 steps per ms) remains 2695/2695 properties
BEST_FIRST walk for 4000 steps (8 resets) in 228 ms. (17 steps per ms) remains 2695/2695 properties
BEST_FIRST walk for 4000 steps (8 resets) in 214 ms. (18 steps per ms) remains 2695/2695 properties
BEST_FIRST walk for 4000 steps (8 resets) in 211 ms. (18 steps per ms) remains 2695/2695 properties
BEST_FIRST walk for 4001 steps (8 resets) in 235 ms. (16 steps per ms) remains 2695/2695 properties
BEST_FIRST walk for 4000 steps (8 resets) in 238 ms. (16 steps per ms) remains 2695/2695 properties
BEST_FIRST walk for 4000 steps (8 resets) in 227 ms. (17 steps per ms) remains 2695/2695 properties
BEST_FIRST walk for 4000 steps (8 resets) in 212 ms. (18 steps per ms) remains 2695/2695 properties
BEST_FIRST walk for 4000 steps (8 resets) in 229 ms. (17 steps per ms) remains 2695/2695 properties
BEST_FIRST walk for 4000 steps (8 resets) in 192 ms. (20 steps per ms) remains 2695/2695 properties
BEST_FIRST walk for 4001 steps (8 resets) in 217 ms. (18 steps per ms) remains 2695/2695 properties
BEST_FIRST walk for 4000 steps (8 resets) in 260 ms. (15 steps per ms) remains 2695/2695 properties
BEST_FIRST walk for 4000 steps (8 resets) in 244 ms. (16 steps per ms) remains 2695/2695 properties
BEST_FIRST walk for 4000 steps (8 resets) in 231 ms. (17 steps per ms) remains 2695/2695 properties
BEST_FIRST walk for 4001 steps (8 resets) in 226 ms. (17 steps per ms) remains 2695/2695 properties
BEST_FIRST walk for 4000 steps (8 resets) in 238 ms. (16 steps per ms) remains 2695/2695 properties
BEST_FIRST walk for 4000 steps (8 resets) in 214 ms. (18 steps per ms) remains 2695/2695 properties
BEST_FIRST walk for 4000 steps (8 resets) in 234 ms. (17 steps per ms) remains 2690/2695 properties
BEST_FIRST walk for 4000 steps (8 resets) in 213 ms. (18 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 249 ms. (16 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 223 ms. (17 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 252 ms. (15 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 234 ms. (17 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 239 ms. (16 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 211 ms. (18 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 239 ms. (16 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 208 ms. (19 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 291 ms. (13 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 269 ms. (14 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 250 ms. (15 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4001 steps (8 resets) in 224 ms. (17 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 252 ms. (15 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4001 steps (8 resets) in 166 ms. (23 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 255 ms. (15 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 226 ms. (17 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 235 ms. (16 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 244 ms. (16 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 219 ms. (18 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 237 ms. (16 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 229 ms. (17 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 225 ms. (17 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 249 ms. (16 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 235 ms. (16 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 234 ms. (17 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 194 ms. (20 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 207 ms. (19 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 235 ms. (16 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 177 ms. (22 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 216 ms. (18 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 213 ms. (18 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 250 ms. (15 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 208 ms. (19 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 234 ms. (17 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 210 ms. (18 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 239 ms. (16 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 204 ms. (19 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 232 ms. (17 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 247 ms. (16 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 283 ms. (14 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 189 ms. (21 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 289 ms. (13 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 207 ms. (19 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 217 ms. (18 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 199 ms. (20 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4001 steps (8 resets) in 217 ms. (18 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4001 steps (8 resets) in 191 ms. (20 steps per ms) remains 2690/2690 properties
[2025-06-06 09:04:38] [INFO ] Invariant cache hit.
[2025-06-06 09:04:38] [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, 2690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 2690 unsolved
[2025-06-06 09:04:55] [INFO ] Deduced a trap composed of 143 places in 231 ms of which 2 ms to minimize.
[2025-06-06 09:04:55] [INFO ] Deduced a trap composed of 143 places in 237 ms of which 2 ms to minimize.
[2025-06-06 09:04:56] [INFO ] Deduced a trap composed of 142 places in 226 ms of which 2 ms to minimize.
[2025-06-06 09:04:56] [INFO ] Deduced a trap composed of 143 places in 220 ms of which 2 ms to minimize.
[2025-06-06 09:04:57] [INFO ] Deduced a trap composed of 141 places in 230 ms of which 2 ms to minimize.
[2025-06-06 09:04:57] [INFO ] Deduced a trap composed of 141 places in 232 ms of which 2 ms to minimize.
[2025-06-06 09:04:57] [INFO ] Deduced a trap composed of 139 places in 265 ms of which 2 ms to minimize.
[2025-06-06 09:04:57] [INFO ] Deduced a trap composed of 141 places in 257 ms of which 2 ms to minimize.
[2025-06-06 09:04:58] [INFO ] Deduced a trap composed of 143 places in 267 ms of which 2 ms to minimize.
[2025-06-06 09:04:58] [INFO ] Deduced a trap composed of 143 places in 261 ms of which 1 ms to minimize.
[2025-06-06 09:04:58] [INFO ] Deduced a trap composed of 143 places in 252 ms of which 1 ms to minimize.
[2025-06-06 09:04:58] [INFO ] Deduced a trap composed of 142 places in 260 ms of which 2 ms to minimize.
[2025-06-06 09:04:59] [INFO ] Deduced a trap composed of 143 places in 232 ms of which 2 ms to minimize.
[2025-06-06 09:04:59] [INFO ] Deduced a trap composed of 143 places in 228 ms of which 1 ms to minimize.
[2025-06-06 09:04:59] [INFO ] Deduced a trap composed of 144 places in 232 ms of which 1 ms to minimize.
[2025-06-06 09:04:59] [INFO ] Deduced a trap composed of 143 places in 234 ms of which 3 ms to minimize.
[2025-06-06 09:05:00] [INFO ] Deduced a trap composed of 138 places in 259 ms of which 1 ms to minimize.
[2025-06-06 09:05:00] [INFO ] Deduced a trap composed of 142 places in 232 ms of which 2 ms to minimize.
[2025-06-06 09:05:00] [INFO ] Deduced a trap composed of 142 places in 253 ms of which 2 ms to minimize.
[2025-06-06 09:05:00] [INFO ] Deduced a trap composed of 142 places in 262 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, 2690 unsolved
[2025-06-06 09:05:04] [INFO ] Deduced a trap composed of 140 places in 267 ms of which 2 ms to minimize.
[2025-06-06 09:05:05] [INFO ] Deduced a trap composed of 140 places in 280 ms of which 8 ms to minimize.
[2025-06-06 09:05:05] [INFO ] Deduced a trap composed of 141 places in 256 ms of which 2 ms to minimize.
[2025-06-06 09:05:05] [INFO ] Deduced a trap composed of 137 places in 260 ms of which 2 ms to minimize.
[2025-06-06 09:05:05] [INFO ] Deduced a trap composed of 136 places in 234 ms of which 2 ms to minimize.
[2025-06-06 09:05:06] [INFO ] Deduced a trap composed of 137 places in 254 ms of which 2 ms to minimize.
[2025-06-06 09:05:06] [INFO ] Deduced a trap composed of 142 places in 254 ms of which 1 ms to minimize.
[2025-06-06 09:05:06] [INFO ] Deduced a trap composed of 139 places in 233 ms of which 2 ms to minimize.
[2025-06-06 09:05:06] [INFO ] Deduced a trap composed of 141 places in 254 ms of which 2 ms to minimize.
[2025-06-06 09:05:07] [INFO ] Deduced a trap composed of 144 places in 257 ms of which 2 ms to minimize.
[2025-06-06 09:05:07] [INFO ] Deduced a trap composed of 143 places in 261 ms of which 2 ms to minimize.
[2025-06-06 09:05:07] [INFO ] Deduced a trap composed of 141 places in 260 ms of which 1 ms to minimize.
[2025-06-06 09:05:08] [INFO ] Deduced a trap composed of 145 places in 264 ms of which 2 ms to minimize.
[2025-06-06 09:05:08] [INFO ] Deduced a trap composed of 139 places in 260 ms of which 2 ms to minimize.
[2025-06-06 09:05:08] [INFO ] Deduced a trap composed of 141 places in 262 ms of which 2 ms to minimize.
[2025-06-06 09:05:08] [INFO ] Deduced a trap composed of 139 places in 259 ms of which 1 ms to minimize.
[2025-06-06 09:05:09] [INFO ] Deduced a trap composed of 142 places in 240 ms of which 2 ms to minimize.
[2025-06-06 09:05:09] [INFO ] Deduced a trap composed of 146 places in 246 ms of which 1 ms to minimize.
[2025-06-06 09:05:09] [INFO ] Deduced a trap composed of 147 places in 231 ms of which 2 ms to minimize.
[2025-06-06 09:05:09] [INFO ] Deduced a trap composed of 141 places in 262 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 20/312 constraints. Problems are: Problem set: 0 solved, 2690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 256/3872 variables, and 312 constraints, problems are : Problem set: 0 solved, 2690 unsolved in 45064 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: 2690/2690 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2690 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 2690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 2690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 40/312 constraints. Problems are: Problem set: 0 solved, 2690 unsolved
[2025-06-06 09:05:31] [INFO ] Deduced a trap composed of 147 places in 232 ms of which 2 ms to minimize.
[2025-06-06 09:05:31] [INFO ] Deduced a trap composed of 141 places in 239 ms of which 1 ms to minimize.
[2025-06-06 09:05:31] [INFO ] Deduced a trap composed of 139 places in 236 ms of which 2 ms to minimize.
[2025-06-06 09:05:32] [INFO ] Deduced a trap composed of 140 places in 241 ms of which 2 ms to minimize.
[2025-06-06 09:05:32] [INFO ] Deduced a trap composed of 143 places in 230 ms of which 1 ms to minimize.
[2025-06-06 09:05:32] [INFO ] Deduced a trap composed of 143 places in 231 ms of which 2 ms to minimize.
[2025-06-06 09:05:32] [INFO ] Deduced a trap composed of 143 places in 237 ms of which 1 ms to minimize.
[2025-06-06 09:05:33] [INFO ] Deduced a trap composed of 143 places in 238 ms of which 2 ms to minimize.
[2025-06-06 09:05:33] [INFO ] Deduced a trap composed of 140 places in 230 ms of which 2 ms to minimize.
[2025-06-06 09:05:33] [INFO ] Deduced a trap composed of 143 places in 242 ms of which 5 ms to minimize.
[2025-06-06 09:05:33] [INFO ] Deduced a trap composed of 141 places in 243 ms of which 2 ms to minimize.
[2025-06-06 09:05:34] [INFO ] Deduced a trap composed of 142 places in 229 ms of which 1 ms to minimize.
[2025-06-06 09:05:34] [INFO ] Deduced a trap composed of 140 places in 235 ms of which 2 ms to minimize.
[2025-06-06 09:05:34] [INFO ] Deduced a trap composed of 141 places in 239 ms of which 2 ms to minimize.
[2025-06-06 09:05:34] [INFO ] Deduced a trap composed of 138 places in 237 ms of which 2 ms to minimize.
[2025-06-06 09:05:35] [INFO ] Deduced a trap composed of 142 places in 235 ms of which 2 ms to minimize.
[2025-06-06 09:05:35] [INFO ] Deduced a trap composed of 143 places in 230 ms of which 2 ms to minimize.
[2025-06-06 09:05:35] [INFO ] Deduced a trap composed of 140 places in 233 ms of which 2 ms to minimize.
[2025-06-06 09:05:35] [INFO ] Deduced a trap composed of 139 places in 231 ms of which 1 ms to minimize.
[2025-06-06 09:05:36] [INFO ] Deduced a trap composed of 141 places in 227 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 20/332 constraints. Problems are: Problem set: 0 solved, 2690 unsolved
[2025-06-06 09:05:43] [INFO ] Deduced a trap composed of 136 places in 226 ms of which 2 ms to minimize.
[2025-06-06 09:05:43] [INFO ] Deduced a trap composed of 144 places in 224 ms of which 2 ms to minimize.
[2025-06-06 09:05:44] [INFO ] Deduced a trap composed of 147 places in 231 ms of which 1 ms to minimize.
[2025-06-06 09:05:44] [INFO ] Deduced a trap composed of 138 places in 229 ms of which 2 ms to minimize.
[2025-06-06 09:05:44] [INFO ] Deduced a trap composed of 140 places in 244 ms of which 1 ms to minimize.
[2025-06-06 09:05:44] [INFO ] Deduced a trap composed of 141 places in 220 ms of which 2 ms to minimize.
[2025-06-06 09:05:45] [INFO ] Deduced a trap composed of 147 places in 235 ms of which 1 ms to minimize.
[2025-06-06 09:05:45] [INFO ] Deduced a trap composed of 148 places in 231 ms of which 2 ms to minimize.
[2025-06-06 09:05:45] [INFO ] Deduced a trap composed of 138 places in 229 ms of which 2 ms to minimize.
[2025-06-06 09:05:45] [INFO ] Deduced a trap composed of 139 places in 246 ms of which 2 ms to minimize.
[2025-06-06 09:05:46] [INFO ] Deduced a trap composed of 145 places in 230 ms of which 2 ms to minimize.
[2025-06-06 09:05:46] [INFO ] Deduced a trap composed of 144 places in 224 ms of which 2 ms to minimize.
[2025-06-06 09:05:46] [INFO ] Deduced a trap composed of 148 places in 232 ms of which 2 ms to minimize.
[2025-06-06 09:05:46] [INFO ] Deduced a trap composed of 145 places in 225 ms of which 2 ms to minimize.
[2025-06-06 09:05:47] [INFO ] Deduced a trap composed of 141 places in 232 ms of which 2 ms to minimize.
[2025-06-06 09:05:47] [INFO ] Deduced a trap composed of 142 places in 238 ms of which 1 ms to minimize.
[2025-06-06 09:05:47] [INFO ] Deduced a trap composed of 144 places in 220 ms of which 2 ms to minimize.
[2025-06-06 09:05:47] [INFO ] Deduced a trap composed of 147 places in 267 ms of which 2 ms to minimize.
[2025-06-06 09:05:48] [INFO ] Deduced a trap composed of 143 places in 227 ms of which 2 ms to minimize.
[2025-06-06 09:05:48] [INFO ] Deduced a trap composed of 147 places in 226 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 20/352 constraints. Problems are: Problem set: 0 solved, 2690 unsolved
[2025-06-06 09:05:57] [INFO ] Deduced a trap composed of 139 places in 236 ms of which 2 ms to minimize.
[2025-06-06 09:05:57] [INFO ] Deduced a trap composed of 142 places in 236 ms of which 2 ms to minimize.
[2025-06-06 09:05:58] [INFO ] Deduced a trap composed of 141 places in 229 ms of which 1 ms to minimize.
[2025-06-06 09:05:58] [INFO ] Deduced a trap composed of 139 places in 228 ms of which 1 ms to minimize.
[2025-06-06 09:05:58] [INFO ] Deduced a trap composed of 143 places in 229 ms of which 2 ms to minimize.
[2025-06-06 09:05:59] [INFO ] Deduced a trap composed of 143 places in 225 ms of which 1 ms to minimize.
[2025-06-06 09:05:59] [INFO ] Deduced a trap composed of 139 places in 223 ms of which 2 ms to minimize.
[2025-06-06 09:06:00] [INFO ] Deduced a trap composed of 147 places in 230 ms of which 2 ms to minimize.
[2025-06-06 09:06:00] [INFO ] Deduced a trap composed of 148 places in 223 ms of which 2 ms to minimize.
[2025-06-06 09:06:00] [INFO ] Deduced a trap composed of 148 places in 227 ms of which 2 ms to minimize.
[2025-06-06 09:06:01] [INFO ] Deduced a trap composed of 140 places in 238 ms of which 2 ms to minimize.
[2025-06-06 09:06:01] [INFO ] Deduced a trap composed of 144 places in 232 ms of which 2 ms to minimize.
[2025-06-06 09:06:01] [INFO ] Deduced a trap composed of 146 places in 232 ms of which 2 ms to minimize.
[2025-06-06 09:06:01] [INFO ] Deduced a trap composed of 147 places in 229 ms of which 2 ms to minimize.
[2025-06-06 09:06:02] [INFO ] Deduced a trap composed of 144 places in 229 ms of which 1 ms to minimize.
[2025-06-06 09:06:02] [INFO ] Deduced a trap composed of 146 places in 224 ms of which 2 ms to minimize.
[2025-06-06 09:06:02] [INFO ] Deduced a trap composed of 141 places in 231 ms of which 2 ms to minimize.
[2025-06-06 09:06:02] [INFO ] Deduced a trap composed of 139 places in 235 ms of which 2 ms to minimize.
[2025-06-06 09:06:03] [INFO ] Deduced a trap composed of 139 places in 237 ms of which 1 ms to minimize.
[2025-06-06 09:06:03] [INFO ] Deduced a trap composed of 145 places in 232 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 20/372 constraints. Problems are: Problem set: 0 solved, 2690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 256/3872 variables, and 372 constraints, problems are : Problem set: 0 solved, 2690 unsolved in 45054 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: 0/2690 constraints, Known Traps: 100/100 constraints]
After SMT, in 93258ms problems are : Problem set: 0 solved, 2690 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 51 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 587240 steps (0 resets) in 120004 ms. (4 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 265 ms. (15 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 207 ms. (19 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 232 ms. (17 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 209 ms. (19 steps per ms) remains 2690/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 216 ms. (18 steps per ms) remains 2689/2690 properties
BEST_FIRST walk for 4000 steps (8 resets) in 190 ms. (20 steps per ms) remains 2689/2689 properties
BEST_FIRST walk for 4001 steps (8 resets) in 195 ms. (20 steps per ms) remains 2689/2689 properties
BEST_FIRST walk for 4000 steps (8 resets) in 215 ms. (18 steps per ms) remains 2689/2689 properties
BEST_FIRST walk for 4000 steps (8 resets) in 194 ms. (20 steps per ms) remains 2689/2689 properties
BEST_FIRST walk for 4000 steps (8 resets) in 174 ms. (22 steps per ms) remains 2689/2689 properties
BEST_FIRST walk for 4000 steps (8 resets) in 222 ms. (17 steps per ms) remains 2689/2689 properties
BEST_FIRST walk for 4000 steps (8 resets) in 173 ms. (22 steps per ms) remains 2687/2689 properties
BEST_FIRST walk for 4000 steps (8 resets) in 249 ms. (16 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 235 ms. (16 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 225 ms. (17 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 212 ms. (18 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 228 ms. (17 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 236 ms. (16 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 275 ms. (14 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 314 ms. (12 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 271 ms. (14 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4001 steps (8 resets) in 218 ms. (18 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 255 ms. (15 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 311 ms. (12 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 278 ms. (14 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 358 ms. (11 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 476 ms. (8 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 384 ms. (10 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4001 steps (8 resets) in 230 ms. (17 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 262 ms. (15 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4001 steps (8 resets) in 372 ms. (10 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 380 ms. (10 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 471 ms. (8 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 412 ms. (9 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 340 ms. (11 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 394 ms. (10 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4002 steps (8 resets) in 335 ms. (11 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 230 ms. (17 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 427 ms. (9 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 381 ms. (10 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 326 ms. (12 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 359 ms. (11 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 321 ms. (12 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 387 ms. (10 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 351 ms. (11 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 286 ms. (13 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 299 ms. (13 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 285 ms. (13 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4001 steps (8 resets) in 262 ms. (15 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 290 ms. (13 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 223 ms. (17 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 240 ms. (16 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 262 ms. (15 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 264 ms. (15 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 315 ms. (12 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 303 ms. (13 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 300 ms. (13 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 352 ms. (11 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 313 ms. (12 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 343 ms. (11 steps per ms) remains 2687/2687 properties
BEST_FIRST walk for 4000 steps (8 resets) in 396 ms. (10 steps per ms) remains 2687/2687 properties
Probabilistic random walk after 1000001 steps, saw 163864 distinct states, run finished after 55272 ms. (steps per millisecond=18 ) properties seen :1
[2025-06-06 09:07:42] [INFO ] Invariant cache hit.
[2025-06-06 09:07:42] [INFO ] State equation strengthened by 3390 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 2686 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 15/270 constraints. Problems are: Problem set: 0 solved, 2686 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2686 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1/256 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 2686 unsolved
SMT process timed out in 78297ms, After SMT, problems are : Problem set: 0 solved, 2686 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 255 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 61 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 61 ms. Remains : 256/256 places, 3616/3616 transitions.
RANDOM walk for 633444 steps (0 resets) in 120004 ms. (5 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 218 ms. (18 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 226 ms. (17 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 260 ms. (15 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 202 ms. (19 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4001 steps (8 resets) in 217 ms. (18 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 199 ms. (20 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4001 steps (8 resets) in 198 ms. (20 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4001 steps (8 resets) in 243 ms. (16 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4001 steps (8 resets) in 310 ms. (12 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4001 steps (8 resets) in 318 ms. (12 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 304 ms. (13 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 239 ms. (16 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 421 ms. (9 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 280 ms. (14 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 406 ms. (9 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 344 ms. (11 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 449 ms. (8 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 332 ms. (12 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 331 ms. (12 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 374 ms. (10 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 418 ms. (9 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 333 ms. (11 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4001 steps (8 resets) in 277 ms. (14 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4001 steps (8 resets) in 259 ms. (15 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 278 ms. (14 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 361 ms. (11 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 352 ms. (11 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 458 ms. (8 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 349 ms. (11 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 423 ms. (9 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 384 ms. (10 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 445 ms. (8 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 283 ms. (14 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4001 steps (8 resets) in 312 ms. (12 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4001 steps (8 resets) in 247 ms. (16 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 276 ms. (14 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 358 ms. (11 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 297 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 4001 steps (8 resets) in 210 ms. (18 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 263 ms. (15 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 347 ms. (11 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 431 ms. (9 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 310 ms. (12 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4001 steps (8 resets) in 307 ms. (12 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 379 ms. (10 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 292 ms. (13 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 335 ms. (11 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 424 ms. (9 steps per ms) remains 2686/2686 properties
Probabilistic random walk after 1000001 steps, saw 163864 distinct states, run finished after 53607 ms. (steps per millisecond=18 ) properties seen :0
[2025-06-06 09:10:29] [INFO ] Invariant cache hit.
[2025-06-06 09:10:29] [INFO ] State equation strengthened by 3390 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 2686 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 15/270 constraints. Problems are: Problem set: 0 solved, 2686 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2686 unsolved
At refinement iteration 3 (OVERLAPS) 1/256 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 2686 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 2686 unsolved
[2025-06-06 09:11:58] [INFO ] Deduced a trap composed of 143 places in 233 ms of which 2 ms to minimize.
[2025-06-06 09:11:58] [INFO ] Deduced a trap composed of 143 places in 226 ms of which 2 ms to minimize.
[2025-06-06 09:11:59] [INFO ] Deduced a trap composed of 143 places in 254 ms of which 2 ms to minimize.
[2025-06-06 09:11:59] [INFO ] Deduced a trap composed of 140 places in 231 ms of which 2 ms to minimize.
[2025-06-06 09:11:59] [INFO ] Deduced a trap composed of 145 places in 252 ms of which 2 ms to minimize.
[2025-06-06 09:11:59] [INFO ] Deduced a trap composed of 141 places in 249 ms of which 2 ms to minimize.
[2025-06-06 09:12:00] [INFO ] Deduced a trap composed of 140 places in 251 ms of which 2 ms to minimize.
[2025-06-06 09:12:00] [INFO ] Deduced a trap composed of 143 places in 231 ms of which 2 ms to minimize.
[2025-06-06 09:12:00] [INFO ] Deduced a trap composed of 139 places in 222 ms of which 2 ms to minimize.
[2025-06-06 09:12:00] [INFO ] Deduced a trap composed of 143 places in 227 ms of which 2 ms to minimize.
[2025-06-06 09:12:01] [INFO ] Deduced a trap composed of 143 places in 222 ms of which 2 ms to minimize.
[2025-06-06 09:12:01] [INFO ] Deduced a trap composed of 142 places in 258 ms of which 2 ms to minimize.
[2025-06-06 09:12:01] [INFO ] Deduced a trap composed of 145 places in 255 ms of which 2 ms to minimize.
[2025-06-06 09:12:01] [INFO ] Deduced a trap composed of 143 places in 250 ms of which 1 ms to minimize.
[2025-06-06 09:12:02] [INFO ] Deduced a trap composed of 142 places in 249 ms of which 1 ms to minimize.
[2025-06-06 09:12:02] [INFO ] Deduced a trap composed of 143 places in 247 ms of which 2 ms to minimize.
[2025-06-06 09:12:02] [INFO ] Deduced a trap composed of 141 places in 229 ms of which 2 ms to minimize.
[2025-06-06 09:12:02] [INFO ] Deduced a trap composed of 141 places in 223 ms of which 2 ms to minimize.
SMT process timed out in 93168ms, After SMT, problems are : Problem set: 0 solved, 2686 unsolved
Fused 2686 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 255 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 59 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 59 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 62 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 09:12:02] [INFO ] Invariant cache hit.
[2025-06-06 09:12:03] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-06 09:12:03] [INFO ] Invariant cache hit.
[2025-06-06 09:12:03] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 09:12:03] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 966 ms to find 0 implicit places.
[2025-06-06 09:12:04] [INFO ] Redundant transitions in 286 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 09:12:04] [INFO ] Invariant cache hit.
[2025-06-06 09:12:04] [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:12:29] [INFO ] Deduced a trap composed of 147 places in 227 ms of which 2 ms to minimize.
[2025-06-06 09:12:29] [INFO ] Deduced a trap composed of 140 places in 237 ms of which 2 ms to minimize.
[2025-06-06 09:12:29] [INFO ] Deduced a trap composed of 145 places in 255 ms of which 2 ms to minimize.
[2025-06-06 09:12:29] [INFO ] Deduced a trap composed of 145 places in 261 ms of which 2 ms to minimize.
[2025-06-06 09:12:30] [INFO ] Deduced a trap composed of 146 places in 235 ms of which 2 ms to minimize.
[2025-06-06 09:12:30] [INFO ] Deduced a trap composed of 145 places in 226 ms of which 3 ms to minimize.
[2025-06-06 09:12:30] [INFO ] Deduced a trap composed of 141 places in 262 ms of which 2 ms to minimize.
[2025-06-06 09:12:30] [INFO ] Deduced a trap composed of 142 places in 233 ms of which 2 ms to minimize.
[2025-06-06 09:12:31] [INFO ] Deduced a trap composed of 148 places in 231 ms of which 2 ms to minimize.
[2025-06-06 09:12:31] [INFO ] Deduced a trap composed of 147 places in 230 ms of which 2 ms to minimize.
[2025-06-06 09:12:31] [INFO ] Deduced a trap composed of 139 places in 231 ms of which 2 ms to minimize.
[2025-06-06 09:12:31] [INFO ] Deduced a trap composed of 137 places in 227 ms of which 2 ms to minimize.
[2025-06-06 09:12:32] [INFO ] Deduced a trap composed of 143 places in 310 ms of which 2 ms to minimize.
[2025-06-06 09:12:32] [INFO ] Deduced a trap composed of 140 places in 226 ms of which 2 ms to minimize.
[2025-06-06 09:12:32] [INFO ] Deduced a trap composed of 141 places in 248 ms of which 2 ms to minimize.
[2025-06-06 09:12:33] [INFO ] Deduced a trap composed of 148 places in 261 ms of which 2 ms to minimize.
[2025-06-06 09:12:33] [INFO ] Deduced a trap composed of 142 places in 233 ms of which 2 ms to minimize.
[2025-06-06 09:12:33] [INFO ] Deduced a trap composed of 142 places in 234 ms of which 2 ms to minimize.
[2025-06-06 09:12:34] [INFO ] Deduced a trap composed of 142 places in 225 ms of which 1 ms to minimize.
[2025-06-06 09:12:34] [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:12:36] [INFO ] Deduced a trap composed of 144 places in 226 ms of which 2 ms to minimize.
[2025-06-06 09:12:36] [INFO ] Deduced a trap composed of 145 places in 227 ms of which 1 ms to minimize.
[2025-06-06 09:12:37] [INFO ] Deduced a trap composed of 139 places in 240 ms of which 2 ms to minimize.
[2025-06-06 09:12:37] [INFO ] Deduced a trap composed of 140 places in 224 ms of which 2 ms to minimize.
[2025-06-06 09:12:37] [INFO ] Deduced a trap composed of 140 places in 228 ms of which 2 ms to minimize.
[2025-06-06 09:12:37] [INFO ] Deduced a trap composed of 138 places in 237 ms of which 2 ms to minimize.
[2025-06-06 09:12:38] [INFO ] Deduced a trap composed of 146 places in 226 ms of which 2 ms to minimize.
[2025-06-06 09:12:38] [INFO ] Deduced a trap composed of 144 places in 226 ms of which 2 ms to minimize.
[2025-06-06 09:12:38] [INFO ] Deduced a trap composed of 141 places in 234 ms of which 2 ms to minimize.
SMT process timed out in 34387ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 34418ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35749 ms. Remains : 256/256 places, 3616/3616 transitions.
RANDOM walk for 1130 steps (0 resets) in 313 ms. (3 steps per ms) remains 0/255 properties
RANDOM walk for 433171 steps (0 resets) in 120004 ms. (3 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 533 ms. (7 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 331 ms. (12 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4001 steps (8 resets) in 225 ms. (17 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 338 ms. (11 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 331 ms. (12 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 283 ms. (14 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4001 steps (8 resets) in 323 ms. (12 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4001 steps (8 resets) in 264 ms. (15 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 306 ms. (13 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 411 ms. (9 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 331 ms. (12 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 374 ms. (10 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 273 ms. (14 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 320 ms. (12 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 368 ms. (10 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 422 ms. (9 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 301 ms. (13 steps per ms) remains 2686/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 344 ms. (11 steps per ms) remains 2685/2686 properties
BEST_FIRST walk for 4000 steps (8 resets) in 328 ms. (12 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 385 ms. (10 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4001 steps (8 resets) in 406 ms. (9 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 389 ms. (10 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 345 ms. (11 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4001 steps (8 resets) in 326 ms. (12 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 336 ms. (11 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 368 ms. (10 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 528 ms. (7 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 380 ms. (10 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 337 ms. (11 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 441 ms. (9 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 437 ms. (9 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 338 ms. (11 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4001 steps (8 resets) in 307 ms. (12 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4001 steps (8 resets) in 324 ms. (12 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 4001 steps (8 resets) in 378 ms. (10 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 297 ms. (13 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 367 ms. (10 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 291 ms. (13 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 465 ms. (8 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 400 ms. (9 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 279 ms. (14 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 320 ms. (12 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 348 ms. (11 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4001 steps (8 resets) in 352 ms. (11 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 310 ms. (12 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4001 steps (8 resets) in 333 ms. (11 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 308 ms. (12 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 312 ms. (12 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 246 ms. (16 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 276 ms. (14 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 279 ms. (14 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 384 ms. (10 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 351 ms. (11 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 279 ms. (14 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 319 ms. (12 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 368 ms. (10 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 278 ms. (14 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 473 ms. (8 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 407 ms. (9 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 384 ms. (10 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 403 ms. (9 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4001 steps (8 resets) in 285 ms. (13 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 286 ms. (13 steps per ms) remains 2685/2685 properties
Probabilistic random walk after 1000001 steps, saw 163864 distinct states, run finished after 49616 ms. (steps per millisecond=20 ) properties seen :0
[2025-06-06 09:14:05] [INFO ] Invariant cache hit.
[2025-06-06 09:14:05] [INFO ] State equation strengthened by 3390 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 15/270 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
At refinement iteration 3 (OVERLAPS) 1/256 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
[2025-06-06 09:15:32] [INFO ] Deduced a trap composed of 143 places in 217 ms of which 2 ms to minimize.
[2025-06-06 09:15:32] [INFO ] Deduced a trap composed of 139 places in 220 ms of which 2 ms to minimize.
[2025-06-06 09:15:33] [INFO ] Deduced a trap composed of 144 places in 223 ms of which 2 ms to minimize.
[2025-06-06 09:15:33] [INFO ] Deduced a trap composed of 143 places in 236 ms of which 2 ms to minimize.
[2025-06-06 09:15:33] [INFO ] Deduced a trap composed of 142 places in 223 ms of which 2 ms to minimize.
[2025-06-06 09:15:33] [INFO ] Deduced a trap composed of 138 places in 226 ms of which 2 ms to minimize.
[2025-06-06 09:15:34] [INFO ] Deduced a trap composed of 141 places in 226 ms of which 2 ms to minimize.
[2025-06-06 09:15:34] [INFO ] Deduced a trap composed of 136 places in 225 ms of which 2 ms to minimize.
[2025-06-06 09:15:34] [INFO ] Deduced a trap composed of 144 places in 227 ms of which 2 ms to minimize.
[2025-06-06 09:15:34] [INFO ] Deduced a trap composed of 139 places in 226 ms of which 2 ms to minimize.
[2025-06-06 09:15:35] [INFO ] Deduced a trap composed of 141 places in 230 ms of which 2 ms to minimize.
[2025-06-06 09:15:35] [INFO ] Deduced a trap composed of 147 places in 221 ms of which 2 ms to minimize.
[2025-06-06 09:15:35] [INFO ] Deduced a trap composed of 138 places in 225 ms of which 1 ms to minimize.
[2025-06-06 09:15:35] [INFO ] Deduced a trap composed of 140 places in 237 ms of which 1 ms to minimize.
[2025-06-06 09:15:36] [INFO ] Deduced a trap composed of 143 places in 232 ms of which 2 ms to minimize.
[2025-06-06 09:15:36] [INFO ] Deduced a trap composed of 141 places in 237 ms of which 1 ms to minimize.
[2025-06-06 09:15:36] [INFO ] Deduced a trap composed of 139 places in 232 ms of which 1 ms to minimize.
[2025-06-06 09:15:36] [INFO ] Deduced a trap composed of 137 places in 224 ms of which 1 ms to minimize.
[2025-06-06 09:15:37] [INFO ] Deduced a trap composed of 141 places in 230 ms of which 1 ms to minimize.
[2025-06-06 09:15:37] [INFO ] Deduced a trap composed of 136 places in 222 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 20/292 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
[2025-06-06 09:15:40] [INFO ] Deduced a trap composed of 140 places in 238 ms of which 2 ms to minimize.
[2025-06-06 09:15:41] [INFO ] Deduced a trap composed of 142 places in 234 ms of which 2 ms to minimize.
[2025-06-06 09:15:41] [INFO ] Deduced a trap composed of 139 places in 229 ms of which 2 ms to minimize.
[2025-06-06 09:15:41] [INFO ] Deduced a trap composed of 143 places in 225 ms of which 2 ms to minimize.
[2025-06-06 09:15:41] [INFO ] Deduced a trap composed of 139 places in 224 ms of which 2 ms to minimize.
[2025-06-06 09:15:42] [INFO ] Deduced a trap composed of 144 places in 237 ms of which 2 ms to minimize.
[2025-06-06 09:15:42] [INFO ] Deduced a trap composed of 140 places in 230 ms of which 1 ms to minimize.
[2025-06-06 09:15:42] [INFO ] Deduced a trap composed of 143 places in 229 ms of which 1 ms to minimize.
[2025-06-06 09:15:42] [INFO ] Deduced a trap composed of 148 places in 230 ms of which 1 ms to minimize.
[2025-06-06 09:15:43] [INFO ] Deduced a trap composed of 139 places in 227 ms of which 2 ms to minimize.
[2025-06-06 09:15:43] [INFO ] Deduced a trap composed of 143 places in 224 ms of which 2 ms to minimize.
[2025-06-06 09:15:43] [INFO ] Deduced a trap composed of 138 places in 230 ms of which 1 ms to minimize.
[2025-06-06 09:15:43] [INFO ] Deduced a trap composed of 144 places in 226 ms of which 2 ms to minimize.
[2025-06-06 09:15:44] [INFO ] Deduced a trap composed of 145 places in 228 ms of which 2 ms to minimize.
[2025-06-06 09:15:44] [INFO ] Deduced a trap composed of 148 places in 227 ms of which 2 ms to minimize.
[2025-06-06 09:15:44] [INFO ] Deduced a trap composed of 140 places in 229 ms of which 2 ms to minimize.
[2025-06-06 09:15:44] [INFO ] Deduced a trap composed of 147 places in 236 ms of which 2 ms to minimize.
[2025-06-06 09:15:45] [INFO ] Deduced a trap composed of 143 places in 232 ms of which 1 ms to minimize.
[2025-06-06 09:15:45] [INFO ] Deduced a trap composed of 146 places in 238 ms of which 2 ms to minimize.
[2025-06-06 09:15:45] [INFO ] Deduced a trap composed of 142 places in 228 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 20/312 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 256/3872 variables, and 312 constraints, problems are : Problem set: 0 solved, 2685 unsolved in 105051 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: 2685/2685 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 15/270 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 11/281 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
At refinement iteration 4 (OVERLAPS) 1/256 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 29/312 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
[2025-06-06 09:17:02] [INFO ] Deduced a trap composed of 139 places in 225 ms of which 2 ms to minimize.
[2025-06-06 09:17:03] [INFO ] Deduced a trap composed of 139 places in 221 ms of which 2 ms to minimize.
[2025-06-06 09:17:03] [INFO ] Deduced a trap composed of 139 places in 219 ms of which 1 ms to minimize.
[2025-06-06 09:17:03] [INFO ] Deduced a trap composed of 139 places in 240 ms of which 2 ms to minimize.
[2025-06-06 09:17:03] [INFO ] Deduced a trap composed of 139 places in 222 ms of which 1 ms to minimize.
[2025-06-06 09:17:03] [INFO ] Deduced a trap composed of 138 places in 224 ms of which 1 ms to minimize.
[2025-06-06 09:17:04] [INFO ] Deduced a trap composed of 141 places in 227 ms of which 2 ms to minimize.
[2025-06-06 09:17:04] [INFO ] Deduced a trap composed of 138 places in 226 ms of which 2 ms to minimize.
[2025-06-06 09:17:04] [INFO ] Deduced a trap composed of 139 places in 225 ms of which 2 ms to minimize.
[2025-06-06 09:17:05] [INFO ] Deduced a trap composed of 141 places in 223 ms of which 4 ms to minimize.
[2025-06-06 09:17:05] [INFO ] Deduced a trap composed of 138 places in 228 ms of which 1 ms to minimize.
[2025-06-06 09:17:05] [INFO ] Deduced a trap composed of 139 places in 227 ms of which 2 ms to minimize.
[2025-06-06 09:17:05] [INFO ] Deduced a trap composed of 141 places in 221 ms of which 2 ms to minimize.
[2025-06-06 09:17:05] [INFO ] Deduced a trap composed of 145 places in 237 ms of which 2 ms to minimize.
[2025-06-06 09:17:06] [INFO ] Deduced a trap composed of 140 places in 231 ms of which 2 ms to minimize.
[2025-06-06 09:17:06] [INFO ] Deduced a trap composed of 141 places in 224 ms of which 1 ms to minimize.
[2025-06-06 09:17:06] [INFO ] Deduced a trap composed of 146 places in 227 ms of which 2 ms to minimize.
[2025-06-06 09:17:06] [INFO ] Deduced a trap composed of 142 places in 230 ms of which 2 ms to minimize.
[2025-06-06 09:17:07] [INFO ] Deduced a trap composed of 143 places in 227 ms of which 1 ms to minimize.
[2025-06-06 09:17:07] [INFO ] Deduced a trap composed of 144 places in 226 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 20/332 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
[2025-06-06 09:17:14] [INFO ] Deduced a trap composed of 145 places in 232 ms of which 1 ms to minimize.
[2025-06-06 09:17:14] [INFO ] Deduced a trap composed of 140 places in 225 ms of which 1 ms to minimize.
[2025-06-06 09:17:15] [INFO ] Deduced a trap composed of 144 places in 232 ms of which 2 ms to minimize.
[2025-06-06 09:17:15] [INFO ] Deduced a trap composed of 143 places in 227 ms of which 1 ms to minimize.
[2025-06-06 09:17:15] [INFO ] Deduced a trap composed of 143 places in 235 ms of which 1 ms to minimize.
[2025-06-06 09:17:15] [INFO ] Deduced a trap composed of 143 places in 218 ms of which 1 ms to minimize.
[2025-06-06 09:17:15] [INFO ] Deduced a trap composed of 143 places in 229 ms of which 2 ms to minimize.
[2025-06-06 09:17:16] [INFO ] Deduced a trap composed of 144 places in 221 ms of which 1 ms to minimize.
[2025-06-06 09:17:16] [INFO ] Deduced a trap composed of 142 places in 216 ms of which 1 ms to minimize.
[2025-06-06 09:17:16] [INFO ] Deduced a trap composed of 143 places in 217 ms of which 1 ms to minimize.
[2025-06-06 09:17:16] [INFO ] Deduced a trap composed of 143 places in 214 ms of which 2 ms to minimize.
[2025-06-06 09:17:17] [INFO ] Deduced a trap composed of 143 places in 221 ms of which 1 ms to minimize.
[2025-06-06 09:17:17] [INFO ] Deduced a trap composed of 141 places in 211 ms of which 2 ms to minimize.
[2025-06-06 09:17:17] [INFO ] Deduced a trap composed of 142 places in 223 ms of which 4 ms to minimize.
[2025-06-06 09:17:17] [INFO ] Deduced a trap composed of 138 places in 218 ms of which 2 ms to minimize.
[2025-06-06 09:17:18] [INFO ] Deduced a trap composed of 138 places in 219 ms of which 2 ms to minimize.
[2025-06-06 09:17:18] [INFO ] Deduced a trap composed of 138 places in 215 ms of which 1 ms to minimize.
[2025-06-06 09:17:18] [INFO ] Deduced a trap composed of 141 places in 224 ms of which 2 ms to minimize.
[2025-06-06 09:17:18] [INFO ] Deduced a trap composed of 139 places in 216 ms of which 2 ms to minimize.
[2025-06-06 09:17:18] [INFO ] Deduced a trap composed of 138 places in 227 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 20/352 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
[2025-06-06 09:17:28] [INFO ] Deduced a trap composed of 141 places in 231 ms of which 1 ms to minimize.
[2025-06-06 09:17:28] [INFO ] Deduced a trap composed of 143 places in 229 ms of which 2 ms to minimize.
[2025-06-06 09:17:29] [INFO ] Deduced a trap composed of 143 places in 222 ms of which 1 ms to minimize.
[2025-06-06 09:17:29] [INFO ] Deduced a trap composed of 140 places in 220 ms of which 2 ms to minimize.
[2025-06-06 09:17:29] [INFO ] Deduced a trap composed of 142 places in 225 ms of which 2 ms to minimize.
[2025-06-06 09:17:29] [INFO ] Deduced a trap composed of 138 places in 225 ms of which 1 ms to minimize.
[2025-06-06 09:17:30] [INFO ] Deduced a trap composed of 146 places in 225 ms of which 1 ms to minimize.
[2025-06-06 09:17:30] [INFO ] Deduced a trap composed of 143 places in 224 ms of which 1 ms to minimize.
[2025-06-06 09:17:30] [INFO ] Deduced a trap composed of 144 places in 232 ms of which 1 ms to minimize.
[2025-06-06 09:17:30] [INFO ] Deduced a trap composed of 145 places in 229 ms of which 2 ms to minimize.
[2025-06-06 09:17:31] [INFO ] Deduced a trap composed of 147 places in 234 ms of which 2 ms to minimize.
[2025-06-06 09:17:31] [INFO ] Deduced a trap composed of 144 places in 222 ms of which 2 ms to minimize.
[2025-06-06 09:17:31] [INFO ] Deduced a trap composed of 147 places in 225 ms of which 1 ms to minimize.
[2025-06-06 09:17:31] [INFO ] Deduced a trap composed of 145 places in 227 ms of which 2 ms to minimize.
[2025-06-06 09:17:32] [INFO ] Deduced a trap composed of 145 places in 241 ms of which 2 ms to minimize.
[2025-06-06 09:17:32] [INFO ] Deduced a trap composed of 143 places in 235 ms of which 2 ms to minimize.
[2025-06-06 09:17:32] [INFO ] Deduced a trap composed of 143 places in 228 ms of which 2 ms to minimize.
[2025-06-06 09:17:32] [INFO ] Deduced a trap composed of 139 places in 225 ms of which 2 ms to minimize.
[2025-06-06 09:17:32] [INFO ] Deduced a trap composed of 138 places in 230 ms of which 2 ms to minimize.
[2025-06-06 09:17:33] [INFO ] Deduced a trap composed of 142 places in 239 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 20/372 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 256/3872 variables, and 372 constraints, problems are : Problem set: 0 solved, 2685 unsolved in 105056 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: 0/2685 constraints, Known Traps: 100/100 constraints]
After SMT, in 213175ms problems are : Problem set: 0 solved, 2685 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 255 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 57 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 57 ms. Remains : 256/256 places, 3616/3616 transitions.
RANDOM walk for 395168 steps (0 resets) in 120004 ms. (3 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 454 ms. (8 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4001 steps (8 resets) in 338 ms. (11 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 319 ms. (12 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 410 ms. (9 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 381 ms. (10 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 450 ms. (8 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4001 steps (8 resets) in 318 ms. (12 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 364 ms. (10 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 409 ms. (9 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 431 ms. (9 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 348 ms. (11 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 347 ms. (11 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 383 ms. (10 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 333 ms. (11 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 366 ms. (10 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 389 ms. (10 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 354 ms. (11 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4001 steps (8 resets) in 447 ms. (8 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4001 steps (8 resets) in 298 ms. (13 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 504 ms. (7 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 251 ms. (15 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 498 ms. (8 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 375 ms. (10 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 506 ms. (7 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 320 ms. (12 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 396 ms. (10 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 279 ms. (14 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 496 ms. (8 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 351 ms. (11 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 449 ms. (8 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 284 ms. (14 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 536 ms. (7 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 396 ms. (10 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 328 ms. (12 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 427 ms. (9 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 400 ms. (9 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 298 ms. (13 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 280 ms. (14 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 507 ms. (7 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4001 steps (8 resets) in 339 ms. (11 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 267 ms. (14 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 278 ms. (14 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 511 ms. (7 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 302 ms. (13 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4001 steps (8 resets) in 371 ms. (10 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4001 steps (8 resets) in 536 ms. (7 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 418 ms. (9 steps per ms) remains 2685/2685 properties
BEST_FIRST walk for 4000 steps (8 resets) in 359 ms. (11 steps per ms) remains 2685/2685 properties
Probabilistic random walk after 1000001 steps, saw 163864 distinct states, run finished after 46489 ms. (steps per millisecond=21 ) properties seen :0
[2025-06-06 09:19:01] [INFO ] Invariant cache hit.
[2025-06-06 09:19:01] [INFO ] State equation strengthened by 3390 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 15/270 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
At refinement iteration 3 (OVERLAPS) 1/256 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
[2025-06-06 09:20:30] [INFO ] Deduced a trap composed of 143 places in 240 ms of which 2 ms to minimize.
[2025-06-06 09:20:30] [INFO ] Deduced a trap composed of 139 places in 233 ms of which 2 ms to minimize.
[2025-06-06 09:20:31] [INFO ] Deduced a trap composed of 144 places in 233 ms of which 2 ms to minimize.
[2025-06-06 09:20:31] [INFO ] Deduced a trap composed of 143 places in 230 ms of which 2 ms to minimize.
[2025-06-06 09:20:31] [INFO ] Deduced a trap composed of 142 places in 227 ms of which 2 ms to minimize.
[2025-06-06 09:20:31] [INFO ] Deduced a trap composed of 138 places in 234 ms of which 2 ms to minimize.
[2025-06-06 09:20:32] [INFO ] Deduced a trap composed of 141 places in 226 ms of which 2 ms to minimize.
[2025-06-06 09:20:32] [INFO ] Deduced a trap composed of 136 places in 228 ms of which 2 ms to minimize.
[2025-06-06 09:20:32] [INFO ] Deduced a trap composed of 144 places in 233 ms of which 1 ms to minimize.
[2025-06-06 09:20:32] [INFO ] Deduced a trap composed of 139 places in 236 ms of which 2 ms to minimize.
[2025-06-06 09:20:33] [INFO ] Deduced a trap composed of 141 places in 237 ms of which 2 ms to minimize.
[2025-06-06 09:20:33] [INFO ] Deduced a trap composed of 147 places in 235 ms of which 2 ms to minimize.
[2025-06-06 09:20:33] [INFO ] Deduced a trap composed of 138 places in 231 ms of which 2 ms to minimize.
[2025-06-06 09:20:33] [INFO ] Deduced a trap composed of 140 places in 233 ms of which 2 ms to minimize.
[2025-06-06 09:20:34] [INFO ] Deduced a trap composed of 143 places in 235 ms of which 2 ms to minimize.
[2025-06-06 09:20:34] [INFO ] Deduced a trap composed of 141 places in 239 ms of which 2 ms to minimize.
[2025-06-06 09:20:34] [INFO ] Deduced a trap composed of 139 places in 227 ms of which 2 ms to minimize.
[2025-06-06 09:20:35] [INFO ] Deduced a trap composed of 137 places in 244 ms of which 2 ms to minimize.
[2025-06-06 09:20:35] [INFO ] Deduced a trap composed of 141 places in 237 ms of which 1 ms to minimize.
[2025-06-06 09:20:35] [INFO ] Deduced a trap composed of 136 places in 230 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 20/292 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
[2025-06-06 09:20:39] [INFO ] Deduced a trap composed of 140 places in 235 ms of which 2 ms to minimize.
[2025-06-06 09:20:39] [INFO ] Deduced a trap composed of 142 places in 237 ms of which 2 ms to minimize.
[2025-06-06 09:20:39] [INFO ] Deduced a trap composed of 139 places in 236 ms of which 2 ms to minimize.
[2025-06-06 09:20:40] [INFO ] Deduced a trap composed of 143 places in 235 ms of which 2 ms to minimize.
[2025-06-06 09:20:40] [INFO ] Deduced a trap composed of 139 places in 256 ms of which 2 ms to minimize.
[2025-06-06 09:20:40] [INFO ] Deduced a trap composed of 144 places in 238 ms of which 2 ms to minimize.
[2025-06-06 09:20:40] [INFO ] Deduced a trap composed of 140 places in 237 ms of which 2 ms to minimize.
[2025-06-06 09:20:41] [INFO ] Deduced a trap composed of 143 places in 230 ms of which 1 ms to minimize.
[2025-06-06 09:20:41] [INFO ] Deduced a trap composed of 148 places in 230 ms of which 2 ms to minimize.
[2025-06-06 09:20:41] [INFO ] Deduced a trap composed of 139 places in 231 ms of which 2 ms to minimize.
[2025-06-06 09:20:41] [INFO ] Deduced a trap composed of 143 places in 232 ms of which 1 ms to minimize.
[2025-06-06 09:20:42] [INFO ] Deduced a trap composed of 138 places in 241 ms of which 1 ms to minimize.
[2025-06-06 09:20:42] [INFO ] Deduced a trap composed of 144 places in 237 ms of which 2 ms to minimize.
[2025-06-06 09:20:42] [INFO ] Deduced a trap composed of 145 places in 232 ms of which 1 ms to minimize.
[2025-06-06 09:20:42] [INFO ] Deduced a trap composed of 148 places in 234 ms of which 2 ms to minimize.
[2025-06-06 09:20:43] [INFO ] Deduced a trap composed of 140 places in 243 ms of which 2 ms to minimize.
[2025-06-06 09:20:43] [INFO ] Deduced a trap composed of 147 places in 238 ms of which 1 ms to minimize.
[2025-06-06 09:20:43] [INFO ] Deduced a trap composed of 143 places in 234 ms of which 2 ms to minimize.
[2025-06-06 09:20:43] [INFO ] Deduced a trap composed of 146 places in 232 ms of which 2 ms to minimize.
[2025-06-06 09:20:44] [INFO ] Deduced a trap composed of 142 places in 241 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 20/312 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 256/3872 variables, and 312 constraints, problems are : Problem set: 0 solved, 2685 unsolved in 120044 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: 2685/2685 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 15/270 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 11/281 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
At refinement iteration 4 (OVERLAPS) 1/256 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 29/312 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
[2025-06-06 09:22:14] [INFO ] Deduced a trap composed of 139 places in 238 ms of which 2 ms to minimize.
[2025-06-06 09:22:15] [INFO ] Deduced a trap composed of 139 places in 227 ms of which 2 ms to minimize.
[2025-06-06 09:22:15] [INFO ] Deduced a trap composed of 139 places in 227 ms of which 2 ms to minimize.
[2025-06-06 09:22:15] [INFO ] Deduced a trap composed of 139 places in 225 ms of which 2 ms to minimize.
[2025-06-06 09:22:15] [INFO ] Deduced a trap composed of 139 places in 228 ms of which 1 ms to minimize.
[2025-06-06 09:22:16] [INFO ] Deduced a trap composed of 138 places in 223 ms of which 2 ms to minimize.
[2025-06-06 09:22:16] [INFO ] Deduced a trap composed of 141 places in 221 ms of which 2 ms to minimize.
[2025-06-06 09:22:16] [INFO ] Deduced a trap composed of 138 places in 222 ms of which 2 ms to minimize.
[2025-06-06 09:22:16] [INFO ] Deduced a trap composed of 139 places in 235 ms of which 1 ms to minimize.
[2025-06-06 09:22:17] [INFO ] Deduced a trap composed of 141 places in 226 ms of which 1 ms to minimize.
[2025-06-06 09:22:17] [INFO ] Deduced a trap composed of 138 places in 225 ms of which 2 ms to minimize.
[2025-06-06 09:22:17] [INFO ] Deduced a trap composed of 139 places in 224 ms of which 2 ms to minimize.
[2025-06-06 09:22:17] [INFO ] Deduced a trap composed of 141 places in 223 ms of which 1 ms to minimize.
[2025-06-06 09:22:18] [INFO ] Deduced a trap composed of 145 places in 224 ms of which 2 ms to minimize.
[2025-06-06 09:22:18] [INFO ] Deduced a trap composed of 140 places in 224 ms of which 1 ms to minimize.
[2025-06-06 09:22:18] [INFO ] Deduced a trap composed of 141 places in 229 ms of which 2 ms to minimize.
[2025-06-06 09:22:18] [INFO ] Deduced a trap composed of 146 places in 225 ms of which 2 ms to minimize.
[2025-06-06 09:22:19] [INFO ] Deduced a trap composed of 142 places in 231 ms of which 1 ms to minimize.
[2025-06-06 09:22:19] [INFO ] Deduced a trap composed of 143 places in 227 ms of which 1 ms to minimize.
[2025-06-06 09:22:19] [INFO ] Deduced a trap composed of 144 places in 217 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 20/332 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
[2025-06-06 09:22:26] [INFO ] Deduced a trap composed of 145 places in 228 ms of which 2 ms to minimize.
[2025-06-06 09:22:27] [INFO ] Deduced a trap composed of 140 places in 233 ms of which 2 ms to minimize.
[2025-06-06 09:22:27] [INFO ] Deduced a trap composed of 144 places in 225 ms of which 2 ms to minimize.
[2025-06-06 09:22:27] [INFO ] Deduced a trap composed of 143 places in 225 ms of which 2 ms to minimize.
[2025-06-06 09:22:27] [INFO ] Deduced a trap composed of 143 places in 221 ms of which 1 ms to minimize.
[2025-06-06 09:22:28] [INFO ] Deduced a trap composed of 143 places in 241 ms of which 1 ms to minimize.
[2025-06-06 09:22:28] [INFO ] Deduced a trap composed of 143 places in 229 ms of which 1 ms to minimize.
[2025-06-06 09:22:28] [INFO ] Deduced a trap composed of 144 places in 226 ms of which 1 ms to minimize.
[2025-06-06 09:22:28] [INFO ] Deduced a trap composed of 142 places in 224 ms of which 1 ms to minimize.
[2025-06-06 09:22:29] [INFO ] Deduced a trap composed of 143 places in 236 ms of which 2 ms to minimize.
[2025-06-06 09:22:29] [INFO ] Deduced a trap composed of 143 places in 232 ms of which 2 ms to minimize.
[2025-06-06 09:22:29] [INFO ] Deduced a trap composed of 143 places in 220 ms of which 2 ms to minimize.
[2025-06-06 09:22:29] [INFO ] Deduced a trap composed of 141 places in 229 ms of which 2 ms to minimize.
[2025-06-06 09:22:30] [INFO ] Deduced a trap composed of 142 places in 223 ms of which 2 ms to minimize.
[2025-06-06 09:22:30] [INFO ] Deduced a trap composed of 138 places in 233 ms of which 1 ms to minimize.
[2025-06-06 09:22:30] [INFO ] Deduced a trap composed of 138 places in 230 ms of which 2 ms to minimize.
[2025-06-06 09:22:30] [INFO ] Deduced a trap composed of 138 places in 230 ms of which 1 ms to minimize.
[2025-06-06 09:22:30] [INFO ] Deduced a trap composed of 141 places in 231 ms of which 1 ms to minimize.
[2025-06-06 09:22:31] [INFO ] Deduced a trap composed of 139 places in 233 ms of which 2 ms to minimize.
[2025-06-06 09:22:31] [INFO ] Deduced a trap composed of 138 places in 231 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 20/352 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
[2025-06-06 09:22:41] [INFO ] Deduced a trap composed of 141 places in 235 ms of which 2 ms to minimize.
[2025-06-06 09:22:41] [INFO ] Deduced a trap composed of 143 places in 226 ms of which 2 ms to minimize.
[2025-06-06 09:22:41] [INFO ] Deduced a trap composed of 143 places in 229 ms of which 2 ms to minimize.
[2025-06-06 09:22:41] [INFO ] Deduced a trap composed of 140 places in 235 ms of which 2 ms to minimize.
[2025-06-06 09:22:42] [INFO ] Deduced a trap composed of 142 places in 232 ms of which 2 ms to minimize.
[2025-06-06 09:22:42] [INFO ] Deduced a trap composed of 138 places in 233 ms of which 2 ms to minimize.
[2025-06-06 09:22:42] [INFO ] Deduced a trap composed of 146 places in 228 ms of which 2 ms to minimize.
[2025-06-06 09:22:42] [INFO ] Deduced a trap composed of 143 places in 230 ms of which 2 ms to minimize.
[2025-06-06 09:22:43] [INFO ] Deduced a trap composed of 144 places in 234 ms of which 2 ms to minimize.
[2025-06-06 09:22:43] [INFO ] Deduced a trap composed of 145 places in 228 ms of which 1 ms to minimize.
[2025-06-06 09:22:43] [INFO ] Deduced a trap composed of 147 places in 238 ms of which 1 ms to minimize.
[2025-06-06 09:22:43] [INFO ] Deduced a trap composed of 144 places in 234 ms of which 1 ms to minimize.
[2025-06-06 09:22:44] [INFO ] Deduced a trap composed of 147 places in 240 ms of which 2 ms to minimize.
[2025-06-06 09:22:44] [INFO ] Deduced a trap composed of 145 places in 230 ms of which 2 ms to minimize.
[2025-06-06 09:22:44] [INFO ] Deduced a trap composed of 145 places in 227 ms of which 3 ms to minimize.
[2025-06-06 09:22:44] [INFO ] Deduced a trap composed of 143 places in 234 ms of which 1 ms to minimize.
[2025-06-06 09:22:45] [INFO ] Deduced a trap composed of 143 places in 233 ms of which 2 ms to minimize.
[2025-06-06 09:22:45] [INFO ] Deduced a trap composed of 139 places in 235 ms of which 1 ms to minimize.
[2025-06-06 09:22:45] [INFO ] Deduced a trap composed of 138 places in 235 ms of which 2 ms to minimize.
[2025-06-06 09:22:45] [INFO ] Deduced a trap composed of 142 places in 241 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 20/372 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
[2025-06-06 09:22:57] [INFO ] Deduced a trap composed of 139 places in 236 ms of which 2 ms to minimize.
[2025-06-06 09:22:57] [INFO ] Deduced a trap composed of 136 places in 235 ms of which 2 ms to minimize.
[2025-06-06 09:22:58] [INFO ] Deduced a trap composed of 138 places in 231 ms of which 2 ms to minimize.
[2025-06-06 09:22:58] [INFO ] Deduced a trap composed of 140 places in 228 ms of which 2 ms to minimize.
[2025-06-06 09:22:58] [INFO ] Deduced a trap composed of 141 places in 225 ms of which 2 ms to minimize.
[2025-06-06 09:22:58] [INFO ] Deduced a trap composed of 143 places in 239 ms of which 1 ms to minimize.
[2025-06-06 09:22:59] [INFO ] Deduced a trap composed of 138 places in 245 ms of which 2 ms to minimize.
[2025-06-06 09:22:59] [INFO ] Deduced a trap composed of 139 places in 229 ms of which 2 ms to minimize.
[2025-06-06 09:22:59] [INFO ] Deduced a trap composed of 139 places in 241 ms of which 2 ms to minimize.
[2025-06-06 09:22:59] [INFO ] Deduced a trap composed of 138 places in 230 ms of which 1 ms to minimize.
[2025-06-06 09:23:00] [INFO ] Deduced a trap composed of 144 places in 234 ms of which 2 ms to minimize.
[2025-06-06 09:23:00] [INFO ] Deduced a trap composed of 142 places in 234 ms of which 2 ms to minimize.
[2025-06-06 09:23:00] [INFO ] Deduced a trap composed of 143 places in 228 ms of which 1 ms to minimize.
[2025-06-06 09:23:00] [INFO ] Deduced a trap composed of 140 places in 230 ms of which 2 ms to minimize.
[2025-06-06 09:23:01] [INFO ] Deduced a trap composed of 140 places in 238 ms of which 2 ms to minimize.
[2025-06-06 09:23:01] [INFO ] Deduced a trap composed of 139 places in 240 ms of which 2 ms to minimize.
[2025-06-06 09:23:01] [INFO ] Deduced a trap composed of 139 places in 236 ms of which 2 ms to minimize.
[2025-06-06 09:23:01] [INFO ] Deduced a trap composed of 144 places in 238 ms of which 2 ms to minimize.
[2025-06-06 09:23:02] [INFO ] Deduced a trap composed of 143 places in 234 ms of which 2 ms to minimize.
[2025-06-06 09:23:02] [INFO ] Deduced a trap composed of 141 places in 241 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 2685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 256/3872 variables, and 392 constraints, problems are : Problem set: 0 solved, 2685 unsolved in 120045 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: 0/2685 constraints, Known Traps: 120/120 constraints]
After SMT, in 243124ms problems are : Problem set: 0 solved, 2685 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 255 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 56 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 56 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 40 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 09:23:04] [INFO ] Invariant cache hit.
[2025-06-06 09:23:04] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-06 09:23:04] [INFO ] Invariant cache hit.
[2025-06-06 09:23:05] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 09:23:05] [INFO ] Implicit Places using invariants and state equation in 818 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
[2025-06-06 09:23:05] [INFO ] Redundant transitions in 239 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 09:23:05] [INFO ] Invariant cache hit.
[2025-06-06 09:23:05] [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:23:30] [INFO ] Deduced a trap composed of 147 places in 256 ms of which 2 ms to minimize.
[2025-06-06 09:23:30] [INFO ] Deduced a trap composed of 140 places in 249 ms of which 1 ms to minimize.
[2025-06-06 09:23:30] [INFO ] Deduced a trap composed of 145 places in 249 ms of which 2 ms to minimize.
[2025-06-06 09:23:31] [INFO ] Deduced a trap composed of 145 places in 251 ms of which 2 ms to minimize.
[2025-06-06 09:23:31] [INFO ] Deduced a trap composed of 146 places in 254 ms of which 2 ms to minimize.
[2025-06-06 09:23:31] [INFO ] Deduced a trap composed of 145 places in 245 ms of which 2 ms to minimize.
[2025-06-06 09:23:31] [INFO ] Deduced a trap composed of 141 places in 249 ms of which 1 ms to minimize.
[2025-06-06 09:23:32] [INFO ] Deduced a trap composed of 142 places in 262 ms of which 2 ms to minimize.
[2025-06-06 09:23:32] [INFO ] Deduced a trap composed of 148 places in 247 ms of which 1 ms to minimize.
[2025-06-06 09:23:32] [INFO ] Deduced a trap composed of 147 places in 254 ms of which 1 ms to minimize.
[2025-06-06 09:23:32] [INFO ] Deduced a trap composed of 139 places in 231 ms of which 2 ms to minimize.
[2025-06-06 09:23:33] [INFO ] Deduced a trap composed of 137 places in 227 ms of which 2 ms to minimize.
[2025-06-06 09:23:33] [INFO ] Deduced a trap composed of 143 places in 231 ms of which 2 ms to minimize.
[2025-06-06 09:23:33] [INFO ] Deduced a trap composed of 140 places in 231 ms of which 2 ms to minimize.
[2025-06-06 09:23:33] [INFO ] Deduced a trap composed of 141 places in 229 ms of which 2 ms to minimize.
[2025-06-06 09:23:34] [INFO ] Deduced a trap composed of 148 places in 231 ms of which 1 ms to minimize.
[2025-06-06 09:23:34] [INFO ] Deduced a trap composed of 142 places in 251 ms of which 2 ms to minimize.
[2025-06-06 09:23:35] [INFO ] Deduced a trap composed of 142 places in 251 ms of which 1 ms to minimize.
[2025-06-06 09:23:35] [INFO ] Deduced a trap composed of 142 places in 255 ms of which 2 ms to minimize.
[2025-06-06 09:23:35] [INFO ] Deduced a trap composed of 141 places in 250 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:23:37] [INFO ] Deduced a trap composed of 144 places in 237 ms of which 2 ms to minimize.
[2025-06-06 09:23:38] [INFO ] Deduced a trap composed of 145 places in 234 ms of which 2 ms to minimize.
[2025-06-06 09:23:38] [INFO ] Deduced a trap composed of 139 places in 234 ms of which 1 ms to minimize.
[2025-06-06 09:23:38] [INFO ] Deduced a trap composed of 140 places in 241 ms of which 2 ms to minimize.
[2025-06-06 09:23:38] [INFO ] Deduced a trap composed of 140 places in 241 ms of which 1 ms to minimize.
[2025-06-06 09:23:39] [INFO ] Deduced a trap composed of 138 places in 239 ms of which 2 ms to minimize.
[2025-06-06 09:23:39] [INFO ] Deduced a trap composed of 146 places in 234 ms of which 1 ms to minimize.
[2025-06-06 09:23:39] [INFO ] Deduced a trap composed of 144 places in 228 ms of which 2 ms to minimize.
[2025-06-06 09:23:39] [INFO ] Deduced a trap composed of 141 places in 233 ms of which 2 ms to minimize.
[2025-06-06 09:23:40] [INFO ] Deduced a trap composed of 140 places in 238 ms of which 1 ms to minimize.
[2025-06-06 09:23:40] [INFO ] Deduced a trap composed of 141 places in 229 ms of which 1 ms to minimize.
SMT process timed out in 34505ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 34534ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35723 ms. Remains : 256/256 places, 3616/3616 transitions.
RANDOM walk for 1135 steps (0 resets) in 32 ms. (34 steps per ms) remains 0/255 properties
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Redundant composition of simpler transitions.) removed 3110 transitions
Redundant transition composition rules discarded 3110 transitions
Iterating global reduction 0 with 3110 rules applied. Total rules applied 3110 place count 256 transition count 506
Applied a total of 3110 rules in 40 ms. Remains 256 /256 variables (removed 0) and now considering 506/3616 (removed 3110) transitions.
Running SMT prover for 2685 properties.
// Phase 1: matrix 506 rows 256 cols
[2025-06-06 09:23:40] [INFO ] Computed 16 invariants in 6 ms
[2025-06-06 09:23:51] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2025-06-06 09:24:47] [INFO ] After 45833ms SMT Verify possible using state equation in real domain returned unsat :0 sat :499 real:2186
TRAPS : Iteration 0
[2025-06-06 09:25:00] [INFO ] After 58001ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :499 real:2186
[2025-06-06 09:25:07] [INFO ] After 86111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :499 real:2186
[2025-06-06 09:25:17] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2025-06-06 09:26:03] [INFO ] After 35999ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2685
TRAPS : Iteration 0
[2025-06-06 09:27:03] [INFO ] After 96261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2685
[2025-06-06 09:27:40] [INFO ] After 153479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2685
Over-approximation ignoring read arcs solved 0 properties in 240107 ms.
Unable to solve all queries for examination QuasiLiveness. Remains :2685 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 2685 properties from file /home/mcc/execution/QuasiLiveness.xml in 3 ms.
Working with output stream class java.io.PrintStream
Total runtime 1480207 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: 1.77

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.096
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 2.245
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: 2021
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 QuasiLiveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TokenRing-PT-015"
export BK_EXAMINATION="QuasiLiveness"
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 QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r252-tall-174915605600217"
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 [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;