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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717063789116

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 10:09:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 10:09:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 10:09:50] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2024-05-30 10:09:50] [INFO ] Transformed 2003 places.
[2024-05-30 10:09:50] [INFO ] Transformed 2253 transitions.
[2024-05-30 10:09:50] [INFO ] Found NUPN structural information;
[2024-05-30 10:09:50] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 339 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
FORMULA ShieldRVs-PT-050B-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 123 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Discarding 303 places :
Symmetric choice reduction at 0 with 303 rule applications. Total rules 303 place count 1700 transition count 1950
Iterating global reduction 0 with 303 rules applied. Total rules applied 606 place count 1700 transition count 1950
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 607 place count 1699 transition count 1949
Iterating global reduction 0 with 1 rules applied. Total rules applied 608 place count 1699 transition count 1949
Applied a total of 608 rules in 479 ms. Remains 1699 /2003 variables (removed 304) and now considering 1949/2253 (removed 304) transitions.
// Phase 1: matrix 1949 rows 1699 cols
[2024-05-30 10:09:51] [INFO ] Computed 201 invariants in 39 ms
[2024-05-30 10:09:52] [INFO ] Implicit Places using invariants in 710 ms returned []
[2024-05-30 10:09:52] [INFO ] Invariant cache hit.
[2024-05-30 10:09:53] [INFO ] Implicit Places using invariants and state equation in 1489 ms returned []
Implicit Place search using SMT with State Equation took 2229 ms to find 0 implicit places.
Running 1948 sub problems to find dead transitions.
[2024-05-30 10:09:53] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)timeout

(s952 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1698/3648 variables, and 0 constraints, problems are : Problem set: 0 solved, 1948 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1699 constraints, PredecessorRefiner: 1948/1948 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1948 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1698/3648 variables, and 0 constraints, problems are : Problem set: 0 solved, 1948 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1699 constraints, PredecessorRefiner: 0/1948 constraints, Known Traps: 0/0 constraints]
After SMT, in 60843ms problems are : Problem set: 0 solved, 1948 unsolved
Search for dead transitions found 0 dead transitions in 60886ms
Starting structural reductions in LTL mode, iteration 1 : 1699/2003 places, 1949/2253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63628 ms. Remains : 1699/2003 places, 1949/2253 transitions.
Support contains 123 out of 1699 places after structural reductions.
[2024-05-30 10:10:54] [INFO ] Flatten gal took : 161 ms
[2024-05-30 10:10:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldRVs-PT-050B-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 10:10:54] [INFO ] Flatten gal took : 102 ms
[2024-05-30 10:10:55] [INFO ] Input system was already deterministic with 1949 transitions.
Support contains 115 out of 1699 places (down from 123) after GAL structural reductions.
RANDOM walk for 40000 steps (16 resets) in 2703 ms. (14 steps per ms) remains 9/70 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 72 ms. (547 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 9/9 properties
[2024-05-30 10:10:56] [INFO ] Invariant cache hit.
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, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1199/1215 variables, 141/141 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1215 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 484/1699 variables, 60/201 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1699 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1949/3648 variables, 1699/1900 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3648 variables, 0/1900 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/3648 variables, 0/1900 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3648/3648 variables, and 1900 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2030 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 1699/1699 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1199/1215 variables, 141/141 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-30 10:10:58] [INFO ] Deduced a trap composed of 38 places in 285 ms of which 38 ms to minimize.
[2024-05-30 10:10:59] [INFO ] Deduced a trap composed of 46 places in 278 ms of which 4 ms to minimize.
[2024-05-30 10:10:59] [INFO ] Deduced a trap composed of 43 places in 239 ms of which 6 ms to minimize.
[2024-05-30 10:10:59] [INFO ] Deduced a trap composed of 40 places in 196 ms of which 4 ms to minimize.
[2024-05-30 10:10:59] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 3 ms to minimize.
[2024-05-30 10:10:59] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 3 ms to minimize.
[2024-05-30 10:11:00] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 3 ms to minimize.
[2024-05-30 10:11:00] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 3 ms to minimize.
[2024-05-30 10:11:00] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 2 ms to minimize.
[2024-05-30 10:11:00] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 2 ms to minimize.
[2024-05-30 10:11:00] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 2 ms to minimize.
[2024-05-30 10:11:00] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 3 ms to minimize.
[2024-05-30 10:11:01] [INFO ] Deduced a trap composed of 63 places in 197 ms of which 6 ms to minimize.
[2024-05-30 10:11:01] [INFO ] Deduced a trap composed of 64 places in 192 ms of which 5 ms to minimize.
[2024-05-30 10:11:01] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 5 ms to minimize.
[2024-05-30 10:11:01] [INFO ] Deduced a trap composed of 60 places in 135 ms of which 2 ms to minimize.
[2024-05-30 10:11:01] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 2 ms to minimize.
[2024-05-30 10:11:01] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1215 variables, 18/159 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1215 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 484/1699 variables, 60/219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-30 10:11:02] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 4 ms to minimize.
[2024-05-30 10:11:02] [INFO ] Deduced a trap composed of 16 places in 186 ms of which 3 ms to minimize.
[2024-05-30 10:11:03] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 3 ms to minimize.
[2024-05-30 10:11:03] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 3 ms to minimize.
[2024-05-30 10:11:03] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 4 ms to minimize.
SMT process timed out in 7209ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 1699 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1699 transition count 1750
Reduce places removed 199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 200 rules applied. Total rules applied 399 place count 1500 transition count 1749
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 1499 transition count 1749
Performed 247 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 247 Pre rules applied. Total rules applied 400 place count 1499 transition count 1502
Deduced a syphon composed of 247 places in 3 ms
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 3 with 494 rules applied. Total rules applied 894 place count 1252 transition count 1502
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 931 place count 1215 transition count 1465
Iterating global reduction 3 with 37 rules applied. Total rules applied 968 place count 1215 transition count 1465
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 968 place count 1215 transition count 1449
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 1000 place count 1199 transition count 1449
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 480
Deduced a syphon composed of 480 places in 2 ms
Reduce places removed 480 places and 0 transitions.
Iterating global reduction 3 with 960 rules applied. Total rules applied 1960 place count 719 transition count 969
Partial Free-agglomeration rule applied 102 times.
Drop transitions (Partial Free agglomeration) removed 102 transitions
Iterating global reduction 3 with 102 rules applied. Total rules applied 2062 place count 719 transition count 969
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2063 place count 718 transition count 968
Applied a total of 2063 rules in 455 ms. Remains 718 /1699 variables (removed 981) and now considering 968/1949 (removed 981) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 456 ms. Remains : 718/1699 places, 968/1949 transitions.
RANDOM walk for 40000 steps (64 resets) in 567 ms. (70 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 1/2 properties
// Phase 1: matrix 968 rows 718 cols
[2024-05-30 10:11:04] [INFO ] Computed 201 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 484/510 variables, 136/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/510 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 693/1203 variables, 510/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1203 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 56/1259 variables, 21/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1259 variables, 5/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1259 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/1261 variables, 1/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1261 variables, 2/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1261 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 60/1321 variables, 22/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1321 variables, 5/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1321 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/1325 variables, 2/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1325 variables, 4/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1325 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1387 variables, 24/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1387 variables, 6/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1387 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/1391 variables, 2/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1391 variables, 4/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1391 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 62/1453 variables, 24/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1453 variables, 6/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1453 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/1457 variables, 2/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1457 variables, 4/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1457 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 62/1519 variables, 24/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1519 variables, 6/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1519 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 4/1523 variables, 2/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1523 variables, 4/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1523 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 62/1585 variables, 24/846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1585 variables, 6/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1585 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 4/1589 variables, 2/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1589 variables, 4/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1589 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 62/1651 variables, 24/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1651 variables, 6/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1651 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 4/1655 variables, 2/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1655 variables, 4/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1655 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 29/1684 variables, 17/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1684 variables, 5/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1684 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 2/1686 variables, 2/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1686 variables, 1/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1686 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 0/1686 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1686/1686 variables, and 919 constraints, problems are : Problem set: 0 solved, 1 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 718/718 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 484/510 variables, 136/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:11:05] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-05-30 10:11:05] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-30 10:11:05] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-30 10:11:05] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:11:05] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-30 10:11:05] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:11:05] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-30 10:11:05] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
[2024-05-30 10:11:06] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
[2024-05-30 10:11:06] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 2 ms to minimize.
[2024-05-30 10:11:06] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-05-30 10:11:06] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-30 10:11:06] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:11:06] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-30 10:11:06] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-30 10:11:06] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/510 variables, 16/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 693/1203 variables, 510/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:11:06] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 3 ms to minimize.
[2024-05-30 10:11:06] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-05-30 10:11:07] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-30 10:11:07] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-05-30 10:11:07] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-05-30 10:11:07] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
[2024-05-30 10:11:07] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-05-30 10:11:07] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-30 10:11:07] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:11:07] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:11:07] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1203 variables, 11/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1203 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/1259 variables, 21/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1259 variables, 5/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1259 variables, 1/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:11:07] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-05-30 10:11:08] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2024-05-30 10:11:08] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-30 10:11:08] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-30 10:11:08] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-30 10:11:08] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 3 ms to minimize.
[2024-05-30 10:11:08] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-30 10:11:08] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-30 10:11:08] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:11:08] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-30 10:11:08] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1259 variables, 11/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1259 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1261 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1261 variables, 2/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1261 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 60/1321 variables, 22/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1321 variables, 5/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1321 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/1325 variables, 2/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1325 variables, 4/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1325 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 62/1387 variables, 24/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1387 variables, 6/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1387 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 4/1391 variables, 2/785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1391 variables, 4/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1391 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 62/1453 variables, 24/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1453 variables, 6/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1453 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 4/1457 variables, 2/821 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1457 variables, 4/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1457 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 62/1519 variables, 24/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1519 variables, 6/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1519 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 4/1523 variables, 2/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1523 variables, 4/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1523 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 62/1585 variables, 24/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1585 variables, 6/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1585 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 4/1589 variables, 2/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1589 variables, 4/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:11:09] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/1589 variables, 1/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1589 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 62/1651 variables, 24/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1651 variables, 6/928 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1651 variables, 0/928 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 4/1655 variables, 2/930 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1655 variables, 4/934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1655 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 29/1684 variables, 17/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1684 variables, 5/956 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1684 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 2/1686 variables, 2/958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1686 variables, 1/959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:11:09] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
At refinement iteration 59 (INCLUDED_ONLY) 0/1686 variables, 1/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1686 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 0/1686 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1686/1686 variables, and 960 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4952 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 718/718 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 40/40 constraints]
After SMT, in 5653ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 356 ms.
Support contains 3 out of 718 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 718/718 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 718 transition count 967
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 717 transition count 967
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 717 transition count 966
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 716 transition count 966
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 24 place count 706 transition count 956
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 705 transition count 955
Applied a total of 25 rules in 109 ms. Remains 705 /718 variables (removed 13) and now considering 955/968 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 705/718 places, 955/968 transitions.
RANDOM walk for 40000 steps (66 resets) in 330 ms. (120 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 218 ms. (182 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 456669 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :0 out of 1
Probabilistic random walk after 456669 steps, saw 447164 distinct states, run finished after 3004 ms. (steps per millisecond=152 ) properties seen :0
// Phase 1: matrix 955 rows 705 cols
[2024-05-30 10:11:13] [INFO ] Computed 201 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 236/260 variables, 68/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 358/618 variables, 260/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/618 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 56/674 variables, 21/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/674 variables, 5/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/674 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/676 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/676 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/676 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 60/736 variables, 22/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/736 variables, 5/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/736 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/740 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/740 variables, 4/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/740 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/802 variables, 24/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/802 variables, 6/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/802 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/806 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/806 variables, 4/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/806 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 62/868 variables, 24/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/868 variables, 6/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/868 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/872 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/872 variables, 4/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/872 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 62/934 variables, 24/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/934 variables, 6/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/934 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 4/938 variables, 2/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/938 variables, 4/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/938 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 62/1000 variables, 24/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1000 variables, 6/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1000 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 4/1004 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1004 variables, 4/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1004 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 62/1066 variables, 24/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1066 variables, 6/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1066 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 4/1070 variables, 2/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1070 variables, 4/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1070 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 62/1132 variables, 24/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1132 variables, 6/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1132 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 4/1136 variables, 2/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1136 variables, 4/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1136 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 62/1198 variables, 24/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1198 variables, 6/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1198 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 4/1202 variables, 2/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1202 variables, 4/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1202 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 62/1264 variables, 24/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1264 variables, 6/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1264 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 4/1268 variables, 2/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1268 variables, 4/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1268 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 62/1330 variables, 24/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1330 variables, 6/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1330 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 4/1334 variables, 2/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1334 variables, 4/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1334 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 62/1396 variables, 24/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1396 variables, 6/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1396 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 4/1400 variables, 2/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1400 variables, 4/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1400 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 62/1462 variables, 24/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1462 variables, 6/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1462 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 4/1466 variables, 2/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1466 variables, 4/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1466 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 62/1528 variables, 24/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1528 variables, 6/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1528 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 4/1532 variables, 2/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1532 variables, 4/828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1532 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 62/1594 variables, 24/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1594 variables, 6/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1594 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 4/1598 variables, 2/860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1598 variables, 4/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1598 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 54/1652 variables, 24/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1652 variables, 6/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1652 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 4/1656 variables, 2/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1656 variables, 4/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1656 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 4/1660 variables, 4/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1660 variables, 2/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1660 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 0/1660 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1660/1660 variables, and 906 constraints, problems are : Problem set: 0 solved, 1 unsolved in 863 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 705/705 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 236/260 variables, 68/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:11:14] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-05-30 10:11:14] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:11:14] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-30 10:11:14] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-30 10:11:14] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-30 10:11:14] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-30 10:11:15] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2024-05-30 10:11:15] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 358/618 variables, 260/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:11:15] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-30 10:11:15] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-30 10:11:15] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-30 10:11:15] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-30 10:11:15] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2024-05-30 10:11:15] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/618 variables, 6/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/618 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/674 variables, 21/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/674 variables, 5/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/674 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:11:15] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-30 10:11:15] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-05-30 10:11:15] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:11:15] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:11:16] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-05-30 10:11:16] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:11:16] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:11:16] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-05-30 10:11:16] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:11:16] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:11:16] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:11:16] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:11:16] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:11:16] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:11:16] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:11:16] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:11:17] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:11:17] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:11:17] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:11:17] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/674 variables, 20/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:11:17] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:11:17] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:11:17] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:11:17] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:11:17] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:11:17] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:11:17] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:11:17] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:11:18] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:11:18] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:11:18] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:11:18] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:11:18] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:11:18] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:11:18] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:11:18] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:11:18] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:11:18] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-30 10:11:18] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:11:18] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/674 variables, 20/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:11:19] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:11:19] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-05-30 10:11:19] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-30 10:11:19] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-30 10:11:19] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:11:19] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:11:19] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:11:19] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:11:19] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-30 10:11:19] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-30 10:11:19] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-05-30 10:11:19] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:11:20] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:11:20] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:11:20] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-05-30 10:11:20] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:11:20] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:11:20] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:11:20] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:11:20] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/674 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:11:20] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:11:20] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:11:20] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-30 10:11:21] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:11:21] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/674 variables, 5/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/674 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/676 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/676 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:11:21] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/676 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/676 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 60/736 variables, 22/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/736 variables, 5/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/736 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 4/740 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/740 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/740 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 62/802 variables, 24/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/802 variables, 6/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/802 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 4/806 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/806 variables, 4/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/806 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 62/868 variables, 24/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/868 variables, 6/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/868 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 4/872 variables, 2/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/872 variables, 4/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/872 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 62/934 variables, 24/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/934 variables, 6/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:11:21] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-30 10:11:21] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/934 variables, 2/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/934 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 4/938 variables, 2/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/938 variables, 4/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/938 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 62/1000 variables, 24/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1000 variables, 6/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:11:21] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-30 10:11:21] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/1000 variables, 2/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1000 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 4/1004 variables, 2/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1004 variables, 4/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1004 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 62/1066 variables, 24/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1066 variables, 6/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1066 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 4/1070 variables, 2/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1070 variables, 4/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1070 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 62/1132 variables, 24/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1132 variables, 6/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:11:22] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 61 (INCLUDED_ONLY) 0/1132 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1132 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 4/1136 variables, 2/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1136 variables, 4/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1136 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 62/1198 variables, 24/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1198 variables, 6/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:11:22] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
At refinement iteration 68 (INCLUDED_ONLY) 0/1198 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1198 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 4/1202 variables, 2/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1202 variables, 4/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1202 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 62/1264 variables, 24/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1264 variables, 6/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1264 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 4/1268 variables, 2/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1268 variables, 4/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1268 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 62/1330 variables, 24/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1330 variables, 6/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1330 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 4/1334 variables, 2/803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1334 variables, 4/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1334 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 62/1396 variables, 24/831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1396 variables, 6/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1396 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 4/1400 variables, 2/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1400 variables, 4/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1400 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 62/1462 variables, 24/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1462 variables, 6/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1462 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 4/1466 variables, 2/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1466 variables, 4/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1466 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 62/1528 variables, 24/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1528 variables, 6/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1528 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 4/1532 variables, 2/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1532 variables, 4/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1532 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 62/1594 variables, 24/939 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1594 variables, 6/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1594 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 4/1598 variables, 2/947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1598 variables, 4/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1598 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (OVERLAPS) 54/1652 variables, 24/975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1652 variables, 6/981 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1652 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (OVERLAPS) 4/1656 variables, 2/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1656 variables, 4/987 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1656 variables, 0/987 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 4/1660 variables, 4/991 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1660 variables, 2/993 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1660 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 0/1660 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1660/1660 variables, and 993 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8824 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 705/705 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 86/86 constraints]
After SMT, in 9705ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 229 ms.
Support contains 3 out of 705 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 705/705 places, 955/955 transitions.
Applied a total of 0 rules in 35 ms. Remains 705 /705 variables (removed 0) and now considering 955/955 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 705/705 places, 955/955 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 705/705 places, 955/955 transitions.
Applied a total of 0 rules in 23 ms. Remains 705 /705 variables (removed 0) and now considering 955/955 (removed 0) transitions.
[2024-05-30 10:11:23] [INFO ] Invariant cache hit.
[2024-05-30 10:11:23] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-30 10:11:23] [INFO ] Invariant cache hit.
[2024-05-30 10:11:24] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1154 ms to find 0 implicit places.
[2024-05-30 10:11:24] [INFO ] Redundant transitions in 117 ms returned []
Running 952 sub problems to find dead transitions.
[2024-05-30 10:11:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:11:35] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-30 10:11:35] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-30 10:11:36] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-30 10:11:36] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-30 10:11:36] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-30 10:11:36] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-30 10:11:36] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-30 10:11:36] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-30 10:11:36] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-30 10:11:36] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-05-30 10:11:36] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-30 10:11:36] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 2 ms to minimize.
[2024-05-30 10:11:36] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-05-30 10:11:36] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-05-30 10:11:36] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-30 10:11:37] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 0 ms to minimize.
[2024-05-30 10:11:37] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-30 10:11:37] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-05-30 10:11:37] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-30 10:11:37] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:11:38] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:11:39] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-05-30 10:11:39] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-05-30 10:11:39] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-30 10:11:39] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 2 ms to minimize.
[2024-05-30 10:11:39] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:11:39] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-05-30 10:11:39] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2024-05-30 10:11:39] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 2 ms to minimize.
[2024-05-30 10:11:39] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:11:39] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:11:39] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:11:40] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 2 ms to minimize.
[2024-05-30 10:11:40] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
[2024-05-30 10:11:40] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 1 ms to minimize.
[2024-05-30 10:11:40] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 1 ms to minimize.
[2024-05-30 10:11:40] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:11:40] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 2 ms to minimize.
[2024-05-30 10:11:40] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 2 ms to minimize.
[2024-05-30 10:11:41] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:11:42] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 10:11:42] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-30 10:11:42] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-30 10:11:44] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:11:44] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 2 ms to minimize.
[2024-05-30 10:11:44] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 1 ms to minimize.
[2024-05-30 10:11:44] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2024-05-30 10:11:44] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 1 ms to minimize.
[2024-05-30 10:11:44] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
[2024-05-30 10:11:44] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 2 ms to minimize.
[2024-05-30 10:11:45] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 3 ms to minimize.
[2024-05-30 10:11:45] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2024-05-30 10:11:45] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2024-05-30 10:11:45] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-05-30 10:11:45] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2024-05-30 10:11:45] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
[2024-05-30 10:11:45] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-05-30 10:11:46] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 2 ms to minimize.
[2024-05-30 10:11:46] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 1 ms to minimize.
[2024-05-30 10:11:46] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 703/1660 variables, and 187 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 127/201 constraints, State Equation: 0/705 constraints, PredecessorRefiner: 952/952 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 952 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 60/187 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:11:56] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2024-05-30 10:11:57] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-30 10:11:57] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2024-05-30 10:11:57] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-30 10:11:57] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-30 10:11:57] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 0 ms to minimize.
[2024-05-30 10:11:57] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2024-05-30 10:11:57] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-05-30 10:11:57] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-30 10:11:57] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-30 10:11:57] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-30 10:11:57] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-30 10:11:57] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-30 10:11:57] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-05-30 10:11:57] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-30 10:11:58] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-05-30 10:11:58] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 0 ms to minimize.
[2024-05-30 10:11:58] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-05-30 10:11:58] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:11:58] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:11:59] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-30 10:11:59] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-30 10:11:59] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 2 ms to minimize.
[2024-05-30 10:11:59] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-30 10:12:00] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-30 10:12:00] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-30 10:12:00] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-30 10:12:00] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-30 10:12:00] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-30 10:12:00] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-30 10:12:00] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-30 10:12:00] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-30 10:12:00] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-30 10:12:00] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-30 10:12:00] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-30 10:12:00] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-30 10:12:00] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 2 ms to minimize.
[2024-05-30 10:12:01] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-30 10:12:01] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:12:01] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:12:02] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-30 10:12:02] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-30 10:12:02] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-30 10:12:02] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 0 ms to minimize.
[2024-05-30 10:12:02] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-30 10:12:02] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-30 10:12:02] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 4 ms to minimize.
[2024-05-30 10:12:03] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-30 10:12:03] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:12:03] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-30 10:12:03] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-30 10:12:03] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-05-30 10:12:03] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-30 10:12:03] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-30 10:12:03] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-30 10:12:03] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-30 10:12:03] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-30 10:12:03] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 0 ms to minimize.
[2024-05-30 10:12:04] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-05-30 10:12:04] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:12:05] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-30 10:12:05] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-05-30 10:12:06] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-05-30 10:12:06] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2024-05-30 10:12:06] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:12:06] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 2 ms to minimize.
[2024-05-30 10:12:06] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 1 ms to minimize.
[2024-05-30 10:12:06] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:12:06] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 2 ms to minimize.
[2024-05-30 10:12:06] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 2 ms to minimize.
[2024-05-30 10:12:06] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 1 ms to minimize.
[2024-05-30 10:12:07] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 1 ms to minimize.
[2024-05-30 10:12:07] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:12:07] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 2 ms to minimize.
[2024-05-30 10:12:07] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 1 ms to minimize.
[2024-05-30 10:12:07] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 2 ms to minimize.
[2024-05-30 10:12:07] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:12:07] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:12:07] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 1 ms to minimize.
[2024-05-30 10:12:07] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/703 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:12:09] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:12:09] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:12:09] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:12:10] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:12:10] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:12:10] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 2 ms to minimize.
[2024-05-30 10:12:10] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 2 ms to minimize.
[2024-05-30 10:12:10] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:12:10] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:12:10] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 2 ms to minimize.
[2024-05-30 10:12:10] [INFO ] Deduced a trap composed of 88 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:12:11] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 2 ms to minimize.
[2024-05-30 10:12:11] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 1 ms to minimize.
[2024-05-30 10:12:11] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 2 ms to minimize.
[2024-05-30 10:12:11] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:12:11] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 2 ms to minimize.
[2024-05-30 10:12:11] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 1 ms to minimize.
[2024-05-30 10:12:11] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-05-30 10:12:11] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 2 ms to minimize.
[2024-05-30 10:12:12] [INFO ] Deduced a trap composed of 101 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:12:13] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:12:13] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 1 ms to minimize.
[2024-05-30 10:12:13] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2024-05-30 10:12:13] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:12:14] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 1 ms to minimize.
[2024-05-30 10:12:14] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
[2024-05-30 10:12:14] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:12:14] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2024-05-30 10:12:14] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2024-05-30 10:12:14] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:12:14] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2024-05-30 10:12:14] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 1 ms to minimize.
[2024-05-30 10:12:14] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 1 ms to minimize.
[2024-05-30 10:12:14] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2024-05-30 10:12:14] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
[2024-05-30 10:12:14] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2024-05-30 10:12:14] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 1 ms to minimize.
[2024-05-30 10:12:14] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2024-05-30 10:12:15] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:12:15] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 20/307 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:12:16] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-30 10:12:16] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-30 10:12:16] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-05-30 10:12:16] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-30 10:12:16] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-30 10:12:16] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 0 ms to minimize.
[2024-05-30 10:12:17] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:12:17] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-30 10:12:17] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-30 10:12:17] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-05-30 10:12:17] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 0 ms to minimize.
[2024-05-30 10:12:17] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-05-30 10:12:17] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-05-30 10:12:17] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2024-05-30 10:12:17] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:12:17] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-30 10:12:17] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-05-30 10:12:18] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2024-05-30 10:12:18] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:12:18] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 20/327 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:12:19] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-30 10:12:20] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:12:20] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:12:20] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2024-05-30 10:12:20] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 2 ms to minimize.
[2024-05-30 10:12:20] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:12:20] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
[2024-05-30 10:12:20] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-05-30 10:12:20] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:12:20] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2024-05-30 10:12:20] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-05-30 10:12:20] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-30 10:12:20] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:12:20] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:12:20] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2024-05-30 10:12:21] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 1 ms to minimize.
[2024-05-30 10:12:21] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 0 ms to minimize.
[2024-05-30 10:12:21] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:12:21] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-05-30 10:12:21] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/703 variables, 20/347 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:12:23] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 1 ms to minimize.
[2024-05-30 10:12:23] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-05-30 10:12:24] [INFO ] Deduced a trap composed of 105 places in 94 ms of which 2 ms to minimize.
[2024-05-30 10:12:24] [INFO ] Deduced a trap composed of 102 places in 94 ms of which 2 ms to minimize.
[2024-05-30 10:12:24] [INFO ] Deduced a trap composed of 106 places in 104 ms of which 2 ms to minimize.
[2024-05-30 10:12:24] [INFO ] Deduced a trap composed of 109 places in 101 ms of which 2 ms to minimize.
[2024-05-30 10:12:24] [INFO ] Deduced a trap composed of 106 places in 102 ms of which 2 ms to minimize.
[2024-05-30 10:12:24] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 2 ms to minimize.
[2024-05-30 10:12:24] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 2 ms to minimize.
[2024-05-30 10:12:24] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 2 ms to minimize.
[2024-05-30 10:12:25] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 2 ms to minimize.
[2024-05-30 10:12:25] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
SMT process timed out in 60390ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 60402ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61704 ms. Remains : 705/705 places, 955/955 transitions.
[2024-05-30 10:12:25] [INFO ] Flatten gal took : 77 ms
[2024-05-30 10:12:25] [INFO ] Flatten gal took : 71 ms
[2024-05-30 10:12:25] [INFO ] Input system was already deterministic with 1949 transitions.
Computed a total of 422 stabilizing places and 422 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 1653 transition count 1903
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 1653 transition count 1903
Applied a total of 92 rules in 100 ms. Remains 1653 /1699 variables (removed 46) and now considering 1903/1949 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 1653/1699 places, 1903/1949 transitions.
[2024-05-30 10:12:25] [INFO ] Flatten gal took : 59 ms
[2024-05-30 10:12:25] [INFO ] Flatten gal took : 61 ms
[2024-05-30 10:12:26] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1658 transition count 1908
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1658 transition count 1908
Applied a total of 82 rules in 109 ms. Remains 1658 /1699 variables (removed 41) and now considering 1908/1949 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 1658/1699 places, 1908/1949 transitions.
[2024-05-30 10:12:26] [INFO ] Flatten gal took : 92 ms
[2024-05-30 10:12:26] [INFO ] Flatten gal took : 71 ms
[2024-05-30 10:12:26] [INFO ] Input system was already deterministic with 1908 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1698 transition count 1749
Reduce places removed 199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 200 rules applied. Total rules applied 399 place count 1499 transition count 1748
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 1498 transition count 1748
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 400 place count 1498 transition count 1498
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 900 place count 1248 transition count 1498
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 946 place count 1202 transition count 1452
Iterating global reduction 3 with 46 rules applied. Total rules applied 992 place count 1202 transition count 1452
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 992 place count 1202 transition count 1436
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 1024 place count 1186 transition count 1436
Performed 474 Post agglomeration using F-continuation condition.Transition count delta: 474
Deduced a syphon composed of 474 places in 1 ms
Reduce places removed 474 places and 0 transitions.
Iterating global reduction 3 with 948 rules applied. Total rules applied 1972 place count 712 transition count 962
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1974 place count 710 transition count 960
Applied a total of 1974 rules in 283 ms. Remains 710 /1699 variables (removed 989) and now considering 960/1949 (removed 989) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 284 ms. Remains : 710/1699 places, 960/1949 transitions.
[2024-05-30 10:12:26] [INFO ] Flatten gal took : 34 ms
[2024-05-30 10:12:26] [INFO ] Flatten gal took : 37 ms
[2024-05-30 10:12:26] [INFO ] Input system was already deterministic with 960 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1698 transition count 1748
Reduce places removed 200 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 201 rules applied. Total rules applied 401 place count 1498 transition count 1747
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 402 place count 1497 transition count 1747
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 248 Pre rules applied. Total rules applied 402 place count 1497 transition count 1499
Deduced a syphon composed of 248 places in 3 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 3 with 496 rules applied. Total rules applied 898 place count 1249 transition count 1499
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 944 place count 1203 transition count 1453
Iterating global reduction 3 with 46 rules applied. Total rules applied 990 place count 1203 transition count 1453
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 990 place count 1203 transition count 1437
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 1022 place count 1187 transition count 1437
Performed 478 Post agglomeration using F-continuation condition.Transition count delta: 478
Deduced a syphon composed of 478 places in 1 ms
Reduce places removed 478 places and 0 transitions.
Iterating global reduction 3 with 956 rules applied. Total rules applied 1978 place count 709 transition count 959
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1980 place count 707 transition count 957
Applied a total of 1980 rules in 213 ms. Remains 707 /1699 variables (removed 992) and now considering 957/1949 (removed 992) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 213 ms. Remains : 707/1699 places, 957/1949 transitions.
[2024-05-30 10:12:27] [INFO ] Flatten gal took : 36 ms
[2024-05-30 10:12:27] [INFO ] Flatten gal took : 36 ms
[2024-05-30 10:12:27] [INFO ] Input system was already deterministic with 957 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1698 transition count 1747
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1497 transition count 1747
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1497 transition count 1497
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1247 transition count 1497
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 949 place count 1200 transition count 1450
Iterating global reduction 2 with 47 rules applied. Total rules applied 996 place count 1200 transition count 1450
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 996 place count 1200 transition count 1433
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 1030 place count 1183 transition count 1433
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 477
Deduced a syphon composed of 477 places in 2 ms
Reduce places removed 477 places and 0 transitions.
Iterating global reduction 2 with 954 rules applied. Total rules applied 1984 place count 706 transition count 956
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1986 place count 704 transition count 954
Applied a total of 1986 rules in 199 ms. Remains 704 /1699 variables (removed 995) and now considering 954/1949 (removed 995) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 199 ms. Remains : 704/1699 places, 954/1949 transitions.
[2024-05-30 10:12:27] [INFO ] Flatten gal took : 42 ms
[2024-05-30 10:12:27] [INFO ] Flatten gal took : 46 ms
[2024-05-30 10:12:27] [INFO ] Input system was already deterministic with 954 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 1654 transition count 1904
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 1654 transition count 1904
Applied a total of 90 rules in 82 ms. Remains 1654 /1699 variables (removed 45) and now considering 1904/1949 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 1654/1699 places, 1904/1949 transitions.
[2024-05-30 10:12:27] [INFO ] Flatten gal took : 54 ms
[2024-05-30 10:12:27] [INFO ] Flatten gal took : 54 ms
[2024-05-30 10:12:27] [INFO ] Input system was already deterministic with 1904 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 1655 transition count 1905
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 1655 transition count 1905
Applied a total of 88 rules in 93 ms. Remains 1655 /1699 variables (removed 44) and now considering 1905/1949 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 1655/1699 places, 1905/1949 transitions.
[2024-05-30 10:12:28] [INFO ] Flatten gal took : 52 ms
[2024-05-30 10:12:28] [INFO ] Flatten gal took : 54 ms
[2024-05-30 10:12:28] [INFO ] Input system was already deterministic with 1905 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 1654 transition count 1904
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 1654 transition count 1904
Applied a total of 90 rules in 81 ms. Remains 1654 /1699 variables (removed 45) and now considering 1904/1949 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 1654/1699 places, 1904/1949 transitions.
[2024-05-30 10:12:28] [INFO ] Flatten gal took : 50 ms
[2024-05-30 10:12:28] [INFO ] Flatten gal took : 53 ms
[2024-05-30 10:12:28] [INFO ] Input system was already deterministic with 1904 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1699 transition count 1751
Reduce places removed 198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 199 rules applied. Total rules applied 397 place count 1501 transition count 1750
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 398 place count 1500 transition count 1750
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 248 Pre rules applied. Total rules applied 398 place count 1500 transition count 1502
Deduced a syphon composed of 248 places in 3 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 3 with 496 rules applied. Total rules applied 894 place count 1252 transition count 1502
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 937 place count 1209 transition count 1459
Iterating global reduction 3 with 43 rules applied. Total rules applied 980 place count 1209 transition count 1459
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 980 place count 1209 transition count 1444
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 1010 place count 1194 transition count 1444
Performed 479 Post agglomeration using F-continuation condition.Transition count delta: 479
Deduced a syphon composed of 479 places in 1 ms
Reduce places removed 479 places and 0 transitions.
Iterating global reduction 3 with 958 rules applied. Total rules applied 1968 place count 715 transition count 965
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 1968 rules in 172 ms. Remains 715 /1699 variables (removed 984) and now considering 965/1949 (removed 984) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 174 ms. Remains : 715/1699 places, 965/1949 transitions.
[2024-05-30 10:12:28] [INFO ] Flatten gal took : 36 ms
[2024-05-30 10:12:28] [INFO ] Flatten gal took : 38 ms
[2024-05-30 10:12:28] [INFO ] Input system was already deterministic with 965 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 1662 transition count 1912
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 1662 transition count 1912
Applied a total of 74 rules in 89 ms. Remains 1662 /1699 variables (removed 37) and now considering 1912/1949 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 1662/1699 places, 1912/1949 transitions.
[2024-05-30 10:12:28] [INFO ] Flatten gal took : 48 ms
[2024-05-30 10:12:29] [INFO ] Flatten gal took : 51 ms
[2024-05-30 10:12:29] [INFO ] Input system was already deterministic with 1912 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1698 transition count 1747
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1497 transition count 1747
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 402 place count 1497 transition count 1498
Deduced a syphon composed of 249 places in 2 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 900 place count 1248 transition count 1498
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 946 place count 1202 transition count 1452
Iterating global reduction 2 with 46 rules applied. Total rules applied 992 place count 1202 transition count 1452
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 992 place count 1202 transition count 1436
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 1024 place count 1186 transition count 1436
Performed 481 Post agglomeration using F-continuation condition.Transition count delta: 481
Deduced a syphon composed of 481 places in 1 ms
Reduce places removed 481 places and 0 transitions.
Iterating global reduction 2 with 962 rules applied. Total rules applied 1986 place count 705 transition count 955
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1988 place count 703 transition count 953
Applied a total of 1988 rules in 184 ms. Remains 703 /1699 variables (removed 996) and now considering 953/1949 (removed 996) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 184 ms. Remains : 703/1699 places, 953/1949 transitions.
[2024-05-30 10:12:29] [INFO ] Flatten gal took : 24 ms
[2024-05-30 10:12:29] [INFO ] Flatten gal took : 27 ms
[2024-05-30 10:12:29] [INFO ] Input system was already deterministic with 953 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 1653 transition count 1903
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 1653 transition count 1903
Applied a total of 92 rules in 104 ms. Remains 1653 /1699 variables (removed 46) and now considering 1903/1949 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 1653/1699 places, 1903/1949 transitions.
[2024-05-30 10:12:29] [INFO ] Flatten gal took : 47 ms
[2024-05-30 10:12:29] [INFO ] Flatten gal took : 50 ms
[2024-05-30 10:12:29] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1665 transition count 1915
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1665 transition count 1915
Applied a total of 68 rules in 80 ms. Remains 1665 /1699 variables (removed 34) and now considering 1915/1949 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 1665/1699 places, 1915/1949 transitions.
[2024-05-30 10:12:29] [INFO ] Flatten gal took : 47 ms
[2024-05-30 10:12:29] [INFO ] Flatten gal took : 51 ms
[2024-05-30 10:12:29] [INFO ] Input system was already deterministic with 1915 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1699/1699 places, 1949/1949 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1698 transition count 1749
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1499 transition count 1749
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 248 Pre rules applied. Total rules applied 398 place count 1499 transition count 1501
Deduced a syphon composed of 248 places in 2 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 2 with 496 rules applied. Total rules applied 894 place count 1251 transition count 1501
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 940 place count 1205 transition count 1455
Iterating global reduction 2 with 46 rules applied. Total rules applied 986 place count 1205 transition count 1455
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 986 place count 1205 transition count 1440
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 1016 place count 1190 transition count 1440
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 480
Deduced a syphon composed of 480 places in 2 ms
Reduce places removed 480 places and 0 transitions.
Iterating global reduction 2 with 960 rules applied. Total rules applied 1976 place count 710 transition count 960
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1978 place count 708 transition count 958
Applied a total of 1978 rules in 185 ms. Remains 708 /1699 variables (removed 991) and now considering 958/1949 (removed 991) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 186 ms. Remains : 708/1699 places, 958/1949 transitions.
[2024-05-30 10:12:30] [INFO ] Flatten gal took : 24 ms
[2024-05-30 10:12:30] [INFO ] Flatten gal took : 26 ms
[2024-05-30 10:12:30] [INFO ] Input system was already deterministic with 958 transitions.
[2024-05-30 10:12:30] [INFO ] Flatten gal took : 51 ms
[2024-05-30 10:12:30] [INFO ] Flatten gal took : 52 ms
[2024-05-30 10:12:30] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-05-30 10:12:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1699 places, 1949 transitions and 6592 arcs took 9 ms.
Total runtime 160143 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVs-PT-050B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1699
TRANSITIONS: 1949
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.034s, Sys 0.007s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.007s, 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: 1748
MODEL NAME: /home/mcc/execution/413/model
1699 places, 1949 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-050B"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldRVs-PT-050B, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683759700857"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-050B.tgz
mv ShieldRVs-PT-050B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;