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-171683759200650.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759200650
=====================================================================

--------------------
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-CTLFireability-2024-00
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2024-01
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2024-02
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2024-03
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2024-04
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2024-05
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2024-06
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2024-07
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2024-08
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2024-09
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2024-10
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2024-11
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2023-12
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2023-13
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2023-14
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717018131138

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
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:28:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 21:28:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 21:28:52] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2024-05-29 21:28:52] [INFO ] Transformed 2343 places.
[2024-05-29 21:28:52] [INFO ] Transformed 2133 transitions.
[2024-05-29 21:28:52] [INFO ] Found NUPN structural information;
[2024-05-29 21:28:52] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 365 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 113 out of 2343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Discarding 307 places :
Symmetric choice reduction at 0 with 307 rule applications. Total rules 307 place count 2036 transition count 1826
Iterating global reduction 0 with 307 rules applied. Total rules applied 614 place count 2036 transition count 1826
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 615 place count 2035 transition count 1825
Iterating global reduction 0 with 1 rules applied. Total rules applied 616 place count 2035 transition count 1825
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 617 place count 2034 transition count 1824
Iterating global reduction 0 with 1 rules applied. Total rules applied 618 place count 2034 transition count 1824
Applied a total of 618 rules in 721 ms. Remains 2034 /2343 variables (removed 309) and now considering 1824/2133 (removed 309) transitions.
// Phase 1: matrix 1824 rows 2034 cols
[2024-05-29 21:28:53] [INFO ] Computed 331 invariants in 34 ms
[2024-05-29 21:28:54] [INFO ] Implicit Places using invariants in 842 ms returned []
[2024-05-29 21:28:54] [INFO ] Invariant cache hit.
[2024-05-29 21:28:56] [INFO ] Implicit Places using invariants and state equation in 1667 ms returned []
Implicit Place search using SMT with State Equation took 2542 ms to find 0 implicit places.
Running 1823 sub problems to find dead transitions.
[2024-05-29 21:28:56] [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 timeout
1.0)
(s603 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2033/3858 variables, and 0 constraints, problems are : Problem set: 0 solved, 1823 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2034 constraints, PredecessorRefiner: 1823/1823 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1823 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2033/3858 variables, and 0 constraints, problems are : Problem set: 0 solved, 1823 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2034 constraints, PredecessorRefiner: 0/1823 constraints, Known Traps: 0/0 constraints]
After SMT, in 60661ms problems are : Problem set: 0 solved, 1823 unsolved
Search for dead transitions found 0 dead transitions in 60698ms
Starting structural reductions in LTL mode, iteration 1 : 2034/2343 places, 1824/2133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63993 ms. Remains : 2034/2343 places, 1824/2133 transitions.
Support contains 113 out of 2034 places after structural reductions.
[2024-05-29 21:29:57] [INFO ] Flatten gal took : 170 ms
[2024-05-29 21:29:57] [INFO ] Flatten gal took : 84 ms
[2024-05-29 21:29:57] [INFO ] Input system was already deterministic with 1824 transitions.
Support contains 110 out of 2034 places (down from 113) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2512 ms. (15 steps per ms) remains 35/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 35/35 properties
[2024-05-29 21:29:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 466/518 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 1516/2034 variables, 272/331 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2034 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 1824/3858 variables, 2034/2365 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3858 variables, 0/2365 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3858/3858 variables, and 2365 constraints, problems are : Problem set: 0 solved, 35 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 2034/2034 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 466/518 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-29 21:30:04] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 10 ms to minimize.
[2024-05-29 21:30:04] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 1516/2034 variables, 272/333 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-29 21:30:05] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 4 ms to minimize.
[2024-05-29 21:30:05] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 2 ms to minimize.
[2024-05-29 21:30:05] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 3 ms to minimize.
[2024-05-29 21:30:06] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 3 ms to minimize.
[2024-05-29 21:30:06] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-05-29 21:30:06] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-29 21:30:06] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-29 21:30:06] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
[2024-05-29 21:30:06] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-05-29 21:30:06] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-05-29 21:30:06] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
[2024-05-29 21:30:06] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2024-05-29 21:30:07] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-05-29 21:30:07] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 3 ms to minimize.
[2024-05-29 21:30:07] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 2 ms to minimize.
[2024-05-29 21:30:07] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-05-29 21:30:07] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-05-29 21:30:07] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-29 21:30:07] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-29 21:30:07] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2034 variables, 20/353 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-29 21:30:08] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-29 21:30:08] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2034/3858 variables, and 355 constraints, problems are : Problem set: 0 solved, 35 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/2034 constraints, PredecessorRefiner: 0/35 constraints, Known Traps: 24/24 constraints]
After SMT, in 10057ms problems are : Problem set: 0 solved, 35 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 2034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 394 transitions
Trivial Post-agglo rules discarded 394 transitions
Performed 394 trivial Post agglomeration. Transition count delta: 394
Iterating post reduction 0 with 394 rules applied. Total rules applied 394 place count 2034 transition count 1430
Reduce places removed 394 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 404 rules applied. Total rules applied 798 place count 1640 transition count 1420
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 808 place count 1630 transition count 1420
Performed 219 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 219 Pre rules applied. Total rules applied 808 place count 1630 transition count 1201
Deduced a syphon composed of 219 places in 1 ms
Reduce places removed 219 places and 0 transitions.
Iterating global reduction 3 with 438 rules applied. Total rules applied 1246 place count 1411 transition count 1201
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1255 place count 1402 transition count 1192
Iterating global reduction 3 with 9 rules applied. Total rules applied 1264 place count 1402 transition count 1192
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1264 place count 1402 transition count 1186
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1276 place count 1396 transition count 1186
Performed 498 Post agglomeration using F-continuation condition.Transition count delta: 498
Deduced a syphon composed of 498 places in 6 ms
Reduce places removed 498 places and 0 transitions.
Iterating global reduction 3 with 996 rules applied. Total rules applied 2272 place count 898 transition count 688
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2273 place count 898 transition count 687
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2275 place count 897 transition count 686
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 81 places in 7 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 4 with 162 rules applied. Total rules applied 2437 place count 816 transition count 686
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2438 place count 816 transition count 685
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2439 place count 815 transition count 685
Partial Free-agglomeration rule applied 87 times.
Drop transitions (Partial Free agglomeration) removed 87 transitions
Iterating global reduction 5 with 87 rules applied. Total rules applied 2526 place count 815 transition count 685
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2527 place count 814 transition count 684
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2528 place count 813 transition count 684
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 2528 place count 813 transition count 682
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 2532 place count 811 transition count 682
Applied a total of 2532 rules in 541 ms. Remains 811 /2034 variables (removed 1223) and now considering 682/1824 (removed 1142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 541 ms. Remains : 811/2034 places, 682/1824 transitions.
RANDOM walk for 40000 steps (8 resets) in 712 ms. (56 steps per ms) remains 14/35 properties
BEST_FIRST walk for 40003 steps (8 resets) in 271 ms. (147 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 253 ms. (157 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 164 ms. (242 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 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 203 ms. (196 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 13/13 properties
// Phase 1: matrix 682 rows 811 cols
[2024-05-29 21:30:10] [INFO ] Computed 330 invariants in 4 ms
[2024-05-29 21:30:10] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 43/59 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 26/85 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 103/188 variables, 85/111 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 155/343 variables, 84/199 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 24/223 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 13/356 variables, 14/238 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/356 variables, 9/247 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/356 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 26/382 variables, 12/259 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/382 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 167/549 variables, 99/358 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/549 variables, 23/381 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/549 variables, 3/384 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/549 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (OVERLAPS) 13/562 variables, 11/395 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/562 variables, 7/402 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/562 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (OVERLAPS) 11/573 variables, 6/408 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/573 variables, 3/411 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/573 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 27 (OVERLAPS) 177/750 variables, 107/518 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/750 variables, 27/545 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/750 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 30 (OVERLAPS) 10/760 variables, 16/561 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/760 variables, 10/571 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/760 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 33 (OVERLAPS) 2/762 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/762 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 35 (OVERLAPS) 98/860 variables, 51/623 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/860 variables, 16/639 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/860 variables, 1/640 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/860 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 39 (OVERLAPS) 9/869 variables, 7/647 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/869 variables, 5/652 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/869 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 42 (OVERLAPS) 8/877 variables, 4/656 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/877 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 44 (OVERLAPS) 110/987 variables, 67/723 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/987 variables, 15/738 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/987 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 47 (OVERLAPS) 6/993 variables, 11/749 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/993 variables, 6/755 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/993 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 50 (OVERLAPS) 82/1075 variables, 39/794 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1075 variables, 8/802 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1075 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 53 (OVERLAPS) 12/1087 variables, 10/812 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1087 variables, 6/818 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1087 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 56 (OVERLAPS) 10/1097 variables, 5/823 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1097 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 58 (OVERLAPS) 78/1175 variables, 55/878 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1175 variables, 12/890 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1175 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 61 (OVERLAPS) 4/1179 variables, 6/896 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1179 variables, 2/898 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1179 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 64 (OVERLAPS) 37/1216 variables, 21/919 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1216 variables, 7/926 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1216 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 67 (OVERLAPS) 2/1218 variables, 2/928 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1218 variables, 2/930 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1218 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 70 (OVERLAPS) 4/1222 variables, 2/932 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1222 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 72 (OVERLAPS) 47/1269 variables, 27/959 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1269 variables, 7/966 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1269 variables, 0/966 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 75 (OVERLAPS) 2/1271 variables, 4/970 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1271 variables, 2/972 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1271 variables, 0/972 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 78 (OVERLAPS) 37/1308 variables, 19/991 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1308 variables, 7/998 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1308 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 81 (OVERLAPS) 2/1310 variables, 2/1000 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1310 variables, 2/1002 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1310 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 84 (OVERLAPS) 4/1314 variables, 2/1004 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1314 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 86 (OVERLAPS) 47/1361 variables, 27/1031 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1361 variables, 7/1038 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1361 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 89 (OVERLAPS) 2/1363 variables, 4/1042 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1363 variables, 2/1044 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1363 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 92 (OVERLAPS) 37/1400 variables, 19/1063 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1400 variables, 7/1070 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1400 variables, 0/1070 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 95 (OVERLAPS) 2/1402 variables, 2/1072 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1402 variables, 2/1074 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1402 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 98 (OVERLAPS) 4/1406 variables, 2/1076 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1406 variables, 0/1076 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 100 (OVERLAPS) 48/1454 variables, 26/1102 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1454 variables, 4/1106 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1454 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 103 (OVERLAPS) 5/1459 variables, 7/1113 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1459 variables, 5/1118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1459 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 106 (OVERLAPS) 24/1483 variables, 15/1133 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1483 variables, 6/1139 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1483 variables, 0/1139 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 109 (OVERLAPS) 1/1484 variables, 1/1140 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1484 variables, 1/1141 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1484 variables, 0/1141 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 112 (OVERLAPS) 2/1486 variables, 1/1142 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1486 variables, 0/1142 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 114 (OVERLAPS) 7/1493 variables, 6/1148 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1493 variables, 2/1150 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1493 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 117 (OVERLAPS) 0/1493 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1493/1493 variables, and 1150 constraints, problems are : Problem set: 0 solved, 13 unsolved in 8731 ms.
Refiners :[Positive P Invariants (semi-flows): 330/330 constraints, State Equation: 811/811 constraints, ReadFeed: 9/9 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 43/59 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 26/85 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:30:19] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 103/188 variables, 85/112 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 155/343 variables, 84/206 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 24/230 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/343 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/343 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/343 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 13/356 variables, 14/252 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/356 variables, 9/261 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/356 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 26/382 variables, 12/273 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/382 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (OVERLAPS) 167/549 variables, 99/372 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/549 variables, 23/395 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/549 variables, 3/398 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:30:19] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/549 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/549 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (OVERLAPS) 13/562 variables, 11/410 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/562 variables, 7/417 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/562 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 28 (OVERLAPS) 11/573 variables, 6/423 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/573 variables, 3/426 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/573 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 31 (OVERLAPS) 177/750 variables, 107/533 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/750 variables, 27/560 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/750 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 34 (OVERLAPS) 10/760 variables, 16/576 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/760 variables, 10/586 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/760 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 37 (OVERLAPS) 2/762 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/762 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 39 (OVERLAPS) 98/860 variables, 51/638 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/860 variables, 16/654 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/860 variables, 1/655 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:30:21] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/860 variables, 1/656 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/860 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 44 (OVERLAPS) 9/869 variables, 7/663 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/869 variables, 5/668 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/869 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 47 (OVERLAPS) 8/877 variables, 4/672 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/877 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 49 (OVERLAPS) 110/987 variables, 67/739 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/987 variables, 15/754 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/987 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 52 (OVERLAPS) 6/993 variables, 11/765 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/993 variables, 6/771 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/993 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 55 (OVERLAPS) 82/1075 variables, 39/810 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1075 variables, 8/818 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1075 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 58 (OVERLAPS) 12/1087 variables, 10/828 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1087 variables, 6/834 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1087 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 61 (OVERLAPS) 10/1097 variables, 5/839 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1097 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 63 (OVERLAPS) 78/1175 variables, 55/894 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1175 variables, 12/906 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1175 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 66 (OVERLAPS) 4/1179 variables, 6/912 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1179 variables, 2/914 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1179 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 69 (OVERLAPS) 37/1216 variables, 21/935 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1216 variables, 7/942 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1216 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 72 (OVERLAPS) 2/1218 variables, 2/944 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1218 variables, 2/946 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1218 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 75 (OVERLAPS) 4/1222 variables, 2/948 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1222 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 77 (OVERLAPS) 47/1269 variables, 27/975 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1269 variables, 7/982 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:30:24] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 2 ms to minimize.
At refinement iteration 79 (INCLUDED_ONLY) 0/1269 variables, 1/983 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1269 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 81 (OVERLAPS) 2/1271 variables, 4/987 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1271 variables, 2/989 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1271 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 84 (OVERLAPS) 37/1308 variables, 19/1008 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1308 variables, 7/1015 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1308 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 87 (OVERLAPS) 2/1310 variables, 2/1017 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1310 variables, 2/1019 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1310 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 90 (OVERLAPS) 4/1314 variables, 2/1021 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:30:26] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 2 ms to minimize.
At refinement iteration 91 (INCLUDED_ONLY) 0/1314 variables, 1/1022 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1314 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 93 (OVERLAPS) 47/1361 variables, 27/1049 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1361 variables, 7/1056 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1361 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 96 (OVERLAPS) 2/1363 variables, 4/1060 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1363 variables, 2/1062 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1363 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 99 (OVERLAPS) 37/1400 variables, 19/1081 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1400 variables, 7/1088 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1400 variables, 0/1088 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 102 (OVERLAPS) 2/1402 variables, 2/1090 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1402 variables, 2/1092 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1402 variables, 0/1092 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 105 (OVERLAPS) 4/1406 variables, 2/1094 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1406 variables, 0/1094 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 107 (OVERLAPS) 48/1454 variables, 26/1120 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1454 variables, 4/1124 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1454 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 110 (OVERLAPS) 5/1459 variables, 7/1131 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1459 variables, 5/1136 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1459 variables, 0/1136 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 113 (OVERLAPS) 24/1483 variables, 15/1151 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1483 variables, 6/1157 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1483 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 116 (OVERLAPS) 1/1484 variables, 1/1158 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1484 variables, 1/1159 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1484 variables, 0/1159 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 119 (OVERLAPS) 2/1486 variables, 1/1160 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1486 variables, 0/1160 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 121 (OVERLAPS) 7/1493 variables, 6/1166 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1493 variables, 2/1168 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1493 variables, 0/1168 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 124 (OVERLAPS) 0/1493 variables, 0/1168 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1493/1493 variables, and 1168 constraints, problems are : Problem set: 0 solved, 13 unsolved in 12699 ms.
Refiners :[Positive P Invariants (semi-flows): 330/330 constraints, State Equation: 811/811 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 5/5 constraints]
After SMT, in 21458ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 4213 ms.
Support contains 16 out of 811 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 811/811 places, 682/682 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 811 transition count 678
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 807 transition count 678
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 8 place count 807 transition count 665
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 34 place count 794 transition count 665
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 68 place count 777 transition count 648
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 1
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 80 place count 771 transition count 647
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 84 place count 767 transition count 643
Applied a total of 84 rules in 105 ms. Remains 767 /811 variables (removed 44) and now considering 643/682 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 767/811 places, 643/682 transitions.
RANDOM walk for 40000 steps (8 resets) in 524 ms. (76 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 205 ms. (194 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 101774 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 13
Probabilistic random walk after 101774 steps, saw 76050 distinct states, run finished after 3004 ms. (steps per millisecond=33 ) properties seen :0
// Phase 1: matrix 643 rows 767 cols
[2024-05-29 21:30:40] [INFO ] Computed 330 invariants in 2 ms
[2024-05-29 21:30:40] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 38/54 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 23/77 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 96/173 variables, 77/103 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 151/324 variables, 84/194 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 30/224 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/324 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 7/331 variables, 8/233 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 7/240 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/331 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 12/343 variables, 6/246 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/343 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 164/507 variables, 87/333 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/507 variables, 27/360 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/507 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/507 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (OVERLAPS) 9/516 variables, 10/371 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/516 variables, 9/380 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/516 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (OVERLAPS) 15/531 variables, 8/388 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/531 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/531 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 27 (OVERLAPS) 178/709 variables, 108/497 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/709 variables, 31/528 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/709 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 30 (OVERLAPS) 8/717 variables, 13/541 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/717 variables, 8/549 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/717 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 33 (OVERLAPS) 2/719 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/719 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 35 (OVERLAPS) 93/812 variables, 50/600 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/812 variables, 19/619 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/812 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 38 (OVERLAPS) 4/816 variables, 4/623 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/816 variables, 4/627 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/816 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 41 (OVERLAPS) 8/824 variables, 4/631 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/824 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 43 (OVERLAPS) 109/933 variables, 63/694 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/933 variables, 16/710 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/933 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 46 (OVERLAPS) 5/938 variables, 10/720 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/938 variables, 5/725 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/938 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 49 (OVERLAPS) 71/1009 variables, 37/762 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1009 variables, 14/776 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1009 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 52 (OVERLAPS) 4/1013 variables, 4/780 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1013 variables, 4/784 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1013 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 55 (OVERLAPS) 8/1021 variables, 4/788 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1021 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 57 (OVERLAPS) 74/1095 variables, 46/834 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1095 variables, 12/846 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1095 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 60 (OVERLAPS) 3/1098 variables, 6/852 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1098 variables, 3/855 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1098 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 63 (OVERLAPS) 39/1137 variables, 21/876 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1137 variables, 8/884 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1137 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 66 (OVERLAPS) 2/1139 variables, 2/886 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1139 variables, 2/888 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1139 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 69 (OVERLAPS) 4/1143 variables, 2/890 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1143 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 71 (OVERLAPS) 47/1190 variables, 27/917 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1190 variables, 7/924 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1190 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 74 (OVERLAPS) 2/1192 variables, 4/928 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1192 variables, 2/930 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1192 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 77 (OVERLAPS) 37/1229 variables, 19/949 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1229 variables, 7/956 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1229 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 80 (OVERLAPS) 2/1231 variables, 2/958 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1231 variables, 2/960 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1231 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 83 (OVERLAPS) 4/1235 variables, 2/962 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1235 variables, 0/962 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 85 (OVERLAPS) 47/1282 variables, 27/989 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1282 variables, 7/996 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1282 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 88 (OVERLAPS) 2/1284 variables, 4/1000 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1284 variables, 2/1002 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1284 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 91 (OVERLAPS) 37/1321 variables, 19/1021 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1321 variables, 7/1028 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1321 variables, 0/1028 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 94 (OVERLAPS) 2/1323 variables, 2/1030 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1323 variables, 2/1032 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1323 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 97 (OVERLAPS) 4/1327 variables, 2/1034 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1327 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 99 (OVERLAPS) 46/1373 variables, 27/1061 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1373 variables, 7/1068 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1373 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 102 (OVERLAPS) 2/1375 variables, 4/1072 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1375 variables, 2/1074 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1375 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 105 (OVERLAPS) 25/1400 variables, 15/1089 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1400 variables, 6/1095 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1400 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 108 (OVERLAPS) 1/1401 variables, 1/1096 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1401 variables, 1/1097 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1401 variables, 0/1097 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 111 (OVERLAPS) 2/1403 variables, 1/1098 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1403 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 113 (OVERLAPS) 7/1410 variables, 6/1104 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1410 variables, 2/1106 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1410 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 116 (OVERLAPS) 0/1410 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1410/1410 variables, and 1106 constraints, problems are : Problem set: 0 solved, 13 unsolved in 7871 ms.
Refiners :[Positive P Invariants (semi-flows): 330/330 constraints, State Equation: 767/767 constraints, ReadFeed: 9/9 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 38/54 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 23/77 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 96/173 variables, 77/103 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:30:48] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
[2024-05-29 21:30:48] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 21:30:48] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 151/324 variables, 84/203 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/324 variables, 30/233 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/324 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/324 variables, 7/241 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:30:48] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/324 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/324 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 7/331 variables, 8/250 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/331 variables, 7/257 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/331 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 12/343 variables, 6/263 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/343 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (OVERLAPS) 164/507 variables, 87/350 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/507 variables, 27/377 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/507 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/507 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (OVERLAPS) 9/516 variables, 10/388 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/516 variables, 9/397 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/516 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 28 (OVERLAPS) 15/531 variables, 8/405 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/531 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/531 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 31 (OVERLAPS) 178/709 variables, 108/514 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/709 variables, 31/545 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/709 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 34 (OVERLAPS) 8/717 variables, 13/558 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/717 variables, 8/566 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/717 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 37 (OVERLAPS) 2/719 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:30:49] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 2 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/719 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/719 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 40 (OVERLAPS) 93/812 variables, 50/618 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/812 variables, 19/637 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/812 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 43 (OVERLAPS) 4/816 variables, 4/641 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/816 variables, 4/645 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/816 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 46 (OVERLAPS) 8/824 variables, 4/649 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/824 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 48 (OVERLAPS) 109/933 variables, 63/712 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/933 variables, 16/728 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:30:50] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 2 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/933 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/933 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 52 (OVERLAPS) 5/938 variables, 10/739 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/938 variables, 5/744 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/938 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 55 (OVERLAPS) 71/1009 variables, 37/781 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1009 variables, 14/795 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1009 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 58 (OVERLAPS) 4/1013 variables, 4/799 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1013 variables, 4/803 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1013 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 61 (OVERLAPS) 8/1021 variables, 4/807 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1021 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 63 (OVERLAPS) 74/1095 variables, 46/853 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1095 variables, 12/865 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1095 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 66 (OVERLAPS) 3/1098 variables, 6/871 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1098 variables, 3/874 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1098 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 69 (OVERLAPS) 39/1137 variables, 21/895 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1137 variables, 8/903 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1137 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 72 (OVERLAPS) 2/1139 variables, 2/905 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1139 variables, 2/907 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1139 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 75 (OVERLAPS) 4/1143 variables, 2/909 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1143 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 77 (OVERLAPS) 47/1190 variables, 27/936 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1190 variables, 7/943 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1190 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 80 (OVERLAPS) 2/1192 variables, 4/947 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1192 variables, 2/949 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1192 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 83 (OVERLAPS) 37/1229 variables, 19/968 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1229 variables, 7/975 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1229 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 86 (OVERLAPS) 2/1231 variables, 2/977 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1231 variables, 2/979 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1231 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 89 (OVERLAPS) 4/1235 variables, 2/981 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1235 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 91 (OVERLAPS) 47/1282 variables, 27/1008 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1282 variables, 7/1015 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1282 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 94 (OVERLAPS) 2/1284 variables, 4/1019 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1284 variables, 2/1021 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1284 variables, 0/1021 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 97 (OVERLAPS) 37/1321 variables, 19/1040 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1321 variables, 7/1047 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1321 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 100 (OVERLAPS) 2/1323 variables, 2/1049 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1323 variables, 2/1051 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:30:55] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
At refinement iteration 102 (INCLUDED_ONLY) 0/1323 variables, 1/1052 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1323 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 104 (OVERLAPS) 4/1327 variables, 2/1054 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1327 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 106 (OVERLAPS) 46/1373 variables, 27/1081 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1373 variables, 7/1088 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1373 variables, 0/1088 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 109 (OVERLAPS) 2/1375 variables, 4/1092 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1375 variables, 2/1094 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1375 variables, 0/1094 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 112 (OVERLAPS) 25/1400 variables, 15/1109 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1400 variables, 6/1115 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1400 variables, 0/1115 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 115 (OVERLAPS) 1/1401 variables, 1/1116 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1401 variables, 1/1117 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1401 variables, 0/1117 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 118 (OVERLAPS) 2/1403 variables, 1/1118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1403 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 120 (OVERLAPS) 7/1410 variables, 6/1124 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1410 variables, 2/1126 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1410 variables, 0/1126 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 123 (OVERLAPS) 0/1410 variables, 0/1126 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1410/1410 variables, and 1126 constraints, problems are : Problem set: 0 solved, 13 unsolved in 11099 ms.
Refiners :[Positive P Invariants (semi-flows): 330/330 constraints, State Equation: 767/767 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 7/7 constraints]
After SMT, in 18980ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 3319 ms.
Support contains 16 out of 767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 767/767 places, 643/643 transitions.
Applied a total of 0 rules in 20 ms. Remains 767 /767 variables (removed 0) and now considering 643/643 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 767/767 places, 643/643 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 767/767 places, 643/643 transitions.
Applied a total of 0 rules in 18 ms. Remains 767 /767 variables (removed 0) and now considering 643/643 (removed 0) transitions.
[2024-05-29 21:31:02] [INFO ] Invariant cache hit.
[2024-05-29 21:31:02] [INFO ] Implicit Places using invariants in 488 ms returned [750, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 490 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 765/767 places, 643/643 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 763 transition count 641
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 763 transition count 641
Applied a total of 4 rules in 28 ms. Remains 763 /765 variables (removed 2) and now considering 641/643 (removed 2) transitions.
// Phase 1: matrix 641 rows 763 cols
[2024-05-29 21:31:03] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 21:31:03] [INFO ] Implicit Places using invariants in 526 ms returned []
[2024-05-29 21:31:03] [INFO ] Invariant cache hit.
[2024-05-29 21:31:03] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 21:31:04] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 1226 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 763/767 places, 641/643 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1762 ms. Remains : 763/767 places, 641/643 transitions.
RANDOM walk for 40000 steps (8 resets) in 369 ms. (108 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 181 ms. (219 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 173 ms. (229 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 188 ms. (211 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 203 ms. (196 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 118396 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 13
Probabilistic random walk after 118396 steps, saw 90246 distinct states, run finished after 3002 ms. (steps per millisecond=39 ) properties seen :0
[2024-05-29 21:31:08] [INFO ] Invariant cache hit.
[2024-05-29 21:31:08] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 38/54 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 23/77 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 96/173 variables, 77/103 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 150/323 variables, 84/194 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 30/224 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 7/330 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 7/239 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/330 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 12/342 variables, 6/245 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/342 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 161/503 variables, 85/330 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/503 variables, 27/357 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/503 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 8/511 variables, 9/366 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/511 variables, 8/374 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/511 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (OVERLAPS) 14/525 variables, 7/381 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/525 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (OVERLAPS) 178/703 variables, 108/489 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/703 variables, 31/520 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/703 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 27 (OVERLAPS) 8/711 variables, 13/533 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/711 variables, 8/541 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/711 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 30 (OVERLAPS) 2/713 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/713 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 32 (OVERLAPS) 93/806 variables, 50/592 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/806 variables, 19/611 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/806 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 35 (OVERLAPS) 4/810 variables, 4/615 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/810 variables, 4/619 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/810 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 38 (OVERLAPS) 8/818 variables, 4/623 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/818 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 40 (OVERLAPS) 109/927 variables, 63/686 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/927 variables, 16/702 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/927 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 43 (OVERLAPS) 5/932 variables, 10/712 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/932 variables, 5/717 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/932 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 46 (OVERLAPS) 71/1003 variables, 37/754 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1003 variables, 14/768 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1003 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 49 (OVERLAPS) 4/1007 variables, 4/772 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1007 variables, 4/776 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1007 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 52 (OVERLAPS) 8/1015 variables, 4/780 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1015 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 54 (OVERLAPS) 74/1089 variables, 46/826 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1089 variables, 12/838 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1089 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 57 (OVERLAPS) 3/1092 variables, 6/844 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1092 variables, 3/847 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1092 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 60 (OVERLAPS) 39/1131 variables, 21/868 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1131 variables, 8/876 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1131 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 63 (OVERLAPS) 2/1133 variables, 2/878 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1133 variables, 2/880 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1133 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 66 (OVERLAPS) 4/1137 variables, 2/882 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1137 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 68 (OVERLAPS) 47/1184 variables, 27/909 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1184 variables, 7/916 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1184 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 71 (OVERLAPS) 2/1186 variables, 4/920 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1186 variables, 2/922 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1186 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 74 (OVERLAPS) 37/1223 variables, 19/941 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1223 variables, 7/948 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1223 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 77 (OVERLAPS) 2/1225 variables, 2/950 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1225 variables, 2/952 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1225 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 80 (OVERLAPS) 4/1229 variables, 2/954 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1229 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 82 (OVERLAPS) 47/1276 variables, 27/981 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1276 variables, 7/988 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1276 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 85 (OVERLAPS) 2/1278 variables, 4/992 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1278 variables, 2/994 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1278 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 88 (OVERLAPS) 37/1315 variables, 19/1013 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1315 variables, 7/1020 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1315 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 91 (OVERLAPS) 2/1317 variables, 2/1022 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1317 variables, 2/1024 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1317 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 94 (OVERLAPS) 4/1321 variables, 2/1026 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1321 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 96 (OVERLAPS) 46/1367 variables, 27/1053 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1367 variables, 7/1060 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1367 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 99 (OVERLAPS) 2/1369 variables, 4/1064 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1369 variables, 2/1066 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1369 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 102 (OVERLAPS) 25/1394 variables, 15/1081 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1394 variables, 6/1087 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1394 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 105 (OVERLAPS) 1/1395 variables, 1/1088 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1395 variables, 1/1089 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1395 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 108 (OVERLAPS) 2/1397 variables, 1/1090 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1397 variables, 0/1090 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 110 (OVERLAPS) 7/1404 variables, 6/1096 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1404 variables, 2/1098 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1404 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 113 (OVERLAPS) 0/1404 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1404/1404 variables, and 1098 constraints, problems are : Problem set: 0 solved, 13 unsolved in 7907 ms.
Refiners :[Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 763/763 constraints, ReadFeed: 7/7 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 38/54 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 23/77 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 96/173 variables, 77/103 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:31:16] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 150/323 variables, 84/201 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 30/231 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/323 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 7/330 variables, 8/246 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/330 variables, 7/253 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 12/342 variables, 6/259 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:31:16] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/342 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/342 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (OVERLAPS) 161/503 variables, 85/345 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/503 variables, 27/372 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/503 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (OVERLAPS) 8/511 variables, 9/381 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/511 variables, 8/389 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/511 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (OVERLAPS) 14/525 variables, 7/396 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:31:17] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/525 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/525 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 29 (OVERLAPS) 178/703 variables, 108/505 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/703 variables, 31/536 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/703 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 32 (OVERLAPS) 8/711 variables, 13/549 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/711 variables, 8/557 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/711 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 35 (OVERLAPS) 2/713 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/713 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 37 (OVERLAPS) 93/806 variables, 50/608 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/806 variables, 19/627 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/806 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 40 (OVERLAPS) 4/810 variables, 4/631 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/810 variables, 4/635 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/810 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 43 (OVERLAPS) 8/818 variables, 4/639 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/818 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 45 (OVERLAPS) 109/927 variables, 63/702 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/927 variables, 16/718 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/927 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 48 (OVERLAPS) 5/932 variables, 10/728 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/932 variables, 5/733 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/932 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 51 (OVERLAPS) 71/1003 variables, 37/770 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1003 variables, 14/784 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:31:19] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 2 ms to minimize.
At refinement iteration 53 (INCLUDED_ONLY) 0/1003 variables, 1/785 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1003 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 55 (OVERLAPS) 4/1007 variables, 4/789 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1007 variables, 4/793 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1007 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 58 (OVERLAPS) 8/1015 variables, 4/797 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1015 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 60 (OVERLAPS) 74/1089 variables, 46/843 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1089 variables, 12/855 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:31:20] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
At refinement iteration 62 (INCLUDED_ONLY) 0/1089 variables, 1/856 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1089 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 64 (OVERLAPS) 3/1092 variables, 6/862 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1092 variables, 3/865 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1092 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 67 (OVERLAPS) 39/1131 variables, 21/886 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1131 variables, 8/894 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:31:20] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
At refinement iteration 69 (INCLUDED_ONLY) 0/1131 variables, 1/895 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1131 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 71 (OVERLAPS) 2/1133 variables, 2/897 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1133 variables, 2/899 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1133 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 74 (OVERLAPS) 4/1137 variables, 2/901 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1137 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 76 (OVERLAPS) 47/1184 variables, 27/928 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1184 variables, 7/935 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1184 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 79 (OVERLAPS) 2/1186 variables, 4/939 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1186 variables, 2/941 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1186 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 82 (OVERLAPS) 37/1223 variables, 19/960 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1223 variables, 7/967 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1223 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 85 (OVERLAPS) 2/1225 variables, 2/969 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1225 variables, 2/971 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1225 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 88 (OVERLAPS) 4/1229 variables, 2/973 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1229 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 90 (OVERLAPS) 47/1276 variables, 27/1000 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1276 variables, 7/1007 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1276 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 93 (OVERLAPS) 2/1278 variables, 4/1011 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1278 variables, 2/1013 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1278 variables, 0/1013 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 96 (OVERLAPS) 37/1315 variables, 19/1032 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1315 variables, 7/1039 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1315 variables, 0/1039 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 99 (OVERLAPS) 2/1317 variables, 2/1041 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1317 variables, 2/1043 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1317 variables, 0/1043 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 102 (OVERLAPS) 4/1321 variables, 2/1045 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1321 variables, 0/1045 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 104 (OVERLAPS) 46/1367 variables, 27/1072 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1367 variables, 7/1079 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1367 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 107 (OVERLAPS) 2/1369 variables, 4/1083 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1369 variables, 2/1085 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 21:31:25] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
At refinement iteration 109 (INCLUDED_ONLY) 0/1369 variables, 1/1086 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1369 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 111 (OVERLAPS) 25/1394 variables, 15/1101 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1394 variables, 6/1107 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1394 variables, 0/1107 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 114 (OVERLAPS) 1/1395 variables, 1/1108 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1395 variables, 1/1109 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1395 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 117 (OVERLAPS) 2/1397 variables, 1/1110 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1397 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 119 (OVERLAPS) 7/1404 variables, 6/1116 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1404 variables, 2/1118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1404 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 122 (OVERLAPS) 0/1404 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1404/1404 variables, and 1118 constraints, problems are : Problem set: 0 solved, 13 unsolved in 11713 ms.
Refiners :[Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 763/763 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 7/7 constraints]
After SMT, in 19634ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 3010 ms.
Support contains 16 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 641/641 transitions.
Applied a total of 0 rules in 25 ms. Remains 763 /763 variables (removed 0) and now considering 641/641 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 763/763 places, 641/641 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 641/641 transitions.
Applied a total of 0 rules in 20 ms. Remains 763 /763 variables (removed 0) and now considering 641/641 (removed 0) transitions.
[2024-05-29 21:31:30] [INFO ] Invariant cache hit.
[2024-05-29 21:31:31] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-29 21:31:31] [INFO ] Invariant cache hit.
[2024-05-29 21:31:31] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 21:31:32] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1096 ms to find 0 implicit places.
[2024-05-29 21:31:32] [INFO ] Redundant transitions in 30 ms returned []
Running 635 sub problems to find dead transitions.
[2024-05-29 21:31:32] [INFO ] Invariant cache hit.
[2024-05-29 21:31:32] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/759 variables, 314/314 constraints. Problems are: Problem set: 0 solved, 635 unsolved
[2024-05-29 21:31:40] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-29 21:31:40] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-29 21:31:41] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 3 ms to minimize.
[2024-05-29 21:31:41] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 3 ms to minimize.
[2024-05-29 21:31:41] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 3 ms to minimize.
[2024-05-29 21:31:42] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 2 ms to minimize.
[2024-05-29 21:31:42] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 3 ms to minimize.
[2024-05-29 21:31:42] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 3 ms to minimize.
[2024-05-29 21:31:42] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 3 ms to minimize.
[2024-05-29 21:31:42] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 3 ms to minimize.
[2024-05-29 21:31:42] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 3 ms to minimize.
[2024-05-29 21:31:42] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 3 ms to minimize.
[2024-05-29 21:31:42] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 6 ms to minimize.
[2024-05-29 21:31:43] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 2 ms to minimize.
[2024-05-29 21:31:43] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 2 ms to minimize.
[2024-05-29 21:31:43] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 2 ms to minimize.
[2024-05-29 21:31:43] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 2 ms to minimize.
[2024-05-29 21:31:43] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 2 ms to minimize.
[2024-05-29 21:31:43] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 2 ms to minimize.
[2024-05-29 21:31:43] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/759 variables, 20/334 constraints. Problems are: Problem set: 0 solved, 635 unsolved
[2024-05-29 21:31:47] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
[2024-05-29 21:31:47] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 2 ms to minimize.
[2024-05-29 21:31:47] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-05-29 21:31:47] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-05-29 21:31:47] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-29 21:31:47] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 3 ms to minimize.
[2024-05-29 21:31:47] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 2 ms to minimize.
[2024-05-29 21:31:47] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 ms to minimize.
[2024-05-29 21:31:47] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 3 ms to minimize.
[2024-05-29 21:31:47] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-29 21:31:47] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 2 ms to minimize.
[2024-05-29 21:31:47] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 2 ms to minimize.
[2024-05-29 21:31:47] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 2 ms to minimize.
[2024-05-29 21:31:48] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-05-29 21:31:48] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 2 ms to minimize.
[2024-05-29 21:31:48] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-05-29 21:31:48] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-29 21:31:48] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-05-29 21:31:48] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-05-29 21:31:48] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/759 variables, 20/354 constraints. Problems are: Problem set: 0 solved, 635 unsolved
[2024-05-29 21:31:52] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/759 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 635 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 759/1404 variables, and 355 constraints, problems are : Problem set: 0 solved, 635 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 314/328 constraints, State Equation: 0/763 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 635/635 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 635 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/759 variables, 314/314 constraints. Problems are: Problem set: 0 solved, 635 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/759 variables, 41/355 constraints. Problems are: Problem set: 0 solved, 635 unsolved
[2024-05-29 21:32:03] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-29 21:32:03] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-29 21:32:03] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 21:32:03] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-29 21:32:03] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 21:32:03] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-29 21:32:03] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 21:32:03] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 21:32:03] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-29 21:32:04] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-29 21:32:04] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-29 21:32:04] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-29 21:32:04] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2024-05-29 21:32:04] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-29 21:32:04] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-29 21:32:04] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-29 21:32:04] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-29 21:32:04] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-29 21:32:04] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-29 21:32:04] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/759 variables, 20/375 constraints. Problems are: Problem set: 0 solved, 635 unsolved
[2024-05-29 21:32:06] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-29 21:32:06] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-29 21:32:06] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-29 21:32:06] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-29 21:32:06] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-29 21:32:06] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-29 21:32:06] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-05-29 21:32:06] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 2 ms to minimize.
[2024-05-29 21:32:06] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-29 21:32:07] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-29 21:32:07] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-29 21:32:07] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-29 21:32:07] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2024-05-29 21:32:07] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-05-29 21:32:09] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 2 ms to minimize.
[2024-05-29 21:32:09] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 2 ms to minimize.
[2024-05-29 21:32:09] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/759 variables, 17/392 constraints. Problems are: Problem set: 0 solved, 635 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/759 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 635 unsolved
At refinement iteration 5 (OVERLAPS) 4/763 variables, 14/406 constraints. Problems are: Problem set: 0 solved, 635 unsolved
[2024-05-29 21:32:21] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-29 21:32:23] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-05-29 21:32:23] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-05-29 21:32:23] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 4/410 constraints. Problems are: Problem set: 0 solved, 635 unsolved
[2024-05-29 21:32:30] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-29 21:32:30] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 763/1404 variables, and 412 constraints, problems are : Problem set: 0 solved, 635 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 0/763 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 0/635 constraints, Known Traps: 84/84 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 635 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61308 ms. Remains : 763/763 places, 641/641 transitions.
[2024-05-29 21:32:32] [INFO ] Flatten gal took : 61 ms
[2024-05-29 21:32:32] [INFO ] Flatten gal took : 101 ms
[2024-05-29 21:32:32] [INFO ] Input system was already deterministic with 1824 transitions.
Computed a total of 481 stabilizing places and 481 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 2033 transition count 1404
Reduce places removed 419 places and 0 transitions.
Iterating post reduction 1 with 419 rules applied. Total rules applied 838 place count 1614 transition count 1404
Performed 228 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 228 Pre rules applied. Total rules applied 838 place count 1614 transition count 1176
Deduced a syphon composed of 228 places in 2 ms
Reduce places removed 228 places and 0 transitions.
Iterating global reduction 2 with 456 rules applied. Total rules applied 1294 place count 1386 transition count 1176
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1311 place count 1369 transition count 1159
Iterating global reduction 2 with 17 rules applied. Total rules applied 1328 place count 1369 transition count 1159
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 1328 place count 1369 transition count 1145
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 1356 place count 1355 transition count 1145
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 480
Deduced a syphon composed of 480 places in 1 ms
Reduce places removed 480 places and 0 transitions.
Iterating global reduction 2 with 960 rules applied. Total rules applied 2316 place count 875 transition count 665
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2317 place count 875 transition count 664
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2319 place count 874 transition count 663
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2321 place count 872 transition count 661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2322 place count 871 transition count 661
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2322 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 4 with 4 rules applied. Total rules applied 2326 place count 869 transition count 659
Applied a total of 2326 rules in 319 ms. Remains 869 /2034 variables (removed 1165) and now considering 659/1824 (removed 1165) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 319 ms. Remains : 869/2034 places, 659/1824 transitions.
[2024-05-29 21:32:32] [INFO ] Flatten gal took : 19 ms
[2024-05-29 21:32:32] [INFO ] Flatten gal took : 21 ms
[2024-05-29 21:32:32] [INFO ] Input system was already deterministic with 659 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 2033 transition count 1403
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 1613 transition count 1403
Performed 228 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 228 Pre rules applied. Total rules applied 840 place count 1613 transition count 1175
Deduced a syphon composed of 228 places in 2 ms
Reduce places removed 228 places and 0 transitions.
Iterating global reduction 2 with 456 rules applied. Total rules applied 1296 place count 1385 transition count 1175
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1313 place count 1368 transition count 1158
Iterating global reduction 2 with 17 rules applied. Total rules applied 1330 place count 1368 transition count 1158
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 1330 place count 1368 transition count 1144
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 1358 place count 1354 transition count 1144
Performed 481 Post agglomeration using F-continuation condition.Transition count delta: 481
Deduced a syphon composed of 481 places in 1 ms
Reduce places removed 481 places and 0 transitions.
Iterating global reduction 2 with 962 rules applied. Total rules applied 2320 place count 873 transition count 663
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2321 place count 873 transition count 662
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2323 place count 872 transition count 661
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2324 place count 872 transition count 661
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2326 place count 870 transition count 659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2327 place count 869 transition count 659
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2327 place count 869 transition count 657
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 2331 place count 867 transition count 657
Applied a total of 2331 rules in 445 ms. Remains 867 /2034 variables (removed 1167) and now considering 657/1824 (removed 1167) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 445 ms. Remains : 867/2034 places, 657/1824 transitions.
[2024-05-29 21:32:33] [INFO ] Flatten gal took : 19 ms
[2024-05-29 21:32:33] [INFO ] Flatten gal took : 20 ms
[2024-05-29 21:32:33] [INFO ] Input system was already deterministic with 657 transitions.
RANDOM walk for 21740 steps (4 resets) in 218 ms. (99 steps per ms) remains 0/1 properties
FORMULA ShieldPPPt-PT-030B-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 2016 transition count 1806
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 2016 transition count 1806
Applied a total of 36 rules in 172 ms. Remains 2016 /2034 variables (removed 18) and now considering 1806/1824 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 172 ms. Remains : 2016/2034 places, 1806/1824 transitions.
[2024-05-29 21:32:33] [INFO ] Flatten gal took : 42 ms
[2024-05-29 21:32:33] [INFO ] Flatten gal took : 45 ms
[2024-05-29 21:32:33] [INFO ] Input system was already deterministic with 1806 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2034/2034 places, 1824/1824 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 2033 transition count 1402
Reduce places removed 421 places and 0 transitions.
Iterating post reduction 1 with 421 rules applied. Total rules applied 842 place count 1612 transition count 1402
Performed 228 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 228 Pre rules applied. Total rules applied 842 place count 1612 transition count 1174
Deduced a syphon composed of 228 places in 1 ms
Reduce places removed 228 places and 0 transitions.
Iterating global reduction 2 with 456 rules applied. Total rules applied 1298 place count 1384 transition count 1174
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1314 place count 1368 transition count 1158
Iterating global reduction 2 with 16 rules applied. Total rules applied 1330 place count 1368 transition count 1158
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 1330 place count 1368 transition count 1145
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 1356 place count 1355 transition count 1145
Performed 482 Post agglomeration using F-continuation condition.Transition count delta: 482
Deduced a syphon composed of 482 places in 1 ms
Reduce places removed 482 places and 0 transitions.
Iterating global reduction 2 with 964 rules applied. Total rules applied 2320 place count 873 transition count 663
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2321 place count 873 transition count 662
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2323 place count 872 transition count 661
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2325 place count 870 transition count 659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2326 place count 869 transition count 659
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2326 place count 869 transition count 657
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 2330 place count 867 transition count 657
Applied a total of 2330 rules in 321 ms. Remains 867 /2034 variables (removed 1167) and now considering 657/1824 (removed 1167) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 336 ms. Remains : 867/2034 places, 657/1824 transitions.
[2024-05-29 21:32:34] [INFO ] Flatten gal took : 17 ms
[2024-05-29 21:32:34] [INFO ] Flatten gal took : 19 ms
[2024-05-29 21:32:34] [INFO ] Input system was already deterministic with 657 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 2033 transition count 1403
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 1613 transition count 1403
Performed 229 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 229 Pre rules applied. Total rules applied 840 place count 1613 transition count 1174
Deduced a syphon composed of 229 places in 1 ms
Reduce places removed 229 places and 0 transitions.
Iterating global reduction 2 with 458 rules applied. Total rules applied 1298 place count 1384 transition count 1174
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1315 place count 1367 transition count 1157
Iterating global reduction 2 with 17 rules applied. Total rules applied 1332 place count 1367 transition count 1157
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 1332 place count 1367 transition count 1143
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 1360 place count 1353 transition count 1143
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 2 with 958 rules applied. Total rules applied 2318 place count 874 transition count 664
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2319 place count 874 transition count 663
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2321 place count 873 transition count 662
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2323 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 2324 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 2324 place count 870 transition count 658
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 2328 place count 868 transition count 658
Applied a total of 2328 rules in 244 ms. Remains 868 /2034 variables (removed 1166) and now considering 658/1824 (removed 1166) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 245 ms. Remains : 868/2034 places, 658/1824 transitions.
[2024-05-29 21:32:34] [INFO ] Flatten gal took : 16 ms
[2024-05-29 21:32:34] [INFO ] Flatten gal took : 18 ms
[2024-05-29 21:32:34] [INFO ] Input system was already deterministic with 658 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 2033 transition count 1403
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 1613 transition count 1403
Performed 228 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 228 Pre rules applied. Total rules applied 840 place count 1613 transition count 1175
Deduced a syphon composed of 228 places in 1 ms
Reduce places removed 228 places and 0 transitions.
Iterating global reduction 2 with 456 rules applied. Total rules applied 1296 place count 1385 transition count 1175
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1313 place count 1368 transition count 1158
Iterating global reduction 2 with 17 rules applied. Total rules applied 1330 place count 1368 transition count 1158
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 1330 place count 1368 transition count 1144
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 1358 place count 1354 transition count 1144
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 2 with 960 rules applied. Total rules applied 2318 place count 874 transition count 664
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2319 place count 874 transition count 663
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2321 place count 873 transition count 662
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2323 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 2324 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 2324 place count 870 transition count 658
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 2328 place count 868 transition count 658
Applied a total of 2328 rules in 199 ms. Remains 868 /2034 variables (removed 1166) and now considering 658/1824 (removed 1166) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 199 ms. Remains : 868/2034 places, 658/1824 transitions.
[2024-05-29 21:32:35] [INFO ] Flatten gal took : 18 ms
[2024-05-29 21:32:35] [INFO ] Flatten gal took : 19 ms
[2024-05-29 21:32:35] [INFO ] Input system was already deterministic with 658 transitions.
RANDOM walk for 11 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
FORMULA ShieldPPPt-PT-030B-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 2011 transition count 1801
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 2011 transition count 1801
Applied a total of 46 rules in 221 ms. Remains 2011 /2034 variables (removed 23) and now considering 1801/1824 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 2011/2034 places, 1801/1824 transitions.
[2024-05-29 21:32:35] [INFO ] Flatten gal took : 37 ms
[2024-05-29 21:32:35] [INFO ] Flatten gal took : 40 ms
[2024-05-29 21:32:35] [INFO ] Input system was already deterministic with 1801 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2013 transition count 1803
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2013 transition count 1803
Applied a total of 42 rules in 162 ms. Remains 2013 /2034 variables (removed 21) and now considering 1803/1824 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 2013/2034 places, 1803/1824 transitions.
[2024-05-29 21:32:35] [INFO ] Flatten gal took : 35 ms
[2024-05-29 21:32:35] [INFO ] Flatten gal took : 39 ms
[2024-05-29 21:32:35] [INFO ] Input system was already deterministic with 1803 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 2033 transition count 1403
Reduce places removed 420 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 421 rules applied. Total rules applied 841 place count 1613 transition count 1402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 842 place count 1612 transition count 1402
Performed 228 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 228 Pre rules applied. Total rules applied 842 place count 1612 transition count 1174
Deduced a syphon composed of 228 places in 1 ms
Reduce places removed 228 places and 0 transitions.
Iterating global reduction 3 with 456 rules applied. Total rules applied 1298 place count 1384 transition count 1174
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1314 place count 1368 transition count 1158
Iterating global reduction 3 with 16 rules applied. Total rules applied 1330 place count 1368 transition count 1158
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 1330 place count 1368 transition count 1145
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 1356 place count 1355 transition count 1145
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 2316 place count 875 transition count 665
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2317 place count 875 transition count 664
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2319 place count 874 transition count 663
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2321 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 2322 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 2322 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 2326 place count 869 transition count 659
Applied a total of 2326 rules in 245 ms. Remains 869 /2034 variables (removed 1165) and now considering 659/1824 (removed 1165) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 246 ms. Remains : 869/2034 places, 659/1824 transitions.
[2024-05-29 21:32:36] [INFO ] Flatten gal took : 21 ms
[2024-05-29 21:32:36] [INFO ] Flatten gal took : 20 ms
[2024-05-29 21:32:36] [INFO ] Input system was already deterministic with 659 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2013 transition count 1803
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2013 transition count 1803
Applied a total of 42 rules in 183 ms. Remains 2013 /2034 variables (removed 21) and now considering 1803/1824 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184 ms. Remains : 2013/2034 places, 1803/1824 transitions.
[2024-05-29 21:32:36] [INFO ] Flatten gal took : 35 ms
[2024-05-29 21:32:36] [INFO ] Flatten gal took : 36 ms
[2024-05-29 21:32:36] [INFO ] Input system was already deterministic with 1803 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 2015 transition count 1805
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 2015 transition count 1805
Applied a total of 38 rules in 178 ms. Remains 2015 /2034 variables (removed 19) and now considering 1805/1824 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 2015/2034 places, 1805/1824 transitions.
[2024-05-29 21:32:36] [INFO ] Flatten gal took : 36 ms
[2024-05-29 21:32:36] [INFO ] Flatten gal took : 38 ms
[2024-05-29 21:32:36] [INFO ] Input system was already deterministic with 1805 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 417 rules applied. Total rules applied 417 place count 2033 transition count 1406
Reduce places removed 417 places and 0 transitions.
Iterating post reduction 1 with 417 rules applied. Total rules applied 834 place count 1616 transition count 1406
Performed 225 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 225 Pre rules applied. Total rules applied 834 place count 1616 transition count 1181
Deduced a syphon composed of 225 places in 2 ms
Reduce places removed 225 places and 0 transitions.
Iterating global reduction 2 with 450 rules applied. Total rules applied 1284 place count 1391 transition count 1181
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 1299 place count 1376 transition count 1166
Iterating global reduction 2 with 15 rules applied. Total rules applied 1314 place count 1376 transition count 1166
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 1314 place count 1376 transition count 1154
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 1338 place count 1364 transition count 1154
Performed 476 Post agglomeration using F-continuation condition.Transition count delta: 476
Deduced a syphon composed of 476 places in 1 ms
Reduce places removed 476 places and 0 transitions.
Iterating global reduction 2 with 952 rules applied. Total rules applied 2290 place count 888 transition count 678
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2291 place count 888 transition count 677
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2293 place count 887 transition count 676
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2294 place count 887 transition count 676
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2296 place count 885 transition count 674
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2297 place count 884 transition count 674
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2297 place count 884 transition count 672
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 2301 place count 882 transition count 672
Applied a total of 2301 rules in 220 ms. Remains 882 /2034 variables (removed 1152) and now considering 672/1824 (removed 1152) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 220 ms. Remains : 882/2034 places, 672/1824 transitions.
[2024-05-29 21:32:37] [INFO ] Flatten gal took : 19 ms
[2024-05-29 21:32:37] [INFO ] Flatten gal took : 20 ms
[2024-05-29 21:32:37] [INFO ] Input system was already deterministic with 672 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 2014 transition count 1804
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 2014 transition count 1804
Applied a total of 40 rules in 181 ms. Remains 2014 /2034 variables (removed 20) and now considering 1804/1824 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 182 ms. Remains : 2014/2034 places, 1804/1824 transitions.
[2024-05-29 21:32:37] [INFO ] Flatten gal took : 35 ms
[2024-05-29 21:32:37] [INFO ] Flatten gal took : 37 ms
[2024-05-29 21:32:37] [INFO ] Input system was already deterministic with 1804 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 2012 transition count 1802
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 2012 transition count 1802
Applied a total of 44 rules in 184 ms. Remains 2012 /2034 variables (removed 22) and now considering 1802/1824 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185 ms. Remains : 2012/2034 places, 1802/1824 transitions.
[2024-05-29 21:32:37] [INFO ] Flatten gal took : 33 ms
[2024-05-29 21:32:37] [INFO ] Flatten gal took : 36 ms
[2024-05-29 21:32:37] [INFO ] Input system was already deterministic with 1802 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 2011 transition count 1801
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 2011 transition count 1801
Applied a total of 46 rules in 164 ms. Remains 2011 /2034 variables (removed 23) and now considering 1801/1824 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 2011/2034 places, 1801/1824 transitions.
[2024-05-29 21:32:38] [INFO ] Flatten gal took : 32 ms
[2024-05-29 21:32:38] [INFO ] Flatten gal took : 33 ms
[2024-05-29 21:32:38] [INFO ] Input system was already deterministic with 1801 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2013 transition count 1803
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2013 transition count 1803
Applied a total of 42 rules in 165 ms. Remains 2013 /2034 variables (removed 21) and now considering 1803/1824 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 2013/2034 places, 1803/1824 transitions.
[2024-05-29 21:32:38] [INFO ] Flatten gal took : 34 ms
[2024-05-29 21:32:38] [INFO ] Flatten gal took : 35 ms
[2024-05-29 21:32:38] [INFO ] Input system was already deterministic with 1803 transitions.
[2024-05-29 21:32:38] [INFO ] Flatten gal took : 37 ms
[2024-05-29 21:32:38] [INFO ] Flatten gal took : 38 ms
[2024-05-29 21:32:38] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-29 21:32:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2034 places, 1824 transitions and 4728 arcs took 9 ms.
Total runtime 226309 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/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 2034
TRANSITIONS: 1824
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.035s, Sys 0.000s]


SAVING FILE /home/mcc/execution/410/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: 1008
MODEL NAME: /home/mcc/execution/410/model
2034 places, 1824 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 CTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-030B"
export BK_EXAMINATION="CTLFireability"
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 CTLFireability"
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-171683759200650"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;