About the Execution of GreatSPN+red for Anderson-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9585.420 | 1800000.00 | 4407387.00 | 2919.20 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r012-smll-171620124200229.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Anderson-PT-10, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r012-smll-171620124200229
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 15:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME Liveness
=== Now, execution of the tool begins
BK_START 1716266407038
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 04:40:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-21 04:40:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 04:40:09] [INFO ] Load time of PNML (sax parser for PT used): 314 ms
[2024-05-21 04:40:09] [INFO ] Transformed 621 places.
[2024-05-21 04:40:09] [INFO ] Transformed 2480 transitions.
[2024-05-21 04:40:09] [INFO ] Found NUPN structural information;
[2024-05-21 04:40:09] [INFO ] Parsed PT model containing 621 places and 2480 transitions and 9560 arcs in 511 ms.
Built sparse matrix representations for Structural reductions in 17 ms.37185KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 254 ms. Remains 621 /621 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 278 ms. Remains : 621/621 places, 2480/2480 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 97 ms. Remains 621 /621 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
// Phase 1: matrix 2480 rows 621 cols
[2024-05-21 04:40:10] [INFO ] Computed 23 invariants in 109 ms
[2024-05-21 04:40:10] [INFO ] Implicit Places using invariants in 752 ms returned []
[2024-05-21 04:40:10] [INFO ] Invariant cache hit.
[2024-05-21 04:40:12] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-21 04:40:12] [INFO ] Implicit Places using invariants and state equation in 2064 ms returned []
Implicit Place search using SMT with State Equation took 2868 ms to find 0 implicit places.
[2024-05-21 04:40:13] [INFO ] Redundant transitions in 223 ms returned []
Running 2470 sub problems to find dead transitions.
[2024-05-21 04:40:13] [INFO ] Invariant cache hit.
[2024-05-21 04:40:13] [INFO ] State equation strengthened by 90 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 621/621 constraints. Problems are: Problem set: 0 solved, 2470 unsolved
SMT process timed out in 40687ms, After SMT, problems are : Problem set: 0 solved, 2470 unsolved
Search for dead transitions found 0 dead transitions in 40796ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 44033 ms. Remains : 621/621 places, 2480/2480 transitions.
Random walk for 1250000 steps, including 0 resets, run took 5898 ms (no deadlock found). (steps per millisecond=211 )
Random directed walk for 1250000 steps, including 0 resets, run took 4691 ms (no deadlock found). (steps per millisecond=266 )
[2024-05-21 04:41:04] [INFO ] Invariant cache hit.
[2024-05-21 04:41:05] [INFO ] [Real]Absence check using 11 positive place invariants in 45 ms returned sat
[2024-05-21 04:41:07] [INFO ] [Real]Absence check using 11 positive and 12 generalized place invariants in 2182 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 621 transition count 2390
Deduced a syphon composed of 90 places in 2 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 531 transition count 2390
Applied a total of 180 rules in 140 ms. Remains 531 /621 variables (removed 90) and now considering 2390/2480 (removed 90) transitions.
// Phase 1: matrix 2390 rows 531 cols
[2024-05-21 04:41:07] [INFO ] Computed 23 invariants in 54 ms
[2024-05-21 04:41:10] [INFO ] Implicit Places using invariants in 2327 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2334 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 530/621 places, 2390/2480 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 530 transition count 2290
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 430 transition count 2290
Applied a total of 200 rules in 23 ms. Remains 430 /530 variables (removed 100) and now considering 2290/2390 (removed 100) transitions.
// Phase 1: matrix 2290 rows 430 cols
[2024-05-21 04:41:10] [INFO ] Computed 22 invariants in 14 ms
[2024-05-21 04:41:12] [INFO ] Implicit Places using invariants in 1826 ms returned []
[2024-05-21 04:41:12] [INFO ] Invariant cache hit.
[2024-05-21 04:41:13] [INFO ] State equation strengthened by 170 read => feed constraints.
[2024-05-21 04:41:18] [INFO ] Implicit Places using invariants and state equation in 5994 ms returned []
Implicit Place search using SMT with State Equation took 7824 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 430/621 places, 2290/2480 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 10322 ms. Remains : 430/621 places, 2290/2480 transitions.
Initial state reduction rules removed 10 formulas.
RANDOM walk for 40000 steps (8 resets) in 9587 ms. (4 steps per ms) remains 1220/2280 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 16 ms. (7 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1220/1220 properties
[2024-05-21 04:41:20] [INFO ] Invariant cache hit.
[2024-05-21 04:41:20] [INFO ] State equation strengthened by 170 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
SMT process timed out in 10334ms, After SMT, problems are : Problem set: 0 solved, 1220 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 182 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 2290/2290 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 386 transition count 2246
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 386 transition count 2246
Applied a total of 88 rules in 164 ms. Remains 386 /430 variables (removed 44) and now considering 2246/2290 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 386/430 places, 2246/2290 transitions.
RANDOM walk for 1525158 steps (4 resets) in 120004 ms. (12 steps per ms) remains 613/1220 properties
BEST_FIRST walk for 4002 steps (8 resets) in 70 ms. (56 steps per ms) remains 613/613 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 612/613 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4003 steps (8 resets) in 74 ms. (53 steps per ms) remains 611/612 properties
BEST_FIRST walk for 4002 steps (8 resets) in 87 ms. (45 steps per ms) remains 611/611 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 541/611 properties
BEST_FIRST walk for 4002 steps (8 resets) in 75 ms. (52 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 533/541 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 532/533 properties
BEST_FIRST walk for 4003 steps (8 resets) in 71 ms. (55 steps per ms) remains 532/532 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 532/532 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 532/532 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 532/532 properties
BEST_FIRST walk for 4001 steps (8 resets) in 107 ms. (37 steps per ms) remains 532/532 properties
BEST_FIRST walk for 4003 steps (8 resets) in 110 ms. (36 steps per ms) remains 532/532 properties
BEST_FIRST walk for 4002 steps (8 resets) in 111 ms. (35 steps per ms) remains 532/532 properties
BEST_FIRST walk for 4003 steps (8 resets) in 106 ms. (37 steps per ms) remains 532/532 properties
BEST_FIRST walk for 4003 steps (8 resets) in 108 ms. (36 steps per ms) remains 532/532 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 443/532 properties
BEST_FIRST walk for 4001 steps (8 resets) in 104 ms. (38 steps per ms) remains 443/443 properties
BEST_FIRST walk for 4001 steps (8 resets) in 82 ms. (48 steps per ms) remains 443/443 properties
BEST_FIRST walk for 4001 steps (8 resets) in 77 ms. (51 steps per ms) remains 443/443 properties
BEST_FIRST walk for 4002 steps (8 resets) in 70 ms. (56 steps per ms) remains 443/443 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 443/443 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 443/443 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 443/443 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 443/443 properties
BEST_FIRST walk for 4001 steps (8 resets) in 62 ms. (63 steps per ms) remains 443/443 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 443/443 properties
BEST_FIRST walk for 4001 steps (8 resets) in 75 ms. (52 steps per ms) remains 443/443 properties
BEST_FIRST walk for 4003 steps (8 resets) in 79 ms. (50 steps per ms) remains 443/443 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 443/443 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 443/443 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 443/443 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 443/443 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 443/443 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 443/443 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 443/443 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 443/443 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 441/443 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 441/441 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 441/441 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 441/441 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 441/441 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 436/441 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 429/436 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 429/429 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 429/429 properties
BEST_FIRST walk for 4001 steps (8 resets) in 56 ms. (70 steps per ms) remains 429/429 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 429/429 properties
BEST_FIRST walk for 4001 steps (8 resets) in 63 ms. (62 steps per ms) remains 429/429 properties
BEST_FIRST walk for 4001 steps (8 resets) in 50 ms. (78 steps per ms) remains 429/429 properties
BEST_FIRST walk for 4001 steps (8 resets) in 62 ms. (63 steps per ms) remains 429/429 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 429/429 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 429/429 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 424/429 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 424/424 properties
BEST_FIRST walk for 4002 steps (8 resets) in 62 ms. (63 steps per ms) remains 424/424 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 424/424 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 424/424 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 424/424 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 424/424 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 410/424 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 344/410 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 344/344 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 344/344 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 344/344 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 344/344 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 328/344 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 328/328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 328/328 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 328/328 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 328/328 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 328/328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 328/328 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 328/328 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 328/328 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 328/328 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 328/328 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 328/328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 328/328 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 328/328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 323/328 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 322/323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 322/322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 322/322 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 322/322 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 322/322 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 322/322 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 322/322 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 322/322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 322/322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 322/322 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 322/322 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 322/322 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 322/322 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 322/322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 317/322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 317/317 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 317/317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 317/317 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 317/317 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 317/317 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 317/317 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 317/317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 317/317 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 314/317 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 314/314 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 314/314 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 314/314 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 314/314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 280/314 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 280/280 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 280/280 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 280/280 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 280/280 properties
BEST_FIRST walk for 4003 steps (8 resets) in 99 ms. (40 steps per ms) remains 280/280 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 278/280 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 278/278 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 278/278 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 278/278 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 278/278 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 278/278 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 278/278 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 274/278 properties
BEST_FIRST walk for 4001 steps (8 resets) in 47 ms. (83 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4000 steps (8 resets) in 48 ms. (81 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 274/274 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 247/274 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 247/247 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 247/247 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 247/247 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 247/247 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 247/247 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 247/247 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 247/247 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 247/247 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 247/247 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 247/247 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 247/247 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 247/247 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 247/247 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 247/247 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 247/247 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 246/247 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4001 steps (8 resets) in 47 ms. (83 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 245/246 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 245/245 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 245/245 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 245/245 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 245/245 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 245/245 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 245/245 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 243/245 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 243/243 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 243/243 properties
// Phase 1: matrix 2246 rows 386 cols
[2024-05-21 04:42:04] [INFO ] Computed 22 invariants in 14 ms
[2024-05-21 04:42:04] [INFO ] State equation strengthened by 136 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 257/374 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 04:42:11] [INFO ] Deduced a trap composed of 300 places in 368 ms of which 34 ms to minimize.
[2024-05-21 04:42:12] [INFO ] Deduced a trap composed of 263 places in 369 ms of which 6 ms to minimize.
[2024-05-21 04:42:12] [INFO ] Deduced a trap composed of 261 places in 454 ms of which 6 ms to minimize.
[2024-05-21 04:42:13] [INFO ] Deduced a trap composed of 243 places in 413 ms of which 7 ms to minimize.
[2024-05-21 04:42:13] [INFO ] Deduced a trap composed of 261 places in 530 ms of which 6 ms to minimize.
[2024-05-21 04:42:14] [INFO ] Deduced a trap composed of 300 places in 545 ms of which 5 ms to minimize.
[2024-05-21 04:42:14] [INFO ] Deduced a trap composed of 248 places in 518 ms of which 6 ms to minimize.
[2024-05-21 04:42:15] [INFO ] Deduced a trap composed of 226 places in 579 ms of which 6 ms to minimize.
[2024-05-21 04:42:16] [INFO ] Deduced a trap composed of 245 places in 580 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 04:42:21] [INFO ] Deduced a trap composed of 205 places in 593 ms of which 5 ms to minimize.
[2024-05-21 04:42:21] [INFO ] Deduced a trap composed of 187 places in 632 ms of which 7 ms to minimize.
[2024-05-21 04:42:22] [INFO ] Deduced a trap composed of 280 places in 582 ms of which 6 ms to minimize.
[2024-05-21 04:42:23] [INFO ] Deduced a trap composed of 265 places in 527 ms of which 5 ms to minimize.
[2024-05-21 04:42:23] [INFO ] Deduced a trap composed of 245 places in 583 ms of which 6 ms to minimize.
[2024-05-21 04:42:24] [INFO ] Deduced a trap composed of 232 places in 622 ms of which 6 ms to minimize.
[2024-05-21 04:42:25] [INFO ] Deduced a trap composed of 229 places in 600 ms of which 5 ms to minimize.
[2024-05-21 04:42:25] [INFO ] Deduced a trap composed of 245 places in 638 ms of which 6 ms to minimize.
[2024-05-21 04:42:26] [INFO ] Deduced a trap composed of 226 places in 605 ms of which 6 ms to minimize.
[2024-05-21 04:42:27] [INFO ] Deduced a trap composed of 246 places in 625 ms of which 6 ms to minimize.
[2024-05-21 04:42:27] [INFO ] Deduced a trap composed of 263 places in 604 ms of which 6 ms to minimize.
[2024-05-21 04:42:28] [INFO ] Deduced a trap composed of 285 places in 607 ms of which 6 ms to minimize.
[2024-05-21 04:42:29] [INFO ] Deduced a trap composed of 266 places in 605 ms of which 6 ms to minimize.
[2024-05-21 04:42:29] [INFO ] Deduced a trap composed of 267 places in 609 ms of which 6 ms to minimize.
[2024-05-21 04:42:30] [INFO ] Deduced a trap composed of 242 places in 556 ms of which 6 ms to minimize.
[2024-05-21 04:42:31] [INFO ] Deduced a trap composed of 223 places in 578 ms of which 5 ms to minimize.
[2024-05-21 04:42:31] [INFO ] Deduced a trap composed of 263 places in 579 ms of which 6 ms to minimize.
[2024-05-21 04:42:32] [INFO ] Deduced a trap composed of 263 places in 525 ms of which 4 ms to minimize.
[2024-05-21 04:42:32] [INFO ] Deduced a trap composed of 282 places in 593 ms of which 6 ms to minimize.
[2024-05-21 04:42:33] [INFO ] Deduced a trap composed of 225 places in 588 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/374 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 04:42:40] [INFO ] Deduced a trap composed of 281 places in 601 ms of which 6 ms to minimize.
[2024-05-21 04:42:40] [INFO ] Deduced a trap composed of 264 places in 599 ms of which 6 ms to minimize.
[2024-05-21 04:42:41] [INFO ] Deduced a trap composed of 262 places in 534 ms of which 6 ms to minimize.
[2024-05-21 04:42:41] [INFO ] Deduced a trap composed of 225 places in 604 ms of which 6 ms to minimize.
[2024-05-21 04:42:42] [INFO ] Deduced a trap composed of 248 places in 534 ms of which 6 ms to minimize.
[2024-05-21 04:42:43] [INFO ] Deduced a trap composed of 224 places in 609 ms of which 6 ms to minimize.
[2024-05-21 04:42:43] [INFO ] Deduced a trap composed of 227 places in 603 ms of which 6 ms to minimize.
[2024-05-21 04:42:44] [INFO ] Deduced a trap composed of 208 places in 502 ms of which 6 ms to minimize.
[2024-05-21 04:42:44] [INFO ] Deduced a trap composed of 190 places in 469 ms of which 4 ms to minimize.
[2024-05-21 04:42:45] [INFO ] Deduced a trap composed of 226 places in 523 ms of which 5 ms to minimize.
[2024-05-21 04:42:45] [INFO ] Deduced a trap composed of 208 places in 748 ms of which 7 ms to minimize.
[2024-05-21 04:42:46] [INFO ] Deduced a trap composed of 235 places in 561 ms of which 6 ms to minimize.
[2024-05-21 04:42:47] [INFO ] Deduced a trap composed of 243 places in 457 ms of which 4 ms to minimize.
[2024-05-21 04:42:47] [INFO ] Deduced a trap composed of 207 places in 494 ms of which 5 ms to minimize.
[2024-05-21 04:42:48] [INFO ] Deduced a trap composed of 247 places in 515 ms of which 6 ms to minimize.
[2024-05-21 04:42:48] [INFO ] Deduced a trap composed of 213 places in 568 ms of which 6 ms to minimize.
[2024-05-21 04:42:49] [INFO ] Deduced a trap composed of 227 places in 484 ms of which 6 ms to minimize.
[2024-05-21 04:42:49] [INFO ] Deduced a trap composed of 229 places in 521 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 374/2632 variables, and 58 constraints, problems are : Problem set: 0 solved, 243 unsolved in 45021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 0/11 constraints, State Equation: 0/386 constraints, ReadFeed: 0/136 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 257/374 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 04:42:53] [INFO ] Deduced a trap composed of 262 places in 592 ms of which 6 ms to minimize.
[2024-05-21 04:42:54] [INFO ] Deduced a trap composed of 264 places in 608 ms of which 6 ms to minimize.
[2024-05-21 04:42:54] [INFO ] Deduced a trap composed of 228 places in 605 ms of which 6 ms to minimize.
[2024-05-21 04:42:55] [INFO ] Deduced a trap composed of 243 places in 602 ms of which 7 ms to minimize.
[2024-05-21 04:42:56] [INFO ] Deduced a trap composed of 243 places in 583 ms of which 6 ms to minimize.
[2024-05-21 04:42:56] [INFO ] Deduced a trap composed of 230 places in 607 ms of which 6 ms to minimize.
[2024-05-21 04:42:57] [INFO ] Deduced a trap composed of 207 places in 584 ms of which 6 ms to minimize.
[2024-05-21 04:42:58] [INFO ] Deduced a trap composed of 231 places in 594 ms of which 4 ms to minimize.
[2024-05-21 04:42:58] [INFO ] Deduced a trap composed of 261 places in 610 ms of which 5 ms to minimize.
[2024-05-21 04:42:59] [INFO ] Deduced a trap composed of 242 places in 403 ms of which 4 ms to minimize.
[2024-05-21 04:42:59] [INFO ] Deduced a trap composed of 189 places in 495 ms of which 6 ms to minimize.
[2024-05-21 04:43:00] [INFO ] Deduced a trap composed of 207 places in 497 ms of which 5 ms to minimize.
[2024-05-21 04:43:00] [INFO ] Deduced a trap composed of 280 places in 488 ms of which 6 ms to minimize.
[2024-05-21 04:43:01] [INFO ] Deduced a trap composed of 242 places in 439 ms of which 4 ms to minimize.
[2024-05-21 04:43:01] [INFO ] Deduced a trap composed of 261 places in 507 ms of which 6 ms to minimize.
[2024-05-21 04:43:02] [INFO ] Deduced a trap composed of 245 places in 559 ms of which 10 ms to minimize.
[2024-05-21 04:43:02] [INFO ] Deduced a trap composed of 264 places in 592 ms of which 6 ms to minimize.
[2024-05-21 04:43:03] [INFO ] Deduced a trap composed of 223 places in 557 ms of which 4 ms to minimize.
[2024-05-21 04:43:03] [INFO ] Deduced a trap composed of 209 places in 593 ms of which 4 ms to minimize.
[2024-05-21 04:43:04] [INFO ] Deduced a trap composed of 215 places in 447 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/374 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 04:43:09] [INFO ] Deduced a trap composed of 265 places in 645 ms of which 7 ms to minimize.
[2024-05-21 04:43:09] [INFO ] Deduced a trap composed of 225 places in 614 ms of which 5 ms to minimize.
[2024-05-21 04:43:10] [INFO ] Deduced a trap composed of 226 places in 610 ms of which 5 ms to minimize.
[2024-05-21 04:43:10] [INFO ] Deduced a trap composed of 230 places in 614 ms of which 6 ms to minimize.
[2024-05-21 04:43:11] [INFO ] Deduced a trap composed of 212 places in 603 ms of which 6 ms to minimize.
[2024-05-21 04:43:12] [INFO ] Deduced a trap composed of 227 places in 597 ms of which 6 ms to minimize.
[2024-05-21 04:43:12] [INFO ] Deduced a trap composed of 189 places in 628 ms of which 6 ms to minimize.
[2024-05-21 04:43:13] [INFO ] Deduced a trap composed of 210 places in 510 ms of which 6 ms to minimize.
[2024-05-21 04:43:13] [INFO ] Deduced a trap composed of 207 places in 462 ms of which 4 ms to minimize.
[2024-05-21 04:43:14] [INFO ] Deduced a trap composed of 266 places in 602 ms of which 5 ms to minimize.
[2024-05-21 04:43:15] [INFO ] Deduced a trap composed of 265 places in 625 ms of which 6 ms to minimize.
[2024-05-21 04:43:15] [INFO ] Deduced a trap composed of 227 places in 568 ms of which 5 ms to minimize.
[2024-05-21 04:43:16] [INFO ] Deduced a trap composed of 244 places in 533 ms of which 6 ms to minimize.
[2024-05-21 04:43:16] [INFO ] Deduced a trap composed of 267 places in 497 ms of which 5 ms to minimize.
[2024-05-21 04:43:17] [INFO ] Deduced a trap composed of 244 places in 497 ms of which 6 ms to minimize.
[2024-05-21 04:43:17] [INFO ] Deduced a trap composed of 244 places in 489 ms of which 5 ms to minimize.
[2024-05-21 04:43:18] [INFO ] Deduced a trap composed of 231 places in 492 ms of which 6 ms to minimize.
[2024-05-21 04:43:18] [INFO ] Deduced a trap composed of 225 places in 510 ms of which 6 ms to minimize.
[2024-05-21 04:43:19] [INFO ] Deduced a trap composed of 214 places in 425 ms of which 6 ms to minimize.
[2024-05-21 04:43:19] [INFO ] Deduced a trap composed of 226 places in 571 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 04:43:24] [INFO ] Deduced a trap composed of 264 places in 594 ms of which 6 ms to minimize.
[2024-05-21 04:43:24] [INFO ] Deduced a trap composed of 227 places in 582 ms of which 5 ms to minimize.
[2024-05-21 04:43:25] [INFO ] Deduced a trap composed of 244 places in 532 ms of which 5 ms to minimize.
[2024-05-21 04:43:25] [INFO ] Deduced a trap composed of 208 places in 621 ms of which 6 ms to minimize.
[2024-05-21 04:43:26] [INFO ] Deduced a trap composed of 264 places in 501 ms of which 5 ms to minimize.
[2024-05-21 04:43:27] [INFO ] Deduced a trap composed of 248 places in 594 ms of which 6 ms to minimize.
[2024-05-21 04:43:27] [INFO ] Deduced a trap composed of 227 places in 598 ms of which 5 ms to minimize.
[2024-05-21 04:43:28] [INFO ] Deduced a trap composed of 267 places in 546 ms of which 6 ms to minimize.
[2024-05-21 04:43:28] [INFO ] Deduced a trap composed of 263 places in 607 ms of which 6 ms to minimize.
[2024-05-21 04:43:29] [INFO ] Deduced a trap composed of 189 places in 509 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 10/108 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 243 unsolved
SMT process timed out in 91073ms, After SMT, problems are : Problem set: 0 solved, 243 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 117 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 2246/2246 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 347 transition count 2099
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 347 transition count 2099
Applied a total of 78 rules in 131 ms. Remains 347 /386 variables (removed 39) and now considering 2099/2246 (removed 147) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 347/386 places, 2099/2246 transitions.
RANDOM walk for 4000000 steps (8 resets) in 81584 ms. (49 steps per ms) remains 234/243 properties
BEST_FIRST walk for 40003 steps (8 resets) in 215 ms. (185 steps per ms) remains 233/234 properties
BEST_FIRST walk for 40003 steps (8 resets) in 211 ms. (188 steps per ms) remains 230/233 properties
BEST_FIRST walk for 40001 steps (8 resets) in 215 ms. (185 steps per ms) remains 230/230 properties
BEST_FIRST walk for 40002 steps (8 resets) in 278 ms. (143 steps per ms) remains 230/230 properties
BEST_FIRST walk for 40002 steps (8 resets) in 273 ms. (145 steps per ms) remains 230/230 properties
BEST_FIRST walk for 40002 steps (8 resets) in 291 ms. (136 steps per ms) remains 225/230 properties
BEST_FIRST walk for 40002 steps (8 resets) in 275 ms. (144 steps per ms) remains 225/225 properties
BEST_FIRST walk for 40003 steps (8 resets) in 261 ms. (152 steps per ms) remains 225/225 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 225/225 properties
BEST_FIRST walk for 40002 steps (8 resets) in 260 ms. (153 steps per ms) remains 225/225 properties
BEST_FIRST walk for 40003 steps (8 resets) in 294 ms. (135 steps per ms) remains 224/225 properties
BEST_FIRST walk for 40003 steps (8 resets) in 267 ms. (149 steps per ms) remains 224/224 properties
BEST_FIRST walk for 40003 steps (8 resets) in 276 ms. (144 steps per ms) remains 224/224 properties
BEST_FIRST walk for 40002 steps (8 resets) in 274 ms. (145 steps per ms) remains 211/224 properties
BEST_FIRST walk for 40003 steps (8 resets) in 264 ms. (150 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 209/211 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 206/209 properties
BEST_FIRST walk for 40001 steps (8 resets) in 276 ms. (144 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40003 steps (8 resets) in 274 ms. (145 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40003 steps (8 resets) in 274 ms. (145 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40003 steps (8 resets) in 198 ms. (201 steps per ms) remains 205/206 properties
BEST_FIRST walk for 40001 steps (8 resets) in 197 ms. (202 steps per ms) remains 205/205 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 200/205 properties
BEST_FIRST walk for 40003 steps (8 resets) in 268 ms. (148 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40003 steps (8 resets) in 360 ms. (110 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40003 steps (8 resets) in 352 ms. (113 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 636 ms. (62 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40003 steps (8 resets) in 546 ms. (73 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40003 steps (8 resets) in 633 ms. (63 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 641 ms. (62 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40003 steps (8 resets) in 589 ms. (67 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40001 steps (8 resets) in 538 ms. (74 steps per ms) remains 199/200 properties
BEST_FIRST walk for 40002 steps (8 resets) in 579 ms. (68 steps per ms) remains 199/199 properties
BEST_FIRST walk for 40003 steps (8 resets) in 449 ms. (88 steps per ms) remains 199/199 properties
BEST_FIRST walk for 40003 steps (8 resets) in 526 ms. (75 steps per ms) remains 197/199 properties
BEST_FIRST walk for 40004 steps (8 resets) in 543 ms. (73 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40004 steps (8 resets) in 534 ms. (74 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40002 steps (8 resets) in 427 ms. (93 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40003 steps (8 resets) in 431 ms. (92 steps per ms) remains 196/197 properties
BEST_FIRST walk for 40003 steps (8 resets) in 419 ms. (95 steps per ms) remains 188/196 properties
BEST_FIRST walk for 40003 steps (8 resets) in 396 ms. (100 steps per ms) remains 188/188 properties
BEST_FIRST walk for 40003 steps (8 resets) in 333 ms. (119 steps per ms) remains 186/188 properties
BEST_FIRST walk for 40002 steps (8 resets) in 514 ms. (77 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 340 ms. (117 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 486 ms. (82 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40002 steps (8 resets) in 405 ms. (98 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40000 steps (8 resets) in 418 ms. (95 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40002 steps (8 resets) in 456 ms. (87 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 407 ms. (98 steps per ms) remains 185/186 properties
BEST_FIRST walk for 40003 steps (8 resets) in 374 ms. (106 steps per ms) remains 185/185 properties
BEST_FIRST walk for 40004 steps (8 resets) in 406 ms. (98 steps per ms) remains 184/185 properties
BEST_FIRST walk for 40002 steps (8 resets) in 353 ms. (113 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40003 steps (8 resets) in 387 ms. (103 steps per ms) remains 181/184 properties
BEST_FIRST walk for 40002 steps (8 resets) in 515 ms. (77 steps per ms) remains 180/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 463 ms. (86 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40003 steps (8 resets) in 304 ms. (131 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40003 steps (8 resets) in 377 ms. (105 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40002 steps (8 resets) in 439 ms. (90 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40003 steps (8 resets) in 379 ms. (105 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40003 steps (8 resets) in 383 ms. (104 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40003 steps (8 resets) in 623 ms. (64 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 387 ms. (103 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40003 steps (8 resets) in 404 ms. (98 steps per ms) remains 179/180 properties
BEST_FIRST walk for 40001 steps (8 resets) in 461 ms. (86 steps per ms) remains 179/179 properties
BEST_FIRST walk for 40003 steps (8 resets) in 382 ms. (104 steps per ms) remains 179/179 properties
BEST_FIRST walk for 40003 steps (8 resets) in 432 ms. (92 steps per ms) remains 179/179 properties
BEST_FIRST walk for 40004 steps (8 resets) in 395 ms. (101 steps per ms) remains 179/179 properties
BEST_FIRST walk for 40003 steps (8 resets) in 370 ms. (107 steps per ms) remains 179/179 properties
BEST_FIRST walk for 40002 steps (8 resets) in 512 ms. (77 steps per ms) remains 179/179 properties
BEST_FIRST walk for 40001 steps (8 resets) in 675 ms. (59 steps per ms) remains 179/179 properties
BEST_FIRST walk for 40003 steps (8 resets) in 694 ms. (57 steps per ms) remains 179/179 properties
BEST_FIRST walk for 40004 steps (8 resets) in 619 ms. (64 steps per ms) remains 179/179 properties
BEST_FIRST walk for 40003 steps (8 resets) in 501 ms. (79 steps per ms) remains 176/179 properties
BEST_FIRST walk for 40001 steps (8 resets) in 322 ms. (123 steps per ms) remains 176/176 properties
BEST_FIRST walk for 40000 steps (8 resets) in 377 ms. (105 steps per ms) remains 176/176 properties
BEST_FIRST walk for 40003 steps (8 resets) in 335 ms. (119 steps per ms) remains 176/176 properties
BEST_FIRST walk for 40004 steps (8 resets) in 457 ms. (87 steps per ms) remains 172/176 properties
BEST_FIRST walk for 40001 steps (8 resets) in 410 ms. (97 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40001 steps (8 resets) in 393 ms. (101 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (8 resets) in 434 ms. (91 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (8 resets) in 330 ms. (120 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (8 resets) in 374 ms. (106 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (8 resets) in 370 ms. (107 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40001 steps (8 resets) in 380 ms. (104 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (8 resets) in 386 ms. (103 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (8 resets) in 408 ms. (97 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40001 steps (8 resets) in 386 ms. (103 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40004 steps (8 resets) in 390 ms. (102 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (8 resets) in 299 ms. (133 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40004 steps (8 resets) in 311 ms. (128 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (8 resets) in 280 ms. (142 steps per ms) remains 171/172 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 375 ms. (106 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (8 resets) in 452 ms. (88 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (8 resets) in 521 ms. (76 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (8 resets) in 383 ms. (104 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (8 resets) in 435 ms. (91 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (8 resets) in 437 ms. (91 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40002 steps (8 resets) in 417 ms. (95 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (8 resets) in 341 ms. (116 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (8 resets) in 403 ms. (99 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (8 resets) in 395 ms. (101 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 450 ms. (88 steps per ms) remains 168/171 properties
BEST_FIRST walk for 40001 steps (8 resets) in 288 ms. (138 steps per ms) remains 161/168 properties
BEST_FIRST walk for 40002 steps (8 resets) in 507 ms. (78 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 492 ms. (81 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (8 resets) in 399 ms. (100 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (8 resets) in 357 ms. (111 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (8 resets) in 393 ms. (101 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 356 ms. (112 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 380 ms. (104 steps per ms) remains 160/161 properties
BEST_FIRST walk for 40002 steps (8 resets) in 412 ms. (96 steps per ms) remains 160/160 properties
BEST_FIRST walk for 40003 steps (8 resets) in 452 ms. (88 steps per ms) remains 160/160 properties
BEST_FIRST walk for 40003 steps (8 resets) in 432 ms. (92 steps per ms) remains 160/160 properties
BEST_FIRST walk for 40000 steps (8 resets) in 452 ms. (88 steps per ms) remains 160/160 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 158/160 properties
BEST_FIRST walk for 40000 steps (8 resets) in 345 ms. (115 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40000 steps (8 resets) in 369 ms. (108 steps per ms) remains 156/158 properties
BEST_FIRST walk for 40003 steps (8 resets) in 314 ms. (126 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 437 ms. (91 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40003 steps (8 resets) in 307 ms. (129 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40003 steps (8 resets) in 325 ms. (122 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40002 steps (8 resets) in 461 ms. (86 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40003 steps (8 resets) in 392 ms. (101 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40002 steps (8 resets) in 451 ms. (88 steps per ms) remains 155/156 properties
BEST_FIRST walk for 40002 steps (8 resets) in 443 ms. (90 steps per ms) remains 153/155 properties
BEST_FIRST walk for 40004 steps (8 resets) in 341 ms. (116 steps per ms) remains 151/153 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 145/151 properties
BEST_FIRST walk for 40001 steps (8 resets) in 323 ms. (123 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40003 steps (8 resets) in 329 ms. (121 steps per ms) remains 144/145 properties
BEST_FIRST walk for 40003 steps (8 resets) in 347 ms. (114 steps per ms) remains 142/144 properties
BEST_FIRST walk for 40002 steps (8 resets) in 323 ms. (123 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 337 ms. (118 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (8 resets) in 374 ms. (106 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (8 resets) in 359 ms. (111 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (8 resets) in 327 ms. (121 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 406 ms. (98 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 484 ms. (82 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (8 resets) in 337 ms. (118 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (8 resets) in 440 ms. (90 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (8 resets) in 323 ms. (123 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (8 resets) in 375 ms. (106 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (8 resets) in 369 ms. (108 steps per ms) remains 138/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 384 ms. (103 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40001 steps (8 resets) in 425 ms. (93 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 287 ms. (138 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (8 resets) in 394 ms. (101 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 253 ms. (157 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (8 resets) in 365 ms. (109 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 395 ms. (101 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 369 ms. (108 steps per ms) remains 131/138 properties
BEST_FIRST walk for 40002 steps (8 resets) in 357 ms. (111 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40004 steps (8 resets) in 422 ms. (94 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (8 resets) in 389 ms. (102 steps per ms) remains 106/131 properties
// Phase 1: matrix 2099 rows 347 cols
[2024-05-21 04:44:20] [INFO ] Computed 22 invariants in 12 ms
[2024-05-21 04:44:20] [INFO ] State equation strengthened by 103 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 264/323 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 23/346 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-21 04:44:24] [INFO ] Deduced a trap composed of 71 places in 555 ms of which 4 ms to minimize.
[2024-05-21 04:44:24] [INFO ] Deduced a trap composed of 141 places in 543 ms of which 4 ms to minimize.
[2024-05-21 04:44:25] [INFO ] Deduced a trap composed of 96 places in 558 ms of which 4 ms to minimize.
[2024-05-21 04:44:25] [INFO ] Deduced a trap composed of 86 places in 531 ms of which 3 ms to minimize.
[2024-05-21 04:44:26] [INFO ] Deduced a trap composed of 94 places in 522 ms of which 4 ms to minimize.
[2024-05-21 04:44:26] [INFO ] Deduced a trap composed of 148 places in 553 ms of which 4 ms to minimize.
[2024-05-21 04:44:27] [INFO ] Deduced a trap composed of 63 places in 550 ms of which 4 ms to minimize.
[2024-05-21 04:44:28] [INFO ] Deduced a trap composed of 78 places in 521 ms of which 4 ms to minimize.
[2024-05-21 04:44:28] [INFO ] Deduced a trap composed of 98 places in 607 ms of which 5 ms to minimize.
[2024-05-21 04:44:29] [INFO ] Deduced a trap composed of 90 places in 576 ms of which 3 ms to minimize.
[2024-05-21 04:44:30] [INFO ] Deduced a trap composed of 57 places in 766 ms of which 6 ms to minimize.
[2024-05-21 04:44:30] [INFO ] Deduced a trap composed of 73 places in 661 ms of which 4 ms to minimize.
[2024-05-21 04:44:31] [INFO ] Deduced a trap composed of 147 places in 536 ms of which 4 ms to minimize.
[2024-05-21 04:44:31] [INFO ] Deduced a trap composed of 85 places in 548 ms of which 3 ms to minimize.
[2024-05-21 04:44:32] [INFO ] Deduced a trap composed of 113 places in 578 ms of which 3 ms to minimize.
[2024-05-21 04:44:32] [INFO ] Deduced a trap composed of 45 places in 462 ms of which 3 ms to minimize.
[2024-05-21 04:44:33] [INFO ] Deduced a trap composed of 141 places in 597 ms of which 4 ms to minimize.
[2024-05-21 04:44:34] [INFO ] Deduced a trap composed of 67 places in 644 ms of which 5 ms to minimize.
[2024-05-21 04:44:34] [INFO ] Deduced a trap composed of 99 places in 582 ms of which 3 ms to minimize.
[2024-05-21 04:44:35] [INFO ] Deduced a trap composed of 103 places in 605 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-21 04:44:36] [INFO ] Deduced a trap composed of 88 places in 558 ms of which 4 ms to minimize.
[2024-05-21 04:44:37] [INFO ] Deduced a trap composed of 89 places in 610 ms of which 4 ms to minimize.
[2024-05-21 04:44:37] [INFO ] Deduced a trap composed of 81 places in 592 ms of which 4 ms to minimize.
[2024-05-21 04:44:38] [INFO ] Deduced a trap composed of 93 places in 516 ms of which 3 ms to minimize.
[2024-05-21 04:44:38] [INFO ] Deduced a trap composed of 91 places in 669 ms of which 5 ms to minimize.
[2024-05-21 04:44:39] [INFO ] Deduced a trap composed of 91 places in 596 ms of which 4 ms to minimize.
[2024-05-21 04:44:40] [INFO ] Deduced a trap composed of 85 places in 584 ms of which 4 ms to minimize.
[2024-05-21 04:44:40] [INFO ] Deduced a trap composed of 103 places in 622 ms of which 5 ms to minimize.
[2024-05-21 04:44:41] [INFO ] Deduced a trap composed of 105 places in 512 ms of which 4 ms to minimize.
[2024-05-21 04:44:41] [INFO ] Deduced a trap composed of 98 places in 561 ms of which 4 ms to minimize.
[2024-05-21 04:44:42] [INFO ] Deduced a trap composed of 96 places in 587 ms of which 3 ms to minimize.
[2024-05-21 04:44:43] [INFO ] Deduced a trap composed of 39 places in 554 ms of which 3 ms to minimize.
[2024-05-21 04:44:43] [INFO ] Deduced a trap composed of 91 places in 561 ms of which 4 ms to minimize.
[2024-05-21 04:44:44] [INFO ] Deduced a trap composed of 56 places in 570 ms of which 4 ms to minimize.
[2024-05-21 04:44:44] [INFO ] Deduced a trap composed of 131 places in 571 ms of which 4 ms to minimize.
[2024-05-21 04:44:45] [INFO ] Deduced a trap composed of 106 places in 464 ms of which 4 ms to minimize.
[2024-05-21 04:44:46] [INFO ] Deduced a trap composed of 119 places in 704 ms of which 4 ms to minimize.
[2024-05-21 04:44:46] [INFO ] Deduced a trap composed of 91 places in 549 ms of which 4 ms to minimize.
[2024-05-21 04:44:47] [INFO ] Deduced a trap composed of 95 places in 546 ms of which 4 ms to minimize.
[2024-05-21 04:44:47] [INFO ] Deduced a trap composed of 72 places in 576 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-21 04:44:49] [INFO ] Deduced a trap composed of 91 places in 722 ms of which 4 ms to minimize.
[2024-05-21 04:44:50] [INFO ] Deduced a trap composed of 91 places in 535 ms of which 4 ms to minimize.
[2024-05-21 04:44:50] [INFO ] Deduced a trap composed of 93 places in 561 ms of which 4 ms to minimize.
[2024-05-21 04:44:51] [INFO ] Deduced a trap composed of 55 places in 627 ms of which 4 ms to minimize.
[2024-05-21 04:44:51] [INFO ] Deduced a trap composed of 93 places in 537 ms of which 3 ms to minimize.
[2024-05-21 04:44:52] [INFO ] Deduced a trap composed of 103 places in 549 ms of which 4 ms to minimize.
[2024-05-21 04:44:52] [INFO ] Deduced a trap composed of 45 places in 531 ms of which 4 ms to minimize.
[2024-05-21 04:44:53] [INFO ] Deduced a trap composed of 93 places in 536 ms of which 3 ms to minimize.
[2024-05-21 04:44:54] [INFO ] Deduced a trap composed of 106 places in 581 ms of which 5 ms to minimize.
[2024-05-21 04:44:54] [INFO ] Deduced a trap composed of 101 places in 623 ms of which 4 ms to minimize.
[2024-05-21 04:44:55] [INFO ] Deduced a trap composed of 88 places in 446 ms of which 4 ms to minimize.
[2024-05-21 04:44:55] [INFO ] Deduced a trap composed of 59 places in 533 ms of which 3 ms to minimize.
[2024-05-21 04:44:56] [INFO ] Deduced a trap composed of 66 places in 652 ms of which 4 ms to minimize.
[2024-05-21 04:44:57] [INFO ] Deduced a trap composed of 135 places in 536 ms of which 4 ms to minimize.
[2024-05-21 04:44:58] [INFO ] Deduced a trap composed of 64 places in 538 ms of which 4 ms to minimize.
[2024-05-21 04:44:59] [INFO ] Deduced a trap composed of 51 places in 655 ms of which 6 ms to minimize.
[2024-05-21 04:45:00] [INFO ] Deduced a trap composed of 106 places in 542 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 17/78 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-21 04:45:04] [INFO ] Deduced a trap composed of 64 places in 700 ms of which 4 ms to minimize.
[2024-05-21 04:45:05] [INFO ] Deduced a trap composed of 71 places in 552 ms of which 4 ms to minimize.
[2024-05-21 04:45:05] [INFO ] Deduced a trap composed of 49 places in 573 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-21 04:45:08] [INFO ] Deduced a trap composed of 76 places in 585 ms of which 5 ms to minimize.
[2024-05-21 04:45:09] [INFO ] Deduced a trap composed of 67 places in 640 ms of which 3 ms to minimize.
[2024-05-21 04:45:09] [INFO ] Deduced a trap composed of 65 places in 566 ms of which 4 ms to minimize.
[2024-05-21 04:45:11] [INFO ] Deduced a trap composed of 68 places in 538 ms of which 4 ms to minimize.
[2024-05-21 04:45:11] [INFO ] Deduced a trap composed of 87 places in 534 ms of which 4 ms to minimize.
[2024-05-21 04:45:13] [INFO ] Deduced a trap composed of 86 places in 555 ms of which 4 ms to minimize.
[2024-05-21 04:45:13] [INFO ] Deduced a trap composed of 86 places in 575 ms of which 3 ms to minimize.
[2024-05-21 04:45:14] [INFO ] Deduced a trap composed of 82 places in 550 ms of which 4 ms to minimize.
[2024-05-21 04:45:15] [INFO ] Deduced a trap composed of 83 places in 688 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-21 04:45:18] [INFO ] Deduced a trap composed of 67 places in 716 ms of which 4 ms to minimize.
[2024-05-21 04:45:19] [INFO ] Deduced a trap composed of 105 places in 557 ms of which 3 ms to minimize.
[2024-05-21 04:45:19] [INFO ] Deduced a trap composed of 106 places in 541 ms of which 4 ms to minimize.
[2024-05-21 04:45:20] [INFO ] Deduced a trap composed of 103 places in 563 ms of which 4 ms to minimize.
[2024-05-21 04:45:20] [INFO ] Deduced a trap composed of 64 places in 585 ms of which 4 ms to minimize.
[2024-05-21 04:45:21] [INFO ] Deduced a trap composed of 84 places in 551 ms of which 4 ms to minimize.
[2024-05-21 04:45:21] [INFO ] Deduced a trap composed of 70 places in 550 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 7/97 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-21 04:45:26] [INFO ] Deduced a trap composed of 66 places in 508 ms of which 5 ms to minimize.
[2024-05-21 04:45:27] [INFO ] Deduced a trap composed of 61 places in 563 ms of which 3 ms to minimize.
[2024-05-21 04:45:28] [INFO ] Deduced a trap composed of 60 places in 591 ms of which 6 ms to minimize.
[2024-05-21 04:45:28] [INFO ] Deduced a trap composed of 60 places in 543 ms of which 3 ms to minimize.
[2024-05-21 04:45:29] [INFO ] Deduced a trap composed of 54 places in 470 ms of which 3 ms to minimize.
[2024-05-21 04:45:29] [INFO ] Deduced a trap composed of 65 places in 561 ms of which 3 ms to minimize.
[2024-05-21 04:45:30] [INFO ] Deduced a trap composed of 101 places in 535 ms of which 4 ms to minimize.
[2024-05-21 04:45:30] [INFO ] Deduced a trap composed of 82 places in 563 ms of which 4 ms to minimize.
[2024-05-21 04:45:31] [INFO ] Deduced a trap composed of 85 places in 543 ms of which 3 ms to minimize.
[2024-05-21 04:45:32] [INFO ] Deduced a trap composed of 73 places in 555 ms of which 4 ms to minimize.
[2024-05-21 04:45:33] [INFO ] Deduced a trap composed of 87 places in 549 ms of which 4 ms to minimize.
[2024-05-21 04:45:34] [INFO ] Deduced a trap composed of 88 places in 571 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 12/109 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-21 04:45:35] [INFO ] Deduced a trap composed of 73 places in 449 ms of which 3 ms to minimize.
[2024-05-21 04:45:35] [INFO ] Deduced a trap composed of 58 places in 545 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/2446 variables, and 111 constraints, problems are : Problem set: 0 solved, 106 unsolved in 75010 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/347 constraints, ReadFeed: 0/103 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 90/90 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 264/323 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 23/346 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 90/111 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 1/347 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-21 04:45:45] [INFO ] Deduced a trap composed of 70 places in 556 ms of which 4 ms to minimize.
[2024-05-21 04:45:46] [INFO ] Deduced a trap composed of 55 places in 539 ms of which 4 ms to minimize.
[2024-05-21 04:45:46] [INFO ] Deduced a trap composed of 56 places in 440 ms of which 3 ms to minimize.
[2024-05-21 04:45:47] [INFO ] Deduced a trap composed of 76 places in 630 ms of which 6 ms to minimize.
[2024-05-21 04:45:47] [INFO ] Deduced a trap composed of 52 places in 592 ms of which 3 ms to minimize.
[2024-05-21 04:45:48] [INFO ] Deduced a trap composed of 48 places in 549 ms of which 4 ms to minimize.
[2024-05-21 04:45:49] [INFO ] Deduced a trap composed of 70 places in 549 ms of which 4 ms to minimize.
[2024-05-21 04:45:49] [INFO ] Deduced a trap composed of 103 places in 558 ms of which 4 ms to minimize.
[2024-05-21 04:45:50] [INFO ] Deduced a trap composed of 63 places in 685 ms of which 5 ms to minimize.
[2024-05-21 04:45:52] [INFO ] Deduced a trap composed of 86 places in 448 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 10/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-21 04:45:59] [INFO ] Deduced a trap composed of 150 places in 444 ms of which 3 ms to minimize.
[2024-05-21 04:46:00] [INFO ] Deduced a trap composed of 107 places in 605 ms of which 5 ms to minimize.
[2024-05-21 04:46:01] [INFO ] Deduced a trap composed of 80 places in 727 ms of which 5 ms to minimize.
[2024-05-21 04:46:01] [INFO ] Deduced a trap composed of 82 places in 554 ms of which 4 ms to minimize.
[2024-05-21 04:46:02] [INFO ] Deduced a trap composed of 59 places in 566 ms of which 3 ms to minimize.
[2024-05-21 04:46:04] [INFO ] Deduced a trap composed of 111 places in 451 ms of which 4 ms to minimize.
[2024-05-21 04:46:05] [INFO ] Deduced a trap composed of 111 places in 555 ms of which 4 ms to minimize.
[2024-05-21 04:46:06] [INFO ] Deduced a trap composed of 128 places in 523 ms of which 4 ms to minimize.
[2024-05-21 04:46:06] [INFO ] Deduced a trap composed of 134 places in 568 ms of which 4 ms to minimize.
[2024-05-21 04:46:07] [INFO ] Deduced a trap composed of 126 places in 556 ms of which 4 ms to minimize.
[2024-05-21 04:46:07] [INFO ] Deduced a trap composed of 99 places in 590 ms of which 4 ms to minimize.
[2024-05-21 04:46:08] [INFO ] Deduced a trap composed of 122 places in 554 ms of which 3 ms to minimize.
[2024-05-21 04:46:09] [INFO ] Deduced a trap composed of 98 places in 551 ms of which 4 ms to minimize.
[2024-05-21 04:46:09] [INFO ] Deduced a trap composed of 122 places in 558 ms of which 3 ms to minimize.
[2024-05-21 04:46:10] [INFO ] Deduced a trap composed of 88 places in 487 ms of which 4 ms to minimize.
[2024-05-21 04:46:10] [INFO ] Deduced a trap composed of 97 places in 538 ms of which 4 ms to minimize.
[2024-05-21 04:46:11] [INFO ] Deduced a trap composed of 120 places in 554 ms of which 4 ms to minimize.
[2024-05-21 04:46:11] [INFO ] Deduced a trap composed of 130 places in 559 ms of which 3 ms to minimize.
[2024-05-21 04:46:12] [INFO ] Deduced a trap composed of 104 places in 601 ms of which 5 ms to minimize.
[2024-05-21 04:46:13] [INFO ] Deduced a trap composed of 114 places in 640 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-21 04:46:19] [INFO ] Deduced a trap composed of 86 places in 442 ms of which 4 ms to minimize.
[2024-05-21 04:46:19] [INFO ] Deduced a trap composed of 149 places in 553 ms of which 4 ms to minimize.
[2024-05-21 04:46:20] [INFO ] Deduced a trap composed of 143 places in 587 ms of which 5 ms to minimize.
[2024-05-21 04:46:21] [INFO ] Deduced a trap composed of 126 places in 663 ms of which 4 ms to minimize.
[2024-05-21 04:46:21] [INFO ] Deduced a trap composed of 69 places in 580 ms of which 3 ms to minimize.
[2024-05-21 04:46:22] [INFO ] Deduced a trap composed of 65 places in 480 ms of which 4 ms to minimize.
[2024-05-21 04:46:23] [INFO ] Deduced a trap composed of 108 places in 632 ms of which 5 ms to minimize.
[2024-05-21 04:46:24] [INFO ] Deduced a trap composed of 79 places in 709 ms of which 5 ms to minimize.
[2024-05-21 04:46:25] [INFO ] Deduced a trap composed of 111 places in 816 ms of which 5 ms to minimize.
[2024-05-21 04:46:26] [INFO ] Deduced a trap composed of 63 places in 798 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 10/152 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-21 04:46:30] [INFO ] Deduced a trap composed of 95 places in 652 ms of which 6 ms to minimize.
[2024-05-21 04:46:31] [INFO ] Deduced a trap composed of 109 places in 658 ms of which 4 ms to minimize.
[2024-05-21 04:46:31] [INFO ] Deduced a trap composed of 52 places in 737 ms of which 5 ms to minimize.
[2024-05-21 04:46:32] [INFO ] Deduced a trap composed of 85 places in 808 ms of which 6 ms to minimize.
[2024-05-21 04:46:33] [INFO ] Deduced a trap composed of 86 places in 831 ms of which 7 ms to minimize.
[2024-05-21 04:46:34] [INFO ] Deduced a trap composed of 74 places in 792 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-21 04:46:44] [INFO ] Deduced a trap composed of 84 places in 728 ms of which 5 ms to minimize.
[2024-05-21 04:46:44] [INFO ] Deduced a trap composed of 49 places in 791 ms of which 6 ms to minimize.
[2024-05-21 04:46:50] [INFO ] Deduced a trap composed of 64 places in 795 ms of which 6 ms to minimize.
[2024-05-21 04:46:50] [INFO ] Deduced a trap composed of 95 places in 779 ms of which 5 ms to minimize.
[2024-05-21 04:46:51] [INFO ] Deduced a trap composed of 96 places in 698 ms of which 5 ms to minimize.
SMT process timed out in 150949ms, After SMT, problems are : Problem set: 0 solved, 106 unsolved
Fused 106 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 59 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 2099/2099 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 302 transition count 1478
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 302 transition count 1478
Applied a total of 90 rules in 77 ms. Remains 302 /347 variables (removed 45) and now considering 1478/2099 (removed 621) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 302/347 places, 1478/2099 transitions.
RANDOM walk for 4000000 steps (8 resets) in 47081 ms. (84 steps per ms) remains 104/106 properties
BEST_FIRST walk for 40003 steps (8 resets) in 132 ms. (300 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40001 steps (8 resets) in 163 ms. (243 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 324 ms. (123 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 292 ms. (136 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 346 ms. (115 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 430 ms. (92 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (8 resets) in 417 ms. (95 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 399 ms. (100 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 520 ms. (76 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 471 ms. (84 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (8 resets) in 459 ms. (86 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 406 ms. (98 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 481 ms. (82 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 410 ms. (97 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (8 resets) in 390 ms. (102 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (8 resets) in 329 ms. (121 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (8 resets) in 424 ms. (94 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 230 ms. (173 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (8 resets) in 319 ms. (125 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 259 ms. (153 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 280 ms. (142 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 351 ms. (113 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40001 steps (8 resets) in 438 ms. (91 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40001 steps (8 resets) in 334 ms. (119 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (8 resets) in 509 ms. (78 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (8 resets) in 493 ms. (80 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40001 steps (8 resets) in 370 ms. (107 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 452 ms. (88 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 425 ms. (93 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (8 resets) in 369 ms. (108 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 358 ms. (111 steps per ms) remains 102/104 properties
BEST_FIRST walk for 40002 steps (8 resets) in 324 ms. (123 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 331 ms. (120 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 465 ms. (85 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 431 ms. (92 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 369 ms. (108 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 335 ms. (119 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 363 ms. (109 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 396 ms. (100 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 362 ms. (110 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 395 ms. (101 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 372 ms. (107 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 281 ms. (141 steps per ms) remains 101/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 288 ms. (138 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40002 steps (8 resets) in 269 ms. (148 steps per ms) remains 100/101 properties
BEST_FIRST walk for 40004 steps (8 resets) in 338 ms. (118 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40002 steps (8 resets) in 438 ms. (91 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 362 ms. (110 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40002 steps (8 resets) in 340 ms. (117 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40002 steps (8 resets) in 441 ms. (90 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40001 steps (8 resets) in 389 ms. (102 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 427 ms. (93 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40002 steps (8 resets) in 352 ms. (113 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 316 ms. (126 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40003 steps (8 resets) in 322 ms. (123 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40003 steps (8 resets) in 268 ms. (148 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40003 steps (8 resets) in 302 ms. (132 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40002 steps (8 resets) in 511 ms. (78 steps per ms) remains 98/100 properties
BEST_FIRST walk for 40001 steps (8 resets) in 434 ms. (91 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 437 ms. (91 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 514 ms. (77 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40002 steps (8 resets) in 430 ms. (92 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40002 steps (8 resets) in 362 ms. (110 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40002 steps (8 resets) in 368 ms. (108 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40002 steps (8 resets) in 385 ms. (103 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 400 ms. (99 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40002 steps (8 resets) in 478 ms. (83 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40002 steps (8 resets) in 372 ms. (107 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 249 ms. (160 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40001 steps (8 resets) in 301 ms. (132 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40002 steps (8 resets) in 304 ms. (131 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40002 steps (8 resets) in 432 ms. (92 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40002 steps (8 resets) in 476 ms. (83 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 485 ms. (82 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 489 ms. (81 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40002 steps (8 resets) in 430 ms. (92 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 97/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 97/97 properties
BEST_FIRST walk for 40004 steps (8 resets) in 416 ms. (95 steps per ms) remains 97/97 properties
BEST_FIRST walk for 40003 steps (8 resets) in 455 ms. (87 steps per ms) remains 97/97 properties
BEST_FIRST walk for 40003 steps (8 resets) in 436 ms. (91 steps per ms) remains 97/97 properties
BEST_FIRST walk for 40001 steps (8 resets) in 403 ms. (99 steps per ms) remains 97/97 properties
BEST_FIRST walk for 40002 steps (8 resets) in 380 ms. (104 steps per ms) remains 97/97 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 95/97 properties
BEST_FIRST walk for 40002 steps (8 resets) in 385 ms. (103 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 384 ms. (103 steps per ms) remains 90/95 properties
// Phase 1: matrix 1478 rows 302 cols
[2024-05-21 04:47:19] [INFO ] Computed 22 invariants in 12 ms
[2024-05-21 04:47:19] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 223/277 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 24/301 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-21 04:47:23] [INFO ] Deduced a trap composed of 77 places in 620 ms of which 6 ms to minimize.
[2024-05-21 04:47:24] [INFO ] Deduced a trap composed of 87 places in 598 ms of which 5 ms to minimize.
[2024-05-21 04:47:24] [INFO ] Deduced a trap composed of 88 places in 565 ms of which 5 ms to minimize.
[2024-05-21 04:47:25] [INFO ] Deduced a trap composed of 101 places in 541 ms of which 5 ms to minimize.
[2024-05-21 04:47:25] [INFO ] Deduced a trap composed of 119 places in 614 ms of which 5 ms to minimize.
[2024-05-21 04:47:26] [INFO ] Deduced a trap composed of 54 places in 528 ms of which 5 ms to minimize.
[2024-05-21 04:47:27] [INFO ] Deduced a trap composed of 93 places in 593 ms of which 5 ms to minimize.
[2024-05-21 04:47:27] [INFO ] Deduced a trap composed of 111 places in 585 ms of which 5 ms to minimize.
[2024-05-21 04:47:28] [INFO ] Deduced a trap composed of 115 places in 586 ms of which 4 ms to minimize.
[2024-05-21 04:47:28] [INFO ] Deduced a trap composed of 102 places in 570 ms of which 4 ms to minimize.
[2024-05-21 04:47:29] [INFO ] Deduced a trap composed of 76 places in 592 ms of which 5 ms to minimize.
[2024-05-21 04:47:30] [INFO ] Deduced a trap composed of 98 places in 587 ms of which 5 ms to minimize.
[2024-05-21 04:47:30] [INFO ] Deduced a trap composed of 50 places in 589 ms of which 5 ms to minimize.
[2024-05-21 04:47:31] [INFO ] Deduced a trap composed of 77 places in 626 ms of which 5 ms to minimize.
[2024-05-21 04:47:31] [INFO ] Deduced a trap composed of 57 places in 604 ms of which 5 ms to minimize.
[2024-05-21 04:47:32] [INFO ] Deduced a trap composed of 105 places in 611 ms of which 5 ms to minimize.
[2024-05-21 04:47:33] [INFO ] Deduced a trap composed of 109 places in 583 ms of which 6 ms to minimize.
[2024-05-21 04:47:33] [INFO ] Deduced a trap composed of 76 places in 598 ms of which 5 ms to minimize.
[2024-05-21 04:47:34] [INFO ] Deduced a trap composed of 78 places in 539 ms of which 5 ms to minimize.
[2024-05-21 04:47:35] [INFO ] Deduced a trap composed of 86 places in 649 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-21 04:47:36] [INFO ] Deduced a trap composed of 61 places in 623 ms of which 5 ms to minimize.
[2024-05-21 04:47:37] [INFO ] Deduced a trap composed of 82 places in 647 ms of which 5 ms to minimize.
[2024-05-21 04:47:37] [INFO ] Deduced a trap composed of 81 places in 607 ms of which 5 ms to minimize.
[2024-05-21 04:47:38] [INFO ] Deduced a trap composed of 74 places in 578 ms of which 5 ms to minimize.
[2024-05-21 04:47:38] [INFO ] Deduced a trap composed of 64 places in 580 ms of which 5 ms to minimize.
[2024-05-21 04:47:39] [INFO ] Deduced a trap composed of 51 places in 545 ms of which 4 ms to minimize.
[2024-05-21 04:47:40] [INFO ] Deduced a trap composed of 60 places in 620 ms of which 5 ms to minimize.
[2024-05-21 04:47:40] [INFO ] Deduced a trap composed of 60 places in 577 ms of which 5 ms to minimize.
[2024-05-21 04:47:41] [INFO ] Deduced a trap composed of 45 places in 574 ms of which 4 ms to minimize.
[2024-05-21 04:47:41] [INFO ] Deduced a trap composed of 93 places in 623 ms of which 5 ms to minimize.
[2024-05-21 04:47:42] [INFO ] Deduced a trap composed of 78 places in 595 ms of which 5 ms to minimize.
[2024-05-21 04:47:43] [INFO ] Deduced a trap composed of 74 places in 576 ms of which 5 ms to minimize.
[2024-05-21 04:47:43] [INFO ] Deduced a trap composed of 76 places in 601 ms of which 5 ms to minimize.
[2024-05-21 04:47:44] [INFO ] Deduced a trap composed of 58 places in 551 ms of which 5 ms to minimize.
[2024-05-21 04:47:44] [INFO ] Deduced a trap composed of 68 places in 586 ms of which 4 ms to minimize.
[2024-05-21 04:47:45] [INFO ] Deduced a trap composed of 98 places in 576 ms of which 5 ms to minimize.
[2024-05-21 04:47:46] [INFO ] Deduced a trap composed of 122 places in 615 ms of which 5 ms to minimize.
[2024-05-21 04:47:46] [INFO ] Deduced a trap composed of 65 places in 598 ms of which 6 ms to minimize.
[2024-05-21 04:47:47] [INFO ] Deduced a trap composed of 72 places in 579 ms of which 4 ms to minimize.
[2024-05-21 04:47:47] [INFO ] Deduced a trap composed of 77 places in 632 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-21 04:47:49] [INFO ] Deduced a trap composed of 111 places in 518 ms of which 5 ms to minimize.
[2024-05-21 04:47:49] [INFO ] Deduced a trap composed of 105 places in 640 ms of which 5 ms to minimize.
[2024-05-21 04:47:50] [INFO ] Deduced a trap composed of 112 places in 619 ms of which 5 ms to minimize.
[2024-05-21 04:47:51] [INFO ] Deduced a trap composed of 64 places in 599 ms of which 5 ms to minimize.
[2024-05-21 04:47:51] [INFO ] Deduced a trap composed of 68 places in 616 ms of which 5 ms to minimize.
[2024-05-21 04:47:52] [INFO ] Deduced a trap composed of 74 places in 588 ms of which 5 ms to minimize.
[2024-05-21 04:47:53] [INFO ] Deduced a trap composed of 75 places in 618 ms of which 5 ms to minimize.
[2024-05-21 04:47:53] [INFO ] Deduced a trap composed of 117 places in 641 ms of which 5 ms to minimize.
[2024-05-21 04:47:54] [INFO ] Deduced a trap composed of 99 places in 631 ms of which 5 ms to minimize.
[2024-05-21 04:47:55] [INFO ] Deduced a trap composed of 81 places in 626 ms of which 5 ms to minimize.
[2024-05-21 04:47:55] [INFO ] Deduced a trap composed of 97 places in 610 ms of which 5 ms to minimize.
[2024-05-21 04:47:56] [INFO ] Deduced a trap composed of 95 places in 598 ms of which 5 ms to minimize.
[2024-05-21 04:47:57] [INFO ] Deduced a trap composed of 105 places in 634 ms of which 5 ms to minimize.
[2024-05-21 04:47:57] [INFO ] Deduced a trap composed of 88 places in 614 ms of which 6 ms to minimize.
[2024-05-21 04:47:58] [INFO ] Deduced a trap composed of 102 places in 625 ms of which 5 ms to minimize.
[2024-05-21 04:47:59] [INFO ] Deduced a trap composed of 118 places in 610 ms of which 6 ms to minimize.
[2024-05-21 04:47:59] [INFO ] Deduced a trap composed of 116 places in 593 ms of which 5 ms to minimize.
[2024-05-21 04:48:00] [INFO ] Deduced a trap composed of 75 places in 554 ms of which 5 ms to minimize.
[2024-05-21 04:48:00] [INFO ] Deduced a trap composed of 119 places in 635 ms of which 8 ms to minimize.
[2024-05-21 04:48:01] [INFO ] Deduced a trap composed of 98 places in 617 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-21 04:48:04] [INFO ] Deduced a trap composed of 54 places in 597 ms of which 5 ms to minimize.
[2024-05-21 04:48:05] [INFO ] Deduced a trap composed of 90 places in 608 ms of which 4 ms to minimize.
[2024-05-21 04:48:06] [INFO ] Deduced a trap composed of 81 places in 607 ms of which 5 ms to minimize.
[2024-05-21 04:48:06] [INFO ] Deduced a trap composed of 82 places in 611 ms of which 5 ms to minimize.
[2024-05-21 04:48:07] [INFO ] Deduced a trap composed of 112 places in 614 ms of which 5 ms to minimize.
[2024-05-21 04:48:08] [INFO ] Deduced a trap composed of 76 places in 611 ms of which 5 ms to minimize.
[2024-05-21 04:48:08] [INFO ] Deduced a trap composed of 61 places in 600 ms of which 5 ms to minimize.
[2024-05-21 04:48:09] [INFO ] Deduced a trap composed of 111 places in 543 ms of which 5 ms to minimize.
[2024-05-21 04:48:09] [INFO ] Deduced a trap composed of 122 places in 635 ms of which 5 ms to minimize.
[2024-05-21 04:48:10] [INFO ] Deduced a trap composed of 109 places in 630 ms of which 5 ms to minimize.
[2024-05-21 04:48:11] [INFO ] Deduced a trap composed of 117 places in 601 ms of which 5 ms to minimize.
[2024-05-21 04:48:11] [INFO ] Deduced a trap composed of 92 places in 627 ms of which 5 ms to minimize.
[2024-05-21 04:48:12] [INFO ] Deduced a trap composed of 133 places in 627 ms of which 5 ms to minimize.
[2024-05-21 04:48:13] [INFO ] Deduced a trap composed of 105 places in 622 ms of which 5 ms to minimize.
[2024-05-21 04:48:13] [INFO ] Deduced a trap composed of 118 places in 627 ms of which 5 ms to minimize.
[2024-05-21 04:48:14] [INFO ] Deduced a trap composed of 98 places in 620 ms of which 5 ms to minimize.
[2024-05-21 04:48:15] [INFO ] Deduced a trap composed of 69 places in 622 ms of which 5 ms to minimize.
[2024-05-21 04:48:16] [INFO ] Deduced a trap composed of 83 places in 622 ms of which 5 ms to minimize.
[2024-05-21 04:48:16] [INFO ] Deduced a trap composed of 69 places in 633 ms of which 5 ms to minimize.
[2024-05-21 04:48:17] [INFO ] Deduced a trap composed of 116 places in 615 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-21 04:48:19] [INFO ] Deduced a trap composed of 113 places in 535 ms of which 5 ms to minimize.
[2024-05-21 04:48:20] [INFO ] Deduced a trap composed of 80 places in 367 ms of which 3 ms to minimize.
[2024-05-21 04:48:20] [INFO ] Deduced a trap composed of 95 places in 378 ms of which 3 ms to minimize.
[2024-05-21 04:48:21] [INFO ] Deduced a trap composed of 108 places in 449 ms of which 5 ms to minimize.
[2024-05-21 04:48:21] [INFO ] Deduced a trap composed of 63 places in 622 ms of which 5 ms to minimize.
[2024-05-21 04:48:22] [INFO ] Deduced a trap composed of 71 places in 539 ms of which 4 ms to minimize.
[2024-05-21 04:48:22] [INFO ] Deduced a trap composed of 80 places in 638 ms of which 5 ms to minimize.
[2024-05-21 04:48:23] [INFO ] Deduced a trap composed of 82 places in 619 ms of which 5 ms to minimize.
[2024-05-21 04:48:24] [INFO ] Deduced a trap composed of 69 places in 616 ms of which 5 ms to minimize.
[2024-05-21 04:48:25] [INFO ] Deduced a trap composed of 119 places in 608 ms of which 5 ms to minimize.
[2024-05-21 04:48:25] [INFO ] Deduced a trap composed of 106 places in 650 ms of which 5 ms to minimize.
[2024-05-21 04:48:26] [INFO ] Deduced a trap composed of 77 places in 589 ms of which 5 ms to minimize.
[2024-05-21 04:48:27] [INFO ] Deduced a trap composed of 47 places in 546 ms of which 5 ms to minimize.
[2024-05-21 04:48:28] [INFO ] Deduced a trap composed of 106 places in 579 ms of which 4 ms to minimize.
[2024-05-21 04:48:28] [INFO ] Deduced a trap composed of 85 places in 621 ms of which 5 ms to minimize.
[2024-05-21 04:48:29] [INFO ] Deduced a trap composed of 70 places in 550 ms of which 4 ms to minimize.
[2024-05-21 04:48:30] [INFO ] Deduced a trap composed of 103 places in 586 ms of which 5 ms to minimize.
[2024-05-21 04:48:30] [INFO ] Deduced a trap composed of 81 places in 629 ms of which 5 ms to minimize.
[2024-05-21 04:48:31] [INFO ] Deduced a trap composed of 82 places in 571 ms of which 5 ms to minimize.
[2024-05-21 04:48:31] [INFO ] Deduced a trap composed of 90 places in 617 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-21 04:48:36] [INFO ] Deduced a trap composed of 116 places in 623 ms of which 5 ms to minimize.
[2024-05-21 04:48:36] [INFO ] Deduced a trap composed of 44 places in 596 ms of which 5 ms to minimize.
[2024-05-21 04:48:37] [INFO ] Deduced a trap composed of 66 places in 501 ms of which 4 ms to minimize.
[2024-05-21 04:48:37] [INFO ] Deduced a trap composed of 75 places in 613 ms of which 5 ms to minimize.
[2024-05-21 04:48:38] [INFO ] Deduced a trap composed of 81 places in 626 ms of which 5 ms to minimize.
[2024-05-21 04:48:39] [INFO ] Deduced a trap composed of 95 places in 578 ms of which 5 ms to minimize.
[2024-05-21 04:48:39] [INFO ] Deduced a trap composed of 46 places in 623 ms of which 5 ms to minimize.
[2024-05-21 04:48:40] [INFO ] Deduced a trap composed of 62 places in 637 ms of which 5 ms to minimize.
[2024-05-21 04:48:41] [INFO ] Deduced a trap composed of 66 places in 620 ms of which 5 ms to minimize.
[2024-05-21 04:48:42] [INFO ] Deduced a trap composed of 46 places in 639 ms of which 5 ms to minimize.
[2024-05-21 04:48:43] [INFO ] Deduced a trap composed of 39 places in 635 ms of which 5 ms to minimize.
[2024-05-21 04:48:44] [INFO ] Deduced a trap composed of 54 places in 607 ms of which 5 ms to minimize.
[2024-05-21 04:48:45] [INFO ] Deduced a trap composed of 59 places in 570 ms of which 5 ms to minimize.
[2024-05-21 04:48:45] [INFO ] Deduced a trap composed of 46 places in 611 ms of which 5 ms to minimize.
[2024-05-21 04:48:46] [INFO ] Deduced a trap composed of 70 places in 551 ms of which 6 ms to minimize.
[2024-05-21 04:48:47] [INFO ] Deduced a trap composed of 79 places in 610 ms of which 5 ms to minimize.
[2024-05-21 04:48:47] [INFO ] Deduced a trap composed of 73 places in 618 ms of which 5 ms to minimize.
[2024-05-21 04:48:48] [INFO ] Deduced a trap composed of 93 places in 596 ms of which 5 ms to minimize.
[2024-05-21 04:48:49] [INFO ] Deduced a trap composed of 86 places in 631 ms of which 5 ms to minimize.
[2024-05-21 04:48:50] [INFO ] Deduced a trap composed of 63 places in 450 ms of which 3 ms to minimize.
SMT process timed out in 90583ms, After SMT, problems are : Problem set: 0 solved, 90 unsolved
Fused 90 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 54 out of 302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 1478/1478 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 299 transition count 1421
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 299 transition count 1421
Applied a total of 6 rules in 39 ms. Remains 299 /302 variables (removed 3) and now considering 1421/1478 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 299/302 places, 1421/1478 transitions.
RANDOM walk for 4000000 steps (8 resets) in 64365 ms. (62 steps per ms) remains 90/90 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2394 ms. (167 steps per ms) remains 90/90 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3063 ms. (130 steps per ms) remains 90/90 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2552 ms. (156 steps per ms) remains 90/90 properties
BEST_FIRST walk for 400001 steps (8 resets) in 2470 ms. (161 steps per ms) remains 90/90 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2478 ms. (161 steps per ms) remains 90/90 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2793 ms. (143 steps per ms) remains 77/90 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2162 ms. (184 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2398 ms. (166 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2086 ms. (191 steps per ms) remains 73/77 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2353 ms. (169 steps per ms) remains 71/73 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2201 ms. (181 steps per ms) remains 70/71 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1739 ms. (229 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2299 ms. (173 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2091 ms. (191 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2172 ms. (184 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1905 ms. (209 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1934 ms. (206 steps per ms) remains 68/70 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2302 ms. (173 steps per ms) remains 67/68 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2385 ms. (167 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2238 ms. (178 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2285 ms. (174 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2348 ms. (170 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1926 ms. (207 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2082 ms. (192 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1791 ms. (223 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2111 ms. (189 steps per ms) remains 66/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2475 ms. (161 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1789 ms. (223 steps per ms) remains 65/66 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2174 ms. (183 steps per ms) remains 64/65 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2273 ms. (175 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400001 steps (8 resets) in 2043 ms. (195 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2038 ms. (196 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2132 ms. (187 steps per ms) remains 62/64 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1982 ms. (201 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2036 ms. (196 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2403 ms. (166 steps per ms) remains 58/62 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2396 ms. (166 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2126 ms. (188 steps per ms) remains 55/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2090 ms. (191 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400000 steps (8 resets) in 2231 ms. (179 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2381 ms. (167 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2203 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1932 ms. (206 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2329 ms. (171 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2321 ms. (172 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1868 ms. (214 steps per ms) remains 49/55 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1874 ms. (213 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2033 ms. (196 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2260 ms. (176 steps per ms) remains 47/49 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2688 ms. (148 steps per ms) remains 43/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2235 ms. (178 steps per ms) remains 41/43 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1923 ms. (207 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2074 ms. (192 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2004 ms. (199 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2315 ms. (172 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2425 ms. (164 steps per ms) remains 40/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2005 ms. (199 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2094 ms. (190 steps per ms) remains 40/40 properties
// Phase 1: matrix 1421 rows 299 cols
[2024-05-21 04:49:59] [INFO ] Computed 22 invariants in 8 ms
[2024-05-21 04:49:59] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 239/272 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 26/298 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-21 04:50:00] [INFO ] Deduced a trap composed of 93 places in 397 ms of which 4 ms to minimize.
[2024-05-21 04:50:00] [INFO ] Deduced a trap composed of 71 places in 391 ms of which 4 ms to minimize.
[2024-05-21 04:50:01] [INFO ] Deduced a trap composed of 53 places in 315 ms of which 4 ms to minimize.
[2024-05-21 04:50:01] [INFO ] Deduced a trap composed of 73 places in 396 ms of which 3 ms to minimize.
[2024-05-21 04:50:02] [INFO ] Deduced a trap composed of 48 places in 391 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 1/299 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-21 04:50:03] [INFO ] Deduced a trap composed of 105 places in 411 ms of which 3 ms to minimize.
[2024-05-21 04:50:04] [INFO ] Deduced a trap composed of 88 places in 395 ms of which 3 ms to minimize.
[2024-05-21 04:50:04] [INFO ] Deduced a trap composed of 107 places in 365 ms of which 3 ms to minimize.
[2024-05-21 04:50:04] [INFO ] Deduced a trap composed of 50 places in 404 ms of which 4 ms to minimize.
[2024-05-21 04:50:05] [INFO ] Deduced a trap composed of 69 places in 410 ms of which 3 ms to minimize.
[2024-05-21 04:50:05] [INFO ] Deduced a trap composed of 71 places in 394 ms of which 3 ms to minimize.
[2024-05-21 04:50:06] [INFO ] Deduced a trap composed of 69 places in 377 ms of which 3 ms to minimize.
[2024-05-21 04:50:06] [INFO ] Deduced a trap composed of 59 places in 396 ms of which 3 ms to minimize.
[2024-05-21 04:50:07] [INFO ] Deduced a trap composed of 69 places in 419 ms of which 3 ms to minimize.
[2024-05-21 04:50:07] [INFO ] Deduced a trap composed of 91 places in 416 ms of which 3 ms to minimize.
[2024-05-21 04:50:07] [INFO ] Deduced a trap composed of 85 places in 404 ms of which 3 ms to minimize.
[2024-05-21 04:50:08] [INFO ] Deduced a trap composed of 83 places in 398 ms of which 4 ms to minimize.
[2024-05-21 04:50:08] [INFO ] Deduced a trap composed of 77 places in 410 ms of which 3 ms to minimize.
[2024-05-21 04:50:09] [INFO ] Deduced a trap composed of 96 places in 443 ms of which 6 ms to minimize.
[2024-05-21 04:50:09] [INFO ] Deduced a trap composed of 66 places in 463 ms of which 4 ms to minimize.
[2024-05-21 04:50:10] [INFO ] Deduced a trap composed of 90 places in 400 ms of which 3 ms to minimize.
[2024-05-21 04:50:10] [INFO ] Deduced a trap composed of 65 places in 401 ms of which 3 ms to minimize.
[2024-05-21 04:50:10] [INFO ] Deduced a trap composed of 59 places in 406 ms of which 5 ms to minimize.
[2024-05-21 04:50:11] [INFO ] Deduced a trap composed of 119 places in 525 ms of which 3 ms to minimize.
[2024-05-21 04:50:11] [INFO ] Deduced a trap composed of 97 places in 414 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-21 04:50:12] [INFO ] Deduced a trap composed of 97 places in 377 ms of which 4 ms to minimize.
[2024-05-21 04:50:12] [INFO ] Deduced a trap composed of 64 places in 395 ms of which 3 ms to minimize.
[2024-05-21 04:50:13] [INFO ] Deduced a trap composed of 77 places in 392 ms of which 3 ms to minimize.
[2024-05-21 04:50:13] [INFO ] Deduced a trap composed of 107 places in 404 ms of which 3 ms to minimize.
[2024-05-21 04:50:14] [INFO ] Deduced a trap composed of 51 places in 387 ms of which 3 ms to minimize.
[2024-05-21 04:50:14] [INFO ] Deduced a trap composed of 71 places in 312 ms of which 3 ms to minimize.
[2024-05-21 04:50:15] [INFO ] Deduced a trap composed of 75 places in 402 ms of which 3 ms to minimize.
[2024-05-21 04:50:15] [INFO ] Deduced a trap composed of 81 places in 400 ms of which 3 ms to minimize.
[2024-05-21 04:50:15] [INFO ] Deduced a trap composed of 82 places in 354 ms of which 3 ms to minimize.
[2024-05-21 04:50:16] [INFO ] Deduced a trap composed of 100 places in 408 ms of which 3 ms to minimize.
[2024-05-21 04:50:16] [INFO ] Deduced a trap composed of 105 places in 394 ms of which 3 ms to minimize.
[2024-05-21 04:50:17] [INFO ] Deduced a trap composed of 111 places in 400 ms of which 3 ms to minimize.
[2024-05-21 04:50:17] [INFO ] Deduced a trap composed of 97 places in 409 ms of which 3 ms to minimize.
[2024-05-21 04:50:17] [INFO ] Deduced a trap composed of 83 places in 352 ms of which 3 ms to minimize.
[2024-05-21 04:50:18] [INFO ] Deduced a trap composed of 56 places in 329 ms of which 3 ms to minimize.
[2024-05-21 04:50:18] [INFO ] Deduced a trap composed of 64 places in 411 ms of which 4 ms to minimize.
[2024-05-21 04:50:19] [INFO ] Deduced a trap composed of 104 places in 410 ms of which 3 ms to minimize.
[2024-05-21 04:50:19] [INFO ] Deduced a trap composed of 97 places in 412 ms of which 3 ms to minimize.
[2024-05-21 04:50:19] [INFO ] Deduced a trap composed of 62 places in 404 ms of which 4 ms to minimize.
[2024-05-21 04:50:20] [INFO ] Deduced a trap composed of 71 places in 422 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-21 04:50:21] [INFO ] Deduced a trap composed of 69 places in 478 ms of which 3 ms to minimize.
[2024-05-21 04:50:22] [INFO ] Deduced a trap composed of 69 places in 396 ms of which 3 ms to minimize.
[2024-05-21 04:50:22] [INFO ] Deduced a trap composed of 105 places in 406 ms of which 4 ms to minimize.
[2024-05-21 04:50:23] [INFO ] Deduced a trap composed of 61 places in 443 ms of which 4 ms to minimize.
[2024-05-21 04:50:23] [INFO ] Deduced a trap composed of 115 places in 479 ms of which 3 ms to minimize.
[2024-05-21 04:50:24] [INFO ] Deduced a trap composed of 74 places in 403 ms of which 4 ms to minimize.
[2024-05-21 04:50:24] [INFO ] Deduced a trap composed of 59 places in 430 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-21 04:50:26] [INFO ] Deduced a trap composed of 69 places in 407 ms of which 3 ms to minimize.
[2024-05-21 04:50:26] [INFO ] Deduced a trap composed of 57 places in 473 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-21 04:50:28] [INFO ] Deduced a trap composed of 79 places in 390 ms of which 3 ms to minimize.
[2024-05-21 04:50:28] [INFO ] Deduced a trap composed of 56 places in 413 ms of which 3 ms to minimize.
[2024-05-21 04:50:29] [INFO ] Deduced a trap composed of 64 places in 400 ms of which 3 ms to minimize.
[2024-05-21 04:50:29] [INFO ] Deduced a trap composed of 65 places in 436 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-21 04:50:31] [INFO ] Deduced a trap composed of 89 places in 394 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-21 04:50:33] [INFO ] Deduced a trap composed of 45 places in 424 ms of which 3 ms to minimize.
[2024-05-21 04:50:34] [INFO ] Deduced a trap composed of 106 places in 410 ms of which 4 ms to minimize.
[2024-05-21 04:50:34] [INFO ] Deduced a trap composed of 82 places in 383 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/299 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/299 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 15 (OVERLAPS) 1421/1720 variables, 299/383 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1720 variables, 90/473 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1720 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 18 (OVERLAPS) 0/1720 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1720/1720 variables, and 473 constraints, problems are : Problem set: 0 solved, 40 unsolved in 53468 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 299/299 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 239/272 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 26/298 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 50/71 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-21 04:50:54] [INFO ] Deduced a trap composed of 90 places in 622 ms of which 5 ms to minimize.
[2024-05-21 04:50:54] [INFO ] Deduced a trap composed of 81 places in 610 ms of which 4 ms to minimize.
[2024-05-21 04:50:55] [INFO ] Deduced a trap composed of 100 places in 503 ms of which 5 ms to minimize.
[2024-05-21 04:50:56] [INFO ] Deduced a trap composed of 99 places in 591 ms of which 5 ms to minimize.
[2024-05-21 04:50:56] [INFO ] Deduced a trap composed of 128 places in 623 ms of which 4 ms to minimize.
[2024-05-21 04:50:57] [INFO ] Deduced a trap composed of 122 places in 595 ms of which 5 ms to minimize.
[2024-05-21 04:50:57] [INFO ] Deduced a trap composed of 83 places in 602 ms of which 5 ms to minimize.
[2024-05-21 04:50:58] [INFO ] Deduced a trap composed of 90 places in 599 ms of which 5 ms to minimize.
[2024-05-21 04:50:59] [INFO ] Deduced a trap composed of 94 places in 577 ms of which 5 ms to minimize.
[2024-05-21 04:50:59] [INFO ] Deduced a trap composed of 129 places in 581 ms of which 5 ms to minimize.
[2024-05-21 04:51:00] [INFO ] Deduced a trap composed of 103 places in 586 ms of which 5 ms to minimize.
[2024-05-21 04:51:01] [INFO ] Deduced a trap composed of 79 places in 573 ms of which 4 ms to minimize.
[2024-05-21 04:51:01] [INFO ] Deduced a trap composed of 93 places in 568 ms of which 5 ms to minimize.
[2024-05-21 04:51:02] [INFO ] Deduced a trap composed of 86 places in 598 ms of which 5 ms to minimize.
[2024-05-21 04:51:02] [INFO ] Deduced a trap composed of 120 places in 592 ms of which 5 ms to minimize.
[2024-05-21 04:51:03] [INFO ] Deduced a trap composed of 112 places in 564 ms of which 5 ms to minimize.
[2024-05-21 04:51:04] [INFO ] Deduced a trap composed of 74 places in 620 ms of which 5 ms to minimize.
[2024-05-21 04:51:04] [INFO ] Deduced a trap composed of 123 places in 588 ms of which 5 ms to minimize.
[2024-05-21 04:51:05] [INFO ] Deduced a trap composed of 121 places in 527 ms of which 5 ms to minimize.
[2024-05-21 04:51:05] [INFO ] Deduced a trap composed of 101 places in 590 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-21 04:51:08] [INFO ] Deduced a trap composed of 106 places in 325 ms of which 4 ms to minimize.
[2024-05-21 04:51:08] [INFO ] Deduced a trap composed of 110 places in 529 ms of which 5 ms to minimize.
[2024-05-21 04:51:09] [INFO ] Deduced a trap composed of 100 places in 638 ms of which 5 ms to minimize.
[2024-05-21 04:51:10] [INFO ] Deduced a trap composed of 89 places in 598 ms of which 4 ms to minimize.
[2024-05-21 04:51:11] [INFO ] Deduced a trap composed of 89 places in 311 ms of which 3 ms to minimize.
[2024-05-21 04:51:11] [INFO ] Deduced a trap composed of 99 places in 575 ms of which 5 ms to minimize.
[2024-05-21 04:51:12] [INFO ] Deduced a trap composed of 104 places in 579 ms of which 5 ms to minimize.
[2024-05-21 04:51:13] [INFO ] Deduced a trap composed of 125 places in 582 ms of which 4 ms to minimize.
[2024-05-21 04:51:13] [INFO ] Deduced a trap composed of 117 places in 585 ms of which 5 ms to minimize.
[2024-05-21 04:51:14] [INFO ] Deduced a trap composed of 96 places in 580 ms of which 5 ms to minimize.
[2024-05-21 04:51:15] [INFO ] Deduced a trap composed of 91 places in 582 ms of which 5 ms to minimize.
[2024-05-21 04:51:15] [INFO ] Deduced a trap composed of 112 places in 575 ms of which 5 ms to minimize.
[2024-05-21 04:51:16] [INFO ] Deduced a trap composed of 100 places in 605 ms of which 5 ms to minimize.
[2024-05-21 04:51:17] [INFO ] Deduced a trap composed of 88 places in 588 ms of which 5 ms to minimize.
[2024-05-21 04:51:18] [INFO ] Deduced a trap composed of 82 places in 576 ms of which 5 ms to minimize.
[2024-05-21 04:51:18] [INFO ] Deduced a trap composed of 132 places in 309 ms of which 3 ms to minimize.
[2024-05-21 04:51:19] [INFO ] Deduced a trap composed of 114 places in 487 ms of which 5 ms to minimize.
[2024-05-21 04:51:19] [INFO ] Deduced a trap composed of 78 places in 584 ms of which 5 ms to minimize.
[2024-05-21 04:51:20] [INFO ] Deduced a trap composed of 94 places in 590 ms of which 5 ms to minimize.
[2024-05-21 04:51:21] [INFO ] Deduced a trap composed of 97 places in 599 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 1/299 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 12/124 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-21 04:51:37] [INFO ] Deduced a trap composed of 89 places in 306 ms of which 3 ms to minimize.
[2024-05-21 04:51:38] [INFO ] Deduced a trap composed of 107 places in 330 ms of which 3 ms to minimize.
[2024-05-21 04:51:38] [INFO ] Deduced a trap composed of 129 places in 366 ms of which 2 ms to minimize.
[2024-05-21 04:51:38] [INFO ] Deduced a trap composed of 118 places in 359 ms of which 3 ms to minimize.
[2024-05-21 04:51:39] [INFO ] Deduced a trap composed of 92 places in 513 ms of which 4 ms to minimize.
[2024-05-21 04:51:39] [INFO ] Deduced a trap composed of 132 places in 364 ms of which 3 ms to minimize.
[2024-05-21 04:51:40] [INFO ] Deduced a trap composed of 123 places in 520 ms of which 4 ms to minimize.
[2024-05-21 04:51:40] [INFO ] Deduced a trap composed of 52 places in 379 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 8/132 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-21 04:51:45] [INFO ] Deduced a trap composed of 53 places in 597 ms of which 5 ms to minimize.
[2024-05-21 04:51:46] [INFO ] Deduced a trap composed of 42 places in 603 ms of which 5 ms to minimize.
[2024-05-21 04:51:47] [INFO ] Deduced a trap composed of 40 places in 592 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 13 (OVERLAPS) 1421/1720 variables, 299/434 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1720 variables, 90/524 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1720 variables, 40/564 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1720 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 17 (OVERLAPS) 0/1720 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1720/1720 variables, and 564 constraints, problems are : Problem set: 0 solved, 40 unsolved in 92337 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 299/299 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 113/113 constraints]
After SMT, in 145983ms problems are : Problem set: 0 solved, 40 unsolved
Parikh walk visited 0 properties in 170 ms.
Support contains 33 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 1421/1421 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 280 transition count 1060
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 280 transition count 1060
Applied a total of 38 rules in 29 ms. Remains 280 /299 variables (removed 19) and now considering 1060/1421 (removed 361) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 280/299 places, 1060/1421 transitions.
RANDOM walk for 4000000 steps (8 resets) in 28911 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400002 steps (8 resets) in 844 ms. (473 steps per ms) remains 39/40 properties
BEST_FIRST walk for 400002 steps (8 resets) in 904 ms. (441 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 864 ms. (462 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 865 ms. (461 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 889 ms. (449 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (8 resets) in 844 ms. (473 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (8 resets) in 847 ms. (471 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (8 resets) in 888 ms. (449 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400002 steps (8 resets) in 903 ms. (442 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 896 ms. (445 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 849 ms. (470 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (8 resets) in 969 ms. (412 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400002 steps (8 resets) in 907 ms. (440 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400002 steps (8 resets) in 845 ms. (472 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400002 steps (8 resets) in 847 ms. (471 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (8 resets) in 880 ms. (454 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400002 steps (8 resets) in 902 ms. (442 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 856 ms. (466 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 894 ms. (446 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (8 resets) in 856 ms. (466 steps per ms) remains 37/39 properties
BEST_FIRST walk for 400003 steps (8 resets) in 844 ms. (473 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (8 resets) in 879 ms. (454 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (8 resets) in 892 ms. (447 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (8 resets) in 872 ms. (458 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 851 ms. (469 steps per ms) remains 35/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 943 ms. (423 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (8 resets) in 873 ms. (457 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (8 resets) in 929 ms. (430 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1724 ms. (231 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1302 ms. (306 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1827 ms. (218 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1878 ms. (212 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1972 ms. (202 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1615 ms. (247 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1824 ms. (219 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1549 ms. (258 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1703 ms. (234 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1865 ms. (214 steps per ms) remains 35/35 properties
// Phase 1: matrix 1060 rows 280 cols
[2024-05-21 04:52:46] [INFO ] Computed 22 invariants in 8 ms
[2024-05-21 04:52:46] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 222/252 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 27/279 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 1/280 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-21 04:52:48] [INFO ] Deduced a trap composed of 74 places in 333 ms of which 3 ms to minimize.
[2024-05-21 04:52:48] [INFO ] Deduced a trap composed of 89 places in 318 ms of which 3 ms to minimize.
[2024-05-21 04:52:48] [INFO ] Deduced a trap composed of 74 places in 337 ms of which 4 ms to minimize.
[2024-05-21 04:52:49] [INFO ] Deduced a trap composed of 121 places in 307 ms of which 3 ms to minimize.
[2024-05-21 04:52:49] [INFO ] Deduced a trap composed of 79 places in 361 ms of which 3 ms to minimize.
[2024-05-21 04:52:50] [INFO ] Deduced a trap composed of 108 places in 347 ms of which 3 ms to minimize.
[2024-05-21 04:52:50] [INFO ] Deduced a trap composed of 80 places in 326 ms of which 3 ms to minimize.
[2024-05-21 04:52:50] [INFO ] Deduced a trap composed of 62 places in 317 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-21 04:52:51] [INFO ] Deduced a trap composed of 115 places in 428 ms of which 3 ms to minimize.
[2024-05-21 04:52:51] [INFO ] Deduced a trap composed of 131 places in 320 ms of which 3 ms to minimize.
[2024-05-21 04:52:52] [INFO ] Deduced a trap composed of 134 places in 329 ms of which 3 ms to minimize.
[2024-05-21 04:52:52] [INFO ] Deduced a trap composed of 123 places in 355 ms of which 4 ms to minimize.
[2024-05-21 04:52:52] [INFO ] Deduced a trap composed of 122 places in 459 ms of which 4 ms to minimize.
[2024-05-21 04:52:53] [INFO ] Deduced a trap composed of 118 places in 329 ms of which 3 ms to minimize.
[2024-05-21 04:52:53] [INFO ] Deduced a trap composed of 68 places in 323 ms of which 3 ms to minimize.
[2024-05-21 04:52:54] [INFO ] Deduced a trap composed of 51 places in 324 ms of which 3 ms to minimize.
[2024-05-21 04:52:54] [INFO ] Deduced a trap composed of 73 places in 307 ms of which 3 ms to minimize.
[2024-05-21 04:52:54] [INFO ] Deduced a trap composed of 87 places in 322 ms of which 3 ms to minimize.
[2024-05-21 04:52:54] [INFO ] Deduced a trap composed of 93 places in 326 ms of which 3 ms to minimize.
[2024-05-21 04:52:55] [INFO ] Deduced a trap composed of 94 places in 337 ms of which 3 ms to minimize.
[2024-05-21 04:52:55] [INFO ] Deduced a trap composed of 122 places in 323 ms of which 3 ms to minimize.
[2024-05-21 04:52:56] [INFO ] Deduced a trap composed of 125 places in 335 ms of which 3 ms to minimize.
[2024-05-21 04:52:56] [INFO ] Deduced a trap composed of 110 places in 324 ms of which 3 ms to minimize.
[2024-05-21 04:52:56] [INFO ] Deduced a trap composed of 68 places in 340 ms of which 3 ms to minimize.
[2024-05-21 04:52:57] [INFO ] Deduced a trap composed of 85 places in 335 ms of which 3 ms to minimize.
[2024-05-21 04:52:57] [INFO ] Deduced a trap composed of 80 places in 345 ms of which 3 ms to minimize.
[2024-05-21 04:52:57] [INFO ] Deduced a trap composed of 102 places in 332 ms of which 3 ms to minimize.
[2024-05-21 04:52:58] [INFO ] Deduced a trap composed of 76 places in 335 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-21 04:52:58] [INFO ] Deduced a trap composed of 103 places in 245 ms of which 3 ms to minimize.
[2024-05-21 04:52:58] [INFO ] Deduced a trap composed of 86 places in 335 ms of which 3 ms to minimize.
[2024-05-21 04:52:59] [INFO ] Deduced a trap composed of 88 places in 261 ms of which 2 ms to minimize.
[2024-05-21 04:52:59] [INFO ] Deduced a trap composed of 105 places in 338 ms of which 3 ms to minimize.
[2024-05-21 04:52:59] [INFO ] Deduced a trap composed of 91 places in 356 ms of which 4 ms to minimize.
[2024-05-21 04:53:00] [INFO ] Deduced a trap composed of 84 places in 453 ms of which 3 ms to minimize.
[2024-05-21 04:53:00] [INFO ] Deduced a trap composed of 85 places in 332 ms of which 3 ms to minimize.
[2024-05-21 04:53:01] [INFO ] Deduced a trap composed of 66 places in 336 ms of which 3 ms to minimize.
[2024-05-21 04:53:01] [INFO ] Deduced a trap composed of 82 places in 321 ms of which 3 ms to minimize.
[2024-05-21 04:53:01] [INFO ] Deduced a trap composed of 115 places in 336 ms of which 3 ms to minimize.
[2024-05-21 04:53:02] [INFO ] Deduced a trap composed of 69 places in 330 ms of which 3 ms to minimize.
[2024-05-21 04:53:02] [INFO ] Deduced a trap composed of 89 places in 336 ms of which 4 ms to minimize.
[2024-05-21 04:53:02] [INFO ] Deduced a trap composed of 78 places in 439 ms of which 6 ms to minimize.
[2024-05-21 04:53:03] [INFO ] Deduced a trap composed of 89 places in 289 ms of which 3 ms to minimize.
[2024-05-21 04:53:03] [INFO ] Deduced a trap composed of 80 places in 332 ms of which 3 ms to minimize.
[2024-05-21 04:53:03] [INFO ] Deduced a trap composed of 78 places in 332 ms of which 2 ms to minimize.
[2024-05-21 04:53:04] [INFO ] Deduced a trap composed of 83 places in 343 ms of which 3 ms to minimize.
[2024-05-21 04:53:04] [INFO ] Deduced a trap composed of 117 places in 331 ms of which 3 ms to minimize.
[2024-05-21 04:53:04] [INFO ] Deduced a trap composed of 82 places in 316 ms of which 3 ms to minimize.
[2024-05-21 04:53:05] [INFO ] Deduced a trap composed of 86 places in 332 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-21 04:53:06] [INFO ] Deduced a trap composed of 100 places in 294 ms of which 3 ms to minimize.
[2024-05-21 04:53:06] [INFO ] Deduced a trap composed of 124 places in 331 ms of which 3 ms to minimize.
[2024-05-21 04:53:06] [INFO ] Deduced a trap composed of 68 places in 331 ms of which 3 ms to minimize.
[2024-05-21 04:53:07] [INFO ] Deduced a trap composed of 132 places in 310 ms of which 3 ms to minimize.
[2024-05-21 04:53:07] [INFO ] Deduced a trap composed of 137 places in 316 ms of which 3 ms to minimize.
[2024-05-21 04:53:07] [INFO ] Deduced a trap composed of 118 places in 324 ms of which 3 ms to minimize.
[2024-05-21 04:53:08] [INFO ] Deduced a trap composed of 100 places in 366 ms of which 5 ms to minimize.
[2024-05-21 04:53:08] [INFO ] Deduced a trap composed of 114 places in 422 ms of which 3 ms to minimize.
[2024-05-21 04:53:08] [INFO ] Deduced a trap composed of 86 places in 336 ms of which 3 ms to minimize.
[2024-05-21 04:53:09] [INFO ] Deduced a trap composed of 80 places in 321 ms of which 3 ms to minimize.
[2024-05-21 04:53:09] [INFO ] Deduced a trap composed of 88 places in 310 ms of which 3 ms to minimize.
[2024-05-21 04:53:09] [INFO ] Deduced a trap composed of 91 places in 310 ms of which 3 ms to minimize.
[2024-05-21 04:53:10] [INFO ] Deduced a trap composed of 117 places in 313 ms of which 3 ms to minimize.
[2024-05-21 04:53:10] [INFO ] Deduced a trap composed of 102 places in 319 ms of which 3 ms to minimize.
[2024-05-21 04:53:11] [INFO ] Deduced a trap composed of 122 places in 411 ms of which 4 ms to minimize.
[2024-05-21 04:53:11] [INFO ] Deduced a trap composed of 73 places in 372 ms of which 3 ms to minimize.
[2024-05-21 04:53:11] [INFO ] Deduced a trap composed of 84 places in 320 ms of which 3 ms to minimize.
[2024-05-21 04:53:12] [INFO ] Deduced a trap composed of 89 places in 327 ms of which 3 ms to minimize.
[2024-05-21 04:53:12] [INFO ] Deduced a trap composed of 127 places in 400 ms of which 4 ms to minimize.
[2024-05-21 04:53:13] [INFO ] Deduced a trap composed of 85 places in 380 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-21 04:53:14] [INFO ] Deduced a trap composed of 96 places in 332 ms of which 3 ms to minimize.
[2024-05-21 04:53:14] [INFO ] Deduced a trap composed of 87 places in 323 ms of which 3 ms to minimize.
[2024-05-21 04:53:14] [INFO ] Deduced a trap composed of 63 places in 325 ms of which 3 ms to minimize.
[2024-05-21 04:53:15] [INFO ] Deduced a trap composed of 72 places in 327 ms of which 3 ms to minimize.
[2024-05-21 04:53:15] [INFO ] Deduced a trap composed of 50 places in 337 ms of which 3 ms to minimize.
[2024-05-21 04:53:15] [INFO ] Deduced a trap composed of 93 places in 333 ms of which 3 ms to minimize.
[2024-05-21 04:53:16] [INFO ] Deduced a trap composed of 115 places in 252 ms of which 6 ms to minimize.
[2024-05-21 04:53:16] [INFO ] Deduced a trap composed of 83 places in 321 ms of which 3 ms to minimize.
[2024-05-21 04:53:16] [INFO ] Deduced a trap composed of 85 places in 324 ms of which 3 ms to minimize.
[2024-05-21 04:53:17] [INFO ] Deduced a trap composed of 80 places in 372 ms of which 5 ms to minimize.
[2024-05-21 04:53:17] [INFO ] Deduced a trap composed of 49 places in 403 ms of which 4 ms to minimize.
[2024-05-21 04:53:17] [INFO ] Deduced a trap composed of 91 places in 326 ms of which 3 ms to minimize.
[2024-05-21 04:53:18] [INFO ] Deduced a trap composed of 101 places in 282 ms of which 3 ms to minimize.
[2024-05-21 04:53:18] [INFO ] Deduced a trap composed of 57 places in 322 ms of which 3 ms to minimize.
[2024-05-21 04:53:18] [INFO ] Deduced a trap composed of 51 places in 335 ms of which 3 ms to minimize.
[2024-05-21 04:53:19] [INFO ] Deduced a trap composed of 85 places in 462 ms of which 4 ms to minimize.
[2024-05-21 04:53:19] [INFO ] Deduced a trap composed of 70 places in 446 ms of which 4 ms to minimize.
[2024-05-21 04:53:20] [INFO ] Deduced a trap composed of 51 places in 359 ms of which 3 ms to minimize.
[2024-05-21 04:53:20] [INFO ] Deduced a trap composed of 95 places in 320 ms of which 3 ms to minimize.
[2024-05-21 04:53:21] [INFO ] Deduced a trap composed of 96 places in 341 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-21 04:53:23] [INFO ] Deduced a trap composed of 59 places in 344 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-21 04:53:25] [INFO ] Deduced a trap composed of 90 places in 261 ms of which 3 ms to minimize.
[2024-05-21 04:53:26] [INFO ] Deduced a trap composed of 78 places in 330 ms of which 3 ms to minimize.
[2024-05-21 04:53:26] [INFO ] Deduced a trap composed of 50 places in 335 ms of which 3 ms to minimize.
[2024-05-21 04:53:27] [INFO ] Deduced a trap composed of 78 places in 328 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 14 (OVERLAPS) 1060/1340 variables, 280/395 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1340 variables, 90/485 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1340 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 17 (OVERLAPS) 0/1340 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1340/1340 variables, and 485 constraints, problems are : Problem set: 0 solved, 35 unsolved in 64064 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 280/280 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 93/93 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 222/252 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 27/279 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 93/114 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-21 04:53:52] [INFO ] Deduced a trap composed of 69 places in 471 ms of which 5 ms to minimize.
[2024-05-21 04:53:52] [INFO ] Deduced a trap composed of 98 places in 477 ms of which 4 ms to minimize.
[2024-05-21 04:53:53] [INFO ] Deduced a trap composed of 60 places in 402 ms of which 4 ms to minimize.
[2024-05-21 04:53:53] [INFO ] Deduced a trap composed of 63 places in 457 ms of which 4 ms to minimize.
[2024-05-21 04:53:54] [INFO ] Deduced a trap composed of 57 places in 355 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 5/119 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 1/280 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 1060/1340 variables, 280/400 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1340 variables, 90/490 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1340 variables, 35/525 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1340 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 13 (OVERLAPS) 0/1340 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1340/1340 variables, and 525 constraints, problems are : Problem set: 0 solved, 35 unsolved in 24583 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 280/280 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 98/98 constraints]
After SMT, in 88744ms problems are : Problem set: 0 solved, 35 unsolved
Parikh walk visited 0 properties in 1023 ms.
Support contains 30 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 1060/1060 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 278 transition count 1022
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 278 transition count 1022
Applied a total of 4 rules in 37 ms. Remains 278 /280 variables (removed 2) and now considering 1022/1060 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 278/280 places, 1022/1060 transitions.
RANDOM walk for 4000000 steps (8 resets) in 31440 ms. (127 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1553 ms. (257 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1695 ms. (235 steps per ms) remains 34/35 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1529 ms. (261 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1705 ms. (234 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1352 ms. (295 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1469 ms. (272 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1980 ms. (201 steps per ms) remains 33/34 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1973 ms. (202 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1507 ms. (265 steps per ms) remains 32/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1589 ms. (251 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1662 ms. (240 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1688 ms. (236 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1600 ms. (249 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1646 ms. (242 steps per ms) remains 31/32 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1797 ms. (222 steps per ms) remains 30/31 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1705 ms. (234 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1844 ms. (216 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1595 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1667 ms. (239 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1409 ms. (283 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1464 ms. (273 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1659 ms. (240 steps per ms) remains 29/30 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1785 ms. (223 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1398 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1853 ms. (215 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1870 ms. (213 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1788 ms. (223 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1514 ms. (264 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1761 ms. (227 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1893 ms. (211 steps per ms) remains 28/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1734 ms. (230 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1664 ms. (240 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1726 ms. (231 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1677 ms. (238 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1585 ms. (252 steps per ms) remains 28/28 properties
// Phase 1: matrix 1022 rows 278 cols
[2024-05-21 04:54:52] [INFO ] Computed 22 invariants in 6 ms
[2024-05-21 04:54:52] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 223/250 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 27/277 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-21 04:54:53] [INFO ] Deduced a trap composed of 140 places in 298 ms of which 3 ms to minimize.
[2024-05-21 04:54:53] [INFO ] Deduced a trap composed of 111 places in 303 ms of which 3 ms to minimize.
[2024-05-21 04:54:54] [INFO ] Deduced a trap composed of 92 places in 299 ms of which 3 ms to minimize.
[2024-05-21 04:54:54] [INFO ] Deduced a trap composed of 97 places in 310 ms of which 3 ms to minimize.
[2024-05-21 04:54:54] [INFO ] Deduced a trap composed of 106 places in 301 ms of which 3 ms to minimize.
[2024-05-21 04:54:55] [INFO ] Deduced a trap composed of 65 places in 275 ms of which 3 ms to minimize.
[2024-05-21 04:54:55] [INFO ] Deduced a trap composed of 79 places in 295 ms of which 4 ms to minimize.
[2024-05-21 04:54:55] [INFO ] Deduced a trap composed of 150 places in 287 ms of which 3 ms to minimize.
[2024-05-21 04:54:56] [INFO ] Deduced a trap composed of 89 places in 308 ms of which 3 ms to minimize.
[2024-05-21 04:54:56] [INFO ] Deduced a trap composed of 115 places in 311 ms of which 3 ms to minimize.
[2024-05-21 04:54:56] [INFO ] Deduced a trap composed of 85 places in 374 ms of which 4 ms to minimize.
[2024-05-21 04:54:57] [INFO ] Deduced a trap composed of 72 places in 326 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 1/278 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-21 04:54:57] [INFO ] Deduced a trap composed of 111 places in 260 ms of which 3 ms to minimize.
[2024-05-21 04:54:58] [INFO ] Deduced a trap composed of 57 places in 264 ms of which 3 ms to minimize.
[2024-05-21 04:54:58] [INFO ] Deduced a trap composed of 92 places in 325 ms of which 3 ms to minimize.
[2024-05-21 04:54:58] [INFO ] Deduced a trap composed of 75 places in 320 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 1022/1300 variables, 278/316 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1300 variables, 90/406 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1300 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (OVERLAPS) 0/1300 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1300/1300 variables, and 406 constraints, problems are : Problem set: 0 solved, 28 unsolved in 10652 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 278/278 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 223/250 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 27/277 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 1/278 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 1022/1300 variables, 278/316 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1300 variables, 90/406 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1300 variables, 28/434 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1300 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 0/1300 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1300/1300 variables, and 434 constraints, problems are : Problem set: 0 solved, 28 unsolved in 7922 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 278/278 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 16/16 constraints]
After SMT, in 18638ms problems are : Problem set: 0 solved, 28 unsolved
Parikh walk visited 5 properties in 6443 ms.
Support contains 22 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 1022/1022 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 270 transition count 870
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 270 transition count 870
Applied a total of 16 rules in 18 ms. Remains 270 /278 variables (removed 8) and now considering 870/1022 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 270/278 places, 870/1022 transitions.
RANDOM walk for 4000000 steps (8 resets) in 48696 ms. (82 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1860 ms. (214 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1708 ms. (234 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1569 ms. (254 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1788 ms. (223 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1699 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2088 ms. (191 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2871 ms. (139 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1770 ms. (225 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1760 ms. (227 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1650 ms. (242 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1893 ms. (211 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1590 ms. (251 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1833 ms. (218 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1772 ms. (225 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1910 ms. (209 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1811 ms. (220 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1877 ms. (212 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1685 ms. (237 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1816 ms. (220 steps per ms) remains 22/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1835 ms. (217 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1891 ms. (211 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1527 ms. (261 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1800 ms. (222 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 4485719 steps, run timeout after 96001 ms. (steps per millisecond=46 ) properties seen :11 out of 22
Probabilistic random walk after 4485719 steps, saw 2670884 distinct states, run finished after 96014 ms. (steps per millisecond=46 ) properties seen :11
// Phase 1: matrix 870 rows 270 cols
[2024-05-21 04:57:25] [INFO ] Computed 22 invariants in 4 ms
[2024-05-21 04:57:25] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 234/245 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 5/250 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 19/269 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 04:57:26] [INFO ] Deduced a trap composed of 96 places in 379 ms of which 4 ms to minimize.
[2024-05-21 04:57:26] [INFO ] Deduced a trap composed of 118 places in 355 ms of which 4 ms to minimize.
[2024-05-21 04:57:27] [INFO ] Deduced a trap composed of 100 places in 313 ms of which 4 ms to minimize.
[2024-05-21 04:57:27] [INFO ] Deduced a trap composed of 84 places in 223 ms of which 2 ms to minimize.
[2024-05-21 04:57:27] [INFO ] Deduced a trap composed of 83 places in 260 ms of which 3 ms to minimize.
[2024-05-21 04:57:28] [INFO ] Deduced a trap composed of 110 places in 354 ms of which 5 ms to minimize.
[2024-05-21 04:57:28] [INFO ] Deduced a trap composed of 132 places in 363 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 04:57:29] [INFO ] Deduced a trap composed of 73 places in 375 ms of which 4 ms to minimize.
[2024-05-21 04:57:29] [INFO ] Deduced a trap composed of 89 places in 377 ms of which 4 ms to minimize.
[2024-05-21 04:57:29] [INFO ] Deduced a trap composed of 61 places in 377 ms of which 3 ms to minimize.
[2024-05-21 04:57:30] [INFO ] Deduced a trap composed of 81 places in 293 ms of which 4 ms to minimize.
[2024-05-21 04:57:30] [INFO ] Deduced a trap composed of 100 places in 352 ms of which 4 ms to minimize.
[2024-05-21 04:57:31] [INFO ] Deduced a trap composed of 99 places in 353 ms of which 3 ms to minimize.
[2024-05-21 04:57:31] [INFO ] Deduced a trap composed of 79 places in 385 ms of which 4 ms to minimize.
[2024-05-21 04:57:31] [INFO ] Deduced a trap composed of 89 places in 289 ms of which 3 ms to minimize.
[2024-05-21 04:57:32] [INFO ] Deduced a trap composed of 76 places in 266 ms of which 3 ms to minimize.
[2024-05-21 04:57:32] [INFO ] Deduced a trap composed of 77 places in 312 ms of which 3 ms to minimize.
[2024-05-21 04:57:32] [INFO ] Deduced a trap composed of 116 places in 407 ms of which 4 ms to minimize.
[2024-05-21 04:57:33] [INFO ] Deduced a trap composed of 88 places in 389 ms of which 4 ms to minimize.
[2024-05-21 04:57:33] [INFO ] Deduced a trap composed of 66 places in 382 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 13/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/270 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 870/1140 variables, 270/312 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1140 variables, 90/402 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1140 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 0/1140 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1140/1140 variables, and 402 constraints, problems are : Problem set: 0 solved, 11 unsolved in 9816 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 270/270 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 234/245 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 5/250 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 19/269 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/270 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 04:57:36] [INFO ] Deduced a trap composed of 87 places in 323 ms of which 3 ms to minimize.
[2024-05-21 04:57:36] [INFO ] Deduced a trap composed of 100 places in 326 ms of which 3 ms to minimize.
[2024-05-21 04:57:37] [INFO ] Deduced a trap composed of 84 places in 295 ms of which 3 ms to minimize.
[2024-05-21 04:57:37] [INFO ] Deduced a trap composed of 91 places in 284 ms of which 3 ms to minimize.
[2024-05-21 04:57:37] [INFO ] Deduced a trap composed of 88 places in 278 ms of which 3 ms to minimize.
[2024-05-21 04:57:38] [INFO ] Deduced a trap composed of 87 places in 288 ms of which 3 ms to minimize.
[2024-05-21 04:57:38] [INFO ] Deduced a trap composed of 103 places in 285 ms of which 3 ms to minimize.
[2024-05-21 04:57:38] [INFO ] Deduced a trap composed of 84 places in 275 ms of which 3 ms to minimize.
[2024-05-21 04:57:38] [INFO ] Deduced a trap composed of 109 places in 282 ms of which 2 ms to minimize.
[2024-05-21 04:57:39] [INFO ] Deduced a trap composed of 84 places in 267 ms of which 3 ms to minimize.
[2024-05-21 04:57:39] [INFO ] Deduced a trap composed of 84 places in 281 ms of which 3 ms to minimize.
[2024-05-21 04:57:39] [INFO ] Deduced a trap composed of 90 places in 279 ms of which 3 ms to minimize.
[2024-05-21 04:57:40] [INFO ] Deduced a trap composed of 92 places in 360 ms of which 4 ms to minimize.
[2024-05-21 04:57:40] [INFO ] Deduced a trap composed of 115 places in 390 ms of which 3 ms to minimize.
[2024-05-21 04:57:40] [INFO ] Deduced a trap composed of 71 places in 315 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 04:57:41] [INFO ] Deduced a trap composed of 63 places in 326 ms of which 3 ms to minimize.
[2024-05-21 04:57:41] [INFO ] Deduced a trap composed of 72 places in 331 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 04:57:42] [INFO ] Deduced a trap composed of 82 places in 263 ms of which 3 ms to minimize.
[2024-05-21 04:57:42] [INFO ] Deduced a trap composed of 74 places in 382 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 870/1140 variables, 270/331 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1140 variables, 90/421 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1140 variables, 11/432 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1140 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 0/1140 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1140/1140 variables, and 432 constraints, problems are : Problem set: 0 solved, 11 unsolved in 11182 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 270/270 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 39/39 constraints]
After SMT, in 21029ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 0 properties in 6709 ms.
Support contains 11 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 870/870 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 259 transition count 661
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 259 transition count 661
Applied a total of 22 rules in 16 ms. Remains 259 /270 variables (removed 11) and now considering 661/870 (removed 209) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 259/270 places, 661/870 transitions.
RANDOM walk for 4000000 steps (8 resets) in 36320 ms. (110 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 10122 ms. (395 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 10327 ms. (387 steps per ms) remains 10/10 properties
BEST_FIRST walk for 3764370 steps (8 resets) in 12370 ms. (304 steps per ms) remains 9/10 properties
BEST_FIRST walk for 3929579 steps (8 resets) in 12663 ms. (310 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 9097 ms. (439 steps per ms) remains 6/8 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 11965 ms. (334 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 10329 ms. (387 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 8353 ms. (478 steps per ms) remains 2/4 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 6791 ms. (588 steps per ms) remains 1/2 properties
// Phase 1: matrix 661 rows 259 cols
[2024-05-21 04:58:41] [INFO ] Computed 22 invariants in 6 ms
[2024-05-21 04:58:41] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 228/230 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/239 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/258 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/259 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 04:58:41] [INFO ] Deduced a trap composed of 130 places in 347 ms of which 4 ms to minimize.
[2024-05-21 04:58:42] [INFO ] Deduced a trap composed of 96 places in 335 ms of which 4 ms to minimize.
[2024-05-21 04:58:42] [INFO ] Deduced a trap composed of 71 places in 338 ms of which 4 ms to minimize.
[2024-05-21 04:58:42] [INFO ] Deduced a trap composed of 64 places in 336 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 661/920 variables, 259/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/920 variables, 90/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/920 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/920 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 920/920 variables, and 375 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 259/259 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 228/230 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/239 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/258 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/259 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 04:58:43] [INFO ] Deduced a trap composed of 74 places in 375 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 661/920 variables, 259/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/920 variables, 90/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/920 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/920 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/920 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 920/920 variables, and 377 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1148 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 259/259 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 3205ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 2 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 661/661 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 251 transition count 509
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 251 transition count 509
Applied a total of 16 rules in 18 ms. Remains 251 /259 variables (removed 8) and now considering 509/661 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 251/259 places, 509/661 transitions.
RANDOM walk for 4000000 steps (8 resets) in 8698 ms. (459 steps per ms) remains 1/1 properties
BEST_FIRST walk for 2561343 steps (5 resets) in 1881 ms. (1360 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 2290 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 621 transition count 2390
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 531 transition count 2390
Applied a total of 180 rules in 30 ms. Remains 531 /621 variables (removed 90) and now considering 2390/2480 (removed 90) transitions.
// Phase 1: matrix 2390 rows 531 cols
[2024-05-21 04:58:47] [INFO ] Computed 23 invariants in 15 ms
[2024-05-21 04:58:49] [INFO ] Implicit Places using invariants in 2312 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2318 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 530/621 places, 2390/2480 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 530 transition count 2290
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 430 transition count 2290
Applied a total of 200 rules in 16 ms. Remains 430 /530 variables (removed 100) and now considering 2290/2390 (removed 100) transitions.
// Phase 1: matrix 2290 rows 430 cols
[2024-05-21 04:58:49] [INFO ] Computed 22 invariants in 11 ms
[2024-05-21 04:58:51] [INFO ] Implicit Places using invariants in 1637 ms returned []
[2024-05-21 04:58:51] [INFO ] Invariant cache hit.
[2024-05-21 04:58:52] [INFO ] State equation strengthened by 170 read => feed constraints.
[2024-05-21 04:58:58] [INFO ] Implicit Places using invariants and state equation in 6676 ms returned []
Implicit Place search using SMT with State Equation took 8320 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 430/621 places, 2290/2480 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 10685 ms. Remains : 430/621 places, 2290/2480 transitions.
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Unable to solve all queries for examination Liveness. Remains :2290 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 2290 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 1129421 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Anderson-PT-10
IS_COLORED=
IS_NUPN=1
LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 621
TRANSITIONS: 2480
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 9560
NUPN UNITS: 13
LOADING TIME: 1.823
SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.168
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 2.817
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 2613
MODEL NAME: /home/mcc/execution/model
621 places, 2480 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML
MEDDLY ERROR: Insufficient memory
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="Anderson-PT-10"
export BK_EXAMINATION="Liveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is Anderson-PT-10, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r012-smll-171620124200229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-10.tgz
mv Anderson-PT-10 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;