MCC'2024- Execution of r528-tall-171683762000857

About the Execution of LTSMin+red for ShieldRVs-PT-050B

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
2244.863	178341.00	253524.00	473.60	?T????T?????????	normal

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.r528-tall-171683762000857.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 ltsminxred
Input is ShieldRVs-PT-050B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762000857
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 17:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 17:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 625K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2024-00
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2024-01
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2024-02
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2024-03
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2024-04
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2024-05
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2024-06
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2024-07
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2024-08
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2024-09
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2024-10
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2024-11
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2023-12
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2023-13
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2023-14
FORMULA_NAME ShieldRVs-PT-050B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717270994021

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:43:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 19:43:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:43:15] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2024-06-01 19:43:15] [INFO ] Transformed 2003 places.
[2024-06-01 19:43:15] [INFO ] Transformed 2253 transitions.
[2024-06-01 19:43:15] [INFO ] Found NUPN structural information;
[2024-06-01 19:43:15] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 350 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
FORMULA ShieldRVs-PT-050B-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 123 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Discarding 303 places :
Symmetric choice reduction at 0 with 303 rule applications. Total rules 303 place count 1700 transition count 1950
Iterating global reduction 0 with 303 rules applied. Total rules applied 606 place count 1700 transition count 1950
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 607 place count 1699 transition count 1949
Iterating global reduction 0 with 1 rules applied. Total rules applied 608 place count 1699 transition count 1949
Applied a total of 608 rules in 414 ms. Remains 1699 /2003 variables (removed 304) and now considering 1949/2253 (removed 304) transitions.
// Phase 1: matrix 1949 rows 1699 cols
[2024-06-01 19:43:16] [INFO ] Computed 201 invariants in 40 ms
[2024-06-01 19:43:16] [INFO ] Implicit Places using invariants in 717 ms returned []
[2024-06-01 19:43:16] [INFO ] Invariant cache hit.
[2024-06-01 19:43:18] [INFO ] Implicit Places using invariants and state equation in 1573 ms returned []
Implicit Place search using SMT with State Equation took 2319 ms to find 0 implicit places.
Running 1948 sub problems to find dead transitions.
[2024-06-01 19:43:18] [INFO ] Invariant cache hit.
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)
(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)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)timeout

(s1364 1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1698/3648 variables, and 0 constraints, problems are : Problem set: 0 solved, 1948 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1699 constraints, PredecessorRefiner: 1948/1948 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1948 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1698/3648 variables, and 0 constraints, problems are : Problem set: 0 solved, 1948 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1699 constraints, PredecessorRefiner: 0/1948 constraints, Known Traps: 0/0 constraints]
After SMT, in 60887ms problems are : Problem set: 0 solved, 1948 unsolved
Search for dead transitions found 0 dead transitions in 60926ms
Starting structural reductions in LTL mode, iteration 1 : 1699/2003 places, 1949/2253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63696 ms. Remains : 1699/2003 places, 1949/2253 transitions.
Support contains 123 out of 1699 places after structural reductions.
[2024-06-01 19:44:19] [INFO ] Flatten gal took : 173 ms
[2024-06-01 19:44:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldRVs-PT-050B-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 19:44:19] [INFO ] Flatten gal took : 106 ms
[2024-06-01 19:44:20] [INFO ] Input system was already deterministic with 1949 transitions.
Support contains 115 out of 1699 places (down from 123) after GAL structural reductions.
RANDOM walk for 40000 steps (16 resets) in 3083 ms. (12 steps per ms) remains 6/70 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
[2024-06-01 19:44:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1234/1249 variables, 144/144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 450/1699 variables, 57/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1699 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1949/3648 variables, 1699/1900 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3648 variables, 0/1900 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/3648 variables, 0/1900 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3648/3648 variables, and 1900 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1573 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 1699/1699 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1234/1249 variables, 144/144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 19:44:23] [INFO ] Deduced a trap composed of 54 places in 295 ms of which 41 ms to minimize.
[2024-06-01 19:44:23] [INFO ] Deduced a trap composed of 47 places in 276 ms of which 5 ms to minimize.
[2024-06-01 19:44:23] [INFO ] Deduced a trap composed of 52 places in 267 ms of which 7 ms to minimize.
[2024-06-01 19:44:24] [INFO ] Deduced a trap composed of 45 places in 234 ms of which 4 ms to minimize.
[2024-06-01 19:44:24] [INFO ] Deduced a trap composed of 59 places in 240 ms of which 4 ms to minimize.
[2024-06-01 19:44:24] [INFO ] Deduced a trap composed of 49 places in 218 ms of which 4 ms to minimize.
[2024-06-01 19:44:24] [INFO ] Deduced a trap composed of 53 places in 204 ms of which 3 ms to minimize.
[2024-06-01 19:44:25] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 4 ms to minimize.
[2024-06-01 19:44:25] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 4 ms to minimize.
[2024-06-01 19:44:25] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 3 ms to minimize.
[2024-06-01 19:44:25] [INFO ] Deduced a trap composed of 53 places in 202 ms of which 4 ms to minimize.
[2024-06-01 19:44:26] [INFO ] Deduced a trap composed of 46 places in 198 ms of which 4 ms to minimize.
[2024-06-01 19:44:26] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 3 ms to minimize.
[2024-06-01 19:44:26] [INFO ] Deduced a trap composed of 44 places in 189 ms of which 4 ms to minimize.
[2024-06-01 19:44:26] [INFO ] Deduced a trap composed of 36 places in 194 ms of which 4 ms to minimize.
[2024-06-01 19:44:26] [INFO ] Deduced a trap composed of 48 places in 182 ms of which 3 ms to minimize.
[2024-06-01 19:44:27] [INFO ] Deduced a trap composed of 56 places in 165 ms of which 3 ms to minimize.
[2024-06-01 19:44:27] [INFO ] Deduced a trap composed of 51 places in 171 ms of which 3 ms to minimize.
[2024-06-01 19:44:27] [INFO ] Deduced a trap composed of 69 places in 177 ms of which 3 ms to minimize.
[2024-06-01 19:44:27] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 19:44:27] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 3 ms to minimize.
[2024-06-01 19:44:28] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 5 ms to minimize.
SMT process timed out in 6754ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15 out of 1699 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 1699 transition count 1752
Reduce places removed 197 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 198 rules applied. Total rules applied 395 place count 1502 transition count 1751
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 396 place count 1501 transition count 1751
Performed 247 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 247 Pre rules applied. Total rules applied 396 place count 1501 transition count 1504
Deduced a syphon composed of 247 places in 2 ms
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 3 with 494 rules applied. Total rules applied 890 place count 1254 transition count 1504
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 931 place count 1213 transition count 1463
Iterating global reduction 3 with 41 rules applied. Total rules applied 972 place count 1213 transition count 1463
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 972 place count 1213 transition count 1449
Deduced a syphon composed of 14 places in 7 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 1000 place count 1199 transition count 1449
Performed 482 Post agglomeration using F-continuation condition.Transition count delta: 482
Deduced a syphon composed of 482 places in 2 ms
Reduce places removed 482 places and 0 transitions.
Iterating global reduction 3 with 964 rules applied. Total rules applied 1964 place count 717 transition count 967
Partial Free-agglomeration rule applied 102 times.
Drop transitions (Partial Free agglomeration) removed 102 transitions
Iterating global reduction 3 with 102 rules applied. Total rules applied 2066 place count 717 transition count 967
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2067 place count 716 transition count 966
Applied a total of 2067 rules in 553 ms. Remains 716 /1699 variables (removed 983) and now considering 966/1949 (removed 983) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 553 ms. Remains : 716/1699 places, 966/1949 transitions.
RANDOM walk for 40000 steps (64 resets) in 740 ms. (53 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 201 ms. (198 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 1/2 properties
// Phase 1: matrix 966 rows 716 cols
[2024-06-01 19:44:29] [INFO ] Computed 201 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 479/505 variables, 136/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 688/1193 variables, 505/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1193 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 56/1249 variables, 21/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1249 variables, 5/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1249 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/1251 variables, 1/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1251 variables, 2/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1251 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1313 variables, 22/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1313 variables, 3/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1313 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 7/1320 variables, 4/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1320 variables, 5/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1320 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 63/1383 variables, 26/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1383 variables, 6/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1383 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/1387 variables, 2/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1387 variables, 4/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1387 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 62/1449 variables, 24/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1449 variables, 6/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1449 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/1453 variables, 2/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1453 variables, 4/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1453 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 62/1515 variables, 24/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1515 variables, 6/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1515 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 4/1519 variables, 2/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1519 variables, 4/820 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1519 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 62/1581 variables, 24/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1581 variables, 6/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1581 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 4/1585 variables, 2/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1585 variables, 4/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1585 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 62/1647 variables, 24/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1647 variables, 6/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1647 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 4/1651 variables, 2/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1651 variables, 4/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1651 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 29/1680 variables, 17/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1680 variables, 5/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1680 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 2/1682 variables, 2/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1682 variables, 1/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1682 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 0/1682 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1682/1682 variables, and 917 constraints, problems are : Problem set: 0 solved, 1 unsolved in 609 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 716/716 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 479/505 variables, 136/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:44:29] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:44:30] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-06-01 19:44:30] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:44:30] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:44:30] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:44:30] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:44:30] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:44:30] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:44:30] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:44:30] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:44:30] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:44:30] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:44:30] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 13/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 688/1193 variables, 505/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:44:31] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 3 ms to minimize.
[2024-06-01 19:44:31] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:44:31] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:44:31] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:44:31] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 3 ms to minimize.
[2024-06-01 19:44:31] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:44:31] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-06-01 19:44:32] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:44:32] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2024-06-01 19:44:32] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 1 ms to minimize.
[2024-06-01 19:44:32] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2024-06-01 19:44:32] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-06-01 19:44:32] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1193 variables, 13/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1193 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/1249 variables, 21/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1249 variables, 5/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1249 variables, 1/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:44:32] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:44:32] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:44:32] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 3 ms to minimize.
[2024-06-01 19:44:33] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:44:33] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:44:33] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-06-01 19:44:33] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2024-06-01 19:44:33] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 3 ms to minimize.
[2024-06-01 19:44:33] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:44:33] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
[2024-06-01 19:44:33] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:44:34] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:44:34] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2024-06-01 19:44:34] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-06-01 19:44:34] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:44:34] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:44:34] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:44:34] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:44:34] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2024-06-01 19:44:34] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1249 variables, 20/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:44:35] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2024-06-01 19:44:35] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2024-06-01 19:44:35] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-06-01 19:44:35] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:44:35] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:44:35] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-06-01 19:44:35] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:44:35] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 1 ms to minimize.
[2024-06-01 19:44:35] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2024-06-01 19:44:36] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:44:36] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:44:36] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
[2024-06-01 19:44:36] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-06-01 19:44:36] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-06-01 19:44:36] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-06-01 19:44:36] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:44:36] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:44:36] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:44:37] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
[2024-06-01 19:44:37] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1249 variables, 20/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:44:37] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 4 ms to minimize.
[2024-06-01 19:44:37] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 1 ms to minimize.
[2024-06-01 19:44:37] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2024-06-01 19:44:37] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:44:37] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 1 ms to minimize.
[2024-06-01 19:44:37] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 1 ms to minimize.
[2024-06-01 19:44:38] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2024-06-01 19:44:38] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:44:38] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 1 ms to minimize.
[2024-06-01 19:44:38] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:44:38] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:44:38] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:44:38] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 1 ms to minimize.
[2024-06-01 19:44:38] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:44:38] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 1 ms to minimize.
[2024-06-01 19:44:39] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:44:39] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:44:39] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:44:39] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2024-06-01 19:44:39] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1249 variables, 20/760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:44:39] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:44:39] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2024-06-01 19:44:39] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 1 ms to minimize.
[2024-06-01 19:44:40] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:44:40] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:44:40] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 1 ms to minimize.
[2024-06-01 19:44:40] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:44:40] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:44:40] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-06-01 19:44:40] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:44:40] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:44:41] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:44:41] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:44:41] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:44:41] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:44:41] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:44:41] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:44:41] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:44:41] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:44:41] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1249 variables, 20/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:44:41] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-06-01 19:44:41] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:44:41] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:44:42] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-06-01 19:44:42] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-06-01 19:44:42] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:44:42] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:44:42] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:44:42] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:44:42] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:44:42] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:44:42] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:44:42] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2024-06-01 19:44:42] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:44:43] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:44:43] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:44:43] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:44:43] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:44:43] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:44:43] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1249 variables, 20/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:44:43] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:44:43] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:44:43] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:44:43] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:44:43] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:44:43] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:44:44] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:44:44] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:44:44] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:44:44] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:44:44] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:44:44] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:44:44] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:44:44] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:44:44] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:44:44] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 0 ms to minimize.
[2024-06-01 19:44:44] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:44:44] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:44:44] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:44:45] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1249 variables, 20/820 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:44:45] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:44:45] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2024-06-01 19:44:45] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:44:45] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:44:45] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:44:45] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:44:45] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:44:45] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:44:45] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1249 variables, 9/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1249 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/1251 variables, 1/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1251 variables, 2/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1251 variables, 0/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 62/1313 variables, 22/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1313 variables, 3/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1313 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 7/1320 variables, 4/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1320 variables, 5/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1320 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 63/1383 variables, 26/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1383 variables, 6/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1383 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 4/1387 variables, 2/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1387 variables, 4/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:44:46] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1387 variables, 1/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1387 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 62/1449 variables, 24/929 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1449 variables, 6/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1449 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 4/1453 variables, 2/937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1453 variables, 4/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:44:46] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/1453 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1453 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 62/1515 variables, 24/966 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1515 variables, 6/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:44:46] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:44:46] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
At refinement iteration 45 (INCLUDED_ONLY) 0/1515 variables, 2/974 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1515 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 4/1519 variables, 2/976 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1519 variables, 4/980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1519 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 62/1581 variables, 24/1004 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1581 variables, 6/1010 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1581 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 4/1585 variables, 2/1012 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1585 variables, 4/1016 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:44:46] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
At refinement iteration 55 (INCLUDED_ONLY) 0/1585 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1585 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 62/1647 variables, 24/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1647 variables, 6/1047 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1647 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 4/1651 variables, 2/1049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1651 variables, 4/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:44:46] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
At refinement iteration 62 (INCLUDED_ONLY) 0/1651 variables, 1/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1651 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 29/1680 variables, 17/1071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1680 variables, 5/1076 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:44:47] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
At refinement iteration 66 (INCLUDED_ONLY) 0/1680 variables, 1/1077 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1680 variables, 0/1077 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 2/1682 variables, 2/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1682 variables, 1/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:44:47] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
At refinement iteration 70 (INCLUDED_ONLY) 0/1682 variables, 1/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1682 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 0/1682 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1682/1682 variables, and 1081 constraints, problems are : Problem set: 0 solved, 1 unsolved in 17618 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 716/716 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 163/163 constraints]
After SMT, in 18260ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 237 ms.
Support contains 3 out of 716 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 716/716 places, 966/966 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 716 transition count 964
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 714 transition count 964
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 714 transition count 962
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 712 transition count 962
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 707 transition count 957
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 705 transition count 955
Applied a total of 20 rules in 135 ms. Remains 705 /716 variables (removed 11) and now considering 955/966 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 705/716 places, 955/966 transitions.
RANDOM walk for 40000 steps (67 resets) in 309 ms. (129 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 463534 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 1
Probabilistic random walk after 463534 steps, saw 454153 distinct states, run finished after 3008 ms. (steps per millisecond=154 ) properties seen :0
// Phase 1: matrix 955 rows 705 cols
[2024-06-01 19:44:50] [INFO ] Computed 201 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 236/260 variables, 68/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 358/618 variables, 260/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/618 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 56/674 variables, 21/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/674 variables, 5/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/674 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/676 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/676 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/676 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 60/736 variables, 22/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/736 variables, 5/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/736 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/740 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/740 variables, 4/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/740 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/802 variables, 24/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/802 variables, 6/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/802 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/806 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/806 variables, 4/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/806 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 62/868 variables, 24/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/868 variables, 6/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/868 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/872 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/872 variables, 4/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/872 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 62/934 variables, 24/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/934 variables, 6/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/934 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 4/938 variables, 2/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/938 variables, 4/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/938 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 62/1000 variables, 24/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1000 variables, 6/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1000 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 4/1004 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1004 variables, 4/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1004 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 62/1066 variables, 24/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1066 variables, 6/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1066 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 4/1070 variables, 2/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1070 variables, 4/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1070 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 62/1132 variables, 24/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1132 variables, 6/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1132 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 4/1136 variables, 2/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1136 variables, 4/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1136 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 62/1198 variables, 24/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1198 variables, 6/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1198 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 4/1202 variables, 2/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1202 variables, 4/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1202 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 62/1264 variables, 24/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1264 variables, 6/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1264 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 4/1268 variables, 2/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1268 variables, 4/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1268 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 62/1330 variables, 24/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1330 variables, 6/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1330 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 4/1334 variables, 2/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1334 variables, 4/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1334 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 62/1396 variables, 24/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1396 variables, 6/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1396 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 4/1400 variables, 2/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1400 variables, 4/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1400 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 62/1462 variables, 24/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1462 variables, 6/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1462 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 4/1466 variables, 2/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1466 variables, 4/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1466 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 62/1528 variables, 24/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1528 variables, 6/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1528 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 4/1532 variables, 2/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1532 variables, 4/828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1532 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 62/1594 variables, 24/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1594 variables, 6/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1594 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 4/1598 variables, 2/860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1598 variables, 4/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1598 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 54/1652 variables, 24/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1652 variables, 6/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1652 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 4/1656 variables, 2/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1656 variables, 4/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1656 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 4/1660 variables, 4/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1660 variables, 2/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1660 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 0/1660 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1660/1660 variables, and 906 constraints, problems are : Problem set: 0 solved, 1 unsolved in 814 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 705/705 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 236/260 variables, 68/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:44:51] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:44:51] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:44:52] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:44:52] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:44:52] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:44:52] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:44:52] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 2 ms to minimize.
[2024-06-01 19:44:52] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 358/618 variables, 260/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:44:52] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/618 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/618 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/674 variables, 21/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/674 variables, 5/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/674 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:44:52] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:44:52] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:44:52] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:44:52] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:44:52] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:44:53] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-06-01 19:44:53] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:44:53] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:44:53] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:44:53] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:44:53] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:44:53] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:44:53] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:44:53] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:44:53] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2024-06-01 19:44:53] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:44:53] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:44:54] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:44:54] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:44:54] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/674 variables, 20/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:44:54] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:44:54] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:44:54] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:44:54] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 0 ms to minimize.
[2024-06-01 19:44:54] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:44:54] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:44:54] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2024-06-01 19:44:54] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:44:54] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:44:54] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:44:54] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:44:55] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:44:55] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:44:55] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:44:55] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:44:55] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:44:55] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2024-06-01 19:44:55] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:44:55] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:44:55] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/674 variables, 20/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:44:55] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:44:55] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:44:55] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-06-01 19:44:55] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:44:55] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:44:55] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:44:56] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:44:56] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:44:56] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:44:56] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:44:56] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 0 ms to minimize.
[2024-06-01 19:44:56] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:44:56] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:44:56] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:44:56] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:44:56] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:44:56] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:44:56] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:44:56] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-01 19:44:56] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/674 variables, 20/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:44:57] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:44:57] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 3 ms to minimize.
[2024-06-01 19:44:57] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:44:57] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:44:57] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:44:57] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:44:57] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:44:57] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:44:57] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 0 ms to minimize.
[2024-06-01 19:44:57] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:44:57] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 0 ms to minimize.
[2024-06-01 19:44:57] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:44:57] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:44:57] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:44:57] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:44:58] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:44:58] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:44:58] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:44:58] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:44:58] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/674 variables, 20/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:44:58] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:44:58] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:44:58] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:44:58] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:44:58] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:44:58] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 0 ms to minimize.
[2024-06-01 19:44:58] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:44:58] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:44:58] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:44:59] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2024-06-01 19:44:59] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:44:59] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2024-06-01 19:44:59] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:44:59] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 0 ms to minimize.
[2024-06-01 19:44:59] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:44:59] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:44:59] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 0 ms to minimize.
[2024-06-01 19:44:59] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:44:59] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:44:59] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/674 variables, 20/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:44:59] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2024-06-01 19:44:59] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:44:59] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:44:59] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:45:00] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:45:00] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:45:00] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:45:00] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:45:00] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:45:00] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 0 ms to minimize.
[2024-06-01 19:45:00] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:45:00] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:45:00] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:45:00] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2024-06-01 19:45:00] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:45:00] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:45:00] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:45:00] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:45:01] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:45:01] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/674 variables, 20/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:45:01] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:45:01] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:45:01] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:45:01] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:45:01] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:45:01] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:45:01] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:45:01] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:45:01] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:45:01] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:45:01] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:45:02] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:45:02] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:45:02] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2024-06-01 19:45:02] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:45:02] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:45:02] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:45:02] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:45:02] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:45:02] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/674 variables, 20/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:45:02] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:45:02] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/674 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/674 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/676 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/676 variables, 2/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:45:02] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/676 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/676 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 60/736 variables, 22/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/736 variables, 5/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/736 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/740 variables, 2/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/740 variables, 4/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:45:03] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/740 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/740 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 62/802 variables, 24/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/802 variables, 6/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:45:03] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/802 variables, 1/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/802 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 4/806 variables, 2/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/806 variables, 4/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:45:03] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/806 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/806 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 62/868 variables, 24/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/868 variables, 6/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:45:03] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/868 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/868 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 4/872 variables, 2/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/872 variables, 4/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/872 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 62/934 variables, 24/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/934 variables, 6/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/934 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 4/938 variables, 2/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/938 variables, 4/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/938 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 62/1000 variables, 24/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1000 variables, 6/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1000 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 4/1004 variables, 2/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1004 variables, 4/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1004 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 62/1066 variables, 24/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1066 variables, 6/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1066 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 4/1070 variables, 2/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1070 variables, 4/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1070 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 62/1132 variables, 24/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1132 variables, 6/763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1132 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 4/1136 variables, 2/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1136 variables, 4/769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1136 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 62/1198 variables, 24/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1198 variables, 6/799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1198 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 4/1202 variables, 2/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1202 variables, 4/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1202 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 62/1264 variables, 24/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1264 variables, 6/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1264 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 4/1268 variables, 2/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1268 variables, 4/841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1268 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 62/1330 variables, 24/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1330 variables, 6/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1330 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 4/1334 variables, 2/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1334 variables, 4/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1334 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 62/1396 variables, 24/901 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1396 variables, 6/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:45:04] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:45:04] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
At refinement iteration 91 (INCLUDED_ONLY) 0/1396 variables, 2/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1396 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 4/1400 variables, 2/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1400 variables, 4/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1400 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 62/1462 variables, 24/939 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1462 variables, 6/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1462 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 4/1466 variables, 2/947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1466 variables, 4/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1466 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 62/1528 variables, 24/975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1528 variables, 6/981 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1528 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 4/1532 variables, 2/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1532 variables, 4/987 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1532 variables, 0/987 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 62/1594 variables, 24/1011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1594 variables, 6/1017 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1594 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 4/1598 variables, 2/1019 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1598 variables, 4/1023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1598 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 54/1652 variables, 24/1047 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1652 variables, 6/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1652 variables, 0/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (OVERLAPS) 4/1656 variables, 2/1055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1656 variables, 4/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1656 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (OVERLAPS) 4/1660 variables, 4/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1660 variables, 2/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1660 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 0/1660 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1660/1660 variables, and 1065 constraints, problems are : Problem set: 0 solved, 1 unsolved in 13091 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 705/705 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 158/158 constraints]
After SMT, in 13929ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 286 ms.
Support contains 3 out of 705 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 705/705 places, 955/955 transitions.
Applied a total of 0 rules in 20 ms. Remains 705 /705 variables (removed 0) and now considering 955/955 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 705/705 places, 955/955 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 705/705 places, 955/955 transitions.
Applied a total of 0 rules in 28 ms. Remains 705 /705 variables (removed 0) and now considering 955/955 (removed 0) transitions.
[2024-06-01 19:45:05] [INFO ] Invariant cache hit.
[2024-06-01 19:45:05] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-06-01 19:45:05] [INFO ] Invariant cache hit.
[2024-06-01 19:45:06] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 1108 ms to find 0 implicit places.
[2024-06-01 19:45:06] [INFO ] Redundant transitions in 125 ms returned []
Running 952 sub problems to find dead transitions.
[2024-06-01 19:45:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:45:17] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:45:18] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:45:18] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:45:19] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:45:19] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:45:19] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 3 ms to minimize.
[2024-06-01 19:45:19] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:45:19] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:45:19] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:45:20] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:45:20] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2024-06-01 19:45:20] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:45:20] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:45:20] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:45:20] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:45:21] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:45:21] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:45:22] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:45:22] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:45:23] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:45:25] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:45:26] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:45:26] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:45:26] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:45:26] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:45:26] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:45:26] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 3 ms to minimize.
[2024-06-01 19:45:27] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:45:27] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:45:28] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:45:28] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:45:28] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:45:28] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:45:28] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:45:28] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:45:28] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:45:29] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-06-01 19:45:29] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:45:29] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:45:29] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:45:30] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:45:30] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:45:30] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:45:30] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:45:30] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2024-06-01 19:45:30] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 0 ms to minimize.
[2024-06-01 19:45:31] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 3 ms to minimize.
[2024-06-01 19:45:31] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:45:31] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 0 ms to minimize.
[2024-06-01 19:45:31] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:45:31] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:45:31] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:45:31] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:45:31] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:45:31] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:45:32] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:45:32] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:45:32] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:45:32] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:45:32] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 703/1660 variables, and 187 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 127/201 constraints, State Equation: 0/705 constraints, PredecessorRefiner: 952/952 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 952 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 60/187 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:45:38] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 19:45:38] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:45:38] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:45:38] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:45:38] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2024-06-01 19:45:38] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2024-06-01 19:45:39] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 1 ms to minimize.
[2024-06-01 19:45:39] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:45:39] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 1 ms to minimize.
[2024-06-01 19:45:39] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:45:39] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 1 ms to minimize.
[2024-06-01 19:45:39] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:45:40] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 1 ms to minimize.
[2024-06-01 19:45:40] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:45:40] [INFO ] Deduced a trap composed of 75 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:45:40] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:45:40] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:45:40] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:45:40] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:45:40] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:45:41] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:45:42] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 0 ms to minimize.
[2024-06-01 19:45:42] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:45:42] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:45:42] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:45:42] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:45:42] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:45:42] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:45:42] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 0 ms to minimize.
[2024-06-01 19:45:42] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:45:42] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:45:42] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:45:43] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:45:43] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:45:43] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:45:43] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:45:43] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:45:43] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:45:43] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:45:43] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:45:44] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:45:45] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:45:45] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:45:45] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:45:45] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:45:45] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 0 ms to minimize.
[2024-06-01 19:45:45] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:45:45] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:45:45] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:45:45] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:45:45] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:45:45] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:45:45] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 0 ms to minimize.
[2024-06-01 19:45:46] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:45:46] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:45:46] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:45:46] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:45:46] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:45:46] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 1 ms to minimize.
[2024-06-01 19:45:46] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:45:47] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:45:47] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 0 ms to minimize.
[2024-06-01 19:45:48] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:45:48] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:45:48] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:45:48] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:45:48] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:45:48] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:45:48] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:45:48] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:45:48] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:45:48] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:45:48] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:45:49] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 0 ms to minimize.
[2024-06-01 19:45:49] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:45:49] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:45:49] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:45:49] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:45:49] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:45:49] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/703 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:45:50] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:45:51] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:45:51] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:45:51] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:45:51] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:45:51] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:45:51] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:45:51] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:45:51] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:45:51] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:45:51] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:45:51] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:45:51] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:45:51] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:45:51] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:45:52] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:45:52] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:45:52] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:45:52] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:45:52] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:45:53] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:45:54] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:45:54] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:45:54] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:45:54] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:45:54] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:45:54] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 2 ms to minimize.
[2024-06-01 19:45:55] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:45:55] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 4 ms to minimize.
[2024-06-01 19:45:55] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:45:55] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:45:55] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:45:55] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 1 ms to minimize.
[2024-06-01 19:45:55] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:45:56] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:45:56] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:45:56] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 1 ms to minimize.
[2024-06-01 19:45:56] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:45:56] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 1 ms to minimize.
[2024-06-01 19:45:56] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 20/307 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:45:58] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:45:58] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:45:58] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:45:58] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:45:58] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:45:58] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:45:58] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:45:58] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:45:58] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:45:59] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:45:59] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 1 ms to minimize.
[2024-06-01 19:45:59] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:45:59] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 1 ms to minimize.
[2024-06-01 19:45:59] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 1 ms to minimize.
[2024-06-01 19:45:59] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 1 ms to minimize.
[2024-06-01 19:45:59] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:46:00] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:46:00] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:46:00] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 1 ms to minimize.
[2024-06-01 19:46:00] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 20/327 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:46:01] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:46:02] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:46:02] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 0 ms to minimize.
[2024-06-01 19:46:02] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 0 ms to minimize.
[2024-06-01 19:46:02] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:46:02] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:46:02] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:46:02] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:46:02] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:46:02] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:46:02] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:46:02] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:46:03] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:46:04] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:46:05] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:46:05] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:46:05] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 1 ms to minimize.
[2024-06-01 19:46:05] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 1 ms to minimize.
[2024-06-01 19:46:05] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:46:05] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/703 variables, 20/347 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 703/1660 variables, and 347 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 127/201 constraints, State Equation: 0/705 constraints, PredecessorRefiner: 0/952 constraints, Known Traps: 220/220 constraints]
After SMT, in 60330ms problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 60339ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61610 ms. Remains : 705/705 places, 955/955 transitions.
[2024-06-01 19:46:06] [INFO ] Flatten gal took : 70 ms
[2024-06-01 19:46:06] [INFO ] Flatten gal took : 62 ms
[2024-06-01 19:46:07] [INFO ] Input system was already deterministic with 1949 transitions.
Computed a total of 422 stabilizing places and 422 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 1653 transition count 1903
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 1653 transition count 1903
Applied a total of 92 rules in 86 ms. Remains 1653 /1699 variables (removed 46) and now considering 1903/1949 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 1653/1699 places, 1903/1949 transitions.
[2024-06-01 19:46:07] [INFO ] Flatten gal took : 53 ms
[2024-06-01 19:46:07] [INFO ] Flatten gal took : 55 ms
[2024-06-01 19:46:07] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1658 transition count 1908
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1658 transition count 1908
Applied a total of 82 rules in 84 ms. Remains 1658 /1699 variables (removed 41) and now considering 1908/1949 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 1658/1699 places, 1908/1949 transitions.
[2024-06-01 19:46:07] [INFO ] Flatten gal took : 50 ms
[2024-06-01 19:46:07] [INFO ] Flatten gal took : 53 ms
[2024-06-01 19:46:07] [INFO ] Input system was already deterministic with 1908 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1698 transition count 1749
Reduce places removed 199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 200 rules applied. Total rules applied 399 place count 1499 transition count 1748
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 1498 transition count 1748
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 400 place count 1498 transition count 1498
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 900 place count 1248 transition count 1498
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 946 place count 1202 transition count 1452
Iterating global reduction 3 with 46 rules applied. Total rules applied 992 place count 1202 transition count 1452
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 992 place count 1202 transition count 1436
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 1024 place count 1186 transition count 1436
Performed 474 Post agglomeration using F-continuation condition.Transition count delta: 474
Deduced a syphon composed of 474 places in 2 ms
Reduce places removed 474 places and 0 transitions.
Iterating global reduction 3 with 948 rules applied. Total rules applied 1972 place count 712 transition count 962
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1974 place count 710 transition count 960
Applied a total of 1974 rules in 294 ms. Remains 710 /1699 variables (removed 989) and now considering 960/1949 (removed 989) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 294 ms. Remains : 710/1699 places, 960/1949 transitions.
[2024-06-01 19:46:08] [INFO ] Flatten gal took : 30 ms
[2024-06-01 19:46:08] [INFO ] Flatten gal took : 30 ms
[2024-06-01 19:46:08] [INFO ] Input system was already deterministic with 960 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1698 transition count 1748
Reduce places removed 200 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 201 rules applied. Total rules applied 401 place count 1498 transition count 1747
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 402 place count 1497 transition count 1747
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 248 Pre rules applied. Total rules applied 402 place count 1497 transition count 1499
Deduced a syphon composed of 248 places in 2 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 3 with 496 rules applied. Total rules applied 898 place count 1249 transition count 1499
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 944 place count 1203 transition count 1453
Iterating global reduction 3 with 46 rules applied. Total rules applied 990 place count 1203 transition count 1453
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 990 place count 1203 transition count 1437
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 1022 place count 1187 transition count 1437
Performed 478 Post agglomeration using F-continuation condition.Transition count delta: 478
Deduced a syphon composed of 478 places in 2 ms
Reduce places removed 478 places and 0 transitions.
Iterating global reduction 3 with 956 rules applied. Total rules applied 1978 place count 709 transition count 959
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1980 place count 707 transition count 957
Applied a total of 1980 rules in 248 ms. Remains 707 /1699 variables (removed 992) and now considering 957/1949 (removed 992) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 250 ms. Remains : 707/1699 places, 957/1949 transitions.
[2024-06-01 19:46:08] [INFO ] Flatten gal took : 30 ms
[2024-06-01 19:46:08] [INFO ] Flatten gal took : 32 ms
[2024-06-01 19:46:08] [INFO ] Input system was already deterministic with 957 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1698 transition count 1747
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1497 transition count 1747
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1497 transition count 1497
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1247 transition count 1497
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 949 place count 1200 transition count 1450
Iterating global reduction 2 with 47 rules applied. Total rules applied 996 place count 1200 transition count 1450
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 996 place count 1200 transition count 1433
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 1030 place count 1183 transition count 1433
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 477
Deduced a syphon composed of 477 places in 2 ms
Reduce places removed 477 places and 0 transitions.
Iterating global reduction 2 with 954 rules applied. Total rules applied 1984 place count 706 transition count 956
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1986 place count 704 transition count 954
Applied a total of 1986 rules in 262 ms. Remains 704 /1699 variables (removed 995) and now considering 954/1949 (removed 995) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 262 ms. Remains : 704/1699 places, 954/1949 transitions.
[2024-06-01 19:46:08] [INFO ] Flatten gal took : 39 ms
[2024-06-01 19:46:08] [INFO ] Flatten gal took : 35 ms
[2024-06-01 19:46:09] [INFO ] Input system was already deterministic with 954 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 1654 transition count 1904
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 1654 transition count 1904
Applied a total of 90 rules in 88 ms. Remains 1654 /1699 variables (removed 45) and now considering 1904/1949 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 1654/1699 places, 1904/1949 transitions.
[2024-06-01 19:46:09] [INFO ] Flatten gal took : 48 ms
[2024-06-01 19:46:09] [INFO ] Flatten gal took : 49 ms
[2024-06-01 19:46:09] [INFO ] Input system was already deterministic with 1904 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 1655 transition count 1905
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 1655 transition count 1905
Applied a total of 88 rules in 88 ms. Remains 1655 /1699 variables (removed 44) and now considering 1905/1949 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 1655/1699 places, 1905/1949 transitions.
[2024-06-01 19:46:09] [INFO ] Flatten gal took : 47 ms
[2024-06-01 19:46:09] [INFO ] Flatten gal took : 48 ms
[2024-06-01 19:46:09] [INFO ] Input system was already deterministic with 1905 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 1654 transition count 1904
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 1654 transition count 1904
Applied a total of 90 rules in 88 ms. Remains 1654 /1699 variables (removed 45) and now considering 1904/1949 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 1654/1699 places, 1904/1949 transitions.
[2024-06-01 19:46:09] [INFO ] Flatten gal took : 47 ms
[2024-06-01 19:46:09] [INFO ] Flatten gal took : 47 ms
[2024-06-01 19:46:10] [INFO ] Input system was already deterministic with 1904 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1699 transition count 1751
Reduce places removed 198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 199 rules applied. Total rules applied 397 place count 1501 transition count 1750
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 398 place count 1500 transition count 1750
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 248 Pre rules applied. Total rules applied 398 place count 1500 transition count 1502
Deduced a syphon composed of 248 places in 3 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 3 with 496 rules applied. Total rules applied 894 place count 1252 transition count 1502
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 937 place count 1209 transition count 1459
Iterating global reduction 3 with 43 rules applied. Total rules applied 980 place count 1209 transition count 1459
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 980 place count 1209 transition count 1444
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 1010 place count 1194 transition count 1444
Performed 479 Post agglomeration using F-continuation condition.Transition count delta: 479
Deduced a syphon composed of 479 places in 1 ms
Reduce places removed 479 places and 0 transitions.
Iterating global reduction 3 with 958 rules applied. Total rules applied 1968 place count 715 transition count 965
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 1968 rules in 172 ms. Remains 715 /1699 variables (removed 984) and now considering 965/1949 (removed 984) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 173 ms. Remains : 715/1699 places, 965/1949 transitions.
[2024-06-01 19:46:10] [INFO ] Flatten gal took : 31 ms
[2024-06-01 19:46:10] [INFO ] Flatten gal took : 33 ms
[2024-06-01 19:46:10] [INFO ] Input system was already deterministic with 965 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 1662 transition count 1912
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 1662 transition count 1912
Applied a total of 74 rules in 84 ms. Remains 1662 /1699 variables (removed 37) and now considering 1912/1949 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 1662/1699 places, 1912/1949 transitions.
[2024-06-01 19:46:10] [INFO ] Flatten gal took : 43 ms
[2024-06-01 19:46:10] [INFO ] Flatten gal took : 44 ms
[2024-06-01 19:46:10] [INFO ] Input system was already deterministic with 1912 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1698 transition count 1747
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1497 transition count 1747
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 402 place count 1497 transition count 1498
Deduced a syphon composed of 249 places in 2 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 900 place count 1248 transition count 1498
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 946 place count 1202 transition count 1452
Iterating global reduction 2 with 46 rules applied. Total rules applied 992 place count 1202 transition count 1452
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 992 place count 1202 transition count 1436
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 1024 place count 1186 transition count 1436
Performed 481 Post agglomeration using F-continuation condition.Transition count delta: 481
Deduced a syphon composed of 481 places in 1 ms
Reduce places removed 481 places and 0 transitions.
Iterating global reduction 2 with 962 rules applied. Total rules applied 1986 place count 705 transition count 955
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1988 place count 703 transition count 953
Applied a total of 1988 rules in 170 ms. Remains 703 /1699 variables (removed 996) and now considering 953/1949 (removed 996) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 171 ms. Remains : 703/1699 places, 953/1949 transitions.
[2024-06-01 19:46:10] [INFO ] Flatten gal took : 31 ms
[2024-06-01 19:46:10] [INFO ] Flatten gal took : 25 ms
[2024-06-01 19:46:10] [INFO ] Input system was already deterministic with 953 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 1653 transition count 1903
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 1653 transition count 1903
Applied a total of 92 rules in 81 ms. Remains 1653 /1699 variables (removed 46) and now considering 1903/1949 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 1653/1699 places, 1903/1949 transitions.
[2024-06-01 19:46:11] [INFO ] Flatten gal took : 43 ms
[2024-06-01 19:46:11] [INFO ] Flatten gal took : 44 ms
[2024-06-01 19:46:11] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1665 transition count 1915
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1665 transition count 1915
Applied a total of 68 rules in 80 ms. Remains 1665 /1699 variables (removed 34) and now considering 1915/1949 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 1665/1699 places, 1915/1949 transitions.
[2024-06-01 19:46:11] [INFO ] Flatten gal took : 46 ms
[2024-06-01 19:46:11] [INFO ] Flatten gal took : 48 ms
[2024-06-01 19:46:11] [INFO ] Input system was already deterministic with 1915 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1698 transition count 1749
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1499 transition count 1749
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 248 Pre rules applied. Total rules applied 398 place count 1499 transition count 1501
Deduced a syphon composed of 248 places in 2 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 2 with 496 rules applied. Total rules applied 894 place count 1251 transition count 1501
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 940 place count 1205 transition count 1455
Iterating global reduction 2 with 46 rules applied. Total rules applied 986 place count 1205 transition count 1455
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 986 place count 1205 transition count 1440
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 1016 place count 1190 transition count 1440
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 480
Deduced a syphon composed of 480 places in 1 ms
Reduce places removed 480 places and 0 transitions.
Iterating global reduction 2 with 960 rules applied. Total rules applied 1976 place count 710 transition count 960
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1978 place count 708 transition count 958
Applied a total of 1978 rules in 238 ms. Remains 708 /1699 variables (removed 991) and now considering 958/1949 (removed 991) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 238 ms. Remains : 708/1699 places, 958/1949 transitions.
[2024-06-01 19:46:11] [INFO ] Flatten gal took : 22 ms
[2024-06-01 19:46:11] [INFO ] Flatten gal took : 25 ms
[2024-06-01 19:46:11] [INFO ] Input system was already deterministic with 958 transitions.
[2024-06-01 19:46:11] [INFO ] Flatten gal took : 46 ms
[2024-06-01 19:46:11] [INFO ] Flatten gal took : 45 ms
[2024-06-01 19:46:11] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 19:46:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1699 places, 1949 transitions and 6592 arcs took 10 ms.
Total runtime 176796 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldRVs-PT-050B-CTLCardinality-2024-00
Could not compute solution for formula : ShieldRVs-PT-050B-CTLCardinality-2024-02
Could not compute solution for formula : ShieldRVs-PT-050B-CTLCardinality-2024-03
Could not compute solution for formula : ShieldRVs-PT-050B-CTLCardinality-2024-04
Could not compute solution for formula : ShieldRVs-PT-050B-CTLCardinality-2024-05
Could not compute solution for formula : ShieldRVs-PT-050B-CTLCardinality-2024-07
Could not compute solution for formula : ShieldRVs-PT-050B-CTLCardinality-2024-08
Could not compute solution for formula : ShieldRVs-PT-050B-CTLCardinality-2024-09
Could not compute solution for formula : ShieldRVs-PT-050B-CTLCardinality-2024-10
Could not compute solution for formula : ShieldRVs-PT-050B-CTLCardinality-2024-11
Could not compute solution for formula : ShieldRVs-PT-050B-CTLCardinality-2023-12
Could not compute solution for formula : ShieldRVs-PT-050B-CTLCardinality-2023-13
Could not compute solution for formula : ShieldRVs-PT-050B-CTLCardinality-2023-14
Could not compute solution for formula : ShieldRVs-PT-050B-CTLCardinality-2023-15

BK_STOP 1717271172362

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldRVs-PT-050B-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/2261/ctl_0_
ctl formula name ShieldRVs-PT-050B-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/2261/ctl_1_
ctl formula name ShieldRVs-PT-050B-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/2261/ctl_2_
ctl formula name ShieldRVs-PT-050B-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/2261/ctl_3_
ctl formula name ShieldRVs-PT-050B-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/2261/ctl_4_
ctl formula name ShieldRVs-PT-050B-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/2261/ctl_5_
ctl formula name ShieldRVs-PT-050B-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/2261/ctl_6_
ctl formula name ShieldRVs-PT-050B-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/2261/ctl_7_
ctl formula name ShieldRVs-PT-050B-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/2261/ctl_8_
ctl formula name ShieldRVs-PT-050B-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/2261/ctl_9_
ctl formula name ShieldRVs-PT-050B-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/2261/ctl_10_
ctl formula name ShieldRVs-PT-050B-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/2261/ctl_11_
ctl formula name ShieldRVs-PT-050B-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/2261/ctl_12_
ctl formula name ShieldRVs-PT-050B-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/2261/ctl_13_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ShieldRVs-PT-050B"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 ltsminxred"
echo " Input is ShieldRVs-PT-050B, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683762000857"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-050B.tgz
mv ShieldRVs-PT-050B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;