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.r084-tall-174860080400313.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 DoubleExponent-PT-020, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r084-tall-174860080400313
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 340K May 29 14:32 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 StableMarking

=== Now, execution of the tool begins

BK_START 1748736504863

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 00:08:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 00:08:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 00:08:26] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2025-06-01 00:08:26] [INFO ] Transformed 1064 places.
[2025-06-01 00:08:26] [INFO ] Transformed 998 transitions.
[2025-06-01 00:08:26] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 222 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 12 ms.
RANDOM walk for 40000 steps (1318 resets) in 2861 ms. (13 steps per ms) remains 973/1053 properties
BEST_FIRST walk for 120 steps (8 resets) in 16 ms. (7 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 19 ms. (6 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 29 ms. (4 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 28 ms. (4 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 16 ms. (7 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 16 ms. (7 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 16 ms. (7 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 17 ms. (6 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 17 ms. (6 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 26 ms. (4 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 973/973 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 973/973 properties
Probabilistic random walk after 30000 steps, saw 15006 distinct states, run finished after 1759 ms. (steps per millisecond=17 ) properties seen :55
// Phase 1: matrix 998 rows 1064 cols
[2025-06-01 00:08:29] [INFO ] Invariants computation overflowed in 135 ms
Error getting values : (error "ParserException while parsing response: ((s3 (/ 1.0 2.0))
(s4 (/ 1.0 2.0))
(s5 (/ 1.0 2.0))
(s6 (/ 1.0 2.0))
(s7 (/ 1.0 2.0))
(s8 (/ 1.0 2.0))
(s9 (/ 1.0 2.0))
(s10 (/ 1.0 2.0))
(s11 (/ 1.0 2.0))
(s12 (/ 1.0 2.0))
(s14 (/ 1.0 2.0))
(s15 (/ 1.0 2.0))
(s16 (/ 1.0 2.0))
(s17 (/ 1.0 2.0))
(s18 (/ 1.0 2.0))
(s19 (/ 1.0 2.0))
(s20 (/ 1.0 2.0))
(s21 (/ 1.0 2.0))
(s22 (/ 1.0 2.0))
(s23 (/ 1.0 2.0))
(s25 (/ 1.0 2.0))
(s26 (/ 1.0 2.0))
(s27 (/ 1.0 2.0))
(s28 (/ 1.0 2.0))
(s29 (/ 1.0 2.0))
(s30 (/ 1.0 2.0))
(s31 (/ 1.0 2.0))
(s32 (/ 1.0 2.0))
(s33 (/ 1.0 2.0))
(s34 (/ 1.0 2.0))
(s36 (/ 1.0 2.0))
(s37 (/ 1.0 2.0))
(s38 (/ 1.0 2.0))
(s39 (/ 1.0 2.0))
(s40 (/ 1.0 2.0))
(s41 (/ 1.0 2.0))
(s42 (/ 1.0 2.0))
(s43 (/ 1.0 2.0))
(s44 (/ 1.0 2.0))
(s45 (/ 1.0 2.0))
(s47 (/ 1.0 2.0))
(s48 (/ 1.0 2.0))
(s49 (/ 1.0 2.0))
(s50 (/ 1.0 2.0))
(s51 (/ 1.0 2.0))
(s52 (/ 1.0 2.0))
(s53 (/ 1.0 2.0))
(s54 (/ 1.0 2.0))
(s55 (/ 1.0 2.0))
(s56 (/ 1.0 2.0))
(s58 (/ 1.0 2.0))
(s59 (/ 1.0 2.0))
(s60 (/ 1.0 2.0))
(s61 (/ 1.0 2.0))
(s62 (/ 1.0 2.0))
(s63 (/ 1.0 2.0))
(s64 (/ 1.0 2.0))
(s65 (/ 1.0 2.0))
(s66 (/ 1.0 2.0))
(s67 (/ 1.0 2.0))
(s69 (/ 1.0 2.0))
(s70 (/ 1.0 2.0))
(s71 (/ 1.0 2.0))
(s72 (/ 1.0 2.0))
(s73 (/ 1.0 2.0))
(s92 (/ 1.0 2.0))
(s93 (/ 1.0 2.0))
(s94 (/ 1.0 2.0))
(s107 (/ 1.0 2.0))
(s108 (/ 1.0 2.0))
(s109 (/ 1.0 2.0))
(s111 (/ 1.0 2.0))
(s112 (/ 1.0 2.0))
(s113 (/ 1.0 2.0))
(s114 (/ 1.0 2.0))
(s115 (/ 1.0 2.0))
(s116 (/ 1.0 2.0))
(s117 (/ 1.0 2.0))
(s118 (/ 1.0 2.0))
(s119 (/ 1.0 2.0))
(s120 (/ 1.0 2.0))
(s133 (/ 1.0 2.0))
(s137 (/ 1.0 2.0))
(s138 (/ 1.0 2.0))
(s139 (/ 1.0 2.0))
(s140 (/ 1.0 2.0))
(s141 (/ 1.0 2.0))
(s142 (/ 1.0 2.0))
(s144 (/ 1.0 2.0))
(s145 (/ 1.0 2.0))
(s146 (/ 1.0 2.0))
(s147 (/ 1.0 2.0))
(s148 (/ 1.0 2.0))
(s149 (/ 1.0 2.0))
(s150 (/ 1.0 2.0))
(s151 (/ 1.0 2.0))
(s152 (/ 1.0 2.0))
(s153 (/ 1.0 2.0))
(s155 (/ 1.0 2.0))
(s156 (/ 1.0 2.0))
(s157 (/ 1.0 2.0))
(s158 (/ 1.0 2.0))
(s159 (/ 1.0 2.0))
(s160 (/ 1.0 2.0))
(s161 (/ 1.0 2.0))
(s162 (/ 1.0 2.0))
(s163 (/ 1.0 2.0))
(s164 (/ 1.0 2.0))
(s166 (/ 1.0 2.0))
(s167 (/ 1.0 2.0))
(s168 (/ 1.0 2.0))
(s169 (/ 1.0 2.0))
(s170 (/ 1.0 2.0))
(s171 (/ 1.0 2.0))
(s172 (/ 1.0 2.0))
(s173 (/ 1.0 2.0))
(s174 (/ 1.0 2.0))
(s175 (/ 1.0 2.0))
(s178 (/ 1.0 2.0))
(s179 (/ 1.0 2.0))
(s180 (/ 1.0 2.0))
(s181 (/ 1.0 2.0))
(s182 (/ 1.0 2.0))
(s183 (/ 1.0 2.0))
(s184 (/ 1.0 2.0))
(s185 (/ 1.0 2.0))
(s186 (/ 1.0 2.0))
(s187 (/ 1.0 2.0))
(s189 (/ 1.0 2.0))
(s190 (/ 1.0 2.0))
(s191 (/ 1.0 2.0))
(s192 (/ 1.0 2.0))
(s193 (/ 1.0 2.0))
(s194 (/ 1.0 2.0))
(s195 (/ 1.0 2.0))
(s196 (/ 1.0 2.0))
(s197 (/ 1.0 2.0))
(s198 (/ 1.0 2.0))
(s200 (/ 1.0 2.0))
(s201 (/ 1.0 2.0))
(s202 (/ 1.0 2.0))
(s203 (/ 1.0 2.0))
(s204 (/ 1.0 2.0))
(s205 (/ 1.0 2.0))
(s206 (/ 1.0 2.0))
(s207 (/ 1.0 2.0))
(s208 (/ 1.0 2.0))
(s209 (/ 1.0 2.0))
(s211 (/ 1.0 2.0))
(s212 (/ 1.0 2.0))
(s213 (/ 1.0 2.0))
(s214 (/ 1.0 2.0))
(s215 (/ 1.0 2.0))
(s216 (/ 1.0 2.0))
(s217 (/ 1.0 2.0))
(s218 (/ 1.0 2.0))
(s219 (/ 1.0 2.0))
(s220 (/ 1.0 2.0))
(s222 (/ 1.0 2.0))
(s223 (/ 1.0 2.0))
(s224 (/ 1.0 2.0))
(s225 (/ 1.0 2.0))
(s226 (/ 1.0 2.0))
(s227 (/ 1.0 2.0))
(s228 (/ 1.0 2.0))
(s229 (/ 1.0 2.0))
(s230 (/ 1.0 2.0))
(s231 (/ 1.0 2.0))
(s233 (/ 1.0 2.0))
(s234 (/ 1.0 2.0))
(s235 (/ 1.0 2.0))
(s236 (/ 1.0 2.0))
(s237 (/ 1.0 2.0))
(s238 (/ 1.0 2.0))
(s239 (/ 1.0 2.0))
(s240 (/ 1.0 2.0))
(s241 (/ 1.0 2.0))
(s242 (/ 1.0 2.0))
(s244 (/ 1.0 2.0))
(s245 (/ 1.0 2.0))
(s246 (/ 1.0 2.0))
(s247 (/ 1.0 2.0))
(s248 (/ 1.0 2.0))
(s249 (/ 1.0 2.0))
(s250 (/ 1.0 2.0))
(s251 (/ 1.0 2.0))
(s252 (/ 1.0 2.0))
(s253 (/ 1.0 2.0))
(s255 (/ 1.0 2.0))
(s256 (/ 1.0 2.0))
(s257 (/ 1.0 2.0))
(s258 (/ 1.0 2.0))
(s259 (/ 1.0 2.0))
(s260 (/ 1.0 2.0))
(s261 (/ 1.0 2.0))
(s262 (/ 1.0 2.0))
(s263 (/ 1.0 2.0))
(s264 (/ 1.0 2.0))
(s266 (/ 1.0 2.0))
(s267 (/ 1.0 2.0))
(s268 (/ 1.0 2.0))
(s269 (/ 1.0 2.0))
(s270 (/ 1.0 2.0))
(s271 (/ 1.0 2.0))
(s272 (/ 1.0 2.0))
(s273 (/ 1.0 2.0))
(s274 (/ 1.0 2.0))
(s275 (/ 1.0 2.0))
(s277 (/ 1.0 2.0))
(s278 (/ 1.0 2.0))
(s279 (/ 1.0 2.0))
(s280 (/ 1.0 2.0))
(s281 (/ 1.0 2.0))
(s282 (/ 1.0 2.0))
(s283 (/ 1.0 2.0))
(s284 (/ 1.0 2.0))
(s285 (/ 1.0 2.0))
(s286 (/ 1.0 2.0))
(s289 (/ 1.0 2.0))
(s290 (/ 1.0 2.0))
(s291 (/ 1.0 2.0))
(s292 (/ 1.0 2.0))
(s293 (/ 1.0 2.0))
(s294 (/ 1.0 2.0))
(s295 (/ 1.0 2.0))
(s296 (/ 1.0 2.0))
(s297 (/ 1.0 2.0))
(s298 (/ 1.0 2.0))
(s300 (/ 1.0 2.0))
(s301 (/ 1.0 2.0))
(s302 (/ 1.0 2.0))
(s303 (/ 1.0 2.0))
(s304 (/ 1.0 2.0))
(s305 (/ 1.0 2.0))
(s306 (/ 1.0 2.0))
(s307 (/ 1.0 2.0))
(s308 (/ 1.0 2.0))
(s309 (/ 1.0 2.0))
(s311 (/ 1.0 2.0))
(s312 (/ 1.0 2.0))
(s313 (/ 1.0 2.0))
(s314 (/ 1.0 2.0))
(s315 (/ 1.0 2.0))
(s316 (/ 1.0 2.0))
(s317 (/ 1.0 2.0))
(s318 (/ 1.0 2.0))
(s319 (/ 1.0 2.0))
(s320 (/ 1.0 2.0))
(s322 (/ 1.0 2.0))
(s323 (/ 1.0 2.0))
(s324 (/ 1.0 2.0))
(s325 (/ 1.0 2.0))
(s326 (/ 1.0 2.0))
(s327 (/ 1.0 2.0))
(s328 (/ 1.0 2.0))
(s329 (/ 1.0 2.0))
(s330 (/ 1.0 2.0))
(s331 (/ 1.0 2.0))
(s333 (/ 1.0 2.0))
(s334 (/ 1.0 2.0))
(s335 (/ 1.0 2.0))
(s336 (/ 1.0 2.0))
(s337 (/ 1.0 2.0))
(s338 (/ 1.0 2.0))
(s339 (/ 1.0 2.0))
(s340 (/ 1.0 2.0))
(s341 (/ 1.0 2.0))
(s342 (/ 1.0 2.0))
(s344 (/ 1.0 2.0))
(s345 (/ 1.0 2.0))
(s346 (/ 1.0 2.0))
(s347 (/ 1.0 2.0))
(s348 (/ 1.0 2.0))
(s349 (/ 1.0 2.0))
(s350 (/ 1.0 2.0))
(s351 (/ 1.0 2.0))
(s352 (/ 1.0 2.0))
(s353 (/ 1.0 2.0))
(s355 (/ 1.0 2.0))
(s356 (/ 1.0 2.0))
(s357 (/ 1.0 2.0))
(s358 (/ 1.0 2.0))
(s359 (/ 1.0 2.0))
(s360 (/ 1.0 2.0))
(s361 (/ 1.0 2.0))
(s362 (/ 1.0 2.0))
(s363 (/ 1.0 2.0))
(s364 (/ 1.0 2.0))
(s366 (/ 1.0 2.0))
(s367 (/ 1.0 2.0))
(s368 (/ 1.0 2.0))
(s369 (/ 1.0 2.0))
(s370 (/ 1.0 2.0))
(s371 (/ 1.0 2.0))
(s372 (/ 1.0 2.0))
(s373 (/ 1.0 2.0))
(s374 (/ 1.0 2.0))
(s375 (/ 1.0 2.0))
(s377 (/ 1.0 2.0))
(s378 (/ 1.0 2.0))
(s379 (/ 1.0 2.0))
(s380 (/ 1.0 2.0))
(s381 (/ 1.0 2.0))
(s382 (/ 1.0 2.0))
(s383 (/ 1.0 2.0))
(s384 (/ 1.0 2.0))
(s385 (/ 1.0 2.0))
(s386 (/ 1.0 2.0))
(s388 (/ 1.0 2.0))
(s389 (/ 1.0 2.0))
(s390 (/ 1.0 2.0))
(s391 (/ 1.0 2.0))
(s392 (/ 1.0 2.0))
(s393 (/ 1.0 2.0))
(s394 (/ 1.0 2.0))
(s395 (/ 1.0 2.0))
(s396 (/ 1.0 2.0))
(s397 (/ 1.0 2.0))
(s400 (/ 1.0 2.0))
(s401 (/ 1.0 2.0))
(s402 (/ 1.0 2.0))
(s403 (/ 1.0 2.0))
(s404 (/ 1.0 2.0))
(s405 (/ 1.0 2.0))
(s406 (/ 1.0 2.0))
(s407 (/ 1.0 2.0))
(s408 (/ 1.0 2.0))
(s409 (/ 1.0 2.0))
(s411 (/ 1.0 2.0))
(s412 (/ 1.0 2.0))
(s413 (/ 1.0 2.0))
(s414 (/ 1.0 2.0))
(s415 (/ 1.0 2.0))
(s416 (/ 1.0 2.0))
(s417 (/ 1.0 2.0))
(s418 (/ 1.0 2.0))
(s419 (/ 1.0 2.0))
(s420 (/ 1.0 2.0))
(s422 (/ 1.0 2.0))
(s423 (/ 1.0 2.0))
(s424 (/ 1.0 2.0))
(s425 (/ 1.0 2.0))
(s426 (/ 1.0 2.0))
(s427 (/ 1.0 2.0))
(s428 (/ 1.0 2.0))
(s429 (/ 1.0 2.0))
(s430 (/ 1.0 2.0))
(s431 (/ 1.0 2.0))
(s433 (/ 1.0 2.0))
(s434 (/ 1.0 2.0))
(s435 (/ 1.0 2.0))
(s436 (/ 1.0 2.0))
(s437 (/ 1.0 2.0))
(s438 (/ 1.0 2.0))
(s439 (/ 1.0 2.0))
(s440 (/ 1.0 2.0))
(s441 (/ 1.0 2.0))
(s442 (/ 1.0 2.0))
(s444 (/ 1.0 2.0))
(s445 (/ 1.0 2.0))
(s446 (/ 1.0 2.0))
(s447 (/ 1.0 2.0))
(s448 (/ 1.0 2.0))
(s449 (/ 1.0 2.0))
(s450 (/ 1.0 2.0))
(s451 (/ 1.0 2.0))
(s452 (/ 1.0 2.0))
(s453 (/ 1.0 2.0))
(s455 (/ 1.0 2.0))
(s456 (/ 1.0 2.0))
(s457 (/ 1.0 2.0))
(s458 (/ 1.0 2.0))
(s459 (/ 1.0 2.0))
(s460 (/ 1.0 2.0))
(s461 (/ 1.0 2.0))
(s462 (/ 1.0 2.0))
(s463 (/ 1.0 2.0))
(s464 (/ 1.0 2.0))
(s466 (/ 1.0 2.0))
(s467 (/ 1.0 2.0))
(s468 (/ 1.0 2.0))
(s469 (/ 1.0 2.0))
(s470 (/ 1.0 2.0))
(s471 (/ 1.0 2.0))
(s472 (/ 1.0 2.0))
(s473 (/ 1.0 2.0))
(s474 (/ 1.0 2.0))
(s475 (/ 1.0 2.0))
(s477 (/ 1.0 2.0))
(s478 (/ 1.0 2.0))
(s479 (/ 1.0 2.0))
(s480 (/ 1.0 2.0))
(s481 (/ 1.0 2.0))
(s482 (/ 1.0 2.0))
(s483 (/ 1.0 2.0))
(s484 (/ 1.0 2.0))
(s485 (/ 1.0 2.0))
(s486 (/ 1.0 2.0))
(s488 (/ 1.0 2.0))
(s489 (/ 1.0 2.0))
(s490 (/ 1.0 2.0))
(s491 (/ 1.0 2.0))
(s492 (/ 1.0 2.0))
(s493 (/ 1.0 2.0))
(s494 (/ 1.0 2.0))
(s495 (/ 1.0 2.0))
(s496 (/ 1.0 2.0))
(s497 (/ 1.0 2.0))
(s499 (/ 1.0 2.0))
(s500 (/ 1.0 2.0))
(s501 (/ 1.0 2.0))
(s502 (/ 1.0 2.0))
(s503 (/ 1.0 2.0))
(s504 (/ 1.0 2.0))
(s505 (/ 1.0 2.0))
(s506 (/ 1.0 2.0))
(s507 (/ 1.0 2.0))
(s508 (/ 1.0 2.0))
(s511 (/ 1.0 2.0))
(s512 (/ 1.0 2.0))
(s513 (/ 1.0 2.0))
(s514 (/ 1.0 2.0))
(s515 (/ 1.0 2.0))
(s516 (/ 1.0 2.0))
(s517 (/ 1.0 2.0))
(s518 (/ 1.0 2.0))
(s519 (/ 1.0 2.0))
(s520 (/ 1.0 2.0))
(s522 (/ 1.0 2.0))
(s523 (/ 1.0 2.0))
(s524 (/ 1.0 2.0))
(s525 (/ 1.0 2.0))
(s526 (/ 1.0 2.0))
(s527 (/ 1.0 2.0))
(s528 (/ 1.0 2.0))
(s529 (/ 1.0 2.0))
(s530 (/ 1.0 2.0))
(s531 (/ 1.0 2.0))
(s533 (/ 1.0 2.0))
(s534 (/ 1.0 2.0))
(s535 (/ 1.0 2.0))
(s536 (/ 1.0 2.0))
(s537 (/ 1.0 2.0))
(s538 (/ 1.0 2.0))
(s539 (/ 1.0 2.0))
(s540 (/ 1.0 2.0))
(s541 (/ 1.0 2.0))
(s542 (/ 1.0 2.0))
(s544 (/ 1.0 2.0))
(s545 (/ 1.0 2.0))
(s546 (/ 1.0 2.0))
(s547 (/ 1.0 2.0))
(s548 (/ 1.0 2.0))
(s549 (/ 1.0 2.0))
(s550 (/ 1.0 2.0))
(s551 (/ 1.0 2.0))
(s552 (/ 1.0 2.0))
(s553 (/ 1.0 2.0))
(s555 (/ 1.0 2.0))
(s556 (/ 1.0 2.0))
(s557 (/ 1.0 2.0))
(s558 (/ 1.0 2.0))
(s559 (/ 1.0 2.0))
(s560 (/ 1.0 2.0))
(s561 (/ 1.0 2.0))
(s562 (/ 1.0 2.0))
(s563 (/ 1.0 2.0))
(s564 (/ 1.0 2.0))
(s566 (/ 1.0 2.0))
(s567 (/ 1.0 2.0))
(s568 (/ 1.0 2.0))
(s569 (/ 1.0 2.0))
(s570 (/ 1.0 2.0))
(s571 (/ 1.0 2.0))
(s572 (/ 1.0 2.0))
(s573 (/ 1.0 2.0))
(s574 (/ 1.0 2.0))
(s575 (/ 1.0 2.0))
(s577 (/ 1.0 2.0))
(s578 (/ 1.0 2.0))
(s579 (/ 1.0 2.0))
(s580 (/ 1.0 2.0))
(s581 (/ 1.0 2.0))
(s582 (/ 1.0 2.0))
(s583 (/ 1.0 2.0))
(s584 (/ 1.0 2.0))
(s585 (/ 1.0 2.0))
(s586 (/ 1.0 2.0))
(s588 (/ 1.0 2.0))
(s589 (/ 1.0 2.0))
(s590 (/ 1.0 2.0))
(s591 (/ 1.0 2.0))
(s592 (/ 1.0 2.0))
(s593 (/ 1.0 2.0))
(s594 (/ 1.0 2.0))
(s595 (/ 1.0 2.0))
(s596 (/ 1.0 2.0))
(s597 (/ 1.0 2.0))
(s599 (/ 1.0 2.0))
(s600 (/ 1.0 2.0))
(s601 (/ 1.0 2.0))
(s602 (/ 1.0 2.0))
(s603 (/ 1.0 2.0))
(s604 (/ 1.0 2.0))
(s605 (/ 1.0 2.0))
(s606 (/ 1.0 2.0))
(s607 (/ 1.0 2.0))
(s608 (/ 1.0 2.0))
(s610 (/ 1.0 2.0))
(s611 (/ 1.0 2.0))
(s612 (/ 1.0 2.0))
(s613 (/ 1.0 2.0))
(s614 (/ 1.0 2.0))
(s615 (/ 1.0 2.0))
(s616 (/ 1.0 2.0))
(s617 (/ 1.0 2.0))
(s618 (/ 1.0 2.0))
(s619 (/ 1.0 2.0))
(s622 (/ 1.0 2.0))
(s623 (/ 1.0 2.0))
(s624 (/ 1.0 2.0))
(s625 (/ 1.0 2.0))
(s626 (/ 1.0 2.0))
(s627 (/ 1.0 2.0))
(s628 (/ 1.0 2.0))
(s629 (/ 1.0 2.0))
(s630 (/ 1.0 2.0))
(s631 (/ 1.0 2.0))
(s633 (/ 1.0 2.0))
(s634 (/ 1.0 2.0))
(s635 (/ 1.0 2.0))
(s636 (/ 1.0 2.0))
(s637 (/ 1.0 2.0))
(s638 (/ 1.0 2.0))
(s639 (/ 1.0 2.0))
(s640 (/ 1.0 2.0))
(s641 (/ 1.0 2.0))
(s642 (/ 1.0 2.0))
(s644 (/ 1.0 2.0))
(s645 (/ 1.0 2.0))
(s646 (/ 1.0 2.0))
(s647 (/ 1.0 2.0))
(s648 (/ 1.0 2.0))
(s649 (/ 1.0 2.0))
(s650 (/ 1.0 2.0))
(s651 (/ 1.0 2.0))
(s652 (/ 1.0 2.0))
(s653 (/ 1.0 2.0))
(s655 (/ 1.0 2.0))
(s656 (/ 1.0 2.0))
(s657 (/ 1.0 2.0))
(s658 (/ 1.0 2.0))
(s659 (/ 1.0 2.0))
(s660 (/ 1.0 2.0))
(s661 (/ 1.0 2.0))
(s662 (/ 1.0 2.0))
(s663 (/ 1.0 2.0))
(s664 (/ 1.0 2.0))
(s666 (/ 1.0 2.0))
(s667 (/ 1.0 2.0))
(s668 (/ 1.0 2.0))
(s669 (/ 1.0 2.0))
(s670 (/ 1.0 2.0))
(s671 (/ 1.0 2.0))
(s672 (/ 1.0 2.0))
(s673 (/ 1.0 2.0))
(s674 (/ 1.0 2.0))
(s675 (/ 1.0 2.0))
(s677 (/ 1.0 2.0))
(s678 (/ 1.0 2.0))
(s679 (/ 1.0 2.0))
(s680 (/ 1.0 2.0))
(s681 (/ 1.0 2.0))
(s682 (/ 1.0 2.0))
(s683 (/ 1.0 2.0))
(s684 (/ 1.0 2.0))
(s685 (/ 1.0 2.0))
(s686 (/ 1.0 2.0))
(s688 (/ 1.0 2.0))
(s689 (/ 1.0 2.0))
(s690 (/ 1.0 2.0))
(s691 (/ 1.0 2.0))
(s692 (/ 1.0 2.0))
(s693 (/ 1.0 2.0))
(s694 (/ 1.0 2.0))
(s695 (/ 1.0 2.0))
(s696 (/ 1.0 2.0))
(s697 (/ 1.0 2.0))
(s699 (/ 1.0 2.0))
(s700 (/ 1.0 2.0))
(s701 (/ 1.0 2.0))
(s702 (/ 1.0 2.0))
(s703 (/ 1.0 2.0))
(s704 (/ 1.0 2.0))
(s705 (/ 1.0 2.0))
(s706 (/ 1.0 2.0))
(s707 (/ 1.0 2.0))
(s708 (/ 1.0 2.0))
(s710 (/ 1.0 2.0))
(s711 (/ 1.0 2.0))
(s712 (/ 1.0 2.0))
(s713 (/ 1.0 2.0))
(s714 (/ 1.0 2.0))
(s715 (/ 1.0 2.0))
(s716 (/ 1.0 2.0))
(s717 (/ 1.0 2.0))
(s718 (/ 1.0 2.0))
(s719 (/ 1.0 2.0))
(s721 (/ 1.0 2.0))
(s722 (/ 1.0 2.0))
(s723 (/ 1.0 2.0))
(s724 (/ 1.0 2.0))
(s725 (/ 1.0 2.0))
(s726 (/ 1.0 2.0))
(s727 (/ 1.0 2.0))
(s728 (/ 1.0 2.0))
(s729 (/ 1.0 2.0))
(s730 (/ 1.0 2.0))
(s733 (/ 1.0 2.0))
(s734 (/ 1.0 2.0))
(s735 (/ 1.0 2.0))
(s736 (/ 1.0 2.0))
(s737 (/ 1.0 2.0))
(s738 (/ 1.0 2.0))
(s739 (/ 1.0 2.0))
(s740 (/ 1.0 2.0))
(s741 (/ 1.0 2.0))
(s742 (/ 1.0 2.0))
(s744 (/ 1.0 2.0))
(s745 (/ 1.0 2.0))
(s746 (/ 1.0 2.0))
(s747 (/ 1.0 2.0))
(s748 (/ 1.0 2.0))
(s749 (/ 1.0 2.0))
(s750 (/ 1.0 2.0))
(s751 (/ 1.0 2.0))
(s752 (/ 1.0 2.0))
(s753 (/ 1.0 2.0))
(s755 (/ 1.0 2.0))
(s756 (/ 1.0 2.0))
(s757 (/ 1.0 2.0))
(s758 (/ 1.0 2.0))
(s759 (/ 1.0 2.0))
(s760 (/ 1.0 2.0))
(s761 (/ 1.0 2.0))
(s762 (/ 1.0 2.0))
(s763 (/ 1.0 2.0))
(s764 (/ 1.0 2.0))
(s766 (/ 1.0 2.0))
(s767 (/ 1.0 2.0))
(s768 (/ 1.0 2.0))
(s769 (/ 1.0 2.0))
(s770 (/ 1.0 2.0))
(s771 (/ 1.0 2.0))
(s772 (/ 1.0 2.0))
(s773 (/ 1.0 2.0))
(s774 (/ 1.0 2.0))
(s775 (/ 1.0 2.0))
(s777 (/ 1.0 2.0))
(s778 (/ 1.0 2.0))
(s779 (/ 1.0 2.0))
(s780 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 918/2062 variables, and 0 constraints, problems are : Problem set: 0 solved, 918 unsolved in 5087 ms.
Refiners :[State Equation: 0/1064 constraints, PredecessorRefiner: 918/918 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 918 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 918/2062 variables, and 0 constraints, problems are : Problem set: 0 solved, 918 unsolved in 5022 ms.
Refiners :[State Equation: 0/1064 constraints, PredecessorRefiner: 0/918 constraints, Known Traps: 0/0 constraints]
After SMT, in 10485ms problems are : Problem set: 0 solved, 918 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 918 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1064 transition count 968
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 1034 transition count 968
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 60 place count 1034 transition count 963
Deduced a syphon composed of 5 places in 15 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 70 place count 1029 transition count 963
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 42 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 130 place count 999 transition count 933
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 46 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 140 place count 994 transition count 933
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 994 transition count 927
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 152 place count 988 transition count 927
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 163 place count 988 transition count 927
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 987 transition count 926
Applied a total of 164 rules in 384 ms. Remains 987 /1064 variables (removed 77) and now considering 926/998 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 395 ms. Remains : 987/1064 places, 926/998 transitions.
RANDOM walk for 2753269 steps (352814 resets) in 120004 ms. (22 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4001 steps (348 resets) in 134 ms. (29 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4002 steps (337 resets) in 128 ms. (31 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4003 steps (348 resets) in 127 ms. (31 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4000 steps (329 resets) in 112 ms. (35 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4001 steps (343 resets) in 113 ms. (35 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4002 steps (347 resets) in 113 ms. (35 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4000 steps (344 resets) in 114 ms. (34 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4003 steps (345 resets) in 118 ms. (33 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4001 steps (325 resets) in 120 ms. (33 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4002 steps (334 resets) in 113 ms. (35 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4001 steps (343 resets) in 117 ms. (33 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4001 steps (338 resets) in 115 ms. (34 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4002 steps (336 resets) in 172 ms. (23 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4000 steps (349 resets) in 160 ms. (24 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4001 steps (328 resets) in 159 ms. (25 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4002 steps (354 resets) in 178 ms. (22 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4001 steps (322 resets) in 164 ms. (24 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4001 steps (341 resets) in 161 ms. (24 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4004 steps (338 resets) in 192 ms. (20 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4002 steps (339 resets) in 148 ms. (26 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4001 steps (335 resets) in 152 ms. (26 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4003 steps (324 resets) in 162 ms. (24 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4001 steps (313 resets) in 158 ms. (25 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4002 steps (316 resets) in 205 ms. (19 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4001 steps (333 resets) in 198 ms. (20 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4000 steps (344 resets) in 194 ms. (20 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4001 steps (330 resets) in 193 ms. (20 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4003 steps (337 resets) in 191 ms. (20 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4003 steps (329 resets) in 197 ms. (20 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4004 steps (348 resets) in 197 ms. (20 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4003 steps (340 resets) in 183 ms. (21 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4002 steps (329 resets) in 179 ms. (22 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4003 steps (337 resets) in 146 ms. (27 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4000 steps (321 resets) in 122 ms. (32 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4001 steps (333 resets) in 113 ms. (35 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4002 steps (339 resets) in 114 ms. (34 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4001 steps (355 resets) in 117 ms. (33 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4002 steps (339 resets) in 110 ms. (36 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4004 steps (334 resets) in 111 ms. (35 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4001 steps (346 resets) in 114 ms. (34 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4003 steps (327 resets) in 141 ms. (28 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4000 steps (334 resets) in 119 ms. (33 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4000 steps (336 resets) in 110 ms. (36 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4002 steps (322 resets) in 111 ms. (35 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4000 steps (336 resets) in 111 ms. (35 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4002 steps (320 resets) in 110 ms. (36 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4001 steps (327 resets) in 122 ms. (32 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4001 steps (345 resets) in 112 ms. (35 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4001 steps (351 resets) in 114 ms. (34 steps per ms) remains 918/918 properties
BEST_FIRST walk for 4001 steps (344 resets) in 112 ms. (35 steps per ms) remains 918/918 properties
Probabilistic random walk after 1000000 steps, saw 500653 distinct states, run finished after 43301 ms. (steps per millisecond=23 ) properties seen :51
// Phase 1: matrix 926 rows 987 cols
[2025-06-01 00:09:56] [INFO ] Invariants computation overflowed in 74 ms
[2025-06-01 00:09:56] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 867 unsolved
At refinement iteration 1 (OVERLAPS) 821/1688 variables, 867/867 constraints. Problems are: Problem set: 0 solved, 867 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1688/1913 variables, and 867 constraints, problems are : Problem set: 0 solved, 867 unsolved in 45039 ms.
Refiners :[State Equation: 867/987 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 867/867 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 867 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 867 unsolved
At refinement iteration 1 (OVERLAPS) 821/1688 variables, 867/867 constraints. Problems are: Problem set: 0 solved, 867 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1688 variables, 842/1709 constraints. Problems are: Problem set: 0 solved, 867 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1688/1913 variables, and 1709 constraints, problems are : Problem set: 0 solved, 867 unsolved in 45037 ms.
Refiners :[State Equation: 867/987 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 842/867 constraints, Known Traps: 0/0 constraints]
After SMT, in 90314ms problems are : Problem set: 0 solved, 867 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 867 out of 987 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 987/987 places, 926/926 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 987 transition count 915
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 976 transition count 915
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 22 place count 976 transition count 913
Deduced a syphon composed of 2 places in 16 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 974 transition count 913
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 10 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 44 place count 965 transition count 904
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 963 transition count 904
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 963 transition count 900
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 56 place count 959 transition count 900
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 959 transition count 900
Applied a total of 60 rules in 141 ms. Remains 959 /987 variables (removed 28) and now considering 900/926 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 959/987 places, 900/926 transitions.
RANDOM walk for 2854290 steps (365578 resets) in 120004 ms. (23 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (334 resets) in 182 ms. (21 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (321 resets) in 211 ms. (18 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (346 resets) in 171 ms. (23 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (347 resets) in 220 ms. (18 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (355 resets) in 311 ms. (12 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (355 resets) in 203 ms. (19 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (332 resets) in 209 ms. (19 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (354 resets) in 211 ms. (18 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (333 resets) in 197 ms. (20 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (350 resets) in 208 ms. (19 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (342 resets) in 203 ms. (19 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (328 resets) in 195 ms. (20 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (356 resets) in 242 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (316 resets) in 184 ms. (21 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4003 steps (344 resets) in 204 ms. (19 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (344 resets) in 186 ms. (21 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (341 resets) in 213 ms. (18 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (347 resets) in 217 ms. (18 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (330 resets) in 211 ms. (18 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (340 resets) in 202 ms. (19 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (348 resets) in 215 ms. (18 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (339 resets) in 220 ms. (18 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (350 resets) in 198 ms. (20 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (323 resets) in 191 ms. (20 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (350 resets) in 234 ms. (17 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (339 resets) in 210 ms. (18 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (341 resets) in 268 ms. (14 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (329 resets) in 226 ms. (17 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (354 resets) in 247 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (308 resets) in 225 ms. (17 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (322 resets) in 282 ms. (14 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (356 resets) in 296 ms. (13 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (330 resets) in 215 ms. (18 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (349 resets) in 229 ms. (17 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (324 resets) in 203 ms. (19 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (323 resets) in 184 ms. (21 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (344 resets) in 182 ms. (21 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (341 resets) in 198 ms. (20 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (347 resets) in 209 ms. (19 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (326 resets) in 226 ms. (17 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (331 resets) in 141 ms. (28 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (324 resets) in 263 ms. (15 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (356 resets) in 273 ms. (14 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (350 resets) in 225 ms. (17 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (343 resets) in 204 ms. (19 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (338 resets) in 200 ms. (19 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (333 resets) in 199 ms. (20 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (339 resets) in 203 ms. (19 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (321 resets) in 240 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4003 steps (340 resets) in 216 ms. (18 steps per ms) remains 867/867 properties
Probabilistic random walk after 1000000 steps, saw 500676 distinct states, run finished after 44969 ms. (steps per millisecond=22 ) properties seen :0
// Phase 1: matrix 900 rows 959 cols
[2025-06-01 00:12:45] [INFO ] Invariants computation overflowed in 128 ms
[2025-06-01 00:12:45] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 867 unsolved
At refinement iteration 1 (OVERLAPS) 823/1690 variables, 867/867 constraints. Problems are: Problem set: 0 solved, 867 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1690 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 867 unsolved
Error getting values : (error "ParserException while parsing response: ((t7 (/ 265.0 16.0))
(t9 (/ 33.0 2.0))
(t10 0.0)
(t11 (/ 263.0 16.0))
(t13 (/ 5585347.0 16.0))
(t14 (/ 5585345.0 16.0))
(t15 0.0)
(t16 0.0)
(t17 0.0)
(t18 (/ 5585345.0 16.0))
(t19 (/ 5585345.0 16.0))
(t20 (/ 5585345.0 16.0))
(t21 (/ 5585345.0 16.0))
(t22 (/ 5585345.0 16.0))
(t23 0.0)
(t24 (/ 5585345.0 16.0))
(t25 (/ 5585345.0 16.0))
(t28 0.0)
(t29 (/ 131.0 8.0))
(t30 (/ 261.0 16.0))
(t31 (/ 65.0 4.0))
(t32 (/ 259.0 16.0))
(t33 (/ 129.0 8.0))
(t34 (/ 257.0 16.0))
(t35 16.0)
(t36 (/ 255.0 16.0))
(t37 (/ 127.0 8.0))
(t38 0.0)
(t39 (/ 243.0 16.0))
(t40 (/ 121.0 8.0))
(t41 0.0)
(t42 (/ 241.0 16.0))
(t43 (/ 349069.0 2.0))
(t44 (/ 3.0 16.0))
(t45 (/ 1.0 8.0))
(t46 (/ 1.0 16.0))
(t47 (/ 698137.0 4.0))
(t48 (/ 2792547.0 16.0))
(t49 (/ 1396273.0 8.0))
(t50 (/ 2792545.0 16.0))
(t51 174534.0)
(t52 0.0)
(t53 (/ 2792543.0 16.0))
(t54 (/ 1396271.0 8.0))
(t55 (/ 698135.0 4.0))
(t56 0.0)
(t57 0.0)
(t58 0.0)
(t59 (/ 698135.0 4.0))
(t61 (/ 1396279.0 8.0))
(t62 (/ 1396279.0 8.0))
(t63 (/ 1396279.0 8.0))
(t64 (/ 1396279.0 8.0))
(t65 (/ 9.0 8.0))
(t66 (/ 698135.0 4.0))
(t67 (/ 2792539.0 16.0))
(t68 (/ 2792541.0 8.0))
(t69 (/ 5585081.0 16.0))
(t70 (/ 5585081.0 16.0))
(t71 (/ 5585081.0 16.0))
(t72 (/ 5585081.0 16.0))
(t73 (/ 5585081.0 16.0))
(t74 0.0)
(t75 (/ 5585081.0 16.0))
(t76 (/ 5585081.0 16.0))
(t77 0.0)
(t78 (/ 5585081.0 16.0))
(t79 15.0)
(t80 (/ 239.0 16.0))
(t81 (/ 119.0 8.0))
(t82 (/ 237.0 16.0))
(t83 (/ 59.0 4.0))
(t84 (/ 235.0 16.0))
(t85 (/ 117.0 8.0))
(t86 (/ 233.0 16.0))
(t87 (/ 29.0 2.0))
(t88 0.0)
(t89 (/ 231.0 16.0))
(t90 (/ 115.0 8.0))
(t91 0.0)
(t92 (/ 229.0 16.0))
(t93 (/ 1396161.0 16.0))
(t94 (/ 3.0 16.0))
(t95 (/ 1.0 8.0))
(t96 (/ 1.0 16.0))
(t97 (/ 1396157.0 16.0))
(t98 (/ 1396165.0 16.0))
(t99 (/ 349041.0 4.0))
(t100 (/ 1396163.0 16.0))
(t101 (/ 698081.0 8.0))
(t102 (/ 9.0 16.0))
(t103 (/ 174519.0 2.0))
(t104 (/ 1396151.0 16.0))
(t105 (/ 1396149.0 16.0))
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 (/ 1396149.0 16.0))
(t110 (/ 1396149.0 16.0))
(t111 (/ 349037.0 4.0))
(t112 (/ 1396147.0 16.0))
(t113 (/ 1396147.0 16.0))
(t114 0.0)
(t115 (/ 1396147.0 16.0))
(t116 (/ 1396147.0 16.0))
(t117 (/ 2792299.0 16.0))
(t118 (/ 2792299.0 16.0))
(t119 (/ 2792299.0 16.0))
(t120 (/ 2792299.0 16.0))
(t121 (/ 2792299.0 16.0))
(t122 (/ 2792299.0 16.0))
(t123 (/ 2792299.0 16.0))
(t124 0.0)
(t125 (/ 1396149.0 8.0))
(t126 (/ 1396149.0 8.0))
(t127 0.0)
(t128 (/ 1396149.0 8.0))
(t129 (/ 57.0 4.0))
(t130 (/ 227.0 16.0))
(t131 (/ 113.0 8.0))
(t132 (/ 225.0 16.0))
(t133 14.0)
(t134 (/ 223.0 16.0))
(t135 (/ 111.0 8.0))
(t136 (/ 221.0 16.0))
(t137 (/ 55.0 4.0))
(t138 0.0)
(t139 (/ 219.0 16.0))
(t140 (/ 109.0 8.0))
(t141 0.0)
(t142 (/ 217.0 16.0))
(t143 (/ 348983.0 8.0))
(t144 0.0)
(t145 0.0)
(t146 0.0)
(t147 (/ 348983.0 8.0))
(t148 (/ 348983.0 8.0))
(t149 (/ 348983.0 8.0))
(t150 (/ 348983.0 8.0))
(t151 (/ 348983.0 8.0))
(t152 0.0)
(t153 (/ 348983.0 8.0))
(t154 (/ 697965.0 16.0))
(t155 (/ 174491.0 4.0))
(t156 0.0)
(t157 0.0)
(t158 0.0)
(t159 (/ 174491.0 4.0))
(t160 (/ 697971.0 16.0))
(t161 (/ 697971.0 16.0))
(t162 (/ 697971.0 16.0))
(t163 (/ 697971.0 16.0))
(t164 (/ 7.0 16.0))
(t165 (/ 174491.0 4.0))
(t166 (/ 697953.0 16.0))
(t167 (/ 697965.0 8.0))
(t168 (/ 697965.0 8.0))
(t169 (/ 697965.0 8.0))
(t170 (/ 697965.0 8.0))
(t171 (/ 697965.0 8.0))
(t172 (/ 697965.0 8.0))
(t173 (/ 697965.0 8.0))
(t174 0.0)
(t175 (/ 1395919.0 16.0))
(t176 (/ 1395919.0 16.0))
(t177 0.0)
(t178 (/ 697959.0 8.0))
(t179 (/ 27.0 2.0))
(t181 (/ 215.0 16.0))
(t182 (/ 107.0 8.0))
(t183 (/ 213.0 16.0))
(t184 (/ 53.0 4.0))
(t185 (/ 211.0 16.0))
(t186 (/ 105.0 8.0))
(t187 (/ 209.0 16.0))
(t188 13.0)
(t189 0.0)
(t190 (/ 207.0 16.0))
(t191 (/ 103.0 8.0))
(t192 0.0)
(t193 (/ 205.0 16.0))
(t194 (/ 174437.0 8.0))
(t195 0.0)
(t196 0.0)
(t197 0.0)
(t198 (/ 174437.0 8.0))
(t199 (/ 174437.0 8.0))
(t200 (/ 174437.0 8.0))
(t201 (/ 174437.0 8.0))
(t202 (/ 174437.0 8.0))
(t203 0.0)
(t204 (/ 174437.0 8.0))
(t205 (/ 348873.0 16.0))
(t206 (/ 43609.0 2.0))
(t207 0.0)
(t208 0.0)
(t209 0.0)
(t210 (/ 43609.0 2.0))
(t211 (/ 348879.0 16.0))
(t212 (/ 348879.0 16.0))
(t213 (/ 348879.0 16.0))
(t214 (/ 348879.0 16.0))
(t215 (/ 7.0 16.0))
(t216 (/ 43609.0 2.0))
(t217 (/ 348863.0 16.0))
(t218 (/ 348873.0 8.0))
(t219 (/ 348873.0 8.0))
(t220 (/ 348873.0 8.0))
(t221 (/ 348873.0 8.0))
(t222 (/ 348873.0 8.0))
(t223 (/ 348873.0 8.0))
(t224 (/ 348873.0 8.0))
(t225 0.0)
(t226 (/ 348873.0 8.0))
(t227 (/ 348873.0 8.0))
(t228 0.0)
(t229 (/ 87217.0 2.0))
(t230 (/ 51.0 4.0))
(t231 (/ 203.0 16.0))
(t232 (/ 101.0 8.0))
(t233 (/ 201.0 16.0))
(t234 (/ 25.0 2.0))
(t235 (/ 199.0 16.0))
(t236 (/ 99.0 8.0))
(t237 (/ 197.0 16.0))
(t238 (/ 49.0 4.0))
(t239 0.0)
(t240 (/ 195.0 16.0))
(t241 (/ 97.0 8.0))
(t242 0.0)
(t243 (/ 193.0 16.0))
(t244 (/ 87167.0 8.0))
(t245 0.0)
(t246 0.0)
(t247 0.0)
(t248 (/ 87167.0 8.0))
(t249 (/ 87167.0 8.0))
(t250 (/ 87167.0 8.0))
(t251 (/ 87167.0 8.0))
(t252 (/ 87167.0 8.0))
(t253 0.0)
(t254 (/ 87167.0 8.0))
(t255 (/ 174333.0 16.0))
(t256 (/ 43583.0 4.0))
(t257 0.0)
(t258 0.0)
(t259 0.0)
(t260 (/ 43583.0 4.0))
(t261 (/ 43583.0 4.0))
(t262 (/ 43583.0 4.0))
(t263 (/ 43583.0 4.0))
(t264 (/ 43583.0 4.0))
(t265 0.0)
(t266 (/ 43583.0 4.0))
(t267 (/ 174325.0 16.0))
(t268 (/ 174333.0 8.0))
(t269 (/ 174333.0 8.0))
(t270 (/ 174333.0 8.0))
(t271 (/ 174333.0 8.0))
(t272 (/ 174333.0 8.0))
(t273 (/ 174333.0 8.0))
(t274 (/ 174333.0 8.0))
(t275 0.0)
(t276 (/ 174333.0 8.0))
(t277 (/ 174333.0 8.0))
(t278 0.0)
(t279 (/ 174329.0 8.0))
(t280 12.0)
(t282 (/ 191.0 16.0))
(t283 (/ 95.0 8.0))
(t284 (/ 189.0 16.0))
(t285 (/ 47.0 4.0))
(t286 (/ 187.0 16.0))
(t287 (/ 93.0 8.0))
(t288 (/ 185.0 16.0))
(t289 (/ 23.0 2.0))
(t290 0.0)
(t291 (/ 183.0 16.0))
(t292 (/ 91.0 8.0))
(t293 0.0)
(t294 (/ 181.0 16.0))
(t295 (/ 43535.0 8.0))
(t296 0.0)
(t297 0.0)
(t298 0.0)
(t299 (/ 43535.0 8.0))
(t300 (/ 43535.0 8.0))
(t301 (/ 43535.0 8.0))
(t303 (/ 43535.0 8.0))
(t304 (/ 43535.0 8.0))
(t305 0.0)
(t306 (/ 43535.0 8.0))
(t307 (/ 87069.0 16.0))
(t308 (/ 21767.0 4.0))
(t309 0.0)
(t310 0.0)
(t311 0.0)
(t312 (/ 21767.0 4.0))
(t313 (/ 21767.0 4.0))
(t314 (/ 21767.0 4.0))
(t315 (/ 21767.0 4.0))
(t316 (/ 21767.0 4.0))
(t317 0.0)
(t318 (/ 21767.0 4.0))
(t319 (/ 87063.0 16.0))
(t320 (/ 87069.0 8.0))
(t321 (/ 87069.0 8.0))
(t322 (/ 87069.0 8.0))
(t323 (/ 87069.0 8.0))
(t324 (/ 87069.0 8.0))
(t325 (/ 87069.0 8.0))
(t326 (/ 87069.0 8.0))
(t327 0.0)
(t328 (/ 87069.0 8.0))
(t329 (/ 87069.0 8.0))
(t330 0.0)
(t331 (/ 43533.0 4.0))
(t332 (/ 45.0 4.0))
(t333 (/ 179.0 16.0))
(t334 (/ 89.0 8.0))
(t335 (/ 351.0 16.0))
(t336 (/ 175.0 8.0))
(t337 (/ 349.0 16.0))
(t338 (/ 87.0 4.0))
(t339 (/ 347.0 16.0))
(t340 (/ 173.0 8.0))
(t341 (/ 87.0 8.0))
(t342 (/ 171.0 16.0))
(t343 (/ 85.0 8.0))
(t344 0.0)
(t345 (/ 169.0 16.0))
(t346 (/ 21809.0 8.0))
(t347 (/ 87.0 8.0))
(t348 (/ 87.0 8.0))
(t349 (/ 87.0 8.0))
(t350 (/ 10861.0 4.0))
(t351 (/ 43621.0 16.0))
(t352 (/ 43621.0 16.0))
(t353 (/ 43621.0 16.0))
(t354 (/ 43621.0 16.0))
(t355 (/ 177.0 16.0))
(t356 (/ 10861.0 4.0))
(t357 (/ 43443.0 16.0))
(t358 (/ 21721.0 8.0))
(t359 0.0)
(t360 0.0)
(t361 0.0)
(t362 (/ 21721.0 8.0))
(t363 (/ 43449.0 16.0))
(t364 (/ 43449.0 16.0))
(t365 (/ 43449.0 16.0))
(t366 (/ 43449.0 16.0))
(t367 (/ 7.0 16.0))
(t368 (/ 21721.0 8.0))
(t369 (/ 43439.0 16.0))
(t370 (/ 43443.0 8.0))
(t371 (/ 43443.0 8.0))
(t372 (/ 43443.0 8.0))
(t373 (/ 43443.0 8.0))
(t374 (/ 43443.0 8.0))
(t375 (/ 43443.0 8.0))
(t376 (/ 43443.0 8.0))
(t377 0.0)
(t378 (/ 43443.0 8.0))
(t379 (/ 43443.0 8.0))
(t380 0.0)
(t381 (/ 43441.0 8.0))
(t382 (/ 21.0 2.0))
(t383 (/ 167.0 16.0))
(t384 (/ 83.0 8.0))
(t385 (/ 165.0 16.0))
(t386 (/ 41.0 4.0))
(t387 (/ 163.0 16.0))
(t388 (/ 81.0 8.0))
(t389 (/ 161.0 16.0))
(t390 10.0)
(t391 0.0)
(t392 (/ 159.0 16.0))
(t393 (/ 79.0 8.0))
(t394 0.0)
(t395 (/ 157.0 16.0))
(t396 (/ 10819.0 8.0))
(t397 0.0)
(t398 0.0)
(t399 0.0)
(t400 (/ 10819.0 8.0))
(t401 (/ 10819.0 8.0))
(t402 (/ 10819.0 8.0))
(t403 (/ 10819.0 8.0))
(t404 (/ 10819.0 8.0))
(t405 0.0)
(t406 (/ 10819.0 8.0))
(t407 (/ 5409.0 4.0))
(t408 (/ 10817.0 8.0))
(t409 0.0)
(t410 0.0)
(t411 0.0)
(t412 (/ 10817.0 8.0))
(t414 (/ 10817.0 8.0))
(t415 (/ 10817.0 8.0))
(t416 (/ 10817.0 8.0))
(t417 (/ 10817.0 8.0))
(t418 0.0)
(t419 (/ 10817.0 8.0))
(t420 (/ 10817.0 8.0))
(t421 (/ 5409.0 2.0))
(t422 (/ 5409.0 2.0))
(t423 (/ 5409.0 2.0))
(t424 (/ 5409.0 2.0))
(t425 (/ 5409.0 2.0))
(t426 (/ 5409.0 2.0))
(t427 (/ 5409.0 2.0))
(t428 0.0)
(t429 (/ 5409.0 2.0))
(t430 (/ 5409.0 2.0))
(t431 0.0)
(t432 (/ 21635.0 8.0))
(t433 (/ 39.0 4.0))
(t434 (/ 155.0 16.0))
(t435 (/ 77.0 8.0))
(t436 (/ 469.0 16.0))
(t437 (/ 117.0 4.0))
(t438 (/ 467.0 16.0))
(t439 (/ 233.0 8.0))
(t440 (/ 465.0 16.0))
(t441 29.0)
(t442 (/ 79.0 4.0))
(t443 (/ 147.0 16.0))
(t444 (/ 73.0 8.0))
(t445 0.0)
(t446 (/ 145.0 16.0))
(t447 691.0)
(t448 (/ 79.0 4.0))
(t449 (/ 79.0 4.0))
(t450 (/ 79.0 4.0))
(t451 (/ 2685.0 4.0))
(t452 (/ 2725.0 4.0))
(t453 (/ 2725.0 4.0))
(t454 (/ 2725.0 4.0))
(t455 (/ 2725.0 4.0))
(t456 10.0)
(t457 (/ 2685.0 4.0))
(t458 (/ 10739.0 16.0))
(t459 (/ 5369.0 8.0))
(t460 0.0)
(t461 0.0)
(t462 0.0)
(t463 (/ 5369.0 8.0))
(t464 (/ 5369.0 8.0))
(t465 (/ 5369.0 8.0))
(t466 (/ 5369.0 8.0))
(t467 (/ 5369.0 8.0))
(t468 0.0)
(t469 (/ 5369.0 8.0))
(t470 (/ 10737.0 16.0))
(t471 (/ 10739.0 8.0))
(t472 (/ 10739.0 8.0))
(t473 (/ 10739.0 8.0))
(t474 (/ 10739.0 8.0))
(t475 (/ 10739.0 8.0))
(t476 (/ 10739.0 8.0))
(t477 (/ 10739.0 8.0))
(t478 0.0)
(t479 (/ 21477.0 16.0))
(t480 (/ 21477.0 16.0))
(t481 0.0)
(t482 (/ 21477.0 16.0))
(t483 9.0)
(t485 (/ 143.0 16.0))
(t486 (/ 71.0 8.0))
(t487 66.0)
(t488 (/ 1055.0 16.0))
(t489 (/ 527.0 8.0))
(t490 (/ 1053.0 16.0))
(t491 (/ 263.0 4.0))
(t492 (/ 1051.0 16.0))
(t493 (/ 915.0 16.0))
(t494 (/ 135.0 16.0))
(t495 (/ 67.0 8.0))
(t496 0.0)
(t497 (/ 133.0 16.0))
(t498 (/ 6213.0 16.0))
(t499 (/ 915.0 16.0))
(t500 (/ 915.0 16.0))
(t501 (/ 915.0 16.0))
(t502 (/ 2649.0 8.0))
(t503 (/ 5753.0 16.0))
(t504 (/ 5753.0 16.0))
(t505 (/ 5753.0 16.0))
(t506 (/ 5753.0 16.0))
(t507 (/ 455.0 16.0))
(t508 (/ 2649.0 8.0))
(t509 (/ 5297.0 16.0))
(t510 (/ 2647.0 8.0))
(t511 0.0)
(t512 0.0)
(t513 0.0)
(t514 (/ 2647.0 8.0))
(t515 (/ 5303.0 16.0))
(t516 (/ 5303.0 16.0))
(t517 (/ 5303.0 16.0))
(t518 (/ 5303.0 16.0))
(t519 (/ 9.0 16.0))
(t520 (/ 2647.0 8.0))
(t521 (/ 2647.0 8.0))
(t522 662.0)
(t523 662.0)
(t524 662.0)
(t525 662.0)
(t526 662.0)
(t527 662.0)
(t528 662.0)
(t529 0.0)
(t530 662.0)
(t531 662.0)
(t532 0.0)
(t533 662.0)
(t534 (/ 33.0 4.0))
(t535 (/ 131.0 16.0))
(t536 (/ 65.0 8.0))
(t537 (/ 129.0 16.0))
(t538 8.0)
(t539 (/ 127.0 16.0))
(t540 (/ 63.0 8.0))
(t541 (/ 125.0 16.0))
(t542 (/ 31.0 4.0))
(t543 0.0)
(t544 (/ 123.0 16.0))
(t545 (/ 61.0 8.0))
(t546 0.0)
(t547 (/ 121.0 16.0))
(t548 (/ 1291.0 8.0))
(t549 0.0)
(t550 0.0)
(t551 0.0)
(t552 (/ 1291.0 8.0))
(t553 (/ 1291.0 8.0))
(t554 (/ 1291.0 8.0))
(t555 (/ 1291.0 8.0))
(t556 (/ 1291.0 8.0))
(t557 0.0)
(t558 (/ 1291.0 8.0))
(t559 (/ 2581.0 16.0))
(t560 (/ 645.0 4.0))
(t561 0.0)
(t562 0.0)
(t563 0.0)
(t564 (/ 645.0 4.0))
(t565 (/ 2587.0 16.0))
(t566 (/ 2587.0 16.0))
(t567 (/ 2587.0 16.0))
(t568 (/ 2587.0 16.0))
(t569 (/ 7.0 16.0))
(t570 (/ 645.0 4.0))
(t571 (/ 2579.0 16.0))
(t572 (/ 2581.0 8.0))
(t573 (/ 2581.0 8.0))
(t574 (/ 2581.0 8.0))
(t575 (/ 2581.0 8.0))
(t576 (/ 2581.0 8.0))
(t577 (/ 2581.0 8.0))
(t578 (/ 2581.0 8.0))
(t579 0.0)
(t580 (/ 5161.0 16.0))
(t581 (/ 645.0 2.0))
(t582 0.0)
(t583 (/ 645.0 2.0))
(t584 (/ 15.0 2.0))
(t585 (/ 119.0 16.0))
(t586 (/ 59.0 8.0))
(t587 (/ 117.0 16.0))
(t588 (/ 29.0 4.0))
(t589 (/ 115.0 16.0))
(t590 (/ 57.0 8.0))
(t591 (/ 113.0 16.0))
(t592 7.0)
(t593 0.0)
(t594 (/ 111.0 16.0))
(t595 (/ 55.0 8.0))
(t596 0.0)
(t597 (/ 109.0 16.0))
(t598 (/ 615.0 8.0))
(t599 0.0)
(t600 0.0)
(t601 0.0)
(t602 (/ 615.0 8.0))
(t603 (/ 615.0 8.0))
(t604 (/ 615.0 8.0))
(t606 (/ 615.0 8.0))
(t607 (/ 615.0 8.0))
(t608 0.0)
(t609 (/ 615.0 8.0))
(t610 (/ 615.0 8.0))
(t611 (/ 307.0 4.0))
(t612 0.0)
(t613 0.0)
(t614 0.0)
(t615 (/ 307.0 4.0))
(t616 (/ 1235.0 16.0))
(t617 (/ 1235.0 16.0))
(t618 (/ 1235.0 16.0))
(t619 (/ 1235.0 16.0))
(t620 (/ 7.0 16.0))
(t621 (/ 307.0 4.0))
(t622 (/ 307.0 4.0))
(t623 (/ 1229.0 8.0))
(t624 (/ 1229.0 8.0))
(t625 (/ 1229.0 8.0))
(t626 (/ 1229.0 8.0))
(t627 (/ 1229.0 8.0))
(t628 (/ 1229.0 8.0))
(t629 (/ 1229.0 8.0))
(t630 0.0)
(t631 (/ 1229.0 8.0))
(t632 (/ 1229.0 8.0))
(t633 0.0)
(t634 (/ 1229.0 8.0))
(t635 (/ 27.0 4.0))
(t637 (/ 107.0 16.0))
(t638 (/ 53.0 8.0))
(t639 (/ 105.0 16.0))
(t640 (/ 13.0 2.0))
(t641 (/ 103.0 16.0))
(t642 (/ 51.0 8.0))
(t643 (/ 101.0 16.0))
(t644 (/ 25.0 4.0))
(t645 0.0)
(t646 (/ 99.0 16.0))
(t647 (/ 49.0 8.0))
(t648 0.0)
(t649 (/ 97.0 16.0))
(t650 35.0)
(t651 0.0)
(t652 0.0)
(t653 0.0)
(t654 35.0)
(t655 35.0)
(t656 35.0)
(t657 35.0)
(t658 35.0)
(t659 0.0)
(t660 35.0)
(t661 (/ 559.0 16.0))
(t662 (/ 279.0 8.0))
(t663 0.0)
(t664 0.0)
(t665 0.0)
(t666 (/ 279.0 8.0))
(t667 (/ 565.0 16.0))
(t668 (/ 565.0 16.0))
(t669 (/ 565.0 16.0))
(t670 (/ 565.0 16.0))
(t671 (/ 7.0 16.0))
(t672 (/ 279.0 8.0))
(t673 (/ 279.0 8.0))
(t674 (/ 559.0 8.0))
(t675 (/ 559.0 8.0))
(t676 (/ 559.0 8.0))
(t677 (/ 559.0 8.0))
(t678 (/ 559.0 8.0))
(t679 (/ 559.0 8.0))
(t680 (/ 559.0 8.0))
(t681 0.0)
(t682 (/ 559.0 8.0))
(t683 (/ 559.0 8.0))
(t684 0.0)
(t685 (/ 1117.0 16.0))
(t686 6.0)
(t687 (/ 95.0 16.0))
(t688 (/ 47.0 8.0))
(t689 (/ 93.0 16.0))
(t690 (/ 23.0 4.0))
(t691 (/ 91.0 16.0))
(t692 (/ 45.0 8.0))
(t693 (/ 89.0 16.0))
(t694 (/ 11.0 2.0))
(t695 0.0)
(t696 (/ 87.0 16.0))
(t697 (/ 43.0 8.0))
(t698 0.0)
(t699 (/ 85.0 16.0))
(t700 (/ 29.0 2.0))
(t701 0.0)
(t702 0.0)
(t703 0.0)
(t704 (/ 29.0 2.0))
(t705 (/ 29.0 2.0))
(t706 (/ 29.0 2.0))
(t708 (/ 29.0 2.0))
(t709 (/ 29.0 2.0))
(t710 0.0)
(t711 (/ 29.0 2.0))
(t712 (/ 231.0 16.0))
(t713 (/ 57.0 4.0))
(t714 0.0)
(t715 0.0)
(t716 0.0)
(t717 (/ 57.0 4.0))
(t718 (/ 57.0 4.0))
(t719 (/ 57.0 4.0))
(t720 (/ 57.0 4.0))
(t721 (/ 57.0 4.0))
(t722 0.0)
(t723 (/ 57.0 4.0))
(t724 (/ 227.0 16.0))
(t725 (/ 115.0 4.0))
(t726 (/ 115.0 4.0))
(t727 (/ 115.0 4.0))
(t729 (/ 115.0 4.0))
(t730 (/ 115.0 4.0))
(t731 (/ 115.0 4.0))
(t732 (/ 115.0 4.0))
(t733 0.0)
(t734 (/ 115.0 4.0))
(t735 (/ 115.0 4.0))
(t736 0.0)
(t737 (/ 459.0 16.0))
(t738 (/ 21.0 4.0))
(t739 (/ 83.0 16.0))
(t740 (/ 41.0 8.0))
(t741 (/ 81.0 16.0))
(t742 5.0)
(t743 (/ 79.0 16.0))
(t744 (/ 39.0 8.0))
(t745 (/ 77.0 16.0))
(t746 (/ 19.0 4.0))
(t747 0.0)
(t748 (/ 7.0 2.0))
(t749 (/ 55.0 16.0))
(t750 0.0)
(t751 (/ 11.0 4.0))
(t752 6.0)
(t753 (/ 3.0 16.0))
(t754 (/ 1.0 8.0))
(t755 (/ 1.0 16.0))
(t756 (/ 23.0 4.0))
(t757 (/ 91.0 16.0))
(t758 (/ 45.0 8.0))
(t759 (/ 89.0 16.0))
(t760 (/ 11.0 2.0))
(t761 0.0)
(t762 (/ 87.0 16.0))
(t763 (/ 77.0 16.0))
(t764 (/ 73.0 16.0))
(t765 (/ 3.0 16.0))
(t766 (/ 1.0 8.0))
(t767 (/ 1.0 16.0))
(t768 (/ 69.0 16.0))
(t769 (/ 17.0 4.0))
(t770 (/ 67.0 16.0))
(t771 (/ 33.0 8.0))
(t772 (/ 65.0 16.0))
(t773 0.0)
(t774 4.0)
(t775 (/ 63.0 16.0))
(t776 (/ 75.0 8.0))
(t777 (/ 149.0 16.0))
(t778 (/ 37.0 4.0))
(t779 (/ 147.0 16.0))
(t780 (/ 73.0 8.0))
(t781 (/ 145.0 16.0))
(t782 9.0)
(t783 0.0)
(t784 (/ 143.0 16.0))
(t785 (/ 71.0 8.0))
(t786 0.0)
(t787 (/ 141.0 16.0))
(t788 (/ 43.0 16.0))
(t789 (/ 21.0 8.0))
(t790 (/ 41.0 16.0))
(t791 (/ 5.0 2.0))
(t792 (/ 39.0 16.0))
(t793 (/ 19.0 8.0))
(t794 (/ 37.0 16.0))
(t795 (/ 9.0 4.0))
(t796 (/ 35.0 16.0))
(t797 0.0)
(t798 (/ 7.0 8.0))
(t799 (/ 13.0 16.0))
(t800 0.0)
(t801 (/ 1.0 16.0))
(t802 (/ 17.0 8.0))
(t803 (/ 3.0 16.0))
(t804 (/ 1.0 8.0))
(t805 (/ 1.0 16.0))
(t806 (/ 15.0 8.0))
(t807 (/ 19.0 8.0))
(t808 (/ 37.0 16.0))
(t809 (/ 9.0 4.0))
(t810 (/ 35.0 16.0))
(t811 (/ 9.0 16.0))
(t812 (/ 25.0 16.0))
(t813 (/ 15.0 16.0))
(t814 (/ 3.0 4.0))
(t815 (/ 3.0 16.0))
(t816 (/ 1.0 8.0))
(t817 (/ 1.0 16.0))
(t818 (/ 1.0 2.0))
(t819 timeout
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
SMT process timed out in 75279ms, After SMT, problems are : Problem set: 0 solved, 867 unsolved
Fused 867 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 867 out of 959 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 959/959 places, 900/900 transitions.
Applied a total of 0 rules in 29 ms. Remains 959 /959 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 959/959 places, 900/900 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 959/959 places, 900/900 transitions.
Applied a total of 0 rules in 24 ms. Remains 959 /959 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 959 cols
[2025-06-01 00:14:01] [INFO ] Invariants computation overflowed in 125 ms
[2025-06-01 00:14:01] [INFO ] Implicit Places using invariants in 286 ms returned []
// Phase 1: matrix 900 rows 959 cols
[2025-06-01 00:14:01] [INFO ] Invariants computation overflowed in 117 ms
[2025-06-01 00:14:01] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:14:13] [INFO ] Implicit Places using invariants and state equation in 12436 ms returned [85, 91, 287, 412, 780, 906]
[2025-06-01 00:14:13] [INFO ] Actually due to overlaps returned [412, 287]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12737 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 957/959 places, 900/900 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 957 transition count 899
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 956 transition count 899
Applied a total of 2 rules in 44 ms. Remains 956 /957 variables (removed 1) and now considering 899/900 (removed 1) transitions.
// Phase 1: matrix 899 rows 956 cols
[2025-06-01 00:14:13] [INFO ] Invariants computation overflowed in 70 ms
[2025-06-01 00:14:14] [INFO ] Implicit Places using invariants in 215 ms returned []
// Phase 1: matrix 899 rows 956 cols
[2025-06-01 00:14:14] [INFO ] Invariants computation overflowed in 69 ms
[2025-06-01 00:14:14] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:14:25] [INFO ] Implicit Places using invariants and state equation in 11267 ms returned [85, 91, 777, 903]
[2025-06-01 00:14:25] [INFO ] Actually due to overlaps returned [903, 777]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11488 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 954/959 places, 899/900 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 954 transition count 898
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 953 transition count 898
Applied a total of 2 rules in 44 ms. Remains 953 /954 variables (removed 1) and now considering 898/899 (removed 1) transitions.
// Phase 1: matrix 898 rows 953 cols
[2025-06-01 00:14:25] [INFO ] Invariants computation overflowed in 118 ms
[2025-06-01 00:14:25] [INFO ] Implicit Places using invariants in 270 ms returned []
// Phase 1: matrix 898 rows 953 cols
[2025-06-01 00:14:25] [INFO ] Invariants computation overflowed in 109 ms
[2025-06-01 00:14:26] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:14:27] [INFO ] Implicit Places using invariants and state equation in 2130 ms returned [85, 91]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2405 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 951/959 places, 898/900 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 951 transition count 897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 950 transition count 897
Applied a total of 2 rules in 43 ms. Remains 950 /951 variables (removed 1) and now considering 897/898 (removed 1) transitions.
// Phase 1: matrix 897 rows 950 cols
[2025-06-01 00:14:27] [INFO ] Invariants computation overflowed in 54 ms
[2025-06-01 00:14:28] [INFO ] Implicit Places using invariants in 212 ms returned []
// Phase 1: matrix 897 rows 950 cols
[2025-06-01 00:14:28] [INFO ] Invariants computation overflowed in 52 ms
[2025-06-01 00:14:28] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:14:31] [INFO ] Implicit Places using invariants and state equation in 3130 ms returned []
Implicit Place search using SMT with State Equation took 3344 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 950/959 places, 897/900 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 30129 ms. Remains : 950/959 places, 897/900 transitions.
RANDOM walk for 3140699 steps (453454 resets) in 120004 ms. (26 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4003 steps (362 resets) in 105 ms. (37 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (351 resets) in 103 ms. (38 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (382 resets) in 106 ms. (37 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4003 steps (364 resets) in 101 ms. (39 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (354 resets) in 105 ms. (37 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (372 resets) in 104 ms. (38 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (372 resets) in 102 ms. (38 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4003 steps (363 resets) in 109 ms. (36 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (347 resets) in 103 ms. (38 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (357 resets) in 101 ms. (39 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (376 resets) in 104 ms. (38 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (385 resets) in 106 ms. (37 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (383 resets) in 110 ms. (36 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (368 resets) in 177 ms. (22 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (374 resets) in 218 ms. (18 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (355 resets) in 165 ms. (24 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4003 steps (366 resets) in 182 ms. (21 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4003 steps (352 resets) in 125 ms. (31 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (362 resets) in 196 ms. (20 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (380 resets) in 149 ms. (26 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (355 resets) in 136 ms. (29 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (380 resets) in 230 ms. (17 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (351 resets) in 203 ms. (19 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (355 resets) in 164 ms. (24 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (330 resets) in 118 ms. (33 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (366 resets) in 257 ms. (15 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (362 resets) in 203 ms. (19 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (364 resets) in 249 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (379 resets) in 142 ms. (27 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (368 resets) in 148 ms. (26 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (361 resets) in 206 ms. (19 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (365 resets) in 190 ms. (20 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (374 resets) in 199 ms. (20 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4003 steps (363 resets) in 197 ms. (20 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4003 steps (349 resets) in 123 ms. (32 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (369 resets) in 260 ms. (15 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (372 resets) in 151 ms. (26 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4003 steps (359 resets) in 217 ms. (18 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4003 steps (351 resets) in 225 ms. (17 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (374 resets) in 222 ms. (17 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (373 resets) in 195 ms. (20 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (382 resets) in 145 ms. (27 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (369 resets) in 191 ms. (20 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4003 steps (359 resets) in 156 ms. (25 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (377 resets) in 182 ms. (21 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (341 resets) in 163 ms. (24 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (374 resets) in 202 ms. (19 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (362 resets) in 203 ms. (19 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (369 resets) in 154 ms. (25 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (352 resets) in 207 ms. (19 steps per ms) remains 867/867 properties
Probabilistic random walk after 1000001 steps, saw 500249 distinct states, run finished after 46213 ms. (steps per millisecond=21 ) properties seen :0
// Phase 1: matrix 897 rows 950 cols
[2025-06-01 00:15:50] [INFO ] Invariants computation overflowed in 55 ms
[2025-06-01 00:15:50] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 867 unsolved
At refinement iteration 1 (OVERLAPS) 823/1690 variables, 867/867 constraints. Problems are: Problem set: 0 solved, 867 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1690 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 867 unsolved
Error getting values : (error "ParserException while parsing response: ((t6 (/ 265.0 16.0))
(t8 (/ 33.0 2.0))
(t9 0.0)
(t10 (/ 263.0 16.0))
(t12 (/ 5582577.0 16.0))
(t13 (/ 5582575.0 16.0))
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 (/ 5582575.0 16.0))
(t18 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
SMT process timed out in 90204ms, After SMT, problems are : Problem set: 0 solved, 867 unsolved
Fused 867 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 867 out of 950 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 897/897 transitions.
Applied a total of 0 rules in 30 ms. Remains 950 /950 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 950/950 places, 897/897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 897/897 transitions.
Applied a total of 0 rules in 20 ms. Remains 950 /950 variables (removed 0) and now considering 897/897 (removed 0) transitions.
// Phase 1: matrix 897 rows 950 cols
[2025-06-01 00:17:20] [INFO ] Invariants computation overflowed in 54 ms
[2025-06-01 00:17:20] [INFO ] Implicit Places using invariants in 230 ms returned []
// Phase 1: matrix 897 rows 950 cols
[2025-06-01 00:17:20] [INFO ] Invariants computation overflowed in 59 ms
[2025-06-01 00:17:21] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:17:23] [INFO ] Implicit Places using invariants and state equation in 3186 ms returned []
Implicit Place search using SMT with State Equation took 3420 ms to find 0 implicit places.
[2025-06-01 00:17:23] [INFO ] Redundant transitions in 49 ms returned []
Running 896 sub problems to find dead transitions.
// Phase 1: matrix 897 rows 950 cols
[2025-06-01 00:17:23] [INFO ] Invariants computation overflowed in 50 ms
[2025-06-01 00:17:23] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/945 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 1 (OVERLAPS) 897/1842 variables, 945/945 constraints. Problems are: Problem set: 0 solved, 896 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1842/1847 variables, and 957 constraints, problems are : Problem set: 0 solved, 896 unsolved in 30028 ms.
Refiners :[State Equation: 945/950 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 896/896 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 896 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/945 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 1 (OVERLAPS) 897/1842 variables, 945/945 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1842 variables, 12/957 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1842 variables, 890/1847 constraints. Problems are: Problem set: 0 solved, 896 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1842/1847 variables, and 1847 constraints, problems are : Problem set: 0 solved, 896 unsolved in 30026 ms.
Refiners :[State Equation: 945/950 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 890/896 constraints, Known Traps: 0/0 constraints]
After SMT, in 60251ms problems are : Problem set: 0 solved, 896 unsolved
Search for dead transitions found 0 dead transitions in 60262ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63764 ms. Remains : 950/950 places, 897/897 transitions.
RANDOM walk for 400000 steps (57734 resets) in 16539 ms. (24 steps per ms) remains 867/867 properties
Running SMT prover for 867 properties.
// Phase 1: matrix 897 rows 950 cols
[2025-06-01 00:18:28] [INFO ] Invariants computation overflowed in 57 ms
[2025-06-01 00:18:41] [INFO ] After 12655ms SMT Verify possible using state equation in real domain returned unsat :0 sat :867
[2025-06-01 00:18:41] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:18:55] [INFO ] After 13345ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :867
TRAPS : Iteration 0
[2025-06-01 00:19:52] [INFO ] After 71049ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:867
[2025-06-01 00:19:52] [INFO ] After 84389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:867
[2025-06-01 00:20:14] [INFO ] After 20531ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :867
[2025-06-01 00:20:38] [INFO ] After 24427ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :867
TRAPS : Iteration 0
[2025-06-01 00:20:39] [INFO ] Deduced a trap composed of 358 places in 447 ms of which 90 ms to minimize.
[2025-06-01 00:20:39] [INFO ] Deduced a trap composed of 363 places in 332 ms of which 7 ms to minimize.
[2025-06-01 00:20:39] [INFO ] Deduced a trap composed of 376 places in 284 ms of which 6 ms to minimize.
[2025-06-01 00:20:40] [INFO ] Deduced a trap composed of 372 places in 307 ms of which 5 ms to minimize.
[2025-06-01 00:20:40] [INFO ] Deduced a trap composed of 361 places in 331 ms of which 6 ms to minimize.
[2025-06-01 00:20:40] [INFO ] Deduced a trap composed of 62 places in 321 ms of which 6 ms to minimize.
[2025-06-01 00:20:41] [INFO ] Deduced a trap composed of 64 places in 372 ms of which 6 ms to minimize.
[2025-06-01 00:20:41] [INFO ] Deduced a trap composed of 405 places in 335 ms of which 6 ms to minimize.
[2025-06-01 00:20:41] [INFO ] Deduced a trap composed of 74 places in 316 ms of which 6 ms to minimize.
[2025-06-01 00:20:42] [INFO ] Deduced a trap composed of 394 places in 337 ms of which 6 ms to minimize.
[2025-06-01 00:20:42] [INFO ] Deduced a trap composed of 38 places in 312 ms of which 5 ms to minimize.
[2025-06-01 00:20:42] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4169 ms
[2025-06-01 00:20:43] [INFO ] Deduced a trap composed of 234 places in 163 ms of which 3 ms to minimize.
[2025-06-01 00:20:43] [INFO ] Deduced a trap composed of 194 places in 189 ms of which 2 ms to minimize.
[2025-06-01 00:20:43] [INFO ] Deduced a trap composed of 222 places in 178 ms of which 3 ms to minimize.
[2025-06-01 00:20:43] [INFO ] Deduced a trap composed of 172 places in 193 ms of which 2 ms to minimize.
[2025-06-01 00:20:44] [INFO ] Deduced a trap composed of 170 places in 169 ms of which 2 ms to minimize.
[2025-06-01 00:20:44] [INFO ] Deduced a trap composed of 198 places in 159 ms of which 4 ms to minimize.
[2025-06-01 00:20:44] [INFO ] Deduced a trap composed of 182 places in 135 ms of which 2 ms to minimize.
[2025-06-01 00:20:44] [INFO ] Deduced a trap composed of 184 places in 151 ms of which 2 ms to minimize.
[2025-06-01 00:20:44] [INFO ] Deduced a trap composed of 218 places in 133 ms of which 2 ms to minimize.
[2025-06-01 00:20:45] [INFO ] Deduced a trap composed of 209 places in 136 ms of which 2 ms to minimize.
[2025-06-01 00:20:45] [INFO ] Deduced a trap composed of 198 places in 146 ms of which 2 ms to minimize.
[2025-06-01 00:20:45] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2230 ms
[2025-06-01 00:20:46] [INFO ] Deduced a trap composed of 196 places in 129 ms of which 2 ms to minimize.
[2025-06-01 00:20:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2025-06-01 00:20:46] [INFO ] Deduced a trap composed of 202 places in 126 ms of which 1 ms to minimize.
[2025-06-01 00:20:46] [INFO ] Deduced a trap composed of 208 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:20:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 413 ms
[2025-06-01 00:20:48] [INFO ] Deduced a trap composed of 158 places in 158 ms of which 2 ms to minimize.
[2025-06-01 00:20:49] [INFO ] Deduced a trap composed of 160 places in 149 ms of which 2 ms to minimize.
[2025-06-01 00:20:49] [INFO ] Deduced a trap composed of 146 places in 160 ms of which 3 ms to minimize.
[2025-06-01 00:20:49] [INFO ] Deduced a trap composed of 148 places in 158 ms of which 3 ms to minimize.
[2025-06-01 00:20:49] [INFO ] Deduced a trap composed of 182 places in 159 ms of which 3 ms to minimize.
[2025-06-01 00:20:49] [INFO ] Deduced a trap composed of 173 places in 172 ms of which 3 ms to minimize.
[2025-06-01 00:20:50] [INFO ] Deduced a trap composed of 122 places in 168 ms of which 3 ms to minimize.
[2025-06-01 00:20:50] [INFO ] Deduced a trap composed of 169 places in 178 ms of which 3 ms to minimize.
[2025-06-01 00:20:50] [INFO ] Deduced a trap composed of 110 places in 177 ms of which 3 ms to minimize.
[2025-06-01 00:20:50] [INFO ] Deduced a trap composed of 182 places in 179 ms of which 3 ms to minimize.
[2025-06-01 00:20:51] [INFO ] Deduced a trap composed of 98 places in 190 ms of which 3 ms to minimize.
[2025-06-01 00:20:51] [INFO ] Deduced a trap composed of 100 places in 190 ms of which 3 ms to minimize.
[2025-06-01 00:20:51] [INFO ] Deduced a trap composed of 192 places in 198 ms of which 3 ms to minimize.
[2025-06-01 00:20:51] [INFO ] Deduced a trap composed of 88 places in 198 ms of which 3 ms to minimize.
[2025-06-01 00:20:52] [INFO ] Deduced a trap composed of 50 places in 216 ms of which 4 ms to minimize.
[2025-06-01 00:20:52] [INFO ] Deduced a trap composed of 52 places in 230 ms of which 4 ms to minimize.
[2025-06-01 00:20:52] [INFO ] Deduced a trap composed of 154 places in 193 ms of which 3 ms to minimize.
[2025-06-01 00:20:53] [INFO ] Deduced a trap composed of 153 places in 191 ms of which 5 ms to minimize.
[2025-06-01 00:20:53] [INFO ] Deduced a trap composed of 177 places in 187 ms of which 3 ms to minimize.
[2025-06-01 00:20:53] [INFO ] Deduced a trap composed of 165 places in 187 ms of which 3 ms to minimize.
[2025-06-01 00:20:53] [INFO ] Deduced a trap composed of 177 places in 200 ms of which 5 ms to minimize.
[2025-06-01 00:20:53] [INFO ] Deduced a trap composed of 190 places in 194 ms of which 3 ms to minimize.
[2025-06-01 00:20:54] [INFO ] Deduced a trap composed of 225 places in 199 ms of which 3 ms to minimize.
[2025-06-01 00:20:54] [INFO ] Deduced a trap composed of 228 places in 191 ms of which 3 ms to minimize.
[2025-06-01 00:20:54] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 3 ms to minimize.
[2025-06-01 00:20:54] [INFO ] Deduced a trap composed of 209 places in 160 ms of which 3 ms to minimize.
[2025-06-01 00:20:55] [INFO ] Deduced a trap composed of 134 places in 157 ms of which 2 ms to minimize.
[2025-06-01 00:20:55] [INFO ] Deduced a trap composed of 124 places in 181 ms of which 3 ms to minimize.
[2025-06-01 00:20:55] [INFO ] Deduced a trap composed of 141 places in 166 ms of which 3 ms to minimize.
[2025-06-01 00:20:55] [INFO ] Deduced a trap composed of 207 places in 166 ms of which 2 ms to minimize.
[2025-06-01 00:20:56] [INFO ] Deduced a trap composed of 136 places in 168 ms of which 2 ms to minimize.
[2025-06-01 00:20:56] [INFO ] Deduced a trap composed of 92 places in 204 ms of which 7 ms to minimize.
[2025-06-01 00:20:56] [INFO ] Deduced a trap composed of 40 places in 240 ms of which 4 ms to minimize.
[2025-06-01 00:20:56] [INFO ] Deduced a trap composed of 93 places in 245 ms of which 4 ms to minimize.
[2025-06-01 00:20:57] [INFO ] Deduced a trap composed of 28 places in 236 ms of which 5 ms to minimize.
[2025-06-01 00:20:57] [INFO ] Deduced a trap composed of 27 places in 235 ms of which 4 ms to minimize.
[2025-06-01 00:20:57] [INFO ] Deduced a trap composed of 80 places in 211 ms of which 3 ms to minimize.
[2025-06-01 00:20:58] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 4 ms to minimize.
[2025-06-01 00:20:58] [INFO ] Deduced a trap composed of 18 places in 245 ms of which 5 ms to minimize.
[2025-06-01 00:20:58] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 5 ms to minimize.
[2025-06-01 00:20:59] [INFO ] Deduced a trap composed of 201 places in 246 ms of which 4 ms to minimize.
[2025-06-01 00:20:59] [INFO ] Deduced a trap composed of 44 places in 232 ms of which 4 ms to minimize.
[2025-06-01 00:20:59] [INFO ] Deduced a trap composed of 69 places in 219 ms of which 3 ms to minimize.
[2025-06-01 00:20:59] [INFO ] Deduced a trap composed of 56 places in 221 ms of which 4 ms to minimize.
[2025-06-01 00:21:00] [INFO ] Deduced a trap composed of 86 places in 194 ms of which 3 ms to minimize.
[2025-06-01 00:21:00] [INFO ] Deduced a trap composed of 104 places in 186 ms of which 3 ms to minimize.
[2025-06-01 00:21:00] [INFO ] Deduced a trap composed of 129 places in 187 ms of which 3 ms to minimize.
[2025-06-01 00:21:01] [INFO ] Deduced a trap composed of 112 places in 184 ms of which 3 ms to minimize.
[2025-06-01 00:21:01] [INFO ] Deduced a trap composed of 259 places in 182 ms of which 3 ms to minimize.
[2025-06-01 00:21:01] [INFO ] Deduced a trap composed of 175 places in 181 ms of which 3 ms to minimize.
[2025-06-01 00:21:01] [INFO ] Deduced a trap composed of 116 places in 178 ms of which 3 ms to minimize.
[2025-06-01 00:21:02] [INFO ] Deduced a trap composed of 212 places in 126 ms of which 1 ms to minimize.
[2025-06-01 00:21:02] [INFO ] Deduced a trap composed of 164 places in 152 ms of which 2 ms to minimize.
[2025-06-01 00:21:08] [INFO ] Deduced a trap composed of 76 places in 209 ms of which 4 ms to minimize.
[2025-06-01 00:21:12] [INFO ] Deduced a trap composed of 14 places in 295 ms of which 5 ms to minimize.
[2025-06-01 00:21:13] [INFO ] Deduced a trap composed of 10 places in 296 ms of which 5 ms to minimize.
[2025-06-01 00:21:15] [INFO ] Deduced a trap composed of 153 places in 160 ms of which 3 ms to minimize.
[2025-06-01 00:21:15] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 26994 ms
[2025-06-01 00:21:21] [INFO ] Deduced a trap composed of 207 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:21:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2025-06-01 00:21:28] [INFO ] Deduced a trap composed of 326 places in 308 ms of which 6 ms to minimize.
[2025-06-01 00:21:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 379 ms
[2025-06-01 00:21:34] [INFO ] Deduced a trap composed of 309 places in 306 ms of which 5 ms to minimize.
[2025-06-01 00:21:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4554 ms
[2025-06-01 00:21:43] [INFO ] Deduced a trap composed of 55 places in 289 ms of which 5 ms to minimize.
[2025-06-01 00:21:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 386 ms
[2025-06-01 00:21:45] [INFO ] Deduced a trap composed of 354 places in 338 ms of which 5 ms to minimize.
[2025-06-01 00:21:45] [INFO ] Deduced a trap composed of 351 places in 346 ms of which 6 ms to minimize.
[2025-06-01 00:21:46] [INFO ] Deduced a trap composed of 359 places in 348 ms of which 6 ms to minimize.
[2025-06-01 00:21:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1301 ms
[2025-06-01 00:21:46] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 6 ms to minimize.
[2025-06-01 00:21:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 397 ms
[2025-06-01 00:21:50] [INFO ] Deduced a trap composed of 369 places in 342 ms of which 6 ms to minimize.
[2025-06-01 00:21:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 408 ms
[2025-06-01 00:21:50] [INFO ] Deduced a trap composed of 344 places in 261 ms of which 5 ms to minimize.
[2025-06-01 00:21:51] [INFO ] Deduced a trap composed of 324 places in 304 ms of which 5 ms to minimize.
[2025-06-01 00:21:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 992 ms
[2025-06-01 00:21:57] [INFO ] Deduced a trap composed of 323 places in 265 ms of which 4 ms to minimize.
[2025-06-01 00:21:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 400 ms
[2025-06-01 00:21:59] [INFO ] Deduced a trap composed of 322 places in 262 ms of which 5 ms to minimize.
[2025-06-01 00:21:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 476 ms
[2025-06-01 00:22:04] [INFO ] Deduced a trap composed of 292 places in 259 ms of which 4 ms to minimize.
[2025-06-01 00:22:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 365 ms
[2025-06-01 00:22:14] [INFO ] Deduced a trap composed of 283 places in 244 ms of which 5 ms to minimize.
[2025-06-01 00:22:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 373 ms
[2025-06-01 00:22:16] [INFO ] Deduced a trap composed of 318 places in 259 ms of which 4 ms to minimize.
[2025-06-01 00:22:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 369 ms
[2025-06-01 00:22:19] [INFO ] Deduced a trap composed of 297 places in 232 ms of which 4 ms to minimize.
[2025-06-01 00:22:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 351 ms
[2025-06-01 00:22:28] [INFO ] Deduced a trap composed of 359 places in 329 ms of which 6 ms to minimize.
[2025-06-01 00:22:29] [INFO ] Deduced a trap composed of 330 places in 338 ms of which 6 ms to minimize.
[2025-06-01 00:22:29] [INFO ] Deduced a trap composed of 359 places in 330 ms of which 6 ms to minimize.
[2025-06-01 00:22:29] [INFO ] Deduced a trap composed of 302 places in 322 ms of which 6 ms to minimize.
[2025-06-01 00:22:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1548 ms
[2025-06-01 00:22:31] [INFO ] Deduced a trap composed of 282 places in 223 ms of which 4 ms to minimize.
[2025-06-01 00:22:32] [INFO ] Deduced a trap composed of 284 places in 226 ms of which 4 ms to minimize.
[2025-06-01 00:22:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 958 ms
[2025-06-01 00:22:57] [INFO ] Deduced a trap composed of 3 places in 309 ms of which 5 ms to minimize.
[2025-06-01 00:22:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 421 ms
[2025-06-01 00:23:01] [INFO ] Deduced a trap composed of 418 places in 321 ms of which 6 ms to minimize.
[2025-06-01 00:23:01] [INFO ] Deduced a trap composed of 67 places in 247 ms of which 4 ms to minimize.
[2025-06-01 00:23:02] [INFO ] Deduced a trap composed of 400 places in 326 ms of which 6 ms to minimize.
[2025-06-01 00:23:02] [INFO ] Deduced a trap composed of 386 places in 344 ms of which 5 ms to minimize.
[2025-06-01 00:23:02] [INFO ] Deduced a trap composed of 391 places in 324 ms of which 6 ms to minimize.
[2025-06-01 00:23:03] [INFO ] Deduced a trap composed of 81 places in 239 ms of which 4 ms to minimize.
[2025-06-01 00:23:03] [INFO ] Deduced a trap composed of 393 places in 321 ms of which 6 ms to minimize.
[2025-06-01 00:23:03] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2494 ms
[2025-06-01 00:23:04] [INFO ] Deduced a trap composed of 395 places in 317 ms of which 5 ms to minimize.
[2025-06-01 00:23:04] [INFO ] Deduced a trap composed of 388 places in 320 ms of which 5 ms to minimize.
[2025-06-01 00:23:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 852 ms
[2025-06-01 00:23:05] [INFO ] Deduced a trap composed of 273 places in 201 ms of which 3 ms to minimize.
[2025-06-01 00:23:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 310 ms
[2025-06-01 00:23:07] [INFO ] Deduced a trap composed of 294 places in 200 ms of which 4 ms to minimize.
[2025-06-01 00:23:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 349 ms
[2025-06-01 00:23:08] [INFO ] Deduced a trap composed of 281 places in 327 ms of which 6 ms to minimize.
[2025-06-01 00:23:08] [INFO ] Deduced a trap composed of 278 places in 311 ms of which 5 ms to minimize.
[2025-06-01 00:23:09] [INFO ] Deduced a trap composed of 390 places in 310 ms of which 6 ms to minimize.
[2025-06-01 00:23:09] [INFO ] Deduced a trap composed of 413 places in 316 ms of which 6 ms to minimize.
[2025-06-01 00:23:10] [INFO ] Deduced a trap composed of 297 places in 306 ms of which 5 ms to minimize.
[2025-06-01 00:23:11] [INFO ] Deduced a trap composed of 380 places in 312 ms of which 6 ms to minimize.
[2025-06-01 00:23:11] [INFO ] Deduced a trap composed of 371 places in 313 ms of which 6 ms to minimize.
[2025-06-01 00:23:11] [INFO ] Deduced a trap composed of 388 places in 307 ms of which 5 ms to minimize.
[2025-06-01 00:23:12] [INFO ] Deduced a trap composed of 394 places in 314 ms of which 5 ms to minimize.
[2025-06-01 00:23:12] [INFO ] Deduced a trap composed of 402 places in 313 ms of which 5 ms to minimize.
[2025-06-01 00:23:13] [INFO ] Deduced a trap composed of 380 places in 303 ms of which 5 ms to minimize.
SMT process timed out, exceeded limit of 100
[2025-06-01 00:23:13] [INFO ] After 178914ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :867
[2025-06-01 00:23:13] [INFO ] After 200073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :867
RANDOM walk for 3064368 steps (442621 resets) in 120004 ms. (25 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (370 resets) in 219 ms. (18 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (373 resets) in 236 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (352 resets) in 243 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (360 resets) in 251 ms. (15 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (378 resets) in 251 ms. (15 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (361 resets) in 165 ms. (24 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (355 resets) in 247 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (369 resets) in 250 ms. (15 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (375 resets) in 247 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (339 resets) in 239 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (349 resets) in 199 ms. (20 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (372 resets) in 243 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (370 resets) in 242 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (380 resets) in 253 ms. (15 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (355 resets) in 201 ms. (19 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (356 resets) in 252 ms. (15 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (366 resets) in 239 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4003 steps (359 resets) in 248 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (351 resets) in 234 ms. (17 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4003 steps (360 resets) in 245 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (370 resets) in 245 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (374 resets) in 244 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (362 resets) in 230 ms. (17 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (358 resets) in 266 ms. (14 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (376 resets) in 259 ms. (15 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (374 resets) in 244 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (346 resets) in 238 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (366 resets) in 258 ms. (15 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (363 resets) in 244 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (350 resets) in 244 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (371 resets) in 195 ms. (20 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4004 steps (353 resets) in 261 ms. (15 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (383 resets) in 265 ms. (15 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (372 resets) in 246 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (356 resets) in 240 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4003 steps (370 resets) in 238 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (373 resets) in 235 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4002 steps (375 resets) in 252 ms. (15 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (346 resets) in 186 ms. (21 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (365 resets) in 263 ms. (15 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (369 resets) in 265 ms. (15 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (367 resets) in 181 ms. (21 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (375 resets) in 231 ms. (17 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (357 resets) in 244 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (385 resets) in 196 ms. (20 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (362 resets) in 248 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (360 resets) in 251 ms. (15 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4001 steps (382 resets) in 248 ms. (16 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4003 steps (373 resets) in 165 ms. (24 steps per ms) remains 867/867 properties
BEST_FIRST walk for 4000 steps (378 resets) in 241 ms. (16 steps per ms) remains 867/867 properties
Probabilistic random walk after 1000001 steps, saw 500249 distinct states, run finished after 50294 ms. (steps per millisecond=19 ) properties seen :0
// Phase 1: matrix 897 rows 950 cols
[2025-06-01 00:24:36] [INFO ] Invariants computation overflowed in 54 ms
[2025-06-01 00:24:36] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 867 unsolved
At refinement iteration 1 (OVERLAPS) 823/1690 variables, 867/867 constraints. Problems are: Problem set: 0 solved, 867 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1690 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 867 unsolved
At refinement iteration 3 (OVERLAPS) 56/1746 variables, 23/890 constraints. Problems are: Problem set: 0 solved, 867 unsolved
SMT process timed out in 105188ms, After SMT, problems are : Problem set: 0 solved, 867 unsolved
Fused 867 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 867 out of 950 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 897/897 transitions.
Applied a total of 0 rules in 34 ms. Remains 950 /950 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 950/950 places, 897/897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 897/897 transitions.
Applied a total of 0 rules in 18 ms. Remains 950 /950 variables (removed 0) and now considering 897/897 (removed 0) transitions.
// Phase 1: matrix 897 rows 950 cols
[2025-06-01 00:26:22] [INFO ] Invariants computation overflowed in 57 ms
[2025-06-01 00:26:22] [INFO ] Implicit Places using invariants in 229 ms returned []
// Phase 1: matrix 897 rows 950 cols
[2025-06-01 00:26:22] [INFO ] Invariants computation overflowed in 48 ms
[2025-06-01 00:26:22] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:26:25] [INFO ] Implicit Places using invariants and state equation in 3145 ms returned []
Implicit Place search using SMT with State Equation took 3375 ms to find 0 implicit places.
[2025-06-01 00:26:25] [INFO ] Redundant transitions in 10 ms returned []
Running 896 sub problems to find dead transitions.
// Phase 1: matrix 897 rows 950 cols
[2025-06-01 00:26:25] [INFO ] Invariants computation overflowed in 54 ms
[2025-06-01 00:26:25] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/945 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 1 (OVERLAPS) 897/1842 variables, 945/945 constraints. Problems are: Problem set: 0 solved, 896 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1842/1847 variables, and 957 constraints, problems are : Problem set: 0 solved, 896 unsolved in 30018 ms.
Refiners :[State Equation: 945/950 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 896/896 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 896 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/945 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 1 (OVERLAPS) 897/1842 variables, 945/945 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1842 variables, 12/957 constraints. Problems are: Problem set: 0 solved, 896 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1842/1847 variables, and 1847 constraints, problems are : Problem set: 0 solved, 896 unsolved in 30041 ms.
Refiners :[State Equation: 945/950 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 890/896 constraints, Known Traps: 0/0 constraints]
After SMT, in 60256ms problems are : Problem set: 0 solved, 896 unsolved
Search for dead transitions found 0 dead transitions in 60264ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63679 ms. Remains : 950/950 places, 897/897 transitions.
RANDOM walk for 400000 steps (57595 resets) in 39219 ms. (10 steps per ms) remains 867/867 properties
Running SMT prover for 867 properties.
// Phase 1: matrix 897 rows 950 cols
[2025-06-01 00:27:36] [INFO ] Invariants computation overflowed in 58 ms
[2025-06-01 00:27:50] [INFO ] After 13364ms SMT Verify possible using state equation in real domain returned unsat :0 sat :867
[2025-06-01 00:27:50] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:28:03] [INFO ] After 13382ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :867
TRAPS : Iteration 0
[2025-06-01 00:29:03] [INFO ] After 72767ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:867
[2025-06-01 00:29:03] [INFO ] After 86796ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:867
[2025-06-01 00:29:24] [INFO ] After 20718ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :867
[2025-06-01 00:29:48] [INFO ] After 24200ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :867
TRAPS : Iteration 0
[2025-06-01 00:29:49] [INFO ] Deduced a trap composed of 358 places in 325 ms of which 6 ms to minimize.
[2025-06-01 00:29:49] [INFO ] Deduced a trap composed of 363 places in 309 ms of which 5 ms to minimize.
[2025-06-01 00:29:49] [INFO ] Deduced a trap composed of 376 places in 307 ms of which 6 ms to minimize.
[2025-06-01 00:29:50] [INFO ] Deduced a trap composed of 372 places in 314 ms of which 5 ms to minimize.
[2025-06-01 00:29:50] [INFO ] Deduced a trap composed of 361 places in 298 ms of which 5 ms to minimize.
[2025-06-01 00:29:50] [INFO ] Deduced a trap composed of 62 places in 297 ms of which 5 ms to minimize.
[2025-06-01 00:29:51] [INFO ] Deduced a trap composed of 64 places in 319 ms of which 6 ms to minimize.
[2025-06-01 00:29:51] [INFO ] Deduced a trap composed of 405 places in 298 ms of which 5 ms to minimize.
[2025-06-01 00:29:51] [INFO ] Deduced a trap composed of 74 places in 290 ms of which 5 ms to minimize.
[2025-06-01 00:29:52] [INFO ] Deduced a trap composed of 394 places in 294 ms of which 6 ms to minimize.
[2025-06-01 00:29:52] [INFO ] Deduced a trap composed of 38 places in 295 ms of which 5 ms to minimize.
[2025-06-01 00:29:52] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3837 ms
[2025-06-01 00:29:53] [INFO ] Deduced a trap composed of 234 places in 157 ms of which 3 ms to minimize.
[2025-06-01 00:29:53] [INFO ] Deduced a trap composed of 194 places in 154 ms of which 2 ms to minimize.
[2025-06-01 00:29:53] [INFO ] Deduced a trap composed of 222 places in 151 ms of which 3 ms to minimize.
[2025-06-01 00:29:53] [INFO ] Deduced a trap composed of 172 places in 158 ms of which 2 ms to minimize.
[2025-06-01 00:29:53] [INFO ] Deduced a trap composed of 170 places in 147 ms of which 2 ms to minimize.
[2025-06-01 00:29:54] [INFO ] Deduced a trap composed of 198 places in 145 ms of which 2 ms to minimize.
[2025-06-01 00:29:54] [INFO ] Deduced a trap composed of 182 places in 140 ms of which 2 ms to minimize.
[2025-06-01 00:29:54] [INFO ] Deduced a trap composed of 184 places in 143 ms of which 3 ms to minimize.
[2025-06-01 00:29:54] [INFO ] Deduced a trap composed of 218 places in 132 ms of which 2 ms to minimize.
[2025-06-01 00:29:54] [INFO ] Deduced a trap composed of 209 places in 130 ms of which 2 ms to minimize.
[2025-06-01 00:29:55] [INFO ] Deduced a trap composed of 198 places in 136 ms of which 2 ms to minimize.
[2025-06-01 00:29:55] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2073 ms
[2025-06-01 00:29:55] [INFO ] Deduced a trap composed of 196 places in 128 ms of which 2 ms to minimize.
[2025-06-01 00:29:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2025-06-01 00:29:56] [INFO ] Deduced a trap composed of 202 places in 126 ms of which 1 ms to minimize.
[2025-06-01 00:29:56] [INFO ] Deduced a trap composed of 208 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:29:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 404 ms
[2025-06-01 00:29:58] [INFO ] Deduced a trap composed of 158 places in 147 ms of which 2 ms to minimize.
[2025-06-01 00:29:58] [INFO ] Deduced a trap composed of 160 places in 148 ms of which 3 ms to minimize.
[2025-06-01 00:29:58] [INFO ] Deduced a trap composed of 146 places in 147 ms of which 2 ms to minimize.
[2025-06-01 00:29:59] [INFO ] Deduced a trap composed of 148 places in 164 ms of which 3 ms to minimize.
[2025-06-01 00:29:59] [INFO ] Deduced a trap composed of 182 places in 166 ms of which 3 ms to minimize.
[2025-06-01 00:29:59] [INFO ] Deduced a trap composed of 173 places in 167 ms of which 3 ms to minimize.
[2025-06-01 00:29:59] [INFO ] Deduced a trap composed of 122 places in 172 ms of which 2 ms to minimize.
[2025-06-01 00:29:59] [INFO ] Deduced a trap composed of 169 places in 175 ms of which 3 ms to minimize.
[2025-06-01 00:30:00] [INFO ] Deduced a trap composed of 110 places in 172 ms of which 3 ms to minimize.
[2025-06-01 00:30:00] [INFO ] Deduced a trap composed of 182 places in 179 ms of which 3 ms to minimize.
[2025-06-01 00:30:00] [INFO ] Deduced a trap composed of 98 places in 185 ms of which 3 ms to minimize.
[2025-06-01 00:30:00] [INFO ] Deduced a trap composed of 100 places in 196 ms of which 3 ms to minimize.
[2025-06-01 00:30:01] [INFO ] Deduced a trap composed of 192 places in 198 ms of which 4 ms to minimize.
[2025-06-01 00:30:01] [INFO ] Deduced a trap composed of 88 places in 202 ms of which 4 ms to minimize.
[2025-06-01 00:30:01] [INFO ] Deduced a trap composed of 50 places in 214 ms of which 3 ms to minimize.
[2025-06-01 00:30:01] [INFO ] Deduced a trap composed of 52 places in 216 ms of which 4 ms to minimize.
[2025-06-01 00:30:02] [INFO ] Deduced a trap composed of 154 places in 191 ms of which 3 ms to minimize.
[2025-06-01 00:30:02] [INFO ] Deduced a trap composed of 153 places in 178 ms of which 3 ms to minimize.
[2025-06-01 00:30:02] [INFO ] Deduced a trap composed of 177 places in 196 ms of which 3 ms to minimize.
[2025-06-01 00:30:03] [INFO ] Deduced a trap composed of 165 places in 191 ms of which 4 ms to minimize.
[2025-06-01 00:30:03] [INFO ] Deduced a trap composed of 177 places in 198 ms of which 4 ms to minimize.
[2025-06-01 00:30:03] [INFO ] Deduced a trap composed of 190 places in 198 ms of which 3 ms to minimize.
[2025-06-01 00:30:03] [INFO ] Deduced a trap composed of 225 places in 192 ms of which 3 ms to minimize.
[2025-06-01 00:30:04] [INFO ] Deduced a trap composed of 228 places in 185 ms of which 3 ms to minimize.
[2025-06-01 00:30:04] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 3 ms to minimize.
[2025-06-01 00:30:04] [INFO ] Deduced a trap composed of 209 places in 156 ms of which 3 ms to minimize.
[2025-06-01 00:30:04] [INFO ] Deduced a trap composed of 134 places in 167 ms of which 2 ms to minimize.
[2025-06-01 00:30:05] [INFO ] Deduced a trap composed of 124 places in 176 ms of which 3 ms to minimize.
[2025-06-01 00:30:05] [INFO ] Deduced a trap composed of 141 places in 167 ms of which 3 ms to minimize.
[2025-06-01 00:30:05] [INFO ] Deduced a trap composed of 207 places in 169 ms of which 3 ms to minimize.
[2025-06-01 00:30:05] [INFO ] Deduced a trap composed of 136 places in 162 ms of which 3 ms to minimize.
[2025-06-01 00:30:05] [INFO ] Deduced a trap composed of 92 places in 192 ms of which 3 ms to minimize.
[2025-06-01 00:30:06] [INFO ] Deduced a trap composed of 40 places in 227 ms of which 4 ms to minimize.
[2025-06-01 00:30:06] [INFO ] Deduced a trap composed of 93 places in 229 ms of which 4 ms to minimize.
[2025-06-01 00:30:06] [INFO ] Deduced a trap composed of 28 places in 229 ms of which 5 ms to minimize.
[2025-06-01 00:30:07] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 4 ms to minimize.
[2025-06-01 00:30:07] [INFO ] Deduced a trap composed of 80 places in 219 ms of which 4 ms to minimize.
[2025-06-01 00:30:07] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 4 ms to minimize.
[2025-06-01 00:30:07] [INFO ] Deduced a trap composed of 18 places in 247 ms of which 4 ms to minimize.
[2025-06-01 00:30:08] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 5 ms to minimize.
[2025-06-01 00:30:08] [INFO ] Deduced a trap composed of 201 places in 251 ms of which 5 ms to minimize.
[2025-06-01 00:30:08] [INFO ] Deduced a trap composed of 44 places in 238 ms of which 4 ms to minimize.
[2025-06-01 00:30:09] [INFO ] Deduced a trap composed of 69 places in 207 ms of which 3 ms to minimize.
[2025-06-01 00:30:09] [INFO ] Deduced a trap composed of 56 places in 231 ms of which 4 ms to minimize.
[2025-06-01 00:30:09] [INFO ] Deduced a trap composed of 86 places in 194 ms of which 4 ms to minimize.
[2025-06-01 00:30:10] [INFO ] Deduced a trap composed of 104 places in 187 ms of which 3 ms to minimize.
[2025-06-01 00:30:10] [INFO ] Deduced a trap composed of 129 places in 187 ms of which 3 ms to minimize.
[2025-06-01 00:30:10] [INFO ] Deduced a trap composed of 112 places in 177 ms of which 3 ms to minimize.
[2025-06-01 00:30:10] [INFO ] Deduced a trap composed of 259 places in 181 ms of which 3 ms to minimize.
[2025-06-01 00:30:11] [INFO ] Deduced a trap composed of 175 places in 177 ms of which 3 ms to minimize.
[2025-06-01 00:30:11] [INFO ] Deduced a trap composed of 116 places in 180 ms of which 3 ms to minimize.
[2025-06-01 00:30:11] [INFO ] Deduced a trap composed of 212 places in 130 ms of which 1 ms to minimize.
[2025-06-01 00:30:12] [INFO ] Deduced a trap composed of 164 places in 146 ms of which 3 ms to minimize.
[2025-06-01 00:30:18] [INFO ] Deduced a trap composed of 76 places in 201 ms of which 4 ms to minimize.
[2025-06-01 00:30:22] [INFO ] Deduced a trap composed of 14 places in 302 ms of which 6 ms to minimize.
[2025-06-01 00:30:22] [INFO ] Deduced a trap composed of 10 places in 286 ms of which 5 ms to minimize.
[2025-06-01 00:30:24] [INFO ] Deduced a trap composed of 153 places in 153 ms of which 2 ms to minimize.
[2025-06-01 00:30:25] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 26729 ms
[2025-06-01 00:30:30] [INFO ] Deduced a trap composed of 207 places in 114 ms of which 2 ms to minimize.
[2025-06-01 00:30:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 294 ms
[2025-06-01 00:30:37] [INFO ] Deduced a trap composed of 326 places in 315 ms of which 5 ms to minimize.
[2025-06-01 00:30:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 389 ms
[2025-06-01 00:30:43] [INFO ] Deduced a trap composed of 309 places in 289 ms of which 5 ms to minimize.
[2025-06-01 00:30:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4502 ms
[2025-06-01 00:30:52] [INFO ] Deduced a trap composed of 55 places in 282 ms of which 5 ms to minimize.
[2025-06-01 00:30:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 383 ms
[2025-06-01 00:30:54] [INFO ] Deduced a trap composed of 354 places in 320 ms of which 5 ms to minimize.
[2025-06-01 00:30:54] [INFO ] Deduced a trap composed of 351 places in 325 ms of which 6 ms to minimize.
[2025-06-01 00:30:55] [INFO ] Deduced a trap composed of 359 places in 352 ms of which 6 ms to minimize.
[2025-06-01 00:30:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1263 ms
[2025-06-01 00:30:56] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 5 ms to minimize.
[2025-06-01 00:30:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 390 ms
[2025-06-01 00:30:59] [INFO ] Deduced a trap composed of 369 places in 331 ms of which 5 ms to minimize.
[2025-06-01 00:30:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 403 ms
[2025-06-01 00:31:00] [INFO ] Deduced a trap composed of 344 places in 290 ms of which 5 ms to minimize.
[2025-06-01 00:31:00] [INFO ] Deduced a trap composed of 324 places in 293 ms of which 5 ms to minimize.
[2025-06-01 00:31:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1022 ms
[2025-06-01 00:31:06] [INFO ] Deduced a trap composed of 323 places in 257 ms of which 4 ms to minimize.
[2025-06-01 00:31:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 387 ms
[2025-06-01 00:31:08] [INFO ] Deduced a trap composed of 322 places in 254 ms of which 5 ms to minimize.
[2025-06-01 00:31:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 464 ms
[2025-06-01 00:31:13] [INFO ] Deduced a trap composed of 292 places in 245 ms of which 4 ms to minimize.
[2025-06-01 00:31:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 344 ms
[2025-06-01 00:31:23] [INFO ] Deduced a trap composed of 283 places in 237 ms of which 4 ms to minimize.
[2025-06-01 00:31:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 365 ms
[2025-06-01 00:31:25] [INFO ] Deduced a trap composed of 318 places in 246 ms of which 4 ms to minimize.
[2025-06-01 00:31:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 347 ms
[2025-06-01 00:31:28] [INFO ] Deduced a trap composed of 297 places in 228 ms of which 4 ms to minimize.
[2025-06-01 00:31:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
[2025-06-01 00:31:37] [INFO ] Deduced a trap composed of 359 places in 309 ms of which 6 ms to minimize.
[2025-06-01 00:31:37] [INFO ] Deduced a trap composed of 330 places in 319 ms of which 6 ms to minimize.
[2025-06-01 00:31:38] [INFO ] Deduced a trap composed of 359 places in 307 ms of which 5 ms to minimize.
[2025-06-01 00:31:38] [INFO ] Deduced a trap composed of 302 places in 308 ms of which 5 ms to minimize.
[2025-06-01 00:31:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1471 ms
[2025-06-01 00:31:40] [INFO ] Deduced a trap composed of 282 places in 216 ms of which 4 ms to minimize.
[2025-06-01 00:31:40] [INFO ] Deduced a trap composed of 284 places in 206 ms of which 3 ms to minimize.
[2025-06-01 00:31:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 922 ms
[2025-06-01 00:32:05] [INFO ] Deduced a trap composed of 3 places in 291 ms of which 5 ms to minimize.
[2025-06-01 00:32:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 409 ms
[2025-06-01 00:32:09] [INFO ] Deduced a trap composed of 418 places in 306 ms of which 5 ms to minimize.
[2025-06-01 00:32:09] [INFO ] Deduced a trap composed of 67 places in 251 ms of which 5 ms to minimize.
[2025-06-01 00:32:09] [INFO ] Deduced a trap composed of 400 places in 320 ms of which 5 ms to minimize.
[2025-06-01 00:32:10] [INFO ] Deduced a trap composed of 386 places in 319 ms of which 6 ms to minimize.
[2025-06-01 00:32:10] [INFO ] Deduced a trap composed of 391 places in 317 ms of which 5 ms to minimize.
[2025-06-01 00:32:10] [INFO ] Deduced a trap composed of 81 places in 231 ms of which 4 ms to minimize.
[2025-06-01 00:32:11] [INFO ] Deduced a trap composed of 393 places in 291 ms of which 6 ms to minimize.
[2025-06-01 00:32:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2413 ms
[2025-06-01 00:32:11] [INFO ] Deduced a trap composed of 395 places in 303 ms of which 6 ms to minimize.
[2025-06-01 00:32:11] [INFO ] Deduced a trap composed of 388 places in 294 ms of which 6 ms to minimize.
[2025-06-01 00:32:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 813 ms
[2025-06-01 00:32:12] [INFO ] Deduced a trap composed of 273 places in 193 ms of which 5 ms to minimize.
[2025-06-01 00:32:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
[2025-06-01 00:32:15] [INFO ] Deduced a trap composed of 294 places in 193 ms of which 3 ms to minimize.
[2025-06-01 00:32:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 338 ms
[2025-06-01 00:32:15] [INFO ] Deduced a trap composed of 281 places in 295 ms of which 5 ms to minimize.
[2025-06-01 00:32:16] [INFO ] Deduced a trap composed of 278 places in 292 ms of which 5 ms to minimize.
[2025-06-01 00:32:16] [INFO ] Deduced a trap composed of 390 places in 319 ms of which 5 ms to minimize.
[2025-06-01 00:32:17] [INFO ] Deduced a trap composed of 413 places in 325 ms of which 5 ms to minimize.
[2025-06-01 00:32:17] [INFO ] Deduced a trap composed of 297 places in 303 ms of which 6 ms to minimize.
[2025-06-01 00:32:18] [INFO ] Deduced a trap composed of 380 places in 302 ms of which 5 ms to minimize.
[2025-06-01 00:32:18] [INFO ] Deduced a trap composed of 371 places in 304 ms of which 5 ms to minimize.
[2025-06-01 00:32:19] [INFO ] Deduced a trap composed of 388 places in 306 ms of which 6 ms to minimize.
[2025-06-01 00:32:19] [INFO ] Deduced a trap composed of 394 places in 317 ms of which 5 ms to minimize.
[2025-06-01 00:32:19] [INFO ] Deduced a trap composed of 402 places in 295 ms of which 5 ms to minimize.
[2025-06-01 00:32:20] [INFO ] Deduced a trap composed of 380 places in 295 ms of which 5 ms to minimize.
[2025-06-01 00:32:20] [INFO ] Deduced a trap composed of 378 places in 290 ms of which 5 ms to minimize.
[2025-06-01 00:32:20] [INFO ] Deduced a trap composed of 390 places in 285 ms of which 6 ms to minimize.
[2025-06-01 00:32:21] [INFO ] Deduced a trap composed of 406 places in 284 ms of which 5 ms to minimize.
[2025-06-01 00:32:21] [INFO ] Deduced a trap composed of 408 places in 294 ms of which 5 ms to minimize.
[2025-06-01 00:32:21] [INFO ] Deduced a trap composed of 419 places in 289 ms of which 5 ms to minimize.
[2025-06-01 00:32:22] [INFO ] Deduced a trap composed of 394 places in 290 ms of which 5 ms to minimize.
[2025-06-01 00:32:22] [INFO ] Deduced a trap composed of 400 places in 286 ms of which 5 ms to minimize.
[2025-06-01 00:32:22] [INFO ] Deduced a trap composed of 394 places in 286 ms of which 5 ms to minimize.
[2025-06-01 00:32:23] [INFO ] Deduced a trap composed of 389 places in 301 ms of which 5 ms to minimize.
SMT process timed out, exceeded limit of 100
[2025-06-01 00:32:23] [INFO ] After 178811ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :867
[2025-06-01 00:32:23] [INFO ] After 200197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :867
RANDOM walk for 40000 steps (5790 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3712 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 282850 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 1
Probabilistic random walk after 282850 steps, saw 141464 distinct states, run finished after 3005 ms. (steps per millisecond=94 ) properties seen :0
// Phase 1: matrix 897 rows 950 cols
[2025-06-01 00:32:26] [INFO ] Invariants computation overflowed in 53 ms
[2025-06-01 00:32:26] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/22 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/64 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 57/121 variables, 28/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/177 variables, 28/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 90/267 variables, 41/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 70/337 variables, 41/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/337 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 66/403 variables, 33/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/403 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 82/485 variables, 45/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/485 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 52/537 variables, 28/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/537 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 59/596 variables, 32/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/596 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 47/643 variables, 24/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/643 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 56/699 variables, 29/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/699 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 47/746 variables, 24/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/746 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 56/802 variables, 29/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/802 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 47/849 variables, 24/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/849 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 56/905 variables, 29/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/905 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 47/952 variables, 24/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/952 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 56/1008 variables, 29/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1008 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 47/1055 variables, 24/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1055 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 56/1111 variables, 29/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1111 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 47/1158 variables, 24/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1158 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 56/1214 variables, 29/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1214 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 47/1261 variables, 24/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1261 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 56/1317 variables, 29/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1317 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 47/1364 variables, 24/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1364 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 56/1420 variables, 29/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1420 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 47/1467 variables, 24/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1467 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 56/1523 variables, 29/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1523 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 48/1571 variables, 24/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1571 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 74/1645 variables, 34/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1645 variables, 2/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1645 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 92/1737 variables, 45/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1737 variables, 2/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1737 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 92/1829 variables, 50/937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1829 variables, 8/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1829 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 18/1847 variables, 17/962 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1847 variables, 0/962 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 0/1847 variables, 0/962 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1847/1847 variables, and 962 constraints, problems are : Problem set: 0 solved, 1 unsolved in 965 ms.
Refiners :[State Equation: 950/950 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/22 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 42/64 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/121 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/177 variables, 28/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/177 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 90/267 variables, 41/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 70/337 variables, 41/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/337 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 66/403 variables, 33/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/403 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 82/485 variables, 45/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/485 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 52/537 variables, 28/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/537 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 59/596 variables, 32/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/596 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 47/643 variables, 24/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/643 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 56/699 variables, 29/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/699 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 47/746 variables, 24/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/746 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 56/802 variables, 29/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/802 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 47/849 variables, 24/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/849 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 56/905 variables, 29/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/905 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 47/952 variables, 24/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/952 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 56/1008 variables, 29/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1008 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 47/1055 variables, 24/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1055 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 56/1111 variables, 29/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1111 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 47/1158 variables, 24/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1158 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 56/1214 variables, 29/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1214 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 47/1261 variables, 24/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1261 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 56/1317 variables, 29/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1317 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 47/1364 variables, 24/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1364 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 56/1420 variables, 29/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1420 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 47/1467 variables, 24/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1467 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 56/1523 variables, 29/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1523 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 48/1571 variables, 24/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1571 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 74/1645 variables, 34/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1645 variables, 2/841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1645 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1737/1847 variables, and 886 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1876 ms.
Refiners :[State Equation: 883/950 constraints, ReadFeed: 2/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2909ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 950 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 897/897 transitions.
Graph (complete) has 1803 edges and 950 vertex of which 944 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 200 rules applied. Total rules applied 201 place count 943 transition count 698
Reduce places removed 197 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 198 rules applied. Total rules applied 399 place count 746 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 745 transition count 697
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 400 place count 745 transition count 664
Deduced a syphon composed of 33 places in 4 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 466 place count 712 transition count 664
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Deduced a syphon composed of 147 places in 2 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 294 rules applied. Total rules applied 760 place count 565 transition count 517
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 822 place count 534 transition count 517
Free-agglomeration rule (complex) applied 68 times.
Iterating global reduction 3 with 68 rules applied. Total rules applied 890 place count 534 transition count 449
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 3 with 68 rules applied. Total rules applied 958 place count 466 transition count 449
Partial Free-agglomeration rule applied 66 times.
Drop transitions (Partial Free agglomeration) removed 66 transitions
Iterating global reduction 4 with 66 rules applied. Total rules applied 1024 place count 466 transition count 449
Applied a total of 1024 rules in 126 ms. Remains 466 /950 variables (removed 484) and now considering 449/897 (removed 448) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 466/950 places, 449/897 transitions.
RANDOM walk for 40000 steps (5748 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3670 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 446443 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 1
Probabilistic random walk after 446443 steps, saw 223400 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
// Phase 1: matrix 449 rows 466 cols
[2025-06-01 00:32:32] [INFO ] Invariants computation overflowed in 36 ms
[2025-06-01 00:32:32] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/41 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 230/271 variables, 74/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 8/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 483/754 variables, 251/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/754 variables, 38/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/754 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 161/915 variables, 130/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/915 variables, 28/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/915 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/915 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 915/915 variables, and 544 constraints, problems are : Problem set: 0 solved, 1 unsolved in 307 ms.
Refiners :[State Equation: 466/466 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/41 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 230/271 variables, 74/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 8/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 483/754 variables, 251/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/754 variables, 38/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/754 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 161/915 variables, 130/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/915 variables, 28/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:32:34] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 0 ms to minimize.
[2025-06-01 00:32:34] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2025-06-01 00:32:34] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2025-06-01 00:32:34] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2025-06-01 00:32:34] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2025-06-01 00:32:34] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2025-06-01 00:32:34] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2025-06-01 00:32:34] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2025-06-01 00:32:35] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
[2025-06-01 00:32:35] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 1 ms to minimize.
[2025-06-01 00:32:35] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 1 ms to minimize.
[2025-06-01 00:32:35] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2025-06-01 00:32:35] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
[2025-06-01 00:32:35] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
[2025-06-01 00:32:35] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2025-06-01 00:32:35] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2025-06-01 00:32:35] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2025-06-01 00:32:36] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2025-06-01 00:32:36] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2025-06-01 00:32:36] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/915 variables, 20/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:32:36] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2025-06-01 00:32:36] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 2 ms to minimize.
[2025-06-01 00:32:36] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 2 ms to minimize.
[2025-06-01 00:32:36] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 1 ms to minimize.
[2025-06-01 00:32:37] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:32:37] [INFO ] Deduced a trap composed of 103 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:32:37] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:32:37] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 2 ms to minimize.
[2025-06-01 00:32:37] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 1 ms to minimize.
[2025-06-01 00:32:37] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2025-06-01 00:32:37] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:32:37] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:32:38] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:32:38] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:32:38] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2025-06-01 00:32:38] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 1 ms to minimize.
[2025-06-01 00:32:38] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:32:38] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2025-06-01 00:32:39] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2025-06-01 00:32:39] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/915 variables, 20/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:32:39] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2025-06-01 00:32:39] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2025-06-01 00:32:39] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2025-06-01 00:32:40] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2025-06-01 00:32:40] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2025-06-01 00:32:40] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:32:41] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:32:41] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/915 variables, 8/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/915 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/915 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 915/915 variables, and 593 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8342 ms.
Refiners :[State Equation: 466/466 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 48/48 constraints]
After SMT, in 8694ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30004 ms.
Support contains 1 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 449/449 transitions.
Applied a total of 0 rules in 30 ms. Remains 466 /466 variables (removed 0) and now considering 449/449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 466/466 places, 449/449 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 449/449 transitions.
Applied a total of 0 rules in 13 ms. Remains 466 /466 variables (removed 0) and now considering 449/449 (removed 0) transitions.
// Phase 1: matrix 449 rows 466 cols
[2025-06-01 00:33:11] [INFO ] Invariants computation overflowed in 34 ms
[2025-06-01 00:33:11] [INFO ] Implicit Places using invariants in 513 ms returned []
// Phase 1: matrix 449 rows 466 cols
[2025-06-01 00:33:11] [INFO ] Invariants computation overflowed in 26 ms
[2025-06-01 00:33:12] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:33:23] [INFO ] Implicit Places using invariants and state equation in 11949 ms returned [14, 19, 67, 72, 93, 98, 118, 124, 145, 150, 170, 175, 196, 202, 221, 226, 249, 255, 277, 282, 302, 307, 328, 333, 354, 360, 381, 386, 406, 412, 434, 439, 458, 464]
[2025-06-01 00:33:23] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12466 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 464/466 places, 449/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 464 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 448
Applied a total of 2 rules in 21 ms. Remains 463 /464 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 463 cols
[2025-06-01 00:33:23] [INFO ] Computed 92 invariants in 66 ms
[2025-06-01 00:33:24] [INFO ] Implicit Places using invariants in 1091 ms returned [14, 19, 90, 95, 115, 121, 142, 147, 167, 172, 193, 199, 218, 223, 246, 252, 274, 279, 299, 304, 325, 330, 351, 357, 378, 383, 403, 409, 431, 436, 455, 461]
[2025-06-01 00:33:24] [INFO ] Actually due to overlaps returned [95, 90]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1095 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 461/466 places, 448/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 460 transition count 447
Applied a total of 2 rules in 20 ms. Remains 460 /461 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 460 cols
[2025-06-01 00:33:25] [INFO ] Invariants computation overflowed in 53 ms
[2025-06-01 00:33:25] [INFO ] Implicit Places using invariants in 480 ms returned []
// Phase 1: matrix 447 rows 460 cols
[2025-06-01 00:33:25] [INFO ] Invariants computation overflowed in 26 ms
[2025-06-01 00:33:25] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:33:38] [INFO ] Implicit Places using invariants and state equation in 13038 ms returned [14, 19, 112, 118, 139, 144, 164, 169, 190, 196, 215, 220, 243, 249, 271, 276, 296, 301, 322, 327, 348, 354, 375, 380, 400, 406, 428, 433, 452, 458]
[2025-06-01 00:33:38] [INFO ] Actually due to overlaps returned [118, 112]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13523 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 458/466 places, 447/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 446
Applied a total of 2 rules in 22 ms. Remains 457 /458 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 457 cols
[2025-06-01 00:33:38] [INFO ] Invariants computation overflowed in 75 ms
[2025-06-01 00:33:39] [INFO ] Implicit Places using invariants in 464 ms returned []
// Phase 1: matrix 446 rows 457 cols
[2025-06-01 00:33:39] [INFO ] Invariants computation overflowed in 65 ms
[2025-06-01 00:33:39] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:33:47] [INFO ] Implicit Places using invariants and state equation in 8249 ms returned [14, 19, 136, 141, 161, 166, 187, 193, 212, 217, 240, 246, 268, 273, 293, 298, 319, 324, 345, 351, 372, 377, 397, 403, 425, 430, 449, 455]
[2025-06-01 00:33:47] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8717 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 455/466 places, 446/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 455 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 445
Applied a total of 2 rules in 21 ms. Remains 454 /455 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 454 cols
[2025-06-01 00:33:47] [INFO ] Invariants computation overflowed in 28 ms
[2025-06-01 00:33:47] [INFO ] Implicit Places using invariants in 414 ms returned []
// Phase 1: matrix 445 rows 454 cols
[2025-06-01 00:33:47] [INFO ] Invariants computation overflowed in 25 ms
[2025-06-01 00:33:47] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:33:55] [INFO ] Implicit Places using invariants and state equation in 8161 ms returned [14, 19, 158, 163, 184, 190, 209, 214, 237, 243, 265, 270, 290, 295, 316, 321, 342, 348, 369, 374, 394, 400, 422, 427, 446, 452]
[2025-06-01 00:33:55] [INFO ] Actually due to overlaps returned [163, 158]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8580 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 452/466 places, 445/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 444
Applied a total of 2 rules in 21 ms. Remains 451 /452 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 451 cols
[2025-06-01 00:33:55] [INFO ] Invariants computation overflowed in 27 ms
[2025-06-01 00:33:56] [INFO ] Implicit Places using invariants in 462 ms returned []
// Phase 1: matrix 444 rows 451 cols
[2025-06-01 00:33:56] [INFO ] Invariants computation overflowed in 23 ms
[2025-06-01 00:33:56] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:34:06] [INFO ] Implicit Places using invariants and state equation in 10605 ms returned [14, 19, 181, 187, 206, 211, 234, 240, 262, 267, 287, 292, 313, 318, 339, 345, 366, 371, 391, 397, 419, 424, 443, 449]
[2025-06-01 00:34:06] [INFO ] Actually due to overlaps returned [187, 181]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11072 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 449/466 places, 444/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 449 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 448 transition count 443
Applied a total of 2 rules in 20 ms. Remains 448 /449 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 448 cols
[2025-06-01 00:34:07] [INFO ] Invariants computation overflowed in 30 ms
[2025-06-01 00:34:07] [INFO ] Implicit Places using invariants in 393 ms returned []
// Phase 1: matrix 443 rows 448 cols
[2025-06-01 00:34:07] [INFO ] Invariants computation overflowed in 26 ms
[2025-06-01 00:34:07] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:34:15] [INFO ] Implicit Places using invariants and state equation in 8005 ms returned [14, 19, 203, 208, 231, 237, 259, 264, 284, 289, 310, 315, 336, 342, 363, 368, 388, 394, 416, 421, 440, 446]
[2025-06-01 00:34:15] [INFO ] Actually due to overlaps returned [208, 203]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8399 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 446/466 places, 443/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 446 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 442
Applied a total of 2 rules in 20 ms. Remains 445 /446 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 445 cols
[2025-06-01 00:34:15] [INFO ] Computed 80 invariants in 65 ms
[2025-06-01 00:34:16] [INFO ] Implicit Places using invariants in 770 ms returned [14, 19, 228, 234, 256, 261, 281, 286, 307, 312, 333, 339, 360, 365, 385, 391, 413, 418, 437, 443]
[2025-06-01 00:34:16] [INFO ] Actually due to overlaps returned [234, 228]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 773 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 443/466 places, 442/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 443 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 441
Applied a total of 2 rules in 17 ms. Remains 442 /443 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 442 cols
[2025-06-01 00:34:16] [INFO ] Invariants computation overflowed in 33 ms
[2025-06-01 00:34:16] [INFO ] Implicit Places using invariants in 371 ms returned []
// Phase 1: matrix 441 rows 442 cols
[2025-06-01 00:34:16] [INFO ] Invariants computation overflowed in 21 ms
[2025-06-01 00:34:16] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:34:23] [INFO ] Implicit Places using invariants and state equation in 7041 ms returned [14, 19, 253, 258, 278, 283, 304, 309, 330, 336, 357, 362, 382, 388, 410, 415, 434, 440]
[2025-06-01 00:34:23] [INFO ] Actually due to overlaps returned [258, 253]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7414 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 440/466 places, 441/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 439 transition count 440
Applied a total of 2 rules in 16 ms. Remains 439 /440 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 439 cols
[2025-06-01 00:34:23] [INFO ] Invariants computation overflowed in 27 ms
[2025-06-01 00:34:23] [INFO ] Implicit Places using invariants in 338 ms returned []
// Phase 1: matrix 440 rows 439 cols
[2025-06-01 00:34:23] [INFO ] Invariants computation overflowed in 27 ms
[2025-06-01 00:34:24] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:34:30] [INFO ] Implicit Places using invariants and state equation in 6778 ms returned [14, 19, 275, 280, 301, 306, 327, 333, 354, 359, 379, 385, 407, 412, 431, 437]
[2025-06-01 00:34:30] [INFO ] Actually due to overlaps returned [280, 275]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7117 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 437/466 places, 440/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 436 transition count 439
Applied a total of 2 rules in 18 ms. Remains 436 /437 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 436 cols
[2025-06-01 00:34:30] [INFO ] Invariants computation overflowed in 25 ms
[2025-06-01 00:34:31] [INFO ] Implicit Places using invariants in 340 ms returned []
// Phase 1: matrix 439 rows 436 cols
[2025-06-01 00:34:31] [INFO ] Invariants computation overflowed in 30 ms
[2025-06-01 00:34:31] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:34:42] [INFO ] Implicit Places using invariants and state equation in 11697 ms returned [14, 19, 298, 303, 324, 330, 351, 356, 376, 382, 404, 409, 428, 434]
[2025-06-01 00:34:42] [INFO ] Actually due to overlaps returned [303, 298]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12039 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 434/466 places, 439/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 438
Applied a total of 2 rules in 16 ms. Remains 433 /434 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 433 cols
[2025-06-01 00:34:42] [INFO ] Invariants computation overflowed in 22 ms
[2025-06-01 00:34:43] [INFO ] Implicit Places using invariants in 323 ms returned []
// Phase 1: matrix 438 rows 433 cols
[2025-06-01 00:34:43] [INFO ] Invariants computation overflowed in 25 ms
[2025-06-01 00:34:43] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:34:50] [INFO ] Implicit Places using invariants and state equation in 7007 ms returned [14, 19, 321, 327, 348, 353, 373, 379, 401, 406, 425, 431]
[2025-06-01 00:34:50] [INFO ] Actually due to overlaps returned [327, 321]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7331 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 431/466 places, 438/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 431 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 430 transition count 437
Applied a total of 2 rules in 16 ms. Remains 430 /431 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 430 cols
[2025-06-01 00:34:50] [INFO ] Invariants computation overflowed in 28 ms
[2025-06-01 00:34:50] [INFO ] Implicit Places using invariants in 312 ms returned []
// Phase 1: matrix 437 rows 430 cols
[2025-06-01 00:34:50] [INFO ] Invariants computation overflowed in 23 ms
[2025-06-01 00:34:50] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:34:55] [INFO ] Implicit Places using invariants and state equation in 4857 ms returned [14, 19, 345, 350, 370, 376, 398, 403, 422, 428]
[2025-06-01 00:34:55] [INFO ] Actually due to overlaps returned [350, 345]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5176 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 428/466 places, 437/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 428 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 427 transition count 436
Applied a total of 2 rules in 20 ms. Remains 427 /428 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 427 cols
[2025-06-01 00:34:55] [INFO ] Invariants computation overflowed in 34 ms
[2025-06-01 00:34:55] [INFO ] Implicit Places using invariants in 323 ms returned []
// Phase 1: matrix 436 rows 427 cols
[2025-06-01 00:34:55] [INFO ] Invariants computation overflowed in 24 ms
[2025-06-01 00:34:55] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:35:03] [INFO ] Implicit Places using invariants and state equation in 7351 ms returned [14, 19, 367, 373, 395, 400, 419, 425]
[2025-06-01 00:35:03] [INFO ] Actually due to overlaps returned [373, 367]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7675 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 425/466 places, 436/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 425 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 424 transition count 435
Applied a total of 2 rules in 15 ms. Remains 424 /425 variables (removed 1) and now considering 435/436 (removed 1) transitions.
// Phase 1: matrix 435 rows 424 cols
[2025-06-01 00:35:03] [INFO ] Invariants computation overflowed in 27 ms
[2025-06-01 00:35:03] [INFO ] Implicit Places using invariants in 311 ms returned []
// Phase 1: matrix 435 rows 424 cols
[2025-06-01 00:35:03] [INFO ] Invariants computation overflowed in 23 ms
[2025-06-01 00:35:03] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:35:12] [INFO ] Implicit Places using invariants and state equation in 9047 ms returned [14, 19, 392, 397, 416, 422]
[2025-06-01 00:35:12] [INFO ] Actually due to overlaps returned [397, 392]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9362 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 422/466 places, 435/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 422 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 421 transition count 434
Applied a total of 2 rules in 19 ms. Remains 421 /422 variables (removed 1) and now considering 434/435 (removed 1) transitions.
// Phase 1: matrix 434 rows 421 cols
[2025-06-01 00:35:12] [INFO ] Computed 64 invariants in 60 ms
[2025-06-01 00:35:12] [INFO ] Implicit Places using invariants in 469 ms returned [14, 19, 413, 419]
[2025-06-01 00:35:12] [INFO ] Actually due to overlaps returned [413, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 470 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 419/466 places, 434/449 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 418 transition count 433
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 418 transition count 433
Applied a total of 3 rules in 24 ms. Remains 418 /419 variables (removed 1) and now considering 433/434 (removed 1) transitions.
// Phase 1: matrix 433 rows 418 cols
[2025-06-01 00:35:12] [INFO ] Computed 62 invariants in 50 ms
[2025-06-01 00:35:13] [INFO ] Implicit Places using invariants in 445 ms returned [416]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 446 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 417/466 places, 433/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 417 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 416 transition count 432
Applied a total of 2 rules in 17 ms. Remains 416 /417 variables (removed 1) and now considering 432/433 (removed 1) transitions.
// Phase 1: matrix 432 rows 416 cols
[2025-06-01 00:35:13] [INFO ] Computed 61 invariants in 55 ms
[2025-06-01 00:35:13] [INFO ] Implicit Places using invariants in 449 ms returned []
[2025-06-01 00:35:13] [INFO ] Invariant cache hit.
[2025-06-01 00:35:14] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:35:18] [INFO ] Implicit Places using invariants and state equation in 5085 ms returned []
Implicit Place search using SMT with State Equation took 5537 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 416/466 places, 432/449 transitions.
Finished structural reductions in REACHABILITY mode , in 18 iterations and 127532 ms. Remains : 416/466 places, 432/449 transitions.
RANDOM walk for 40000 steps (5786 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3663 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 281367 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 1
Probabilistic random walk after 281367 steps, saw 140714 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
// Phase 1: matrix 897 rows 950 cols
[2025-06-01 00:35:22] [INFO ] Invariants computation overflowed in 58 ms
[2025-06-01 00:35:22] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/17 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/49 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 56/105 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/178 variables, 37/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 85/263 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 66/329 variables, 38/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/329 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 65/394 variables, 35/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/394 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 61/455 variables, 31/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/455 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 51/506 variables, 31/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/506 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 37/543 variables, 18/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/543 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 56/599 variables, 29/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/599 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 44/643 variables, 22/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/643 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 56/699 variables, 29/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/699 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 47/746 variables, 24/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/746 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 56/802 variables, 29/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/802 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 47/849 variables, 24/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/849 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 56/905 variables, 29/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/905 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 47/952 variables, 24/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/952 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 56/1008 variables, 29/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1008 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 47/1055 variables, 24/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1055 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 56/1111 variables, 29/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1111 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 47/1158 variables, 24/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1158 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 56/1214 variables, 29/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1214 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 47/1261 variables, 24/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1261 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 56/1317 variables, 29/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1317 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 47/1364 variables, 24/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1364 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 56/1420 variables, 29/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1420 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 47/1467 variables, 24/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1467 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 56/1523 variables, 29/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1523 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 48/1571 variables, 24/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1571 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 74/1645 variables, 34/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1645 variables, 2/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1645 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 92/1737 variables, 45/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1737 variables, 2/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1737 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 92/1829 variables, 50/937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1829 variables, 8/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1829 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 18/1847 variables, 17/962 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1847 variables, 0/962 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 0/1847 variables, 0/962 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1847/1847 variables, and 962 constraints, problems are : Problem set: 0 solved, 1 unsolved in 961 ms.
Refiners :[State Equation: 950/950 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/17 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 32/49 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 56/105 variables, 24/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 73/178 variables, 37/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 85/263 variables, 41/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 66/329 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/329 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 65/394 variables, 35/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/394 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 61/455 variables, 31/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/455 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 51/506 variables, 31/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/506 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 37/543 variables, 18/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/543 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 56/599 variables, 29/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/599 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 44/643 variables, 22/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/643 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 56/699 variables, 29/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/699 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 47/746 variables, 24/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/746 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 56/802 variables, 29/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/802 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 47/849 variables, 24/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/849 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 56/905 variables, 29/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/905 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 47/952 variables, 24/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/952 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 56/1008 variables, 29/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1008 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 47/1055 variables, 24/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1055 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 56/1111 variables, 29/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1111 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 47/1158 variables, 24/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1158 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 56/1214 variables, 29/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1214 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 47/1261 variables, 24/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1261 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 56/1317 variables, 29/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1317 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 47/1364 variables, 24/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1364 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 56/1420 variables, 29/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1420 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 47/1467 variables, 24/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1467 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 56/1523 variables, 29/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1523 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 48/1571 variables, 24/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1571 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 74/1645 variables, 34/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1645 variables, 2/841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1645 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1737/1847 variables, and 886 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1777 ms.
Refiners :[State Equation: 883/950 constraints, ReadFeed: 2/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2805ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 950 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 897/897 transitions.
Graph (complete) has 1803 edges and 950 vertex of which 944 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.9 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 201 rules applied. Total rules applied 202 place count 943 transition count 697
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 400 place count 745 transition count 697
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 400 place count 745 transition count 664
Deduced a syphon composed of 33 places in 6 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 466 place count 712 transition count 664
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Deduced a syphon composed of 147 places in 2 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 294 rules applied. Total rules applied 760 place count 565 transition count 517
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 822 place count 534 transition count 517
Free-agglomeration rule (complex) applied 67 times.
Iterating global reduction 2 with 67 rules applied. Total rules applied 889 place count 534 transition count 450
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 2 with 67 rules applied. Total rules applied 956 place count 467 transition count 450
Partial Free-agglomeration rule applied 67 times.
Drop transitions (Partial Free agglomeration) removed 67 transitions
Iterating global reduction 3 with 67 rules applied. Total rules applied 1023 place count 467 transition count 450
Applied a total of 1023 rules in 79 ms. Remains 467 /950 variables (removed 483) and now considering 450/897 (removed 447) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 467/950 places, 450/897 transitions.
RANDOM walk for 40000 steps (5757 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3670 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 444840 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 1
Probabilistic random walk after 444840 steps, saw 222598 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
// Phase 1: matrix 450 rows 467 cols
[2025-06-01 00:35:28] [INFO ] Invariants computation overflowed in 34 ms
[2025-06-01 00:35:28] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/24 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 215/239 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 511/750 variables, 268/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 41/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/750 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 167/917 variables, 135/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/917 variables, 29/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/917 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/917 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 917/917 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 311 ms.
Refiners :[State Equation: 467/467 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/24 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 215/239 variables, 57/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 511/750 variables, 268/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/750 variables, 41/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/750 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 167/917 variables, 135/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/917 variables, 29/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:35:29] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2025-06-01 00:35:29] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2025-06-01 00:35:29] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2025-06-01 00:35:29] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2025-06-01 00:35:29] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 0 ms to minimize.
[2025-06-01 00:35:29] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2025-06-01 00:35:30] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 0 ms to minimize.
[2025-06-01 00:35:30] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 0 ms to minimize.
[2025-06-01 00:35:30] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/917 variables, 9/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/917 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/917 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 917/917 variables, and 555 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2047 ms.
Refiners :[State Equation: 467/467 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 2405ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30001 ms.
Support contains 1 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 450/450 transitions.
Applied a total of 0 rules in 8 ms. Remains 467 /467 variables (removed 0) and now considering 450/450 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 467/467 places, 450/450 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 450/450 transitions.
Applied a total of 0 rules in 9 ms. Remains 467 /467 variables (removed 0) and now considering 450/450 (removed 0) transitions.
// Phase 1: matrix 450 rows 467 cols
[2025-06-01 00:36:00] [INFO ] Invariants computation overflowed in 34 ms
[2025-06-01 00:36:00] [INFO ] Implicit Places using invariants in 470 ms returned []
// Phase 1: matrix 450 rows 467 cols
[2025-06-01 00:36:00] [INFO ] Invariants computation overflowed in 28 ms
[2025-06-01 00:36:01] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:36:18] [INFO ] Implicit Places using invariants and state equation in 17600 ms returned [15, 20, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 222, 227, 250, 256, 278, 283, 303, 308, 329, 334, 355, 361, 382, 387, 407, 413, 435, 440, 459, 465]
[2025-06-01 00:36:18] [INFO ] Actually due to overlaps returned [73, 68]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 18071 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 465/467 places, 450/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 465 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 464 transition count 449
Applied a total of 2 rules in 25 ms. Remains 464 /465 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 464 cols
[2025-06-01 00:36:18] [INFO ] Invariants computation overflowed in 29 ms
[2025-06-01 00:36:18] [INFO ] Implicit Places using invariants in 443 ms returned []
// Phase 1: matrix 449 rows 464 cols
[2025-06-01 00:36:18] [INFO ] Invariants computation overflowed in 24 ms
[2025-06-01 00:36:19] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:36:30] [INFO ] Implicit Places using invariants and state equation in 11434 ms returned [15, 20, 91, 96, 116, 122, 143, 148, 168, 173, 194, 200, 219, 224, 247, 253, 275, 280, 300, 305, 326, 331, 352, 358, 379, 384, 404, 410, 432, 437, 456, 462]
[2025-06-01 00:36:30] [INFO ] Actually due to overlaps returned [96, 91]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11880 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 462/467 places, 449/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 462 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 461 transition count 448
Applied a total of 2 rules in 21 ms. Remains 461 /462 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 461 cols
[2025-06-01 00:36:30] [INFO ] Invariants computation overflowed in 35 ms
[2025-06-01 00:36:30] [INFO ] Implicit Places using invariants in 433 ms returned []
// Phase 1: matrix 448 rows 461 cols
[2025-06-01 00:36:30] [INFO ] Invariants computation overflowed in 26 ms
[2025-06-01 00:36:31] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:36:39] [INFO ] Implicit Places using invariants and state equation in 8729 ms returned [15, 20, 113, 119, 140, 145, 165, 170, 191, 197, 216, 221, 244, 250, 272, 277, 297, 302, 323, 328, 349, 355, 376, 381, 401, 407, 429, 434, 453, 459]
[2025-06-01 00:36:39] [INFO ] Actually due to overlaps returned [119, 113]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9165 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 459/467 places, 448/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 459 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 458 transition count 447
Applied a total of 2 rules in 17 ms. Remains 458 /459 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 458 cols
[2025-06-01 00:36:39] [INFO ] Computed 88 invariants in 61 ms
[2025-06-01 00:36:40] [INFO ] Implicit Places using invariants in 1010 ms returned [15, 20, 137, 142, 162, 167, 188, 194, 213, 218, 241, 247, 269, 274, 294, 299, 320, 325, 346, 352, 373, 378, 398, 404, 426, 431, 450, 456]
[2025-06-01 00:36:40] [INFO ] Actually due to overlaps returned [142, 137]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1011 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 456/467 places, 447/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 456 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 455 transition count 446
Applied a total of 2 rules in 33 ms. Remains 455 /456 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 455 cols
[2025-06-01 00:36:40] [INFO ] Invariants computation overflowed in 35 ms
[2025-06-01 00:36:41] [INFO ] Implicit Places using invariants in 402 ms returned []
// Phase 1: matrix 446 rows 455 cols
[2025-06-01 00:36:41] [INFO ] Invariants computation overflowed in 27 ms
[2025-06-01 00:36:41] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:36:53] [INFO ] Implicit Places using invariants and state equation in 12241 ms returned [15, 20, 159, 164, 185, 191, 210, 215, 238, 244, 266, 271, 291, 296, 317, 322, 343, 349, 370, 375, 395, 401, 423, 428, 447, 453]
[2025-06-01 00:36:53] [INFO ] Actually due to overlaps returned [164, 159]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12644 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 453/467 places, 446/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 453 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 452 transition count 445
Applied a total of 2 rules in 16 ms. Remains 452 /453 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 452 cols
[2025-06-01 00:36:53] [INFO ] Invariants computation overflowed in 29 ms
[2025-06-01 00:36:53] [INFO ] Implicit Places using invariants in 383 ms returned []
// Phase 1: matrix 445 rows 452 cols
[2025-06-01 00:36:53] [INFO ] Invariants computation overflowed in 27 ms
[2025-06-01 00:36:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:37:04] [INFO ] Implicit Places using invariants and state equation in 11107 ms returned [15, 20, 182, 188, 207, 212, 235, 241, 263, 268, 288, 293, 314, 319, 340, 346, 367, 372, 392, 398, 420, 425, 444, 450]
[2025-06-01 00:37:04] [INFO ] Actually due to overlaps returned [188, 182]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11493 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 450/467 places, 445/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 450 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 449 transition count 444
Applied a total of 2 rules in 21 ms. Remains 449 /450 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 449 cols
[2025-06-01 00:37:04] [INFO ] Invariants computation overflowed in 39 ms
[2025-06-01 00:37:05] [INFO ] Implicit Places using invariants in 407 ms returned []
// Phase 1: matrix 444 rows 449 cols
[2025-06-01 00:37:05] [INFO ] Invariants computation overflowed in 25 ms
[2025-06-01 00:37:05] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:37:14] [INFO ] Implicit Places using invariants and state equation in 9642 ms returned [15, 20, 204, 209, 232, 238, 260, 265, 285, 290, 311, 316, 337, 343, 364, 369, 389, 395, 417, 422, 441, 447]
[2025-06-01 00:37:14] [INFO ] Actually due to overlaps returned [209, 204]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10051 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 447/467 places, 444/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 447 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 446 transition count 443
Applied a total of 2 rules in 21 ms. Remains 446 /447 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 446 cols
[2025-06-01 00:37:14] [INFO ] Invariants computation overflowed in 33 ms
[2025-06-01 00:37:15] [INFO ] Implicit Places using invariants in 373 ms returned []
// Phase 1: matrix 443 rows 446 cols
[2025-06-01 00:37:15] [INFO ] Invariants computation overflowed in 26 ms
[2025-06-01 00:37:15] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:37:32] [INFO ] Implicit Places using invariants and state equation in 17107 ms returned [15, 20, 229, 235, 257, 262, 282, 287, 308, 313, 334, 340, 361, 366, 386, 392, 414, 419, 438, 444]
[2025-06-01 00:37:32] [INFO ] Actually due to overlaps returned [235, 229]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17481 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 444/467 places, 443/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 444 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 443 transition count 442
Applied a total of 2 rules in 17 ms. Remains 443 /444 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 443 cols
[2025-06-01 00:37:32] [INFO ] Invariants computation overflowed in 29 ms
[2025-06-01 00:37:32] [INFO ] Implicit Places using invariants in 378 ms returned []
// Phase 1: matrix 442 rows 443 cols
[2025-06-01 00:37:32] [INFO ] Invariants computation overflowed in 26 ms
[2025-06-01 00:37:32] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:37:40] [INFO ] Implicit Places using invariants and state equation in 7387 ms returned [15, 20, 254, 259, 279, 284, 305, 310, 331, 337, 358, 363, 383, 389, 411, 416, 435, 441]
[2025-06-01 00:37:40] [INFO ] Actually due to overlaps returned [259, 254]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7766 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 441/467 places, 442/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 441 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 440 transition count 441
Applied a total of 2 rules in 21 ms. Remains 440 /441 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 440 cols
[2025-06-01 00:37:40] [INFO ] Invariants computation overflowed in 32 ms
[2025-06-01 00:37:40] [INFO ] Implicit Places using invariants in 345 ms returned []
// Phase 1: matrix 441 rows 440 cols
[2025-06-01 00:37:40] [INFO ] Invariants computation overflowed in 27 ms
[2025-06-01 00:37:40] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:37:46] [INFO ] Implicit Places using invariants and state equation in 6150 ms returned [15, 20, 276, 281, 302, 307, 328, 334, 355, 360, 380, 386, 408, 413, 432, 438]
[2025-06-01 00:37:46] [INFO ] Actually due to overlaps returned [281, 276]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6499 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 438/467 places, 441/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 438 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 437 transition count 440
Applied a total of 2 rules in 20 ms. Remains 437 /438 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 437 cols
[2025-06-01 00:37:46] [INFO ] Invariants computation overflowed in 38 ms
[2025-06-01 00:37:47] [INFO ] Implicit Places using invariants in 343 ms returned []
// Phase 1: matrix 440 rows 437 cols
[2025-06-01 00:37:47] [INFO ] Invariants computation overflowed in 33 ms
[2025-06-01 00:37:47] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:37:55] [INFO ] Implicit Places using invariants and state equation in 8123 ms returned [15, 20, 299, 304, 325, 331, 352, 357, 377, 383, 405, 410, 429, 435]
[2025-06-01 00:37:55] [INFO ] Actually due to overlaps returned [304, 299]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8469 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 435/467 places, 440/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 435 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 434 transition count 439
Applied a total of 2 rules in 23 ms. Remains 434 /435 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 434 cols
[2025-06-01 00:37:55] [INFO ] Invariants computation overflowed in 33 ms
[2025-06-01 00:37:55] [INFO ] Implicit Places using invariants in 335 ms returned []
// Phase 1: matrix 439 rows 434 cols
[2025-06-01 00:37:55] [INFO ] Invariants computation overflowed in 27 ms
[2025-06-01 00:37:55] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:38:07] [INFO ] Implicit Places using invariants and state equation in 11629 ms returned [15, 20, 322, 328, 349, 354, 374, 380, 402, 407, 426, 432]
[2025-06-01 00:38:07] [INFO ] Actually due to overlaps returned [328, 322]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11964 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 432/467 places, 439/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 432 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 431 transition count 438
Applied a total of 2 rules in 20 ms. Remains 431 /432 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 431 cols
[2025-06-01 00:38:07] [INFO ] Invariants computation overflowed in 31 ms
[2025-06-01 00:38:07] [INFO ] Implicit Places using invariants in 325 ms returned []
// Phase 1: matrix 438 rows 431 cols
[2025-06-01 00:38:07] [INFO ] Invariants computation overflowed in 31 ms
[2025-06-01 00:38:07] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:38:15] [INFO ] Implicit Places using invariants and state equation in 7547 ms returned [15, 20, 346, 351, 371, 377, 399, 404, 423, 429]
[2025-06-01 00:38:15] [INFO ] Actually due to overlaps returned [351, 346]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7873 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 429/467 places, 438/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 429 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 428 transition count 437
Applied a total of 2 rules in 20 ms. Remains 428 /429 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 428 cols
[2025-06-01 00:38:15] [INFO ] Invariants computation overflowed in 34 ms
[2025-06-01 00:38:15] [INFO ] Implicit Places using invariants in 314 ms returned []
// Phase 1: matrix 437 rows 428 cols
[2025-06-01 00:38:15] [INFO ] Invariants computation overflowed in 31 ms
[2025-06-01 00:38:15] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 00:38:20] [INFO ] Implicit Places using invariants and state equation in 4964 ms returned [15, 20, 368, 374, 396, 401, 420, 426]
[2025-06-01 00:38:20] [INFO ] Actually due to overlaps returned [374, 368]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5280 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 426/467 places, 437/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 426 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 425 transition count 436
Applied a total of 2 rules in 15 ms. Remains 425 /426 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 425 cols
[2025-06-01 00:38:20] [INFO ] Invariants computation overflowed in 29 ms
[2025-06-01 00:38:20] [INFO ] Implicit Places using invariants in 306 ms returned []
// Phase 1: matrix 436 rows 425 cols
[2025-06-01 00:38:20] [INFO ] Invariants computation overflowed in 28 ms
[2025-06-01 00:38:20] [INFO ] State equation strengthened by 78 read => feed constraints.

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 StableMarking -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="DoubleExponent-PT-020"
export BK_EXAMINATION="StableMarking"
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 DoubleExponent-PT-020, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r084-tall-174860080400313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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