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.r355-tall-171683759200649.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ShieldPPPt-PT-030B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759200649
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 14:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 14:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 569K 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 ShieldPPPt-PT-030B-CTLCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2024-04
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2023-12
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2023-13
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2023-14
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717017909178

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 21:25:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 21:25:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 21:25:10] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2024-05-29 21:25:10] [INFO ] Transformed 2343 places.
[2024-05-29 21:25:10] [INFO ] Transformed 2133 transitions.
[2024-05-29 21:25:10] [INFO ] Found NUPN structural information;
[2024-05-29 21:25:10] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 357 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
FORMULA ShieldPPPt-PT-030B-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 142 out of 2343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Discarding 295 places :
Symmetric choice reduction at 0 with 295 rule applications. Total rules 295 place count 2048 transition count 1838
Iterating global reduction 0 with 295 rules applied. Total rules applied 590 place count 2048 transition count 1838
Applied a total of 590 rules in 447 ms. Remains 2048 /2343 variables (removed 295) and now considering 1838/2133 (removed 295) transitions.
// Phase 1: matrix 1838 rows 2048 cols
[2024-05-29 21:25:11] [INFO ] Computed 331 invariants in 38 ms
[2024-05-29 21:25:12] [INFO ] Implicit Places using invariants in 898 ms returned []
[2024-05-29 21:25:12] [INFO ] Invariant cache hit.
[2024-05-29 21:25:13] [INFO ] Implicit Places using invariants and state equation in 1569 ms returned []
Implicit Place search using SMT with State Equation took 2498 ms to find 0 implicit places.
Running 1837 sub problems to find dead transitions.
[2024-05-29 21:25:13] [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 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2047/3886 variables, and 0 constraints, problems are : Problem set: 0 solved, 1837 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2048 constraints, PredecessorRefiner: 1837/1837 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1837 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2047/3886 variables, and 0 constraints, problems are : Problem set: 0 solved, 1837 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2048 constraints, PredecessorRefiner: 0/1837 constraints, Known Traps: 0/0 constraints]
After SMT, in 60669ms problems are : Problem set: 0 solved, 1837 unsolved
Search for dead transitions found 0 dead transitions in 60712ms
Starting structural reductions in LTL mode, iteration 1 : 2048/2343 places, 1838/2133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63690 ms. Remains : 2048/2343 places, 1838/2133 transitions.
Support contains 142 out of 2048 places after structural reductions.
[2024-05-29 21:26:14] [INFO ] Flatten gal took : 131 ms
[2024-05-29 21:26:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldPPPt-PT-030B-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 21:26:14] [INFO ] Flatten gal took : 74 ms
[2024-05-29 21:26:15] [INFO ] Input system was already deterministic with 1838 transitions.
Support contains 83 out of 2048 places (down from 142) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2285 ms. (17 steps per ms) remains 19/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
[2024-05-29 21:26:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 430/463 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 1585/2048 variables, 276/331 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2048 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 1838/3886 variables, 2048/2379 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3886 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/3886 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3886/3886 variables, and 2379 constraints, problems are : Problem set: 0 solved, 19 unsolved in 3418 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 2048/2048 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 430/463 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 21:26:19] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 1585/2048 variables, 276/332 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 21:26:20] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 4 ms to minimize.
[2024-05-29 21:26:20] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 4 ms to minimize.
[2024-05-29 21:26:20] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 3 ms to minimize.
[2024-05-29 21:26:21] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 3 ms to minimize.
[2024-05-29 21:26:21] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 3 ms to minimize.
[2024-05-29 21:26:21] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 3 ms to minimize.
[2024-05-29 21:26:21] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 3 ms to minimize.
[2024-05-29 21:26:21] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 3 ms to minimize.
[2024-05-29 21:26:21] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 2 ms to minimize.
[2024-05-29 21:26:21] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 3 ms to minimize.
[2024-05-29 21:26:22] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 3 ms to minimize.
[2024-05-29 21:26:22] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 3 ms to minimize.
[2024-05-29 21:26:22] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 3 ms to minimize.
[2024-05-29 21:26:22] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 2 ms to minimize.
[2024-05-29 21:26:22] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 3 ms to minimize.
[2024-05-29 21:26:22] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-29 21:26:22] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
[2024-05-29 21:26:23] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2024-05-29 21:26:23] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-29 21:26:23] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2048 variables, 20/352 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 21:26:23] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2048 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2048/3886 variables, and 353 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/2048 constraints, PredecessorRefiner: 0/19 constraints, Known Traps: 22/22 constraints]
After SMT, in 8451ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 2048 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 408 transitions
Trivial Post-agglo rules discarded 408 transitions
Performed 408 trivial Post agglomeration. Transition count delta: 408
Iterating post reduction 0 with 408 rules applied. Total rules applied 408 place count 2048 transition count 1430
Reduce places removed 408 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 410 rules applied. Total rules applied 818 place count 1640 transition count 1428
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 824 place count 1639 transition count 1423
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 829 place count 1634 transition count 1423
Performed 220 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 220 Pre rules applied. Total rules applied 829 place count 1634 transition count 1203
Deduced a syphon composed of 220 places in 2 ms
Reduce places removed 220 places and 0 transitions.
Iterating global reduction 4 with 440 rules applied. Total rules applied 1269 place count 1414 transition count 1203
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1285 place count 1398 transition count 1187
Iterating global reduction 4 with 16 rules applied. Total rules applied 1301 place count 1398 transition count 1187
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 1301 place count 1398 transition count 1177
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1321 place count 1388 transition count 1177
Performed 513 Post agglomeration using F-continuation condition.Transition count delta: 513
Deduced a syphon composed of 513 places in 2 ms
Reduce places removed 513 places and 0 transitions.
Iterating global reduction 4 with 1026 rules applied. Total rules applied 2347 place count 875 transition count 664
Renaming transitions due to excessive name length > 1024 char.
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 2515 place count 791 transition count 664
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 2518 place count 791 transition count 661
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 2521 place count 788 transition count 661
Partial Free-agglomeration rule applied 83 times.
Drop transitions (Partial Free agglomeration) removed 83 transitions
Iterating global reduction 5 with 83 rules applied. Total rules applied 2604 place count 788 transition count 661
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2605 place count 787 transition count 660
Applied a total of 2605 rules in 484 ms. Remains 787 /2048 variables (removed 1261) and now considering 660/1838 (removed 1178) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 484 ms. Remains : 787/2048 places, 660/1838 transitions.
RANDOM walk for 40000 steps (8 resets) in 1132 ms. (35 steps per ms) remains 14/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 247 ms. (161 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 340 ms. (117 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 325 ms. (122 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 290 ms. (137 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 194 ms. (205 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 168 ms. (236 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 153 ms. (259 steps per ms) remains 14/14 properties
// Phase 1: matrix 660 rows 787 cols
[2024-05-29 21:26:26] [INFO ] Computed 331 invariants in 7 ms
[2024-05-29 21:26:26] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 77/100 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 40/140 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 165/305 variables, 140/189 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 8/197 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 230/535 variables, 121/318 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 42/360 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 16/551 variables, 15/375 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/551 variables, 14/389 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/551 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 30/581 variables, 15/404 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/581 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 252/833 variables, 150/554 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/833 variables, 40/594 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/833 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (OVERLAPS) 14/847 variables, 16/610 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/847 variables, 14/624 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/847 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (OVERLAPS) 22/869 variables, 11/635 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/869 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 24 (OVERLAPS) 218/1087 variables, 135/770 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1087 variables, 43/813 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1087 variables, 1/814 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1087 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 28 (OVERLAPS) 11/1098 variables, 11/825 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1098 variables, 11/836 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1098 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 31 (OVERLAPS) 20/1118 variables, 10/846 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1118 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 33 (OVERLAPS) 120/1238 variables, 79/925 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1238 variables, 17/942 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1238 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 36 (OVERLAPS) 8/1246 variables, 11/953 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1246 variables, 4/957 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1246 variables, 0/957 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 39 (OVERLAPS) 16/1262 variables, 7/964 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1262 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 41 (OVERLAPS) 59/1321 variables, 46/1010 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1321 variables, 10/1020 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1321 variables, 3/1023 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1321 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 45 (OVERLAPS) 3/1324 variables, 3/1026 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1324 variables, 3/1029 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1324 variables, 0/1029 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 48 (OVERLAPS) 4/1328 variables, 2/1031 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1328 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 50 (OVERLAPS) 35/1363 variables, 20/1051 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1363 variables, 6/1057 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1363 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 53 (OVERLAPS) 3/1366 variables, 2/1059 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1366 variables, 3/1062 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1366 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 56 (OVERLAPS) 12/1378 variables, 5/1067 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1378 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 58 (OVERLAPS) 37/1415 variables, 26/1093 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1415 variables, 5/1098 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1415 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 61 (OVERLAPS) 2/1417 variables, 2/1100 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1417 variables, 2/1102 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1417 variables, 0/1102 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 64 (OVERLAPS) 4/1421 variables, 2/1104 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1421 variables, 0/1104 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 66 (OVERLAPS) 20/1441 variables, 15/1119 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1441 variables, 5/1124 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1441 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 69 (OVERLAPS) 6/1447 variables, 4/1128 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1447 variables, 2/1130 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1447 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 72 (OVERLAPS) 0/1447 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1447/1447 variables, and 1130 constraints, problems are : Problem set: 0 solved, 14 unsolved in 6454 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 787/787 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 77/100 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 40/140 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 165/305 variables, 140/189 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 8/197 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 5/202 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-29 21:26:32] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 230/535 variables, 121/324 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/535 variables, 42/366 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 9/375 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-29 21:26:33] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/535 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-29 21:26:33] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-29 21:26:33] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/535 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/535 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 16/551 variables, 15/393 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/551 variables, 14/407 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-29 21:26:33] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/551 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/551 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (OVERLAPS) 30/581 variables, 15/423 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/581 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (OVERLAPS) 252/833 variables, 150/573 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/833 variables, 40/613 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-29 21:26:34] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/833 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/833 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 26 (OVERLAPS) 14/847 variables, 16/630 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/847 variables, 14/644 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/847 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 29 (OVERLAPS) 22/869 variables, 11/655 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-29 21:26:35] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/869 variables, 1/656 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/869 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 32 (OVERLAPS) 218/1087 variables, 135/791 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1087 variables, 43/834 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1087 variables, 1/835 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-29 21:26:35] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-05-29 21:26:35] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/1087 variables, 2/837 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1087 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 37 (OVERLAPS) 11/1098 variables, 11/848 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1098 variables, 11/859 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1098 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 40 (OVERLAPS) 20/1118 variables, 10/869 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1118 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 42 (OVERLAPS) 120/1238 variables, 79/948 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1238 variables, 17/965 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1238 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 45 (OVERLAPS) 8/1246 variables, 11/976 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1246 variables, 4/980 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1246 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 48 (OVERLAPS) 16/1262 variables, 7/987 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-29 21:26:37] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/1262 variables, 1/988 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1262 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 51 (OVERLAPS) 59/1321 variables, 46/1034 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1321 variables, 10/1044 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1321 variables, 3/1047 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1321 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 55 (OVERLAPS) 3/1324 variables, 3/1050 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1324 variables, 3/1053 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1324 variables, 0/1053 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 58 (OVERLAPS) 4/1328 variables, 2/1055 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1328 variables, 0/1055 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 60 (OVERLAPS) 35/1363 variables, 20/1075 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1363 variables, 6/1081 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1363 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 63 (OVERLAPS) 3/1366 variables, 2/1083 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1366 variables, 3/1086 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1366 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 66 (OVERLAPS) 12/1378 variables, 5/1091 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1378 variables, 0/1091 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 68 (OVERLAPS) 37/1415 variables, 26/1117 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1415 variables, 5/1122 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1415 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 71 (OVERLAPS) 2/1417 variables, 2/1124 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1417 variables, 2/1126 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1417 variables, 0/1126 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 74 (OVERLAPS) 4/1421 variables, 2/1128 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1421 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 76 (OVERLAPS) 20/1441 variables, 15/1143 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1441 variables, 5/1148 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1441 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 79 (OVERLAPS) 6/1447 variables, 4/1152 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1447 variables, 2/1154 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1447 variables, 0/1154 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 82 (OVERLAPS) 0/1447 variables, 0/1154 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1447/1447 variables, and 1154 constraints, problems are : Problem set: 0 solved, 14 unsolved in 10100 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 787/787 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 10/10 constraints]
After SMT, in 16574ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 4000 ms.
Support contains 23 out of 787 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 787/787 places, 660/660 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 787 transition count 658
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 785 transition count 658
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 785 transition count 657
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 784 transition count 657
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 18 place count 778 transition count 651
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 778 transition count 651
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 775 transition count 648
Applied a total of 22 rules in 131 ms. Remains 775 /787 variables (removed 12) and now considering 648/660 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 775/787 places, 648/660 transitions.
RANDOM walk for 40000 steps (8 resets) in 834 ms. (47 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 337 ms. (118 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 238 ms. (167 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 230 ms. (173 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 248 ms. (160 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 102353 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 13
Probabilistic random walk after 102353 steps, saw 78419 distinct states, run finished after 3019 ms. (steps per millisecond=33 ) properties seen :0
// Phase 1: matrix 648 rows 775 cols
[2024-05-29 21:26:51] [INFO ] Computed 331 invariants in 3 ms
[2024-05-29 21:26:51] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 68/89 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 24/113 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 142/255 variables, 113/152 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 235/490 variables, 123/277 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 43/320 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 15/505 variables, 15/335 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/505 variables, 15/350 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/505 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 30/535 variables, 15/365 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/535 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 264/799 variables, 155/520 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/799 variables, 45/565 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/799 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 14/813 variables, 14/579 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/813 variables, 14/593 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/813 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (OVERLAPS) 28/841 variables, 14/607 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/841 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (OVERLAPS) 230/1071 variables, 145/752 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1071 variables, 44/796 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1071 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1071 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 28 (OVERLAPS) 11/1082 variables, 12/809 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1082 variables, 11/820 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1082 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 31 (OVERLAPS) 20/1102 variables, 10/830 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1102 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 33 (OVERLAPS) 121/1223 variables, 81/911 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1223 variables, 20/931 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1223 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 36 (OVERLAPS) 5/1228 variables, 9/940 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1228 variables, 5/945 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1228 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 39 (OVERLAPS) 2/1230 variables, 1/946 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1230 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 41 (OVERLAPS) 49/1279 variables, 30/976 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1279 variables, 12/988 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1279 variables, 1/989 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1279 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 45 (OVERLAPS) 2/1281 variables, 2/991 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1281 variables, 2/993 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1281 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 48 (OVERLAPS) 4/1285 variables, 2/995 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1285 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 50 (OVERLAPS) 49/1334 variables, 28/1023 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1334 variables, 7/1030 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1334 variables, 0/1030 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 53 (OVERLAPS) 2/1336 variables, 4/1034 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1336 variables, 2/1036 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1336 variables, 0/1036 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 56 (OVERLAPS) 33/1369 variables, 18/1054 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1369 variables, 7/1061 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1369 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 59 (OVERLAPS) 2/1371 variables, 2/1063 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1371 variables, 2/1065 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1371 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 62 (OVERLAPS) 4/1375 variables, 2/1067 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1375 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 64 (OVERLAPS) 36/1411 variables, 21/1088 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1411 variables, 4/1092 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1411 variables, 0/1092 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 67 (OVERLAPS) 2/1413 variables, 4/1096 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1413 variables, 2/1098 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1413 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 70 (OVERLAPS) 10/1423 variables, 8/1106 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1423 variables, 4/1110 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1423 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 73 (OVERLAPS) 0/1423 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1423/1423 variables, and 1110 constraints, problems are : Problem set: 0 solved, 13 unsolved in 6028 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 775/775 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 68/89 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 24/113 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 142/255 variables, 113/152 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 235/490 variables, 123/282 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 43/325 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 8/333 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:26:57] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 2 ms to minimize.
[2024-05-29 21:26:57] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 28 ms to minimize.
[2024-05-29 21:26:57] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-29 21:26:58] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 4/337 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:26:58] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/490 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/490 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 15/505 variables, 15/353 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/505 variables, 15/368 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/505 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 30/535 variables, 15/383 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/535 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (OVERLAPS) 264/799 variables, 155/538 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/799 variables, 45/583 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/799 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (OVERLAPS) 14/813 variables, 14/597 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/813 variables, 14/611 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/813 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (OVERLAPS) 28/841 variables, 14/625 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/841 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 28 (OVERLAPS) 230/1071 variables, 145/770 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1071 variables, 44/814 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1071 variables, 1/815 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1071 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 32 (OVERLAPS) 11/1082 variables, 12/827 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1082 variables, 11/838 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1082 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 35 (OVERLAPS) 20/1102 variables, 10/848 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1102 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 37 (OVERLAPS) 121/1223 variables, 81/929 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1223 variables, 20/949 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1223 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 40 (OVERLAPS) 5/1228 variables, 9/958 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1228 variables, 5/963 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1228 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 43 (OVERLAPS) 2/1230 variables, 1/964 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1230 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 45 (OVERLAPS) 49/1279 variables, 30/994 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1279 variables, 12/1006 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1279 variables, 1/1007 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1279 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 49 (OVERLAPS) 2/1281 variables, 2/1009 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1281 variables, 2/1011 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1281 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 52 (OVERLAPS) 4/1285 variables, 2/1013 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1285 variables, 0/1013 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 54 (OVERLAPS) 49/1334 variables, 28/1041 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1334 variables, 7/1048 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1334 variables, 0/1048 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 57 (OVERLAPS) 2/1336 variables, 4/1052 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1336 variables, 2/1054 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1336 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 60 (OVERLAPS) 33/1369 variables, 18/1072 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1369 variables, 7/1079 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1369 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 63 (OVERLAPS) 2/1371 variables, 2/1081 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1371 variables, 2/1083 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1371 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 66 (OVERLAPS) 4/1375 variables, 2/1085 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1375 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 68 (OVERLAPS) 36/1411 variables, 21/1106 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1411 variables, 4/1110 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1411 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 71 (OVERLAPS) 2/1413 variables, 4/1114 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1413 variables, 2/1116 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1413 variables, 0/1116 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 74 (OVERLAPS) 10/1423 variables, 8/1124 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1423 variables, 4/1128 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1423 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 77 (OVERLAPS) 0/1423 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1423/1423 variables, and 1128 constraints, problems are : Problem set: 0 solved, 13 unsolved in 8455 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 775/775 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 5/5 constraints]
After SMT, in 14498ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 4668 ms.
Support contains 21 out of 775 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 775/775 places, 648/648 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 773 transition count 646
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 772 transition count 645
Applied a total of 5 rules in 65 ms. Remains 772 /775 variables (removed 3) and now considering 645/648 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 772/775 places, 645/648 transitions.
RANDOM walk for 40000 steps (8 resets) in 478 ms. (83 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 220 ms. (181 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 153 ms. (259 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 106062 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 13
Probabilistic random walk after 106062 steps, saw 80787 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 645 rows 772 cols
[2024-05-29 21:27:14] [INFO ] Computed 331 invariants in 2 ms
[2024-05-29 21:27:14] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 65/86 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 12/98 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 129/227 variables, 98/132 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 244/471 variables, 127/261 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 42/303 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 17/488 variables, 18/321 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 17/338 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 32/520 variables, 16/354 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/520 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 267/787 variables, 157/511 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/787 variables, 47/558 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/787 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 12/799 variables, 12/570 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/799 variables, 12/582 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/799 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (OVERLAPS) 24/823 variables, 12/594 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/823 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (OVERLAPS) 242/1065 variables, 151/745 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1065 variables, 48/793 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1065 variables, 1/794 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1065 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 28 (OVERLAPS) 11/1076 variables, 12/806 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1076 variables, 11/817 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1076 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 31 (OVERLAPS) 20/1096 variables, 10/827 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1096 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 33 (OVERLAPS) 121/1217 variables, 81/908 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1217 variables, 20/928 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1217 variables, 0/928 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 36 (OVERLAPS) 5/1222 variables, 9/937 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1222 variables, 5/942 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1222 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 39 (OVERLAPS) 2/1224 variables, 1/943 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1224 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 41 (OVERLAPS) 49/1273 variables, 30/973 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1273 variables, 12/985 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1273 variables, 1/986 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1273 variables, 0/986 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 45 (OVERLAPS) 2/1275 variables, 2/988 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1275 variables, 2/990 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1275 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 48 (OVERLAPS) 4/1279 variables, 2/992 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1279 variables, 0/992 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 50 (OVERLAPS) 49/1328 variables, 28/1020 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1328 variables, 7/1027 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1328 variables, 0/1027 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 53 (OVERLAPS) 2/1330 variables, 4/1031 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1330 variables, 2/1033 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1330 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 56 (OVERLAPS) 33/1363 variables, 18/1051 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1363 variables, 7/1058 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1363 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 59 (OVERLAPS) 2/1365 variables, 2/1060 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1365 variables, 2/1062 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1365 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 62 (OVERLAPS) 4/1369 variables, 2/1064 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1369 variables, 0/1064 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 64 (OVERLAPS) 36/1405 variables, 21/1085 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1405 variables, 4/1089 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1405 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 67 (OVERLAPS) 2/1407 variables, 4/1093 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1407 variables, 2/1095 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1407 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 70 (OVERLAPS) 10/1417 variables, 8/1103 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1417 variables, 4/1107 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1417 variables, 0/1107 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 73 (OVERLAPS) 0/1417 variables, 0/1107 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1417/1417 variables, and 1107 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5325 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 772/772 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 65/86 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 12/98 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 129/227 variables, 98/132 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 5/139 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 244/471 variables, 127/266 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 42/308 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/471 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:27:20] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/471 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:27:20] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-29 21:27:20] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/471 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/471 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 17/488 variables, 18/337 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/488 variables, 17/354 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/488 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 32/520 variables, 16/370 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/520 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (OVERLAPS) 267/787 variables, 157/527 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/787 variables, 47/574 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/787 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (OVERLAPS) 12/799 variables, 12/586 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/799 variables, 12/598 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/799 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (OVERLAPS) 24/823 variables, 12/610 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/823 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 28 (OVERLAPS) 242/1065 variables, 151/761 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1065 variables, 48/809 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1065 variables, 1/810 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:27:21] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 2 ms to minimize.
[2024-05-29 21:27:21] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-05-29 21:27:21] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/1065 variables, 3/813 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:27:22] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/1065 variables, 1/814 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1065 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 34 (OVERLAPS) 11/1076 variables, 12/826 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1076 variables, 11/837 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1076 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 37 (OVERLAPS) 20/1096 variables, 10/847 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1096 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 39 (OVERLAPS) 121/1217 variables, 81/928 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1217 variables, 20/948 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1217 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 42 (OVERLAPS) 5/1222 variables, 9/957 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1222 variables, 5/962 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:27:23] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/1222 variables, 1/963 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1222 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 46 (OVERLAPS) 2/1224 variables, 1/964 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1224 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 48 (OVERLAPS) 49/1273 variables, 30/994 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1273 variables, 12/1006 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1273 variables, 1/1007 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1273 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 52 (OVERLAPS) 2/1275 variables, 2/1009 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1275 variables, 2/1011 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:27:24] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
At refinement iteration 54 (INCLUDED_ONLY) 0/1275 variables, 1/1012 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1275 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 56 (OVERLAPS) 4/1279 variables, 2/1014 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1279 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 58 (OVERLAPS) 49/1328 variables, 28/1042 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1328 variables, 7/1049 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:27:26] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 2 ms to minimize.
At refinement iteration 60 (INCLUDED_ONLY) 0/1328 variables, 1/1050 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1328 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 62 (OVERLAPS) 2/1330 variables, 4/1054 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1330 variables, 2/1056 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1330 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 65 (OVERLAPS) 33/1363 variables, 18/1074 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1363 variables, 7/1081 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1363 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 68 (OVERLAPS) 2/1365 variables, 2/1083 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1365 variables, 2/1085 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1365 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 71 (OVERLAPS) 4/1369 variables, 2/1087 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1369 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 73 (OVERLAPS) 36/1405 variables, 21/1108 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1405 variables, 4/1112 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1405 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 76 (OVERLAPS) 2/1407 variables, 4/1116 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1407 variables, 2/1118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1407 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 79 (OVERLAPS) 10/1417 variables, 8/1126 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1417 variables, 4/1130 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1417 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 82 (OVERLAPS) 0/1417 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1417/1417 variables, and 1130 constraints, problems are : Problem set: 0 solved, 13 unsolved in 9380 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 772/772 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 10/10 constraints]
After SMT, in 14718ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 3028 ms.
Support contains 21 out of 772 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 772/772 places, 645/645 transitions.
Applied a total of 0 rules in 17 ms. Remains 772 /772 variables (removed 0) and now considering 645/645 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 772/772 places, 645/645 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 772/772 places, 645/645 transitions.
Applied a total of 0 rules in 16 ms. Remains 772 /772 variables (removed 0) and now considering 645/645 (removed 0) transitions.
[2024-05-29 21:27:32] [INFO ] Invariant cache hit.
[2024-05-29 21:27:32] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-05-29 21:27:32] [INFO ] Invariant cache hit.
[2024-05-29 21:27:33] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 21:27:33] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 1092 ms to find 0 implicit places.
[2024-05-29 21:27:33] [INFO ] Redundant transitions in 34 ms returned []
Running 639 sub problems to find dead transitions.
[2024-05-29 21:27:33] [INFO ] Invariant cache hit.
[2024-05-29 21:27:33] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-05-29 21:27:40] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 21:27:41] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-29 21:27:41] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-29 21:27:41] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-29 21:27:41] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:27:41] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-29 21:27:41] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-29 21:27:42] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 21:27:42] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 7 ms to minimize.
[2024-05-29 21:27:42] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 21:27:42] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:27:42] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 21:27:42] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-29 21:27:42] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-29 21:27:42] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-29 21:27:42] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-29 21:27:42] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 2 ms to minimize.
[2024-05-29 21:27:42] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-29 21:27:42] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-29 21:27:42] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 20/340 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-05-29 21:27:45] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 2 ms to minimize.
[2024-05-29 21:27:45] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 3 ms to minimize.
[2024-05-29 21:27:45] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 3 ms to minimize.
[2024-05-29 21:27:45] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 2 ms to minimize.
[2024-05-29 21:27:46] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 3 ms to minimize.
[2024-05-29 21:27:46] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 2 ms to minimize.
[2024-05-29 21:27:46] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 2 ms to minimize.
[2024-05-29 21:27:46] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 2 ms to minimize.
[2024-05-29 21:27:46] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 2 ms to minimize.
[2024-05-29 21:27:46] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 2 ms to minimize.
[2024-05-29 21:27:46] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 2 ms to minimize.
[2024-05-29 21:27:46] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 2 ms to minimize.
[2024-05-29 21:27:47] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 2 ms to minimize.
[2024-05-29 21:27:47] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 3 ms to minimize.
[2024-05-29 21:27:47] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 3 ms to minimize.
[2024-05-29 21:27:47] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 2 ms to minimize.
[2024-05-29 21:27:47] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 3 ms to minimize.
[2024-05-29 21:27:47] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2024-05-29 21:27:47] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-05-29 21:27:47] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-05-29 21:27:50] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
[2024-05-29 21:27:50] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2024-05-29 21:27:50] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 2 ms to minimize.
[2024-05-29 21:27:50] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 2 ms to minimize.
[2024-05-29 21:27:50] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 2 ms to minimize.
[2024-05-29 21:27:51] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-05-29 21:27:51] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 3 ms to minimize.
[2024-05-29 21:27:51] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-05-29 21:27:51] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 2 ms to minimize.
[2024-05-29 21:27:51] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-05-29 21:27:51] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-05-29 21:27:51] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 3 ms to minimize.
[2024-05-29 21:27:51] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2024-05-29 21:27:51] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-05-29 21:27:52] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-05-29 21:27:52] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 2 ms to minimize.
[2024-05-29 21:27:52] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
[2024-05-29 21:27:52] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-05-29 21:27:52] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-05-29 21:27:52] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/768 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 639 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 1.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 1.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 1.0)
(s230 timeout
0.0)
(s231 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/1417 variables, and 380 constraints, problems are : Problem set: 0 solved, 639 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 320/331 constraints, State Equation: 0/772 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 639/639 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 639 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 60/380 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-05-29 21:28:05] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-29 21:28:05] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-29 21:28:05] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-29 21:28:05] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-29 21:28:05] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-29 21:28:05] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-29 21:28:05] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-29 21:28:06] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-29 21:28:06] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-05-29 21:28:06] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-05-29 21:28:06] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
[2024-05-29 21:28:07] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 2 ms to minimize.
[2024-05-29 21:28:07] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
[2024-05-29 21:28:07] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
[2024-05-29 21:28:10] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 15/395 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-05-29 21:28:14] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/768 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/768 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 5 (OVERLAPS) 4/772 variables, 11/407 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-05-29 21:28:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 21:28:27] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 21:28:30] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2024-05-29 21:28:30] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-29 21:28:30] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-05-29 21:28:30] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
[2024-05-29 21:28:30] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2024-05-29 21:28:31] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 772/1417 variables, and 415 constraints, problems are : Problem set: 0 solved, 639 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/772 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/639 constraints, Known Traps: 84/84 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 639 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61299 ms. Remains : 772/772 places, 645/645 transitions.
[2024-05-29 21:28:33] [INFO ] Flatten gal took : 65 ms
[2024-05-29 21:28:33] [INFO ] Flatten gal took : 60 ms
[2024-05-29 21:28:33] [INFO ] Input system was already deterministic with 1838 transitions.
Computed a total of 486 stabilizing places and 486 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 424 transitions
Trivial Post-agglo rules discarded 424 transitions
Performed 424 trivial Post agglomeration. Transition count delta: 424
Iterating post reduction 0 with 424 rules applied. Total rules applied 424 place count 2047 transition count 1413
Reduce places removed 424 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 426 rules applied. Total rules applied 850 place count 1623 transition count 1411
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 852 place count 1622 transition count 1410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 853 place count 1621 transition count 1410
Performed 222 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 222 Pre rules applied. Total rules applied 853 place count 1621 transition count 1188
Deduced a syphon composed of 222 places in 2 ms
Reduce places removed 222 places and 0 transitions.
Iterating global reduction 4 with 444 rules applied. Total rules applied 1297 place count 1399 transition count 1188
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 1322 place count 1374 transition count 1163
Iterating global reduction 4 with 25 rules applied. Total rules applied 1347 place count 1374 transition count 1163
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 1347 place count 1374 transition count 1145
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 1383 place count 1356 transition count 1145
Performed 482 Post agglomeration using F-continuation condition.Transition count delta: 482
Deduced a syphon composed of 482 places in 0 ms
Reduce places removed 482 places and 0 transitions.
Iterating global reduction 4 with 964 rules applied. Total rules applied 2347 place count 874 transition count 663
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2349 place count 872 transition count 661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2350 place count 871 transition count 661
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2350 place count 871 transition count 659
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2354 place count 869 transition count 659
Applied a total of 2354 rules in 268 ms. Remains 869 /2048 variables (removed 1179) and now considering 659/1838 (removed 1179) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 268 ms. Remains : 869/2048 places, 659/1838 transitions.
[2024-05-29 21:28:34] [INFO ] Flatten gal took : 21 ms
[2024-05-29 21:28:34] [INFO ] Flatten gal took : 21 ms
[2024-05-29 21:28:34] [INFO ] Input system was already deterministic with 659 transitions.
RANDOM walk for 531 steps (0 resets) in 8 ms. (59 steps per ms) remains 0/1 properties
FORMULA ShieldPPPt-PT-030B-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 2012 transition count 1802
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 2012 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 2011 transition count 1801
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 2011 transition count 1801
Applied a total of 74 rules in 247 ms. Remains 2011 /2048 variables (removed 37) and now considering 1801/1838 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 2011/2048 places, 1801/1838 transitions.
[2024-05-29 21:28:34] [INFO ] Flatten gal took : 42 ms
[2024-05-29 21:28:34] [INFO ] Flatten gal took : 44 ms
[2024-05-29 21:28:34] [INFO ] Input system was already deterministic with 1801 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 421 transitions
Trivial Post-agglo rules discarded 421 transitions
Performed 421 trivial Post agglomeration. Transition count delta: 421
Iterating post reduction 0 with 421 rules applied. Total rules applied 421 place count 2047 transition count 1416
Reduce places removed 421 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 423 rules applied. Total rules applied 844 place count 1626 transition count 1414
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 846 place count 1625 transition count 1413
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 847 place count 1624 transition count 1413
Performed 223 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 223 Pre rules applied. Total rules applied 847 place count 1624 transition count 1190
Deduced a syphon composed of 223 places in 1 ms
Reduce places removed 223 places and 0 transitions.
Iterating global reduction 4 with 446 rules applied. Total rules applied 1293 place count 1401 transition count 1190
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 1317 place count 1377 transition count 1166
Iterating global reduction 4 with 24 rules applied. Total rules applied 1341 place count 1377 transition count 1166
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 1341 place count 1377 transition count 1148
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 1377 place count 1359 transition count 1148
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 477
Deduced a syphon composed of 477 places in 1 ms
Reduce places removed 477 places and 0 transitions.
Iterating global reduction 4 with 954 rules applied. Total rules applied 2331 place count 882 transition count 671
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2333 place count 880 transition count 669
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2334 place count 879 transition count 669
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2334 place count 879 transition count 667
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2338 place count 877 transition count 667
Applied a total of 2338 rules in 244 ms. Remains 877 /2048 variables (removed 1171) and now considering 667/1838 (removed 1171) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 244 ms. Remains : 877/2048 places, 667/1838 transitions.
[2024-05-29 21:28:34] [INFO ] Flatten gal took : 18 ms
[2024-05-29 21:28:34] [INFO ] Flatten gal took : 18 ms
[2024-05-29 21:28:34] [INFO ] Input system was already deterministic with 667 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 425 transitions
Trivial Post-agglo rules discarded 425 transitions
Performed 425 trivial Post agglomeration. Transition count delta: 425
Iterating post reduction 0 with 425 rules applied. Total rules applied 425 place count 2047 transition count 1412
Reduce places removed 425 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 427 rules applied. Total rules applied 852 place count 1622 transition count 1410
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 854 place count 1621 transition count 1409
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 855 place count 1620 transition count 1409
Performed 223 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 223 Pre rules applied. Total rules applied 855 place count 1620 transition count 1186
Deduced a syphon composed of 223 places in 2 ms
Reduce places removed 223 places and 0 transitions.
Iterating global reduction 4 with 446 rules applied. Total rules applied 1301 place count 1397 transition count 1186
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 1327 place count 1371 transition count 1160
Iterating global reduction 4 with 26 rules applied. Total rules applied 1353 place count 1371 transition count 1160
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 1353 place count 1371 transition count 1141
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 1391 place count 1352 transition count 1141
Performed 479 Post agglomeration using F-continuation condition.Transition count delta: 479
Deduced a syphon composed of 479 places in 0 ms
Reduce places removed 479 places and 0 transitions.
Iterating global reduction 4 with 958 rules applied. Total rules applied 2349 place count 873 transition count 662
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2351 place count 871 transition count 660
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2352 place count 870 transition count 660
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2352 place count 870 transition count 658
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2356 place count 868 transition count 658
Applied a total of 2356 rules in 227 ms. Remains 868 /2048 variables (removed 1180) and now considering 658/1838 (removed 1180) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 227 ms. Remains : 868/2048 places, 658/1838 transitions.
[2024-05-29 21:28:35] [INFO ] Flatten gal took : 16 ms
[2024-05-29 21:28:35] [INFO ] Flatten gal took : 18 ms
[2024-05-29 21:28:35] [INFO ] Input system was already deterministic with 658 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 2018 transition count 1808
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 2018 transition count 1808
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 2017 transition count 1807
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 2017 transition count 1807
Applied a total of 62 rules in 248 ms. Remains 2017 /2048 variables (removed 31) and now considering 1807/1838 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 2017/2048 places, 1807/1838 transitions.
[2024-05-29 21:28:35] [INFO ] Flatten gal took : 38 ms
[2024-05-29 21:28:35] [INFO ] Flatten gal took : 41 ms
[2024-05-29 21:28:35] [INFO ] Input system was already deterministic with 1807 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 2012 transition count 1802
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 2012 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 2011 transition count 1801
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 2011 transition count 1801
Applied a total of 74 rules in 282 ms. Remains 2011 /2048 variables (removed 37) and now considering 1801/1838 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 284 ms. Remains : 2011/2048 places, 1801/1838 transitions.
[2024-05-29 21:28:36] [INFO ] Flatten gal took : 37 ms
[2024-05-29 21:28:36] [INFO ] Flatten gal took : 39 ms
[2024-05-29 21:28:36] [INFO ] Input system was already deterministic with 1801 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 2015 transition count 1805
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 2015 transition count 1805
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 2014 transition count 1804
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 2014 transition count 1804
Applied a total of 68 rules in 251 ms. Remains 2014 /2048 variables (removed 34) and now considering 1804/1838 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 251 ms. Remains : 2014/2048 places, 1804/1838 transitions.
[2024-05-29 21:28:36] [INFO ] Flatten gal took : 35 ms
[2024-05-29 21:28:36] [INFO ] Flatten gal took : 37 ms
[2024-05-29 21:28:36] [INFO ] Input system was already deterministic with 1804 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 2012 transition count 1802
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 2012 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 2011 transition count 1801
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 2011 transition count 1801
Applied a total of 74 rules in 252 ms. Remains 2011 /2048 variables (removed 37) and now considering 1801/1838 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 253 ms. Remains : 2011/2048 places, 1801/1838 transitions.
[2024-05-29 21:28:36] [INFO ] Flatten gal took : 32 ms
[2024-05-29 21:28:36] [INFO ] Flatten gal took : 35 ms
[2024-05-29 21:28:36] [INFO ] Input system was already deterministic with 1801 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 2017 transition count 1807
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 2017 transition count 1807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 2016 transition count 1806
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 2016 transition count 1806
Applied a total of 64 rules in 235 ms. Remains 2016 /2048 variables (removed 32) and now considering 1806/1838 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 2016/2048 places, 1806/1838 transitions.
[2024-05-29 21:28:37] [INFO ] Flatten gal took : 33 ms
[2024-05-29 21:28:37] [INFO ] Flatten gal took : 34 ms
[2024-05-29 21:28:37] [INFO ] Input system was already deterministic with 1806 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 2016 transition count 1806
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 2016 transition count 1806
Applied a total of 64 rules in 179 ms. Remains 2016 /2048 variables (removed 32) and now considering 1806/1838 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 2016/2048 places, 1806/1838 transitions.
[2024-05-29 21:28:37] [INFO ] Flatten gal took : 33 ms
[2024-05-29 21:28:37] [INFO ] Flatten gal took : 35 ms
[2024-05-29 21:28:37] [INFO ] Input system was already deterministic with 1806 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 425 transitions
Trivial Post-agglo rules discarded 425 transitions
Performed 425 trivial Post agglomeration. Transition count delta: 425
Iterating post reduction 0 with 425 rules applied. Total rules applied 425 place count 2047 transition count 1412
Reduce places removed 425 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 427 rules applied. Total rules applied 852 place count 1622 transition count 1410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 853 place count 1621 transition count 1410
Performed 222 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 222 Pre rules applied. Total rules applied 853 place count 1621 transition count 1188
Deduced a syphon composed of 222 places in 2 ms
Reduce places removed 222 places and 0 transitions.
Iterating global reduction 3 with 444 rules applied. Total rules applied 1297 place count 1399 transition count 1188
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1320 place count 1376 transition count 1165
Iterating global reduction 3 with 23 rules applied. Total rules applied 1343 place count 1376 transition count 1165
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 1343 place count 1376 transition count 1148
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 1377 place count 1359 transition count 1148
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 2335 place count 880 transition count 669
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 2337 place count 878 transition count 667
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2338 place count 877 transition count 667
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2338 place count 877 transition count 665
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2342 place count 875 transition count 665
Applied a total of 2342 rules in 217 ms. Remains 875 /2048 variables (removed 1173) and now considering 665/1838 (removed 1173) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 217 ms. Remains : 875/2048 places, 665/1838 transitions.
[2024-05-29 21:28:37] [INFO ] Flatten gal took : 15 ms
[2024-05-29 21:28:37] [INFO ] Flatten gal took : 17 ms
[2024-05-29 21:28:38] [INFO ] Input system was already deterministic with 665 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 424 transitions
Trivial Post-agglo rules discarded 424 transitions
Performed 424 trivial Post agglomeration. Transition count delta: 424
Iterating post reduction 0 with 424 rules applied. Total rules applied 424 place count 2047 transition count 1413
Reduce places removed 424 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 426 rules applied. Total rules applied 850 place count 1623 transition count 1411
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 851 place count 1622 transition count 1411
Performed 224 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 224 Pre rules applied. Total rules applied 851 place count 1622 transition count 1187
Deduced a syphon composed of 224 places in 2 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 3 with 448 rules applied. Total rules applied 1299 place count 1398 transition count 1187
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1324 place count 1373 transition count 1162
Iterating global reduction 3 with 25 rules applied. Total rules applied 1349 place count 1373 transition count 1162
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 1349 place count 1373 transition count 1144
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 1385 place count 1355 transition count 1144
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 477
Deduced a syphon composed of 477 places in 1 ms
Reduce places removed 477 places and 0 transitions.
Iterating global reduction 3 with 954 rules applied. Total rules applied 2339 place count 878 transition count 667
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 2341 place count 876 transition count 665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2342 place count 875 transition count 665
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2342 place count 875 transition count 663
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2346 place count 873 transition count 663
Applied a total of 2346 rules in 204 ms. Remains 873 /2048 variables (removed 1175) and now considering 663/1838 (removed 1175) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 204 ms. Remains : 873/2048 places, 663/1838 transitions.
[2024-05-29 21:28:38] [INFO ] Flatten gal took : 14 ms
[2024-05-29 21:28:38] [INFO ] Flatten gal took : 15 ms
[2024-05-29 21:28:38] [INFO ] Input system was already deterministic with 663 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 426 transitions
Trivial Post-agglo rules discarded 426 transitions
Performed 426 trivial Post agglomeration. Transition count delta: 426
Iterating post reduction 0 with 426 rules applied. Total rules applied 426 place count 2047 transition count 1411
Reduce places removed 426 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 428 rules applied. Total rules applied 854 place count 1621 transition count 1409
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 855 place count 1620 transition count 1409
Performed 223 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 223 Pre rules applied. Total rules applied 855 place count 1620 transition count 1186
Deduced a syphon composed of 223 places in 1 ms
Reduce places removed 223 places and 0 transitions.
Iterating global reduction 3 with 446 rules applied. Total rules applied 1301 place count 1397 transition count 1186
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1326 place count 1372 transition count 1161
Iterating global reduction 3 with 25 rules applied. Total rules applied 1351 place count 1372 transition count 1161
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 1351 place count 1372 transition count 1142
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 1389 place count 1353 transition count 1142
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 480
Deduced a syphon composed of 480 places in 0 ms
Reduce places removed 480 places and 0 transitions.
Iterating global reduction 3 with 960 rules applied. Total rules applied 2349 place count 873 transition count 662
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 2351 place count 871 transition count 660
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2352 place count 870 transition count 660
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2352 place count 870 transition count 658
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2356 place count 868 transition count 658
Applied a total of 2356 rules in 215 ms. Remains 868 /2048 variables (removed 1180) and now considering 658/1838 (removed 1180) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 215 ms. Remains : 868/2048 places, 658/1838 transitions.
[2024-05-29 21:28:38] [INFO ] Flatten gal took : 15 ms
[2024-05-29 21:28:38] [INFO ] Flatten gal took : 16 ms
[2024-05-29 21:28:38] [INFO ] Input system was already deterministic with 658 transitions.
[2024-05-29 21:28:38] [INFO ] Flatten gal took : 36 ms
[2024-05-29 21:28:38] [INFO ] Flatten gal took : 36 ms
[2024-05-29 21:28:38] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-29 21:28:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2048 places, 1838 transitions and 4756 arcs took 8 ms.
Total runtime 208403 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldPPPt-PT-030B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 2048
TRANSITIONS: 1838
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.028s, Sys 0.004s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.006s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1003
MODEL NAME: /home/mcc/execution/411/model
2048 places, 1838 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-030B"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ShieldPPPt-PT-030B, 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 r355-tall-171683759200649"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030B.tgz
mv ShieldPPPt-PT-030B 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 ;