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.r014-tall-174853743600223.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 ASLink-PT-05b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014-tall-174853743600223
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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.6K 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.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 795K 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 1748546080165

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 19:14:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-29 19:14:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:14:41] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2025-05-29 19:14:41] [INFO ] Transformed 2430 places.
[2025-05-29 19:14:41] [INFO ] Transformed 3040 transitions.
[2025-05-29 19:14:41] [INFO ] Found NUPN structural information;
[2025-05-29 19:14:41] [INFO ] Parsed PT model containing 2430 places and 3040 transitions and 9292 arcs in 314 ms.
Structural test allowed to assert that 296 places are NOT stable. Took 20 ms.
RANDOM walk for 40000 steps (81 resets) in 4491 ms. (8 steps per ms) remains 658/2134 properties
BEST_FIRST walk for 122 steps (8 resets) in 9 ms. (12 steps per ms) remains 658/658 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 658/658 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 658/658 properties
BEST_FIRST walk for 122 steps (8 resets) in 13 ms. (8 steps per ms) remains 658/658 properties
BEST_FIRST walk for 123 steps (8 resets) in 13 ms. (8 steps per ms) remains 658/658 properties
BEST_FIRST walk for 121 steps (8 resets) in 11 ms. (10 steps per ms) remains 658/658 properties
BEST_FIRST walk for 122 steps (8 resets) in 16 ms. (7 steps per ms) remains 658/658 properties
BEST_FIRST walk for 122 steps (8 resets) in 21 ms. (5 steps per ms) remains 658/658 properties
BEST_FIRST walk for 122 steps (8 resets) in 11 ms. (10 steps per ms) remains 658/658 properties
BEST_FIRST walk for 123 steps (8 resets) in 38 ms. (3 steps per ms) remains 658/658 properties
BEST_FIRST walk for 123 steps (8 resets) in 16 ms. (7 steps per ms) remains 658/658 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 658/658 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 658/658 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 658/658 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 658/658 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 658/658 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 658/658 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 658/658 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 658/658 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 658/658 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 658/658 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 658/658 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 658/658 properties
BEST_FIRST walk for 122 steps (8 resets) in 13 ms. (8 steps per ms) remains 658/658 properties
BEST_FIRST walk for 122 steps (8 resets) in 10 ms. (11 steps per ms) remains 658/658 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 658/658 properties
BEST_FIRST walk for 122 steps (8 resets) in 16 ms. (7 steps per ms) remains 658/658 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 658/658 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 658/658 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 658/658 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 658/658 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 658/658 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 658/658 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 658/658 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 658/658 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 658/658 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 658/658 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 658/658 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 658/658 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 658/658 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 658/658 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 658/658 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 658/658 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 658/658 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 658/658 properties
BEST_FIRST walk for 122 steps (8 resets) in 5 ms. (20 steps per ms) remains 658/658 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 658/658 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 658/658 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 658/658 properties
BEST_FIRST walk for 122 steps (8 resets) in 5 ms. (20 steps per ms) remains 658/658 properties
// Phase 1: matrix 3040 rows 2430 cols
[2025-05-29 19:14:43] [INFO ] Computed 238 invariants in 171 ms
Error getting values : (error "ParserException while parsing response: ((s9 (/ 1.0 2.0))
(s10 (/ 1.0 2.0))
(s11 (/ 1.0 2.0))
(s12 (/ 1.0 2.0))
(s13 (/ 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))
(s24 (/ 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))
(s35 (/ 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))
(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))
(s56 (/ 1.0 2.0))
(s57 (/ 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))
(s68 (/ 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))
(s74 (/ 1.0 2.0))
(s75 (/ 1.0 2.0))
(s76 (/ 1.0 2.0))
(s77 (/ 1.0 2.0))
(s78 (/ 1.0 2.0))
(s79 (/ 1.0 2.0))
(s80 (/ 1.0 2.0))
(s90 (/ 1.0 2.0))
(s91 (/ 1.0 2.0))
(s92 (/ 1.0 2.0))
(s93 (/ 1.0 2.0))
(s94 (/ 1.0 2.0))
(s95 (/ 1.0 2.0))
(s96 (/ 1.0 2.0))
(s97 (/ 1.0 2.0))
(s98 (/ 1.0 2.0))
(s99 (/ 1.0 2.0))
(s100 (/ 1.0 2.0))
(s101 (/ 1.0 2.0))
(s102 (/ 1.0 2.0))
(s103 (/ 1.0 2.0))
(s104 (/ 1.0 2.0))
(s105 (/ 1.0 2.0))
(s106 (/ 1.0 2.0))
(s107 (/ 1.0 2.0))
(s108 (/ 1.0 2.0))
(s109 (/ 1.0 2.0))
(s110 (/ 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))
(s121 (/ 1.0 2.0))
(s122 (/ 1.0 2.0))
(s123 (/ 1.0 2.0))
(s124 (/ 1.0 2.0))
(s125 (/ 1.0 2.0))
(s126 (/ 1.0 2.0))
(s127 (/ 1.0 2.0))
(s131 (/ 1.0 2.0))
(s132 (/ 1.0 2.0))
(s133 (/ 1.0 2.0))
(s134 (/ 1.0 2.0))
(s135 (/ 1.0 2.0))
(s136 (/ 1.0 2.0))
(s137 (/ 1.0 2.0))
(s138 (/ 1.0 2.0))
(s139 (/ 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))
(s165 (/ 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))
(s176 (/ 1.0 2.0))
(s177 (/ 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))
(s187 (/ 1.0 2.0))
(s188 (/ 1.0 2.0))
(s196 (/ 1.0 2.0))
(s197 (/ 1.0 2.0))
(s199 (/ 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))
(s210 (/ 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))
(s221 (/ 1.0 2.0))
(s222 (/ 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))
(s243 (/ 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))
(s254 (/ 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))
(s265 (/ 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))
(s276 (/ 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))
(s287 (/ 1.0 2.0))
(s319 (/ 1.0 2.0))
(s320 (/ 1.0 2.0))
(s321 (/ 1.0 2.0))
(s322 (/ 1.0 2.0))
(s323 (/ 1.0 2.0))
(s324 (/ 1.0 2.0))
(s352 (/ 1.0 2.0))
(s353 (/ 1.0 2.0))
(s354 (/ 1.0 2.0))
(s355 (/ 1.0 2.0))
(s356 (/ 1.0 2.0))
(s357 (/ 1.0 2.0))
(s358 (/ 1.0 2.0))
(s399 (/ 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))
(s410 (/ 1.0 2.0))
(s411 (/ 1.0 2.0))
(s412 (/ 1.0 2.0))
(s413 (/ 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))
(s421 (/ 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))
(s428 (/ 1.0 2.0))
(s429 (/ 1.0 2.0))
(s430 (/ 1.0 2.0))
(s431 (/ 1.0 2.0))
(s432 (/ 1.0 2.0))
(s433 (/ 1.0 2.0))
(s447 (/ 1.0 2.0))
(s448 (/ 1.0 2.0))
(s449 (/ 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))
(s468 (/ 1.0 2.0))
(s469 (/ 1.0 2.0))
(s470 (/ 1.0 2.0))
(s485 (/ 1.0 2.0))
(s486 (/ 1.0 2.0))
(s487 (/ 1.0 2.0))
(s488 (/ 1.0 2.0))
(s489 (/ 1.0 2.0))
(s490 (/ 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))
(s532 (/ 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))
(s554 (/ 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))
(s565 (/ 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))
(s576 (/ 1.0 2.0))
(s577 (/ 1.0 2.0))
(s578 (/ 1.0 2.0))
(s579 (/ 1.0 2.0))
(s580 (/ 1.0 2.0))
(s582 (/ 1.0 2.0))
(s583 (/ 1.0 2.0))
(s594 (/ 1.0 2.0))
(s596 (/ 1.0 2.0))
(s597 (/ 1.0 2.0))
(s598 (/ 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))
(s609 (/ 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))
(s631 (/ 1.0 2.0))
(s632 (/ 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))
(s643 (/ 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))
(s654 (/ 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))
(s665 (/ 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))
(s676 (/ 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))
(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))
(s751 (/ 1.0 2.0))
(s752 (/ 1.0 2.0))
(s753 (/ 1.0 2.0))
(s794 (/ 1.0 2.0))
(s795 (/ 1.0 2.0))
(s796 (/ 1.0 2.0))
(s797 (/ 1.0 2.0))
(s798 (/ 1.0 2.0))
(s799 (/ 1.0 2.0))
(s800 (/ 1.0 2.0))
(s801 (/ 1.0 2.0))
(s802 (/ 1.0 2.0))
(s803 (/ 1.0 2.0))
(s804 (/ 1.0 2.0))
(s805 (/ 1.0 2.0))
(s806 (/ 1.0 2.0))
(s807 (/ 1.0 2.0))
(s808 (/ 1.0 2.0))
(s842 (/ 1.0 2.0))
(s843 (/ 1.0 2.0))
(s844 (/ 1.0 2.0))
(s851 (/ 1.0 2.0))
(s852 (/ 1.0 2.0))
(s853 (/ 1.0 2.0))
(s857 (/ 1.0 2.0))
(s858 (/ 1.0 2.0))
(s859 (/ 1.0 2.0))
(s863 (/ 1.0 2.0))
(s864 (/ 1.0 2.0))
(s865 (/ 1.0 2.0))
(s883 (/ 1.0 2.0))
(s884 (/ 1.0 2.0))
(s885 (/ 1.0 2.0))
(s921 (/ 1.0 2.0))
(s922 (/ 1.0 2.0))
(s923 (/ 1.0 2.0))
(s924 (/ 1.0 2.0))
(s925 (/ 1.0 2.0))
(s926 (/ 1.0 2.0))
(s927 (/ 1.0 2.0))
(s928 (/ 1.0 2.0))
(s929 (/ 1.0 2.0))
(s977 (/ 1.0 2.0))
(s978 (/ 1.0 2.0))
(s989 (/ 1.0 2.0))
(s991 (/ 1.0 2.0))
(s992 (/ 1.0 2.0))
(s993 (/ 1.0 2.0))
(s1026 (/ 1.0 2.0))
(s1027 (/ 1.0 2.0))
(s1028 (/ 1.0 2.0))
(s1029 (/ 1.0 2.0))
(s1030 (/ 1.0 2.0))
(s1031 (/ 1.0 2.0))
(s1032 (/ 1.0 2.0))
(s1033 (/ 1.0 2.0))
(s1034 (/ 1.0 2.0))
(s1035 (/ 1.0 2.0))
(s1036 (/ 1.0 2.0))
(s1037 (/ 1.0 2.0))
(s1038 (/ 1.0 2.0))
(s1039 (/ 1.0 2.0))
(s1040 (/ 1.0 2.0))
(s1041 (/ 1.0 2.0))
(s1042 (/ 1.0 2.0))
(s1043 (/ 1.0 2.0))
(s1044 (/ 1.0 2.0))
(s1045 (/ 1.0 2.0))
(s1046 (/ 1.0 2.0))
(s1047 (/ 1.0 2.0))
(s1048 (/ 1.0 2.0))
(s1049 (/ 1.0 2.0))
(s1050 (/ 1.0 2.0))
(s1051 (/ 1.0 2.0))
(s1052 (/ 1.0 2.0))
(s1053 (/ 1.0 2.0))
(s1054 (/ 1.0 2.0))
(s1055 (/ 1.0 2.0))
(s1056 (/ 1.0 2.0))
(s1057 (/ 1.0 2.0))
(s1058 (/ 1.0 2.0))
(s1059 (/ 1.0 2.0))
(s1060 (/ 1.0 2.0))
(s1066 (/ 1.0 2.0))
(s1067 (/ 1.0 2.0))
(s1068 (/ 1.0 2.0))
(s1069 (/ 1.0 2.0))
(s1070 (/ 1.0 2.0))
(s1071 (/ 1.0 2.0))
(s1072 (/ 1.0 2.0))
(s1073 (/ 1.0 2.0))
(s1074 (/ 1.0 2.0))
(s1075 (/ 1.0 2.0))
(s1076 (/ 1.0 2.0))
(s1077 (/ 1.0 2.0))
(s1109 (/ 1.0 2.0))
(s1110 (/ 1.0 2.0))
(s1111 (/ 1.0 2.0))
(s1112 (/ 1.0 2.0))
(s1113 (/ 1.0 2.0))
(s1114 (/ 1.0 2.0))
(s1146 (/ 1.0 2.0))
(s1147 (/ 1.0 2.0))
(s1148 (/ 1.0 2.0))
(s1189 (/ 1.0 2.0))
(s1190 (/ 1.0 2.0))
(s1191 (/ 1.0 2.0))
(s1192 (/ 1.0 2.0))
(s1193 (/ 1.0 2.0))
(s1194 (/ 1.0 2.0))
(s1195 (/ 1.0 2.0))
(s1196 (/ 1.0 2.0))
(s1197 (/ 1.0 2.0))
(s1198 (/ 1.0 2.0))
(s1199 (/ 1.0 2.0))
(s1200 (/ 1.0 2.0))
(s1201 (/ 1.0 2.0))
(s1202 (/ 1.0 2.0))
(s1203 (/ 1.0 2.0))
(s1246 (/ 1.0 2.0))
(s1247 (/ 1.0 2.0))
(s1248 (/ 1.0 2.0))
(s1258 (/ 1.0 2.0))
(s1259 (/ 1.0 2.0))
(s1260 (/ 1.0 2.0))
(s1372 (/ 1.0 2.0))
(s1373 (/ 1.0 2.0))
(s1386 (/ 1.0 2.0))
(s1387 (/ 1.0 2.0))
(s1388 (/ 1.0 2.0))
(s1389 (/ 1.0 2.0))
(s1390 (/ 1.0 2.0))
(s1391 (/ 1.0 2.0))
(s1392 (/ 1.0 2.0))
(s1393 (/ 1.0 2.0))
(s1394 (/ 1.0 2.0))
(s1395 (/ 1.0 2.0))
(s1421 (/ 1.0 2.0))
(s1422 (/ 1.0 2.0))
(s1423 (/ 1.0 2.0))
(s1424 (/ 1.0 2.0))
(s1425 (/ 1.0 2.0))
(s1426 (/ 1.0 2.0))
(s1427 (/ 1.0 2.0))
(s1428 (/ 1.0 2.0))
(s1429 (/ 1.0 2.0))
(s1430 (/ 1.0 2.0))
(s1431 (/ 1.0 2.0))
(s1432 (/ 1.0 2.0))
(s1433 (/ 1.0 2.0))
(s1434 (/ 1.0 2.0))
(s1435 (/ 1.0 2.0))
(s1436 (/ 1.0 2.0))
(s1437 (/ 1.0 2.0))
(s1438 (/ 1.0 2.0))
(s1443 (/ 1.0 2.0))
(s1444 (/ 1.0 2.0))
(s1445 (/ 1.0 2.0))
(s1446 (/ 1.0 2.0))
(s1447 (/ 1.0 2.0))
(s1448 (/ 1.0 2.0))
(s1449 (/ 1.0 2.0))
(s1450 (/ 1.0 2.0))
(s1451 (/ 1.0 2.0))
(s1452 (/ 1.0 2.0))
(s1453 (/ 1.0 2.0))
(s1454 (/ 1.0 2.0))
(s1455 (/ 1.0 2.0))
(s1461 (/ 1.0 2.0))
(s1462 (/ 1.0 2.0))
(s1463 (/ 1.0 2.0))
(s1464 (/ 1.0 2.0))
(s1465 (/ 1.0 2.0))
(s1466 (/ 1.0 2.0))
(s1504 (/ 1.0 2.0))
(s1505 (/ 1.0 2.0))
(s1506 (/ 1.0 2.0))
(s1507 (/ 1.0 2.0))
(s1508 (/ 1.0 2.0))
(s1509 (/ 1.0 2.0))
(s1590 (/ 1.0 2.0))
(s1591 (/ 1.0 2.0))
(s1592 (/ 1.0 2.0))
(s1593 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/658 variables, 658/658 constraints. Problems are: Problem set: 0 solved, 658 unsolved
SMT process timed out in 5868ms, After SMT, problems are : Problem set: 0 solved, 658 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 658 out of 2430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2430/2430 places, 3040/3040 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 425 transitions
Trivial Post-agglo rules discarded 425 transitions
Performed 425 trivial Post agglomeration. Transition count delta: 425
Iterating post reduction 0 with 425 rules applied. Total rules applied 425 place count 2430 transition count 2615
Reduce places removed 425 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 451 rules applied. Total rules applied 876 place count 2005 transition count 2589
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 883 place count 1998 transition count 2589
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 883 place count 1998 transition count 2190
Deduced a syphon composed of 399 places in 6 ms
Ensure Unique test removed 36 places
Reduce places removed 435 places and 0 transitions.
Iterating global reduction 3 with 834 rules applied. Total rules applied 1717 place count 1563 transition count 2190
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 25 rules applied. Total rules applied 1742 place count 1559 transition count 2169
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 1763 place count 1538 transition count 2169
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 1763 place count 1538 transition count 2153
Deduced a syphon composed of 16 places in 21 ms
Ensure Unique test removed 16 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 1811 place count 1506 transition count 2153
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 1811 place count 1506 transition count 2137
Deduced a syphon composed of 16 places in 21 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 1843 place count 1490 transition count 2137
Discarding 50 places :
Symmetric choice reduction at 5 with 50 rule applications. Total rules 1893 place count 1440 transition count 2087
Iterating global reduction 5 with 50 rules applied. Total rules applied 1943 place count 1440 transition count 2087
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1944 place count 1440 transition count 2086
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1944 place count 1440 transition count 2075
Deduced a syphon composed of 11 places in 19 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 23 rules applied. Total rules applied 1967 place count 1428 transition count 2075
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1967 place count 1428 transition count 2074
Deduced a syphon composed of 1 places in 11 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1970 place count 1426 transition count 2074
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1973 place count 1423 transition count 2053
Iterating global reduction 6 with 3 rules applied. Total rules applied 1976 place count 1423 transition count 2053
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1976 place count 1423 transition count 2052
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1978 place count 1422 transition count 2052
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1979 place count 1421 transition count 2044
Iterating global reduction 6 with 1 rules applied. Total rules applied 1980 place count 1421 transition count 2044
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1981 place count 1420 transition count 2036
Iterating global reduction 6 with 1 rules applied. Total rules applied 1982 place count 1420 transition count 2036
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1983 place count 1419 transition count 2028
Iterating global reduction 6 with 1 rules applied. Total rules applied 1984 place count 1419 transition count 2028
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1985 place count 1418 transition count 2020
Iterating global reduction 6 with 1 rules applied. Total rules applied 1986 place count 1418 transition count 2020
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1987 place count 1417 transition count 2012
Iterating global reduction 6 with 1 rules applied. Total rules applied 1988 place count 1417 transition count 2012
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1989 place count 1416 transition count 2004
Iterating global reduction 6 with 1 rules applied. Total rules applied 1990 place count 1416 transition count 2004
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1991 place count 1415 transition count 1996
Iterating global reduction 6 with 1 rules applied. Total rules applied 1992 place count 1415 transition count 1996
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1993 place count 1414 transition count 1988
Iterating global reduction 6 with 1 rules applied. Total rules applied 1994 place count 1414 transition count 1988
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1995 place count 1413 transition count 1980
Iterating global reduction 6 with 1 rules applied. Total rules applied 1996 place count 1413 transition count 1980
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1997 place count 1412 transition count 1972
Iterating global reduction 6 with 1 rules applied. Total rules applied 1998 place count 1412 transition count 1972
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1999 place count 1411 transition count 1964
Iterating global reduction 6 with 1 rules applied. Total rules applied 2000 place count 1411 transition count 1964
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2001 place count 1410 transition count 1956
Iterating global reduction 6 with 1 rules applied. Total rules applied 2002 place count 1410 transition count 1956
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2003 place count 1409 transition count 1948
Iterating global reduction 6 with 1 rules applied. Total rules applied 2004 place count 1409 transition count 1948
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2005 place count 1408 transition count 1940
Iterating global reduction 6 with 1 rules applied. Total rules applied 2006 place count 1408 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2007 place count 1407 transition count 1932
Iterating global reduction 6 with 1 rules applied. Total rules applied 2008 place count 1407 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2009 place count 1406 transition count 1924
Iterating global reduction 6 with 1 rules applied. Total rules applied 2010 place count 1406 transition count 1924
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 3 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 6 with 240 rules applied. Total rules applied 2250 place count 1286 transition count 1804
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2252 place count 1285 transition count 1813
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 2261 place count 1285 transition count 1804
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 2270 place count 1276 transition count 1804
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 2273 place count 1276 transition count 1801
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2276 place count 1273 transition count 1801
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2277 place count 1272 transition count 1800
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 4 rules applied. Total rules applied 2281 place count 1269 transition count 1799
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2282 place count 1268 transition count 1799
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 2282 place count 1268 transition count 1795
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 2290 place count 1264 transition count 1795
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 10 with 1 rules applied. Total rules applied 2291 place count 1263 transition count 1795
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2295 place count 1261 transition count 1793
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 2296 place count 1260 transition count 1792
Iterating global reduction 11 with 1 rules applied. Total rules applied 2297 place count 1260 transition count 1792
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2298 place count 1260 transition count 1791
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 2299 place count 1259 transition count 1791
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 2300 place count 1259 transition count 1791
Applied a total of 2300 rules in 1631 ms. Remains 1259 /2430 variables (removed 1171) and now considering 1791/3040 (removed 1249) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1643 ms. Remains : 1259/2430 places, 1791/3040 transitions.
RANDOM walk for 3955288 steps (45856 resets) in 117412 ms. (33 steps per ms) remains 483/658 properties
BEST_FIRST walk for 40004 steps (88 resets) in 345 ms. (115 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40003 steps (91 resets) in 336 ms. (118 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40004 steps (85 resets) in 495 ms. (80 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40004 steps (87 resets) in 475 ms. (84 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40004 steps (84 resets) in 501 ms. (79 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40004 steps (87 resets) in 387 ms. (103 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40003 steps (92 resets) in 330 ms. (120 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40004 steps (89 resets) in 290 ms. (137 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40003 steps (88 resets) in 340 ms. (117 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40001 steps (81 resets) in 336 ms. (118 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40004 steps (89 resets) in 386 ms. (103 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40004 steps (88 resets) in 311 ms. (128 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40003 steps (82 resets) in 372 ms. (107 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40003 steps (83 resets) in 338 ms. (118 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40004 steps (88 resets) in 393 ms. (101 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40003 steps (86 resets) in 381 ms. (104 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40004 steps (93 resets) in 368 ms. (108 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40004 steps (86 resets) in 378 ms. (105 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40001 steps (83 resets) in 377 ms. (105 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40003 steps (91 resets) in 315 ms. (126 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40003 steps (81 resets) in 390 ms. (102 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40003 steps (87 resets) in 393 ms. (101 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40003 steps (87 resets) in 398 ms. (100 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40003 steps (90 resets) in 311 ms. (128 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40002 steps (89 resets) in 393 ms. (101 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40004 steps (83 resets) in 377 ms. (105 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40003 steps (86 resets) in 381 ms. (104 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40003 steps (88 resets) in 370 ms. (107 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40004 steps (84 resets) in 332 ms. (120 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40002 steps (90 resets) in 293 ms. (136 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40004 steps (88 resets) in 299 ms. (133 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40003 steps (88 resets) in 395 ms. (101 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40003 steps (96 resets) in 304 ms. (131 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40004 steps (89 resets) in 239 ms. (166 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40004 steps (88 resets) in 226 ms. (176 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40003 steps (85 resets) in 247 ms. (161 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40004 steps (78 resets) in 266 ms. (149 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40004 steps (89 resets) in 234 ms. (170 steps per ms) remains 483/483 properties
BEST_FIRST walk for 40003 steps (86 resets) in 256 ms. (155 steps per ms) remains 480/483 properties
BEST_FIRST walk for 40003 steps (84 resets) in 232 ms. (171 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40003 steps (90 resets) in 245 ms. (162 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40004 steps (88 resets) in 230 ms. (173 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40003 steps (88 resets) in 249 ms. (160 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40002 steps (76 resets) in 267 ms. (149 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40003 steps (88 resets) in 236 ms. (168 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40004 steps (84 resets) in 240 ms. (165 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40003 steps (88 resets) in 240 ms. (165 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40004 steps (81 resets) in 248 ms. (160 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40003 steps (85 resets) in 227 ms. (175 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40003 steps (80 resets) in 246 ms. (161 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40002 steps (89 resets) in 229 ms. (173 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40003 steps (89 resets) in 238 ms. (167 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40003 steps (81 resets) in 248 ms. (160 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40004 steps (82 resets) in 259 ms. (153 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40004 steps (89 resets) in 237 ms. (168 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40004 steps (81 resets) in 267 ms. (149 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40003 steps (82 resets) in 256 ms. (155 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40004 steps (85 resets) in 236 ms. (168 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40003 steps (87 resets) in 248 ms. (160 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40003 steps (85 resets) in 244 ms. (163 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40002 steps (84 resets) in 238 ms. (167 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40003 steps (81 resets) in 264 ms. (150 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40002 steps (84 resets) in 255 ms. (156 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40003 steps (85 resets) in 237 ms. (168 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40004 steps (86 resets) in 242 ms. (164 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40003 steps (87 resets) in 241 ms. (165 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40004 steps (90 resets) in 227 ms. (175 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40003 steps (90 resets) in 243 ms. (163 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40003 steps (84 resets) in 239 ms. (166 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40003 steps (85 resets) in 245 ms. (162 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40001 steps (91 resets) in 232 ms. (171 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40003 steps (87 resets) in 228 ms. (174 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40003 steps (88 resets) in 240 ms. (165 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40004 steps (85 resets) in 238 ms. (167 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40004 steps (86 resets) in 239 ms. (166 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40004 steps (81 resets) in 255 ms. (156 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40004 steps (87 resets) in 235 ms. (169 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40004 steps (84 resets) in 253 ms. (157 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40003 steps (85 resets) in 235 ms. (169 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40004 steps (88 resets) in 244 ms. (163 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40004 steps (85 resets) in 243 ms. (163 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40004 steps (86 resets) in 386 ms. (103 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40004 steps (92 resets) in 305 ms. (130 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40004 steps (84 resets) in 305 ms. (130 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40003 steps (89 resets) in 367 ms. (108 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40004 steps (89 resets) in 327 ms. (121 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40003 steps (83 resets) in 379 ms. (105 steps per ms) remains 480/480 properties
BEST_FIRST walk for 40004 steps (81 resets) in 266 ms. (149 steps per ms) remains 480/480 properties
// Phase 1: matrix 1791 rows 1259 cols
[2025-05-29 19:15:29] [INFO ] Computed 176 invariants in 83 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 56/536 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/536 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (OVERLAPS) 1/537 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 7 (OVERLAPS) 307/844 variables, 47/97 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/844 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 9 (OVERLAPS) 35/879 variables, 8/105 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/879 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 11 (OVERLAPS) 2/881 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 1.0 68.0))
(s1 (/ 1.0 68.0))
(s2 (/ 13.0 68.0))
(s3 (/ 1.0 68.0))
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 (/ 1.0 68.0))
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 (/ 1.0 68.0))
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 (/ 1.0 68.0))
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 (/ 1.0 68.0))
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 (/ 1.0 68.0))
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 (/ 23.0 34.0))
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 (/ 1.0 68.0))
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 (/ 1.0 68.0))
(s37 (/ 3.0 68.0))
(s38 (/ 1.0 68.0))
(s39 (/ 1.0 68.0))
(s40 (/ 3.0 34.0))
(s41 (/ 1.0 68.0))
(s42 (/ 55.0 68.0))
(s43 0.0)
(s44 (/ 1.0 68.0))
(s45 (/ 1.0 68.0))
(s46 (/ 1.0 68.0))
(s47 (/ 1.0 68.0))
(s48 (/ 1.0 68.0))
(s49 (/ 9.0 17.0))
(s50 (/ 9.0 68.0))
(s51 (/ 1.0 68.0))
(s52 (/ 1.0 68.0))
(s53 (/ 1.0 68.0))
(s54 (/ 1.0 68.0))
(s55 (/ 1.0 68.0))
(s56 (/ 1.0 68.0))
(s57 (/ 1.0 68.0))
(s58 (/ 1.0 68.0))
(s59 (/ 1.0 68.0))
(s60 (/ 1.0 68.0))
(s61 (/ 1.0 68.0))
(s62 (/ 1.0 68.0))
(s63 (/ 1.0 68.0))
(s64 (/ 1.0 68.0))
(s65 (/ 1.0 68.0))
(s66 (/ 1.0 68.0))
(s67 (/ 1.0 68.0))
(s68 (/ 1.0 68.0))
(s69 (/ 1.0 68.0))
(s70 0.0)
(s71 0.0)
(s72 (/ 1.0 68.0))
(s73 (/ 1.0 68.0))
(s74 (/ 1.0 34.0))
(s75 (/ 1.0 68.0))
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 (/ 1.0 68.0))
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 (/ 1.0 68.0))
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 (/ 55.0 68.0))
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 (/ 1.0 68.0))
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 (/ 1.0 68.0))
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 (/ 1.0 68.0))
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 (/ 1.0 68.0))
(s104 0.0)
(s105 0.0)
(s106 (/ 1.0 68.0))
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 (/ 31.0 34.0))
(s187 0.0)
(s188 (/ 3.0 68.0))
(s189 0.0)
(s190 0.0)
(s191 (/ 1.0 68.0))
(s192 (/ 1.0 68.0))
(s193 (/ 1.0 68.0))
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 (/ 1.0 68.0))
(s213 (/ 1.0 68.0))
(s214 (/ 1.0 68.0))
(s215 (/ 29.0 34.0))
(s216 (/ 1.0 68.0))
(s217 (/ 29.0 34.0))
(s218 (/ 1.0 68.0))
(s219 (/ 1.0 68.0))
(s220 (/ 1.0 68.0))
(s221 (/ 59.0 68.0))
(s222 (/ 1.0 68.0))
(s223 (/ 1.0 68.0))
(s224 (/ 1.0 68.0))
(s225 0.0)
(s226 0.0)
(s227 (/ 1.0 68.0))
(s228 (/ 1.0 68.0))
(s229 (/ 1.0 68.0))
(s230 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 881/3050 variables, and 107 constraints, problems are : Problem set: 0 solved, 480 unsolved in 45019 ms.
Refiners :[Positive P Invariants (semi-flows): 43/52 constraints, Generalized P Invariants (flows): 64/124 constraints, State Equation: 0/1259 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 56/536 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/536 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2025-05-29 19:16:22] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (OVERLAPS) 1/537 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 8 (OVERLAPS) 307/844 variables, 47/98 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2025-05-29 19:16:35] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 3 ms to minimize.
[2025-05-29 19:16:35] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 2 ms to minimize.
[2025-05-29 19:16:35] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 2 ms to minimize.
[2025-05-29 19:16:36] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2025-05-29 19:16:36] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2025-05-29 19:16:37] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 2 ms to minimize.
[2025-05-29 19:16:38] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2025-05-29 19:16:38] [INFO ] Deduced a trap composed of 60 places in 196 ms of which 3 ms to minimize.
[2025-05-29 19:16:40] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 2 ms to minimize.
[2025-05-29 19:16:40] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 2 ms to minimize.
[2025-05-29 19:16:43] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 2 ms to minimize.
[2025-05-29 19:16:44] [INFO ] Deduced a trap composed of 67 places in 183 ms of which 3 ms to minimize.
[2025-05-29 19:16:44] [INFO ] Deduced a trap composed of 69 places in 177 ms of which 3 ms to minimize.
[2025-05-29 19:16:45] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 2 ms to minimize.
[2025-05-29 19:16:45] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 2 ms to minimize.
[2025-05-29 19:16:47] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 2 ms to minimize.
[2025-05-29 19:16:47] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 3 ms to minimize.
[2025-05-29 19:16:48] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2025-05-29 19:16:49] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 2 ms to minimize.
[2025-05-29 19:16:50] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/844 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2025-05-29 19:16:52] [INFO ] Deduced a trap composed of 48 places in 194 ms of which 4 ms to minimize.
[2025-05-29 19:16:53] [INFO ] Deduced a trap composed of 59 places in 171 ms of which 3 ms to minimize.
[2025-05-29 19:16:54] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 2 ms to minimize.
[2025-05-29 19:16:54] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 844/3050 variables, and 122 constraints, problems are : Problem set: 0 solved, 480 unsolved in 45020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/52 constraints, Generalized P Invariants (flows): 64/124 constraints, State Equation: 0/1259 constraints, PredecessorRefiner: 0/480 constraints, Known Traps: 25/25 constraints]
After SMT, in 90296ms problems are : Problem set: 0 solved, 480 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 480 out of 1259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1259/1259 places, 1791/1791 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 1259 transition count 1752
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 1220 transition count 1752
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 78 place count 1220 transition count 1712
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 158 place count 1180 transition count 1712
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 7 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 192 place count 1163 transition count 1695
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 193 place count 1163 transition count 1695
Applied a total of 193 rules in 97 ms. Remains 1163 /1259 variables (removed 96) and now considering 1695/1791 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 1163/1259 places, 1695/1791 transitions.
RANDOM walk for 4000000 steps (46431 resets) in 109192 ms. (36 steps per ms) remains 438/480 properties
BEST_FIRST walk for 40004 steps (85 resets) in 289 ms. (137 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40002 steps (90 resets) in 363 ms. (109 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40004 steps (89 resets) in 271 ms. (147 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40003 steps (88 resets) in 273 ms. (145 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40002 steps (87 resets) in 411 ms. (97 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40004 steps (91 resets) in 462 ms. (86 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40002 steps (85 resets) in 442 ms. (90 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40003 steps (86 resets) in 325 ms. (122 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40004 steps (89 resets) in 422 ms. (94 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40004 steps (85 resets) in 592 ms. (67 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40003 steps (85 resets) in 456 ms. (87 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40003 steps (85 resets) in 336 ms. (118 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40002 steps (85 resets) in 345 ms. (115 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40004 steps (89 resets) in 490 ms. (81 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40002 steps (90 resets) in 317 ms. (125 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40003 steps (86 resets) in 485 ms. (82 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40004 steps (88 resets) in 316 ms. (126 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40004 steps (87 resets) in 484 ms. (82 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40004 steps (89 resets) in 340 ms. (117 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40002 steps (83 resets) in 348 ms. (114 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40002 steps (84 resets) in 571 ms. (69 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40003 steps (86 resets) in 488 ms. (81 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40003 steps (87 resets) in 358 ms. (111 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40003 steps (86 resets) in 439 ms. (90 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40003 steps (88 resets) in 359 ms. (111 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40003 steps (83 resets) in 316 ms. (126 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40004 steps (86 resets) in 476 ms. (83 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40003 steps (90 resets) in 316 ms. (126 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40004 steps (81 resets) in 642 ms. (62 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40004 steps (91 resets) in 393 ms. (101 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40004 steps (90 resets) in 418 ms. (95 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40003 steps (89 resets) in 381 ms. (104 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40002 steps (84 resets) in 309 ms. (129 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40003 steps (91 resets) in 345 ms. (115 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40003 steps (83 resets) in 608 ms. (65 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40003 steps (90 resets) in 352 ms. (113 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40004 steps (89 resets) in 563 ms. (70 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40002 steps (88 resets) in 476 ms. (83 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40003 steps (89 resets) in 479 ms. (83 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40004 steps (84 resets) in 362 ms. (110 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40002 steps (78 resets) in 507 ms. (78 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40003 steps (84 resets) in 321 ms. (124 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40001 steps (86 resets) in 447 ms. (89 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40002 steps (89 resets) in 327 ms. (121 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40004 steps (92 resets) in 314 ms. (126 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40004 steps (83 resets) in 415 ms. (96 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40002 steps (93 resets) in 305 ms. (130 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40004 steps (84 resets) in 339 ms. (117 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40003 steps (80 resets) in 478 ms. (83 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40003 steps (81 resets) in 359 ms. (111 steps per ms) remains 438/438 properties
Interrupted probabilistic random walk after 5896918 steps, run timeout after 105001 ms. (steps per millisecond=56 ) properties seen :28 out of 438
Probabilistic random walk after 5896918 steps, saw 1074595 distinct states, run finished after 105012 ms. (steps per millisecond=56 ) properties seen :28
// Phase 1: matrix 1695 rows 1163 cols
[2025-05-29 19:19:20] [INFO ] Computed 176 invariants in 70 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 43/453 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 5 (OVERLAPS) 1/454 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 7 (OVERLAPS) 236/690 variables, 35/77 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/690 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 9 (OVERLAPS) 15/705 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/705 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 11 (OVERLAPS) 182/887 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/887 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 13 (OVERLAPS) 45/932 variables, 7/130 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/932 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 15 (OVERLAPS) 2/934 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/934 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 17 (OVERLAPS) 114/1048 variables, 13/145 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1048 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 19 (OVERLAPS) 46/1094 variables, 6/151 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 1.0 216.0))
(s1 (/ 13.0 216.0))
(s2 (/ 1.0 216.0))
(s3 (/ 1.0 216.0))
(s4 (/ 1.0 216.0))
(s5 (/ 1.0 216.0))
(s6 (/ 1.0 216.0))
(s7 (/ 1.0 216.0))
(s8 (/ 1.0 216.0))
(s9 (/ 1.0 216.0))
(s10 (/ 1.0 216.0))
(s11 (/ 1.0 216.0))
(s12 (/ 1.0 216.0))
(s13 (/ 1.0 216.0))
(s14 (/ 1.0 216.0))
(s15 (/ 1.0 216.0))
(s16 (/ 1.0 216.0))
(s17 (/ 1.0 216.0))
(s18 (/ 1.0 216.0))
(s19 (/ 1.0 216.0))
(s20 (/ 1.0 216.0))
(s21 (/ 1.0 216.0))
(s22 (/ 1.0 216.0))
(s23 (/ 1.0 216.0))
(s24 (/ 1.0 216.0))
(s25 (/ 1.0 216.0))
(s26 (/ 1.0 216.0))
(s27 (/ 1.0 216.0))
(s28 (/ 1.0 216.0))
(s29 (/ 1.0 216.0))
(s30 (/ 1.0 216.0))
(s31 (/ 85.0 108.0))
(s32 (/ 1.0 216.0))
(s33 (/ 1.0 216.0))
(s34 (/ 1.0 216.0))
(s35 0.0)
(s36 (/ 17.0 18.0))
(s37 (/ 1.0 216.0))
(s38 (/ 1.0 72.0))
(s39 (/ 1.0 216.0))
(s40 (/ 1.0 216.0))
(s41 (/ 1.0 36.0))
(s42 0.0)
(s43 0.0)
(s44 (/ 1.0 216.0))
(s45 (/ 1.0 216.0))
(s46 (/ 1.0 216.0))
(s47 (/ 1.0 216.0))
(s48 (/ 1.0 216.0))
(s49 (/ 23.0 27.0))
(s50 (/ 1.0 24.0))
(s51 (/ 1.0 216.0))
(s52 (/ 1.0 216.0))
(s53 (/ 1.0 216.0))
(s54 (/ 1.0 216.0))
(s55 (/ 1.0 216.0))
(s56 (/ 1.0 216.0))
(s57 (/ 1.0 216.0))
(s58 (/ 1.0 216.0))
(s59 (/ 1.0 216.0))
(s60 (/ 1.0 216.0))
(s61 (/ 1.0 216.0))
(s62 (/ 1.0 216.0))
(s63 (/ 1.0 216.0))
(s64 (/ 1.0 216.0))
(s65 (/ 1.0 216.0))
(s66 (/ 1.0 216.0))
(s67 (/ 1.0 216.0))
(s68 (/ 1.0 216.0))
(s69 (/ 1.0 216.0))
(s70 (/ 179.0 216.0))
(s71 (/ 1.0 216.0))
(s72 (/ 1.0 216.0))
(s73 (/ 1.0 216.0))
(s74 (/ 1.0 216.0))
(s75 (/ 1.0 216.0))
(s76 (/ 1.0 216.0))
(s77 (/ 1.0 216.0))
(s78 (/ 1.0 216.0))
(s79 (/ 1.0 216.0))
(s80 (/ 1.0 216.0))
(s81 (/ 1.0 216.0))
(s82 (/ 1.0 216.0))
(s83 (/ 1.0 216.0))
(s84 (/ 1.0 216.0))
(s85 (/ 1.0 216.0))
(s86 (/ 1.0 216.0))
(s87 (/ 1.0 216.0))
(s88 (/ 1.0 216.0))
(s89 (/ 1.0 216.0))
(s90 (/ 1.0 216.0))
(s91 (/ 1.0 216.0))
(s92 (/ 1.0 216.0))
(s93 (/ 1.0 216.0))
(s94 (/ 1.0 216.0))
(s95 (/ 1.0 216.0))
(s96 (/ 1.0 216.0))
(s97 (/ 1.0 216.0))
(s98 (/ 1.0 216.0))
(s99 (/ 1.0 216.0))
(s100 (/ 1.0 216.0))
(s101 (/ 1.0 216.0))
(s102 (/ 1.0 216.0))
(s103 (/ 1.0 216.0))
(s104 (/ 1.0 216.0))
(s105 (/ 1.0 216.0))
(s106 (/ 1.0 216.0))
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 (/ 181.0 216.0))
(s127 (/ 1.0 216.0))
(s128 (/ 1.0 216.0))
(s129 (/ 1.0 216.0))
(s130 (/ 1.0 216.0))
(s131 (/ 1.0 216.0))
(s132 (/ 1.0 216.0))
(s133 (/ 1.0 216.0))
(s134 (/ 1.0 24.0))
(s135 (/ 1.0 216.0))
(s136 (/ 1.0 216.0))
(s137 (/ 1.0 216.0))
(s138 (/ 1.0 216.0))
(s139 (/ 1.0 216.0))
(s140 (/ 1.0 216.0))
(s141 (/ 1.0 216.0))
(s142 (/ 1.0 216.0))
(s143 (/ 1.0 216.0))
(s144 (/ 1.0 216.0))
(s145 (/ 1.0 216.0))
(s146 (/ 1.0 216.0))
(s147 (/ 1.0 216.0))
(s148 (/ 1.0 216.0))
(s149 (/ 1.0 216.0))
(s150 (/ 1.0 216.0))
(s151 (/ 1.0 216.0))
(s152 (/ 1.0 216.0))
(s153 (/ 1.0 216.0))
(s154 (/ 1.0 216.0))
(s155 (/ 1.0 216.0))
(s156 (/ 1.0 216.0))
(s157 (/ 1.0 216.0))
(s158 (/ 1.0 216.0))
(s159 (/ 1.0 216.0))
(s160 (/ 1.0 216.0))
(s161 (/ 1.0 216.0))
(s162 (/ 1.0 216.0))
(s163 (/ 1.0 2.0))
(s164 (/ 1.0 216.0))
(s165 (/ 1.0 216.0))
(s166 (/ 1.0 216.0))
(s167 (/ 1.0 216.0))
(s168 (/ 1.0 216.0))
(s169 (/ 1.0 216.0))
(s170 (/ 1.0 216.0))
(s171 (/ 1.0 216.0))
(s172 (/ 4.0 27.0))
(s173 (/ 1.0 216.0))
(s174 (/ 1.0 216.0))
(s175 (/ 1.0 216.0))
(s176 (/ 1.0 216.0))
(s177 (/ 1.0 216.0))
(s178 (/ 1.0 216.0))
(s179 (/ 13.0 216.0))
(s180 (/ 1.0 8.0))
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 (/ 1.0 216.0))
(s185 (/ 1.0 216.0))
(s186 (/ 1.0 216.0))
(s187 (/ 1.0 216.0))
(s188 (/ 1.0 216.0))
(s189 (/ 1.0 216.0))
(s190 (/ 1.0 216.0))
(s191 (/ 1.0 216.0))
(s192 (/ 1.0 216.0))
(s193 (/ 1.0 216.0))
(s194 (/ 1.0 216.0))
(s195 (/ 1.0 216.0))
(s196 (/ 1.0 216.0))
(s197 (/ 1.0 216.0))
(s198 (/ 1.0 216.0))
(s199 (/ 1.0 216.0))
(s200 (/ 1.0 216.0))
(s201 (/ 1.0 216.0))
(s202 (/ 1.0 216.0))
(s203 (/ 1.0 216.0))
(s204 (/ 1.0 216.0))
(s205 (/ 1.0 216.0))
(s206 (/ 1.0 216.0))
(s207 (/ 1.0 216.0))
(s208 (/ 1.0 216.0))
(s209 (/ 1.0 216.0))
(s210 (/ 1.0 216.0))
(s211 (/ 1.0 216.0))
(s212 (/ 1.0 216.0))
(s213 (/ 1.0 216.0))
(s214 (/ 1.0 216.0))
(s215 (/ 1.0 108.0))
(s216 (/ 1.0 216.0))
(s217 (/ 1.0 216.0))
(s218 (/ 1.0 216.0))
(s219 0.0)
(s220 0.0)
(s221 (/ 1.0 216.0))
(s222 (/ 1.0 216.0))
(s223 (/ 1.0 216.0))
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 (/ 1.0 72.0))
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 (/ 1.0 36.0))
(s255 0.0)
(s256 0.0)
(s257 (/ 1.0 216.0))
(s258 (/ 1.0 216.0))
(s259 (/ 1.0 216.0))
(s260 (/ 1.0 216.0))
(s261 (/ 1.0 216.0))
(s262 (/ 1.0 216.0))
(s263 (/ 1.0 216.0))
(s264 (/ 1.0 216.0))
(s265 (/ 1.0 216.0))
(s266 (/ 1.0 216.0))
(s267 (/ 1.0 216.0))
(s268 (/ 1.0 216.0))
(s269 0.0)
(s270 (/ 1.0 216.0))
(s271 (/ 1.0 216.0))
(s272 (/ 205.0 216.0))
(s273 (/ 1.0 216.0))
(s274 (/ 1.0 216.0))
(s275 (/ 1.0 216.0))
(s276 (/ 1.0 216.0))
(s277 (/ 1.0 54.0))
(s278 (/ 1.0 216.0))
(s279 (/ 1.0 216.0))
(s280 (/ 1.0 216.0))
(s281 (/ 1.0 216.0))
(s282 (/ 1.0 216.0))
(s283 (/ 1.0 216.0))
(s284 (/ 1.0 54.0))
(s285 (/ 35.0 36.0))
(s286 (/ 1.0 216.0))
(s287 (/ 1.0 216.0))
(s288 (/ 1.0 216.0))
(s289 (/ 1.0 216.0))
(s290 (/ 1.0 216.0))
(s291 (/ 1.0 216.0))
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 (/ 1.0 216.0))
(s299 (/ 1.0 2.0))
(s300 (/ 1.0 216.0))
(s301 (/ 53.0 108.0))
(s302 (/ 26.0 27.0))
(s303 (/ 1.0 216.0))
(s304 (/ 1.0 216.0))
(s305 (/ 1.0 216.0))
(s306 (/ 1.0 216.0))
(s307 (/ 1.0 216.0))
(s308 (/ 1.0 216.0))
(s309 (/ 1.0 216.0))
(s310 (/ 1.0 216.0))
(s311 0.0)
(s312 (/ 103.0 108.0))
(s313 (/ 1.0 216.0))
(s314 (/ 1.0 216.0))
(s315 (/ 1.0 27.0))
(s316 0.0)
(s317 (/ 1.0 216.0))
(s318 (/ 1.0 3.0))
(s319 (/ 1.0 216.0))
(s320 (/ 1.0 216.0))
(s321 (/ 1.0 216.0))
(s322 (/ 1.0 216.0))
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 (/ 1.0 216.0))
(s327 0.0)
(s328 0.0)
(s329 (/ 23.0 36.0))
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 (/ 181.0 216.0))
(s359 (/ 1.0 216.0))
(s360 (/ 1.0 216.0))
(s361 (/ 1.0 216.0))
(s362 (/ 1.0 216.0))
(s363 (/ 1.0 216.0))
(s364 (/ 1.0 216.0))
(s365 (/ 1.0 216.0))
(s366 (/ 1.0 216.0))
(s367 (/ 1.0 216.0))
(s368 (/ 1.0 216.0))
(s369 (/ 1.0 24.0))
(s370 (/ 1.0 216.0))
(s371 (/ 1.0 216.0))
(s372 (/ 1.0 216.0))
(s373 (/ 1.0 216.0))
(s374 (/ 1.0 216.0))
(s375 (/ 1.0 216.0))
(s376 (/ 1.0 216.0))
(s377 (/ 1.0 216.0))
(s378 (/ 1.0 216.0))
(s379 (/ 1.0 216.0))
(s380 (/ 1.0 216.0))
(s381 (/ 1.0 216.0))
(s382 (/ 1.0 216.0))
(s383 (/ 1.0 216.0))
(s384 (/ 1.0 216.0))
(s385 (/ 1.0 216.0))
(s386 (/ 1.0 216.0))
(s387 (/ 1.0 216.0))
(s388 (/ 1.0 216.0))
(s389 (/ 1.0 216.0))
(s390 (/ 1.0 216.0))
(s391 (/ 1.0 216.0))
(s392 (/ 1.0 216.0))
(s393 (/ 1.0 216.0))
(s394 (/ 1.0 216.0))
(s395 (/ 1.0 216.0))
(s396 (/ 1.0 216.0))
(s397 (/ 1.0 216.0))
(s398 (/ 1.0 216.0))
(s399 (/ 1.0 216.0))
(s400 (/ 1.0 216.0))
(s401 (/ 1.0 216.0))
(s402 (/ 1.0 216.0))
(s403 (/ 1.0 216.0))
(s404 (/ 4.0 27.0))
(s405 (/ 1.0 216.0))
(s406 (/ 1.0 216.0))
(s407 (/ 1.0 216.0))
(s408 (/ 1.0 216.0))
(s409 (/ 1.0 216.0))
(s410 (/ 1.0 216.0))
(s411 0.0)
(s412 0.0)
(s413 (/ 25.0 36.0))
(s414 0.0)
(s415 0.0)
(s416 (/ 1.0 216.0))
(s417 (/ 1.0 216.0))
(s418 (/ 1.0 216.0))
(s419 (/ 1.0 216.0))
(s420 (/ 1.0 216.0))
(s421 (/ 1.0 216.0))
(s422 (/ 1.0 216.0))
(s423 (/ 1.0 216.0))
(s424 (/ 1.0 216.0))
(s425 (/ 1.0 216.0))
(s426 (/ 1.0 216.0))
(s427 (/ 1.0 216.0))
(s428 (/ 1.0 216.0))
(s429 (/ 1.0 216.0))
(s430 (/ 1.0 216.0))
(s431 (/ 1.0 216.0))
(s432 (/ 1.0 216.0))
(s433 (/ 1.0 216.0))
(s434 (/ 1.0 216.0))
(s435 (/ 1.0 216.0))
(s436 (/ 1.0 216.0))
(s437 (/ 1.0 216.0))
(s438 (/ 1.0 216.0))
(s439 (/ 1.0 216.0))
(s440 (/ 1.0 216.0))
(s441 (/ 31.0 54.0))
(s442 (/ 1.0 216.0))
(s443 (/ 1.0 216.0))
(s444 (/ 31.0 54.0))
(s445 (/ 1.0 216.0))
(s446 (/ 1.0 216.0))
(s447 (/ 1.0 216.0))
(s448 (/ 1.0 216.0))
(s449 (/ 1.0 216.0))
(s450 (/ 125.0 216.0))
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 (/ 1.0 36.0))
(s484 0.0)
(s485 0.0)
(s486 (/ 1.0 216.0))
(s487 (/ 1.0 216.0))
(s488 (/ 1.0 216.0))
(s489 (/ 1.0 216.0))
(s490 (/ 1.0 216.0))
(s491 (/ 1.0 216.0))
(s492 (/ 1.0 216.0))
(s493 (/ 1.0 216.0))
(s494 (/ 1.0 216.0))
(s495 (/ 1.0 216.0))
(s496 (/ 1.0 216.0))
(s497 (/ 1.0 216.0))
(s498 0.0)
(s499 (/ 1.0 216.0))
(s500 (/ 1.0 216.0))
(s501 (/ 107.0 108.0))
(s502 (/ 1.0 108.0))
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 (/ 107.0 108.0))
(s507 (/ 1.0 108.0))
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 (/ 1.0 216.0))
(s515 (/ 1.0 216.0))
(s516 (/ 1.0 216.0))
(s517 (/ 71.0 72.0))
(s518 (/ 1.0 216.0))
(s519 (/ 1.0 216.0))
(s520 (/ 1.0 216.0))
(s521 (/ 211.0 216.0))
(s522 (/ 1.0 216.0))
(s523 (/ 1.0 216.0))
(s524 0.0)
(s525 (/ 83.0 216.0))
(s526 (/ 1.0 216.0))
(s527 (/ 1.0 216.0))
(s528 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/2858 variables, and 151 constraints, problems are : Problem set: 0 solved, 410 unsolved in 75024 ms.
Refiners :[Positive P Invariants (semi-flows): 51/52 constraints, Generalized P Invariants (flows): 100/124 constraints, State Equation: 0/1163 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 43/453 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2025-05-29 19:20:41] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 6 (OVERLAPS) 1/454 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 8 (OVERLAPS) 236/690 variables, 35/78 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2025-05-29 19:20:50] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 3 ms to minimize.
[2025-05-29 19:20:50] [INFO ] Deduced a trap composed of 67 places in 128 ms of which 2 ms to minimize.
[2025-05-29 19:20:50] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 2 ms to minimize.
[2025-05-29 19:20:50] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 2 ms to minimize.
[2025-05-29 19:20:50] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 2 ms to minimize.
[2025-05-29 19:20:51] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2025-05-29 19:20:51] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2025-05-29 19:20:52] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 2 ms to minimize.
[2025-05-29 19:20:52] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2025-05-29 19:20:53] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 3 ms to minimize.
[2025-05-29 19:20:55] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 2 ms to minimize.
[2025-05-29 19:20:56] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 2 ms to minimize.
[2025-05-29 19:20:57] [INFO ] Deduced a trap composed of 58 places in 161 ms of which 3 ms to minimize.
[2025-05-29 19:20:57] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 2 ms to minimize.
[2025-05-29 19:20:57] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 2 ms to minimize.
[2025-05-29 19:20:58] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 1 ms to minimize.
[2025-05-29 19:20:58] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 2 ms to minimize.
[2025-05-29 19:21:00] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2025-05-29 19:21:01] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/690 variables, 19/97 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2025-05-29 19:21:04] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/690 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2025-05-29 19:21:12] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/690 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/690 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 13 (OVERLAPS) 15/705 variables, 9/108 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2025-05-29 19:21:33] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 2 ms to minimize.
[2025-05-29 19:21:35] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/705 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 705/2858 variables, and 110 constraints, problems are : Problem set: 0 solved, 410 unsolved in 75026 ms.
Refiners :[Positive P Invariants (semi-flows): 36/52 constraints, Generalized P Invariants (flows): 50/124 constraints, State Equation: 0/1163 constraints, PredecessorRefiner: 0/410 constraints, Known Traps: 24/24 constraints]
After SMT, in 150278ms problems are : Problem set: 0 solved, 410 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 410 out of 1163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1163/1163 places, 1695/1695 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1163 transition count 1676
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 1144 transition count 1676
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 38 place count 1144 transition count 1659
Deduced a syphon composed of 17 places in 3 ms
Ensure Unique test removed 4 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 76 place count 1123 transition count 1659
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 79 place count 1123 transition count 1656
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 82 place count 1120 transition count 1656
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 82 place count 1120 transition count 1655
Deduced a syphon composed of 1 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 85 place count 1118 transition count 1655
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 85 place count 1118 transition count 1654
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 87 place count 1117 transition count 1654
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 101 place count 1109 transition count 1648
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 102 place count 1109 transition count 1647
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 103 place count 1108 transition count 1647
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 103 place count 1108 transition count 1643
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 111 place count 1104 transition count 1643
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 113 place count 1102 transition count 1643
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 114 place count 1101 transition count 1637
Iterating global reduction 7 with 1 rules applied. Total rules applied 115 place count 1101 transition count 1637
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 116 place count 1100 transition count 1637
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 122 place count 1097 transition count 1634
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 125 place count 1094 transition count 1631
Iterating global reduction 8 with 3 rules applied. Total rules applied 128 place count 1094 transition count 1631
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 131 place count 1094 transition count 1628
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 135 place count 1091 transition count 1627
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 136 place count 1091 transition count 1627
Applied a total of 136 rules in 208 ms. Remains 1091 /1163 variables (removed 72) and now considering 1627/1695 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 1091/1163 places, 1627/1695 transitions.
RANDOM walk for 3526738 steps (41958 resets) in 114044 ms. (30 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (89 resets) in 314 ms. (126 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40003 steps (84 resets) in 396 ms. (100 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (84 resets) in 348 ms. (114 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (90 resets) in 393 ms. (101 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40002 steps (89 resets) in 370 ms. (107 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40003 steps (88 resets) in 438 ms. (91 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40003 steps (85 resets) in 384 ms. (103 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40003 steps (93 resets) in 419 ms. (95 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (88 resets) in 386 ms. (103 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (84 resets) in 373 ms. (106 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (92 resets) in 398 ms. (100 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (93 resets) in 376 ms. (106 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40003 steps (87 resets) in 418 ms. (95 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (91 resets) in 413 ms. (96 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40002 steps (87 resets) in 468 ms. (85 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40002 steps (87 resets) in 259 ms. (153 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (84 resets) in 342 ms. (116 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (87 resets) in 449 ms. (88 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (90 resets) in 287 ms. (138 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40003 steps (91 resets) in 460 ms. (86 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40002 steps (92 resets) in 375 ms. (106 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40002 steps (85 resets) in 349 ms. (114 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40003 steps (88 resets) in 436 ms. (91 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40003 steps (86 resets) in 330 ms. (120 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40003 steps (86 resets) in 389 ms. (102 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (91 resets) in 425 ms. (93 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40003 steps (91 resets) in 422 ms. (94 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40003 steps (84 resets) in 397 ms. (100 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (89 resets) in 392 ms. (101 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40003 steps (78 resets) in 389 ms. (102 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (89 resets) in 349 ms. (114 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40003 steps (86 resets) in 395 ms. (101 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (88 resets) in 357 ms. (111 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (87 resets) in 378 ms. (105 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (88 resets) in 314 ms. (126 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40002 steps (90 resets) in 394 ms. (101 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (90 resets) in 356 ms. (112 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (93 resets) in 385 ms. (103 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40003 steps (92 resets) in 406 ms. (98 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40003 steps (86 resets) in 427 ms. (93 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40002 steps (90 resets) in 394 ms. (101 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (85 resets) in 473 ms. (84 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40002 steps (87 resets) in 375 ms. (106 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40003 steps (90 resets) in 391 ms. (102 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40003 steps (89 resets) in 400 ms. (99 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (89 resets) in 365 ms. (109 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (86 resets) in 428 ms. (93 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (85 resets) in 410 ms. (97 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40002 steps (88 resets) in 364 ms. (109 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (82 resets) in 363 ms. (109 steps per ms) remains 410/410 properties
Interrupted probabilistic random walk after 5905970 steps, run timeout after 108001 ms. (steps per millisecond=54 ) properties seen :0 out of 410
Probabilistic random walk after 5905970 steps, saw 1083902 distinct states, run finished after 108002 ms. (steps per millisecond=54 ) properties seen :0
// Phase 1: matrix 1627 rows 1091 cols
[2025-05-29 19:24:15] [INFO ] Computed 166 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 31/441 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 5 (OVERLAPS) 2/443 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 7 (OVERLAPS) 201/644 variables, 36/79 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/644 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 9 (OVERLAPS) 26/670 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/670 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 11 (OVERLAPS) 2/672 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/672 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 13 (OVERLAPS) 114/786 variables, 18/105 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/786 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 15 (OVERLAPS) 26/812 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/812 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 17 (OVERLAPS) 2/814 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/814 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 19 (OVERLAPS) 109/923 variables, 15/126 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/923 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 21 (OVERLAPS) 60/983 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/983 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 23 (OVERLAPS) 9/992 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/992 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 25 (OVERLAPS) 97/1089 variables, 29/164 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1089/2718 variables, and 164 constraints, problems are : Problem set: 0 solved, 410 unsolved in 90016 ms.
Refiners :[Positive P Invariants (semi-flows): 51/52 constraints, Generalized P Invariants (flows): 113/114 constraints, State Equation: 0/1091 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 31/441 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 5 (OVERLAPS) 2/443 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 7 (OVERLAPS) 201/644 variables, 36/79 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2025-05-29 19:25:55] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 3 ms to minimize.
[2025-05-29 19:25:56] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2025-05-29 19:25:56] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 1 ms to minimize.
[2025-05-29 19:25:56] [INFO ] Deduced a trap composed of 68 places in 133 ms of which 3 ms to minimize.
[2025-05-29 19:25:57] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2025-05-29 19:25:57] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 2 ms to minimize.
[2025-05-29 19:25:58] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 7 ms to minimize.
[2025-05-29 19:25:58] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 3 ms to minimize.
[2025-05-29 19:25:58] [INFO ] Deduced a trap composed of 64 places in 179 ms of which 3 ms to minimize.
[2025-05-29 19:25:59] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2025-05-29 19:26:00] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 1 ms to minimize.
[2025-05-29 19:26:02] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 2 ms to minimize.
[2025-05-29 19:26:02] [INFO ] Deduced a trap composed of 60 places in 163 ms of which 2 ms to minimize.
[2025-05-29 19:26:02] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 3 ms to minimize.
[2025-05-29 19:26:03] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2025-05-29 19:26:05] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2025-05-29 19:26:05] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/644 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2025-05-29 19:26:06] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 2 ms to minimize.
[2025-05-29 19:26:06] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2025-05-29 19:26:08] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2025-05-29 19:26:10] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/644 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/644 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 11 (OVERLAPS) 26/670 variables, 6/106 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/670 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 13 (OVERLAPS) 2/672 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/672 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 15 (OVERLAPS) 114/786 variables, 18/126 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/786 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 17 (OVERLAPS) 26/812 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2025-05-29 19:27:01] [INFO ] Deduced a trap composed of 83 places in 142 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/812 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 812/2718 variables, and 131 constraints, problems are : Problem set: 0 solved, 410 unsolved in 90028 ms.
Refiners :[Positive P Invariants (semi-flows): 40/52 constraints, Generalized P Invariants (flows): 69/114 constraints, State Equation: 0/1091 constraints, PredecessorRefiner: 0/410 constraints, Known Traps: 22/22 constraints]
After SMT, in 180189ms problems are : Problem set: 0 solved, 410 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 410 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 1627/1627 transitions.
Applied a total of 0 rules in 21 ms. Remains 1091 /1091 variables (removed 0) and now considering 1627/1627 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 1091/1091 places, 1627/1627 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 1627/1627 transitions.
Applied a total of 0 rules in 20 ms. Remains 1091 /1091 variables (removed 0) and now considering 1627/1627 (removed 0) transitions.
[2025-05-29 19:27:15] [INFO ] Invariant cache hit.
[2025-05-29 19:27:16] [INFO ] Implicit Places using invariants in 533 ms returned [108, 315, 340, 501, 528, 530, 548, 566, 674, 691, 692, 694, 711, 729, 748, 798, 799, 810, 811, 813, 830, 848, 917, 921, 922, 925, 936, 937, 938, 956, 958, 962, 980, 981, 982, 983, 995, 1001, 1007, 1013, 1019, 1025, 1031, 1037, 1043, 1049, 1055]
[2025-05-29 19:27:16] [INFO ] Actually due to overlaps returned [956, 938, 108, 340, 548, 711, 830, 962, 694, 813, 530, 692, 810, 936, 980, 315, 528, 691, 811, 937, 958, 981, 501, 674, 798, 799, 921, 922, 566, 848, 982, 1025, 1043, 1055, 729, 748, 925, 983, 995, 1001, 1007, 1013, 1019, 1031, 1037, 1049]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 542 ms to find 46 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1045/1091 places, 1627/1627 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 1044 transition count 1547
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 964 transition count 1546
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 162 place count 964 transition count 1529
Deduced a syphon composed of 17 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 35 rules applied. Total rules applied 197 place count 946 transition count 1529
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 209 place count 942 transition count 1521
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 217 place count 934 transition count 1521
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 232 place count 919 transition count 1506
Iterating global reduction 4 with 15 rules applied. Total rules applied 247 place count 919 transition count 1506
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 250 place count 919 transition count 1503
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 250 place count 919 transition count 1502
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 252 place count 918 transition count 1502
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 255 place count 915 transition count 1496
Iterating global reduction 5 with 3 rules applied. Total rules applied 258 place count 915 transition count 1496
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 259 place count 914 transition count 1495
Iterating global reduction 5 with 1 rules applied. Total rules applied 260 place count 914 transition count 1495
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 261 place count 913 transition count 1493
Iterating global reduction 5 with 1 rules applied. Total rules applied 262 place count 913 transition count 1493
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 3 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 338 place count 875 transition count 1455
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 339 place count 875 transition count 1454
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 340 place count 874 transition count 1453
Iterating global reduction 6 with 1 rules applied. Total rules applied 341 place count 874 transition count 1453
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 342 place count 874 transition count 1452
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 346 place count 872 transition count 1453
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 7 with 13 rules applied. Total rules applied 359 place count 872 transition count 1440
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 373 place count 858 transition count 1440
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 374 place count 858 transition count 1439
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 387 place count 858 transition count 1439
Applied a total of 387 rules in 212 ms. Remains 858 /1045 variables (removed 187) and now considering 1439/1627 (removed 188) transitions.
// Phase 1: matrix 1439 rows 858 cols
[2025-05-29 19:27:16] [INFO ] Computed 113 invariants in 18 ms
[2025-05-29 19:27:16] [INFO ] Implicit Places using invariants in 367 ms returned [238, 281, 282, 452, 480, 481, 599, 605, 608, 610, 626, 627, 697, 703, 706, 708, 713, 714, 766, 783, 789, 792, 794]
[2025-05-29 19:27:16] [INFO ] Actually due to overlaps returned [281, 480, 626, 713, 481, 627, 714, 282, 599, 605, 610, 697, 703, 708, 783, 789, 794, 238, 452, 766]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 370 ms to find 20 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 838/1091 places, 1439/1627 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 826 transition count 1427
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 826 transition count 1427
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 823 transition count 1424
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 823 transition count 1424
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 819 transition count 1420
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 47 place count 819 transition count 1411
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 56 place count 810 transition count 1411
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 810 transition count 1410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 809 transition count 1410
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 809 transition count 1410
Applied a total of 59 rules in 83 ms. Remains 809 /838 variables (removed 29) and now considering 1410/1439 (removed 29) transitions.
// Phase 1: matrix 1410 rows 809 cols
[2025-05-29 19:27:16] [INFO ] Computed 93 invariants in 17 ms
[2025-05-29 19:27:17] [INFO ] Implicit Places using invariants in 308 ms returned []
[2025-05-29 19:27:17] [INFO ] Invariant cache hit.
[2025-05-29 19:27:18] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1244 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 809/1091 places, 1410/1627 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2472 ms. Remains : 809/1091 places, 1410/1627 transitions.
RANDOM walk for 4000000 steps (68104 resets) in 93102 ms. (42 steps per ms) remains 385/410 properties
BEST_FIRST walk for 40003 steps (141 resets) in 316 ms. (126 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (141 resets) in 547 ms. (72 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (152 resets) in 370 ms. (107 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (145 resets) in 567 ms. (70 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (146 resets) in 411 ms. (97 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (131 resets) in 426 ms. (93 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (146 resets) in 385 ms. (103 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (148 resets) in 553 ms. (72 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (140 resets) in 500 ms. (79 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40002 steps (147 resets) in 398 ms. (100 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (141 resets) in 399 ms. (100 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40002 steps (141 resets) in 521 ms. (76 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (146 resets) in 464 ms. (86 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40002 steps (152 resets) in 356 ms. (112 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (144 resets) in 476 ms. (83 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (147 resets) in 422 ms. (94 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (143 resets) in 433 ms. (92 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (145 resets) in 483 ms. (82 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (139 resets) in 596 ms. (67 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (138 resets) in 420 ms. (95 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (149 resets) in 421 ms. (94 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (138 resets) in 487 ms. (81 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (146 resets) in 471 ms. (84 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40001 steps (142 resets) in 382 ms. (104 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (149 resets) in 415 ms. (96 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (137 resets) in 403 ms. (99 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40002 steps (146 resets) in 509 ms. (78 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40001 steps (137 resets) in 507 ms. (78 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (140 resets) in 547 ms. (72 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (150 resets) in 522 ms. (76 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (150 resets) in 526 ms. (75 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (146 resets) in 400 ms. (99 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (144 resets) in 468 ms. (85 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40002 steps (156 resets) in 384 ms. (103 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40002 steps (145 resets) in 415 ms. (96 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (138 resets) in 534 ms. (74 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (145 resets) in 505 ms. (79 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (141 resets) in 399 ms. (100 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (139 resets) in 559 ms. (71 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (148 resets) in 392 ms. (101 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (152 resets) in 459 ms. (86 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (151 resets) in 504 ms. (79 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (142 resets) in 544 ms. (73 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (136 resets) in 482 ms. (82 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (140 resets) in 516 ms. (77 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (144 resets) in 376 ms. (106 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (139 resets) in 404 ms. (98 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (146 resets) in 440 ms. (90 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (139 resets) in 543 ms. (73 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40003 steps (147 resets) in 370 ms. (107 steps per ms) remains 385/385 properties
Interrupted probabilistic random walk after 6292300 steps, run timeout after 93001 ms. (steps per millisecond=67 ) properties seen :10 out of 385
Probabilistic random walk after 6292300 steps, saw 1151771 distinct states, run finished after 93001 ms. (steps per millisecond=67 ) properties seen :10
[2025-05-29 19:29:22] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/375 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 15/390 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (OVERLAPS) 209/599 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 7 (OVERLAPS) 5/604 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 9 (OVERLAPS) 118/722 variables, 12/77 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/722 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 11 (OVERLAPS) 38/760 variables, 7/84 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/760 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 13 (OVERLAPS) 49/809 variables, 9/93 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/809 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 15 (OVERLAPS) 1410/2219 variables, 809/902 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2219 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 17 (OVERLAPS) 0/2219 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 375 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2219/2219 variables, and 902 constraints, problems are : Problem set: 0 solved, 375 unsolved in 84729 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 809/809 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/375 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 15/390 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2025-05-29 19:30:49] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:30:49] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2025-05-29 19:30:51] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (OVERLAPS) 209/599 variables, 23/65 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2025-05-29 19:30:55] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 3 ms to minimize.
[2025-05-29 19:30:56] [INFO ] Deduced a trap composed of 48 places in 161 ms of which 3 ms to minimize.
[2025-05-29 19:30:56] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 2 ms to minimize.
[2025-05-29 19:30:57] [INFO ] Deduced a trap composed of 123 places in 110 ms of which 2 ms to minimize.
[2025-05-29 19:30:57] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 2 ms to minimize.
[2025-05-29 19:30:57] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 2 ms to minimize.
[2025-05-29 19:30:57] [INFO ] Deduced a trap composed of 48 places in 151 ms of which 3 ms to minimize.
[2025-05-29 19:30:58] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2025-05-29 19:30:59] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2025-05-29 19:31:00] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 2 ms to minimize.
[2025-05-29 19:31:01] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 3 ms to minimize.
[2025-05-29 19:31:01] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 2 ms to minimize.
[2025-05-29 19:31:02] [INFO ] Deduced a trap composed of 57 places in 170 ms of which 3 ms to minimize.
[2025-05-29 19:31:03] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/599 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2025-05-29 19:31:06] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/599 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/599 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 10 (OVERLAPS) 5/604 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/604 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 12 (OVERLAPS) 118/722 variables, 12/95 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/722 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 14 (OVERLAPS) 38/760 variables, 7/102 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2025-05-29 19:31:40] [INFO ] Deduced a trap composed of 99 places in 101 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/760 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2025-05-29 19:31:50] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/760 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2025-05-29 19:32:00] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/760 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/760 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 19 (OVERLAPS) 49/809 variables, 9/114 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/809 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 21 (OVERLAPS) 1410/2219 variables, 809/923 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2219/2219 variables, and 1298 constraints, problems are : Problem set: 0 solved, 375 unsolved in 105041 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 809/809 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 21/21 constraints]
After SMT, in 189844ms problems are : Problem set: 0 solved, 375 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 375 out of 809 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 809/809 places, 1410/1410 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 809 transition count 1396
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 795 transition count 1396
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 28 place count 795 transition count 1390
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 41 place count 788 transition count 1390
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 788 transition count 1389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 787 transition count 1389
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 9 rules applied. Total rules applied 52 place count 782 transition count 1385
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 52 place count 782 transition count 1383
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 56 place count 780 transition count 1383
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 57 place count 780 transition count 1382
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 59 place count 778 transition count 1382
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 60 place count 777 transition count 1381
Iterating global reduction 5 with 1 rules applied. Total rules applied 61 place count 777 transition count 1381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 62 place count 777 transition count 1380
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 63 place count 777 transition count 1380
Applied a total of 63 rules in 78 ms. Remains 777 /809 variables (removed 32) and now considering 1380/1410 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 777/809 places, 1380/1410 transitions.
RANDOM walk for 4000000 steps (70026 resets) in 90765 ms. (44 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (153 resets) in 303 ms. (131 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (145 resets) in 373 ms. (106 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (145 resets) in 477 ms. (83 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (142 resets) in 568 ms. (70 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (151 resets) in 394 ms. (101 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (156 resets) in 395 ms. (101 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (151 resets) in 493 ms. (80 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (152 resets) in 501 ms. (79 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (152 resets) in 455 ms. (87 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (150 resets) in 380 ms. (104 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (147 resets) in 513 ms. (77 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (144 resets) in 502 ms. (79 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (151 resets) in 507 ms. (78 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (141 resets) in 498 ms. (80 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (159 resets) in 446 ms. (89 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (152 resets) in 477 ms. (83 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (143 resets) in 526 ms. (75 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (148 resets) in 383 ms. (104 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (155 resets) in 523 ms. (76 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (141 resets) in 489 ms. (81 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (152 resets) in 404 ms. (98 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (146 resets) in 526 ms. (75 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (150 resets) in 355 ms. (112 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (150 resets) in 507 ms. (78 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (152 resets) in 508 ms. (78 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (150 resets) in 401 ms. (99 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (154 resets) in 531 ms. (75 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (140 resets) in 421 ms. (94 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (147 resets) in 486 ms. (82 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (145 resets) in 426 ms. (93 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (155 resets) in 474 ms. (84 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (147 resets) in 389 ms. (102 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (151 resets) in 418 ms. (95 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (142 resets) in 425 ms. (93 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (144 resets) in 389 ms. (102 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (151 resets) in 426 ms. (93 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (147 resets) in 405 ms. (98 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (149 resets) in 389 ms. (102 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40000 steps (136 resets) in 574 ms. (69 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (147 resets) in 457 ms. (87 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40001 steps (138 resets) in 436 ms. (91 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (143 resets) in 594 ms. (67 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (146 resets) in 491 ms. (81 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (151 resets) in 489 ms. (81 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (152 resets) in 385 ms. (103 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (155 resets) in 493 ms. (80 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (148 resets) in 482 ms. (82 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (143 resets) in 505 ms. (79 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (146 resets) in 332 ms. (120 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (141 resets) in 493 ms. (80 steps per ms) remains 375/375 properties
Interrupted probabilistic random walk after 5956136 steps, run timeout after 93001 ms. (steps per millisecond=64 ) properties seen :119 out of 375
Probabilistic random walk after 5956136 steps, saw 1193338 distinct states, run finished after 93002 ms. (steps per millisecond=64 ) properties seen :119
// Phase 1: matrix 1380 rows 777 cols
[2025-05-29 19:34:36] [INFO ] Computed 90 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 15/271 variables, 15/28 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 239/510 variables, 22/51 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 21/531 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 13/544 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/544 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 11 (OVERLAPS) 33/577 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 13 (OVERLAPS) 167/744 variables, 22/85 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/744 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 15 (OVERLAPS) 22/766 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/766 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 17 (OVERLAPS) 11/777 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/777 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 19 (OVERLAPS) 1380/2157 variables, 777/867 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2157 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 21 (OVERLAPS) 0/2157 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2157/2157 variables, and 867 constraints, problems are : Problem set: 0 solved, 256 unsolved in 55241 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 777/777 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 15/271 variables, 15/28 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2025-05-29 19:35:33] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2025-05-29 19:35:33] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2025-05-29 19:35:33] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 239/510 variables, 22/54 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2025-05-29 19:35:36] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 2 ms to minimize.
[2025-05-29 19:35:36] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 1 ms to minimize.
[2025-05-29 19:35:36] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2025-05-29 19:35:37] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 2 ms to minimize.
[2025-05-29 19:35:37] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
[2025-05-29 19:35:37] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 2 ms to minimize.
[2025-05-29 19:35:38] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2025-05-29 19:35:39] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2025-05-29 19:35:39] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 21/531 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2025-05-29 19:35:44] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 12 (OVERLAPS) 13/544 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/544 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 14 (OVERLAPS) 33/577 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/577 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 16 (OVERLAPS) 167/744 variables, 22/98 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/744 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 18 (OVERLAPS) 22/766 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/766 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 20 (OVERLAPS) 11/777 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2025-05-29 19:36:12] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/777 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/777 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 23 (OVERLAPS) 1380/2157 variables, 777/881 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2157 variables, 256/1137 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2157/2157 variables, and 1137 constraints, problems are : Problem set: 0 solved, 256 unsolved in 120026 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 777/777 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 14/14 constraints]
After SMT, in 175334ms problems are : Problem set: 0 solved, 256 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 256 out of 777 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 777/777 places, 1380/1380 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 777 transition count 1364
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 761 transition count 1364
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 32 place count 761 transition count 1331
Deduced a syphon composed of 33 places in 2 ms
Ensure Unique test removed 4 places
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 102 place count 724 transition count 1331
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 106 place count 724 transition count 1327
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 110 place count 720 transition count 1327
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 112 place count 718 transition count 1325
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 718 transition count 1325
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 136 place count 706 transition count 1315
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 137 place count 706 transition count 1314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 138 place count 705 transition count 1314
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 138 place count 705 transition count 1311
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 144 place count 702 transition count 1311
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 145 place count 701 transition count 1311
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 146 place count 700 transition count 1305
Iterating global reduction 7 with 1 rules applied. Total rules applied 147 place count 700 transition count 1305
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 148 place count 699 transition count 1305
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 154 place count 696 transition count 1302
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 156 place count 694 transition count 1300
Iterating global reduction 8 with 2 rules applied. Total rules applied 158 place count 694 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 159 place count 693 transition count 1299
Iterating global reduction 8 with 1 rules applied. Total rules applied 160 place count 693 transition count 1299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 161 place count 693 transition count 1298
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 162 place count 693 transition count 1297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 163 place count 692 transition count 1297
Applied a total of 163 rules in 106 ms. Remains 692 /777 variables (removed 85) and now considering 1297/1380 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 692/777 places, 1297/1380 transitions.
RANDOM walk for 2957927 steps (52246 resets) in 120004 ms. (24 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (159 resets) in 395 ms. (101 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (157 resets) in 316 ms. (126 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (151 resets) in 316 ms. (126 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40002 steps (157 resets) in 362 ms. (110 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (156 resets) in 437 ms. (91 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (161 resets) in 352 ms. (113 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (169 resets) in 374 ms. (106 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (157 resets) in 278 ms. (143 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (155 resets) in 418 ms. (95 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40002 steps (157 resets) in 297 ms. (134 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (157 resets) in 377 ms. (105 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (163 resets) in 315 ms. (126 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (154 resets) in 353 ms. (113 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (153 resets) in 449 ms. (88 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (156 resets) in 361 ms. (110 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (154 resets) in 364 ms. (109 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (159 resets) in 354 ms. (112 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (158 resets) in 476 ms. (83 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (159 resets) in 285 ms. (139 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (159 resets) in 315 ms. (126 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40002 steps (160 resets) in 432 ms. (92 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (159 resets) in 290 ms. (137 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (157 resets) in 380 ms. (104 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (153 resets) in 381 ms. (104 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40001 steps (161 resets) in 370 ms. (107 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (158 resets) in 299 ms. (133 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40001 steps (156 resets) in 358 ms. (111 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (152 resets) in 452 ms. (88 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (153 resets) in 264 ms. (150 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (154 resets) in 447 ms. (89 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (155 resets) in 387 ms. (103 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (155 resets) in 389 ms. (102 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (159 resets) in 300 ms. (132 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (153 resets) in 435 ms. (91 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (153 resets) in 428 ms. (93 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (155 resets) in 323 ms. (123 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (151 resets) in 302 ms. (132 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (160 resets) in 402 ms. (99 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (156 resets) in 296 ms. (134 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (154 resets) in 420 ms. (95 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (159 resets) in 411 ms. (97 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (153 resets) in 384 ms. (103 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40002 steps (157 resets) in 332 ms. (120 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (157 resets) in 419 ms. (95 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40001 steps (148 resets) in 351 ms. (113 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (156 resets) in 313 ms. (127 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (155 resets) in 415 ms. (96 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40004 steps (157 resets) in 402 ms. (99 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40003 steps (152 resets) in 345 ms. (115 steps per ms) remains 256/256 properties
BEST_FIRST walk for 40002 steps (152 resets) in 411 ms. (97 steps per ms) remains 256/256 properties
Interrupted probabilistic random walk after 6457846 steps, run timeout after 105003 ms. (steps per millisecond=61 ) properties seen :5 out of 256
Probabilistic random walk after 6457846 steps, saw 1513535 distinct states, run finished after 105004 ms. (steps per millisecond=61 ) properties seen :5
// Phase 1: matrix 1297 rows 692 cols
[2025-05-29 19:39:52] [INFO ] Computed 82 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 12/263 variables, 15/28 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (OVERLAPS) 209/472 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 7 (OVERLAPS) 6/478 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 9 (OVERLAPS) 122/600 variables, 15/68 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/600 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 11 (OVERLAPS) 17/617 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/617 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 13 (OVERLAPS) 51/668 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/668 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 15 (OVERLAPS) 22/690 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/690 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 17 (OVERLAPS) 2/692 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/692 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 19 (OVERLAPS) 1297/1989 variables, 692/774 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1989 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 21 (OVERLAPS) 0/1989 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1989/1989 variables, and 774 constraints, problems are : Problem set: 0 solved, 251 unsolved in 49255 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 692/692 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 12/263 variables, 15/28 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2025-05-29 19:40:43] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-05-29 19:40:43] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:40:43] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 209/472 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2025-05-29 19:40:46] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 1 ms to minimize.
[2025-05-29 19:40:46] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 2 ms to minimize.
[2025-05-29 19:40:46] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 1 ms to minimize.
[2025-05-29 19:40:47] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2025-05-29 19:40:47] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2025-05-29 19:40:48] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 9 (OVERLAPS) 6/478 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2025-05-29 19:40:53] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2025-05-29 19:40:56] [INFO ] Deduced a trap composed of 117 places in 88 ms of which 1 ms to minimize.
[2025-05-29 19:40:56] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/478 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2025-05-29 19:40:59] [INFO ] Deduced a trap composed of 96 places in 88 ms of which 1 ms to minimize.
[2025-05-29 19:40:59] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 2 ms to minimize.
[2025-05-29 19:40:59] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/478 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2025-05-29 19:41:03] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/478 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 15 (OVERLAPS) 122/600 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2025-05-29 19:41:07] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/600 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/600 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 18 (OVERLAPS) 17/617 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/617 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 20 (OVERLAPS) 51/668 variables, 7/95 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2025-05-29 19:41:26] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/668 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/668 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 23 (OVERLAPS) 22/690 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/690 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 25 (OVERLAPS) 2/692 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/692 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 27 (OVERLAPS) 1297/1989 variables, 692/792 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1989 variables, 251/1043 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1989/1989 variables, and 1043 constraints, problems are : Problem set: 0 solved, 251 unsolved in 135018 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 692/692 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 18/18 constraints]
After SMT, in 184341ms problems are : Problem set: 0 solved, 251 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 251 out of 692 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 692/692 places, 1297/1297 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 692 transition count 1295
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 690 transition count 1295
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 690 transition count 1294
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 689 transition count 1294
Applied a total of 6 rules in 21 ms. Remains 689 /692 variables (removed 3) and now considering 1294/1297 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 689/692 places, 1294/1297 transitions.
RANDOM walk for 3489340 steps (61819 resets) in 120004 ms. (29 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (147 resets) in 412 ms. (96 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (160 resets) in 364 ms. (109 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (149 resets) in 291 ms. (136 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (161 resets) in 307 ms. (129 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (161 resets) in 264 ms. (150 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (158 resets) in 448 ms. (89 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (151 resets) in 414 ms. (96 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (155 resets) in 385 ms. (103 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (159 resets) in 298 ms. (133 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (159 resets) in 384 ms. (103 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (154 resets) in 461 ms. (86 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (158 resets) in 442 ms. (90 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (161 resets) in 399 ms. (100 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (152 resets) in 361 ms. (110 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (155 resets) in 302 ms. (132 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (160 resets) in 400 ms. (99 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (153 resets) in 414 ms. (96 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40001 steps (155 resets) in 316 ms. (126 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (149 resets) in 376 ms. (106 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (157 resets) in 434 ms. (91 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (153 resets) in 418 ms. (95 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (159 resets) in 261 ms. (152 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (147 resets) in 460 ms. (86 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (151 resets) in 309 ms. (129 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (147 resets) in 399 ms. (100 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40001 steps (167 resets) in 360 ms. (110 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (152 resets) in 376 ms. (106 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (158 resets) in 388 ms. (102 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (153 resets) in 400 ms. (99 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (160 resets) in 385 ms. (103 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (154 resets) in 394 ms. (101 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (153 resets) in 431 ms. (92 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (146 resets) in 324 ms. (123 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (160 resets) in 310 ms. (128 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (161 resets) in 298 ms. (133 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (156 resets) in 347 ms. (114 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (161 resets) in 349 ms. (114 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (160 resets) in 379 ms. (105 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (150 resets) in 307 ms. (129 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (160 resets) in 290 ms. (137 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (157 resets) in 367 ms. (108 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (158 resets) in 291 ms. (136 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (157 resets) in 305 ms. (130 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (159 resets) in 367 ms. (108 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (161 resets) in 287 ms. (138 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (147 resets) in 393 ms. (101 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (147 resets) in 329 ms. (121 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (148 resets) in 421 ms. (94 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (164 resets) in 366 ms. (109 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (157 resets) in 309 ms. (129 steps per ms) remains 251/251 properties

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="ASLink-PT-05b"
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 ASLink-PT-05b, 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 r014-tall-174853743600223"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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