MCC'2024- Execution of r464-smll-171620118400370

About the Execution of LTSMin+red for Anderson-PT-11

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
3168.960	291227.00	356328.00	857.30	??????T????????F	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r464-smll-171620118400370.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Anderson-PT-11, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620118400370
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 15:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 12 15:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 15:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717259893385

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:38:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:38:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:38:15] [INFO ] Load time of PNML (sax parser for PT used): 500 ms
[2024-06-01 16:38:15] [INFO ] Transformed 749 places.
[2024-06-01 16:38:15] [INFO ] Transformed 3245 transitions.
[2024-06-01 16:38:15] [INFO ] Found NUPN structural information;
[2024-06-01 16:38:15] [INFO ] Parsed PT model containing 749 places and 3245 transitions and 12540 arcs in 694 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
Support contains 108 out of 749 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 749/749 places, 3245/3245 transitions.
Discarding 148 places :
Symmetric choice reduction at 0 with 148 rule applications. Total rules 148 place count 601 transition count 2177
Iterating global reduction 0 with 148 rules applied. Total rules applied 296 place count 601 transition count 2177
Applied a total of 296 rules in 203 ms. Remains 601 /749 variables (removed 148) and now considering 2177/3245 (removed 1068) transitions.
// Phase 1: matrix 2177 rows 601 cols
[2024-06-01 16:38:16] [INFO ] Computed 25 invariants in 89 ms
[2024-06-01 16:38:17] [INFO ] Implicit Places using invariants in 1328 ms returned []
[2024-06-01 16:38:17] [INFO ] Invariant cache hit.
[2024-06-01 16:38:18] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:38:26] [INFO ] Implicit Places using invariants and state equation in 8463 ms returned []
Implicit Place search using SMT with State Equation took 9861 ms to find 0 implicit places.
Running 2166 sub problems to find dead transitions.
[2024-06-01 16:38:26] [INFO ] Invariant cache hit.
[2024-06-01 16:38:26] [INFO ] State equation strengthened by 110 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.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 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2166 unsolved
SMT process timed out in 38704ms, After SMT, problems are : Problem set: 0 solved, 2166 unsolved
Search for dead transitions found 0 dead transitions in 38822ms
Starting structural reductions in LTL mode, iteration 1 : 601/749 places, 2177/3245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48981 ms. Remains : 601/749 places, 2177/3245 transitions.
Support contains 108 out of 601 places after structural reductions.
[2024-06-01 16:39:05] [INFO ] Flatten gal took : 375 ms
[2024-06-01 16:39:06] [INFO ] Flatten gal took : 191 ms
[2024-06-01 16:39:06] [INFO ] Input system was already deterministic with 2177 transitions.
Support contains 107 out of 601 places (down from 108) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 4010 ms. (9 steps per ms) remains 61/87 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 58/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 53/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 51/53 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 48/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
[2024-06-01 16:39:08] [INFO ] Invariant cache hit.
[2024-06-01 16:39:08] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 527/597 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/597 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp82 is UNSAT
At refinement iteration 4 (OVERLAPS) 4/601 variables, 5/25 constraints. Problems are: Problem set: 6 solved, 38 unsolved
[2024-06-01 16:39:11] [INFO ] Deduced a trap composed of 225 places in 994 ms of which 106 ms to minimize.
[2024-06-01 16:39:13] [INFO ] Deduced a trap composed of 197 places in 1139 ms of which 10 ms to minimize.
[2024-06-01 16:39:14] [INFO ] Deduced a trap composed of 276 places in 954 ms of which 10 ms to minimize.
SMT process timed out in 5668ms, After SMT, problems are : Problem set: 6 solved, 38 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 62 out of 601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 601/601 places, 2177/2177 transitions.
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 107 Pre rules applied. Total rules applied 0 place count 601 transition count 2070
Deduced a syphon composed of 107 places in 3 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 0 with 214 rules applied. Total rules applied 214 place count 494 transition count 2070
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 246 place count 462 transition count 1498
Iterating global reduction 0 with 32 rules applied. Total rules applied 278 place count 462 transition count 1498
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 284 place count 459 transition count 1495
Applied a total of 284 rules in 301 ms. Remains 459 /601 variables (removed 142) and now considering 1495/2177 (removed 682) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 302 ms. Remains : 459/601 places, 1495/2177 transitions.
RANDOM walk for 40000 steps (8 resets) in 1109 ms. (36 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 33/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 73 ms. (54 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
// Phase 1: matrix 1495 rows 459 cols
[2024-06-01 16:39:15] [INFO ] Computed 25 invariants in 40 ms
[2024-06-01 16:39:15] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 402/449 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 10/459 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 16:39:16] [INFO ] Deduced a trap composed of 270 places in 740 ms of which 7 ms to minimize.
[2024-06-01 16:39:17] [INFO ] Deduced a trap composed of 85 places in 837 ms of which 8 ms to minimize.
[2024-06-01 16:39:18] [INFO ] Deduced a trap composed of 106 places in 812 ms of which 8 ms to minimize.
[2024-06-01 16:39:19] [INFO ] Deduced a trap composed of 93 places in 675 ms of which 6 ms to minimize.
[2024-06-01 16:39:20] [INFO ] Deduced a trap composed of 114 places in 726 ms of which 7 ms to minimize.
[2024-06-01 16:39:20] [INFO ] Deduced a trap composed of 173 places in 740 ms of which 7 ms to minimize.
[2024-06-01 16:39:21] [INFO ] Deduced a trap composed of 129 places in 728 ms of which 7 ms to minimize.
[2024-06-01 16:39:22] [INFO ] Deduced a trap composed of 116 places in 755 ms of which 7 ms to minimize.
[2024-06-01 16:39:23] [INFO ] Deduced a trap composed of 205 places in 764 ms of which 8 ms to minimize.
[2024-06-01 16:39:23] [INFO ] Deduced a trap composed of 203 places in 613 ms of which 6 ms to minimize.
[2024-06-01 16:39:24] [INFO ] Deduced a trap composed of 77 places in 733 ms of which 7 ms to minimize.
[2024-06-01 16:39:25] [INFO ] Deduced a trap composed of 182 places in 805 ms of which 8 ms to minimize.
[2024-06-01 16:39:26] [INFO ] Deduced a trap composed of 178 places in 777 ms of which 8 ms to minimize.
[2024-06-01 16:39:27] [INFO ] Deduced a trap composed of 219 places in 778 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 16:39:28] [INFO ] Deduced a trap composed of 147 places in 815 ms of which 8 ms to minimize.
[2024-06-01 16:39:29] [INFO ] Deduced a trap composed of 222 places in 835 ms of which 8 ms to minimize.
[2024-06-01 16:39:30] [INFO ] Deduced a trap composed of 282 places in 868 ms of which 7 ms to minimize.
[2024-06-01 16:39:31] [INFO ] Deduced a trap composed of 166 places in 845 ms of which 8 ms to minimize.
[2024-06-01 16:39:32] [INFO ] Deduced a trap composed of 239 places in 793 ms of which 9 ms to minimize.
[2024-06-01 16:39:32] [INFO ] Deduced a trap composed of 179 places in 740 ms of which 7 ms to minimize.
[2024-06-01 16:39:33] [INFO ] Deduced a trap composed of 219 places in 783 ms of which 7 ms to minimize.
[2024-06-01 16:39:34] [INFO ] Deduced a trap composed of 113 places in 857 ms of which 8 ms to minimize.
[2024-06-01 16:39:35] [INFO ] Deduced a trap composed of 229 places in 783 ms of which 7 ms to minimize.
[2024-06-01 16:39:36] [INFO ] Deduced a trap composed of 131 places in 733 ms of which 4 ms to minimize.
[2024-06-01 16:39:36] [INFO ] Deduced a trap composed of 224 places in 714 ms of which 7 ms to minimize.
[2024-06-01 16:39:37] [INFO ] Deduced a trap composed of 158 places in 811 ms of which 8 ms to minimize.
[2024-06-01 16:39:38] [INFO ] Deduced a trap composed of 88 places in 815 ms of which 8 ms to minimize.
[2024-06-01 16:39:39] [INFO ] Deduced a trap composed of 196 places in 676 ms of which 7 ms to minimize.
[2024-06-01 16:39:40] [INFO ] Deduced a trap composed of 194 places in 818 ms of which 9 ms to minimize.
[2024-06-01 16:39:41] [INFO ] Deduced a trap composed of 139 places in 867 ms of which 8 ms to minimize.
[2024-06-01 16:39:42] [INFO ] Deduced a trap composed of 123 places in 835 ms of which 8 ms to minimize.
[2024-06-01 16:39:42] [INFO ] Deduced a trap composed of 246 places in 853 ms of which 7 ms to minimize.
[2024-06-01 16:39:43] [INFO ] Deduced a trap composed of 174 places in 836 ms of which 8 ms to minimize.
[2024-06-01 16:39:44] [INFO ] Deduced a trap composed of 242 places in 758 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 16:39:45] [INFO ] Deduced a trap composed of 175 places in 722 ms of which 7 ms to minimize.
[2024-06-01 16:39:46] [INFO ] Deduced a trap composed of 131 places in 637 ms of which 5 ms to minimize.
[2024-06-01 16:39:47] [INFO ] Deduced a trap composed of 162 places in 547 ms of which 6 ms to minimize.
[2024-06-01 16:39:47] [INFO ] Deduced a trap composed of 151 places in 533 ms of which 4 ms to minimize.
[2024-06-01 16:39:48] [INFO ] Deduced a trap composed of 116 places in 548 ms of which 5 ms to minimize.
[2024-06-01 16:39:48] [INFO ] Deduced a trap composed of 210 places in 442 ms of which 5 ms to minimize.
[2024-06-01 16:39:49] [INFO ] Deduced a trap composed of 197 places in 539 ms of which 5 ms to minimize.
[2024-06-01 16:39:49] [INFO ] Deduced a trap composed of 179 places in 443 ms of which 6 ms to minimize.
[2024-06-01 16:39:50] [INFO ] Deduced a trap composed of 185 places in 622 ms of which 5 ms to minimize.
[2024-06-01 16:39:50] [INFO ] Deduced a trap composed of 120 places in 434 ms of which 5 ms to minimize.
[2024-06-01 16:39:51] [INFO ] Deduced a trap composed of 157 places in 460 ms of which 4 ms to minimize.
[2024-06-01 16:39:52] [INFO ] Deduced a trap composed of 192 places in 588 ms of which 5 ms to minimize.
[2024-06-01 16:39:52] [INFO ] Deduced a trap composed of 186 places in 547 ms of which 4 ms to minimize.
[2024-06-01 16:39:53] [INFO ] Deduced a trap composed of 183 places in 604 ms of which 5 ms to minimize.
[2024-06-01 16:39:54] [INFO ] Deduced a trap composed of 243 places in 565 ms of which 5 ms to minimize.
[2024-06-01 16:39:54] [INFO ] Deduced a trap composed of 57 places in 556 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 1495/1954 variables, 459/534 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1954 variables, 110/644 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1954/1954 variables, and 644 constraints, problems are : Problem set: 0 solved, 26 unsolved in 45011 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 459/459 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 402/449 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 4 (OVERLAPS) 10/459 variables, 10/25 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 50/75 constraints. Problems are: Problem set: 2 solved, 24 unsolved
[2024-06-01 16:40:01] [INFO ] Deduced a trap composed of 156 places in 564 ms of which 5 ms to minimize.
[2024-06-01 16:40:02] [INFO ] Deduced a trap composed of 203 places in 499 ms of which 4 ms to minimize.
[2024-06-01 16:40:03] [INFO ] Deduced a trap composed of 192 places in 604 ms of which 5 ms to minimize.
[2024-06-01 16:40:03] [INFO ] Deduced a trap composed of 176 places in 609 ms of which 16 ms to minimize.
[2024-06-01 16:40:04] [INFO ] Deduced a trap composed of 190 places in 547 ms of which 5 ms to minimize.
[2024-06-01 16:40:04] [INFO ] Deduced a trap composed of 156 places in 635 ms of which 4 ms to minimize.
[2024-06-01 16:40:05] [INFO ] Deduced a trap composed of 178 places in 520 ms of which 4 ms to minimize.
[2024-06-01 16:40:06] [INFO ] Deduced a trap composed of 140 places in 584 ms of which 5 ms to minimize.
[2024-06-01 16:40:06] [INFO ] Deduced a trap composed of 201 places in 448 ms of which 4 ms to minimize.
[2024-06-01 16:40:07] [INFO ] Deduced a trap composed of 130 places in 605 ms of which 4 ms to minimize.
[2024-06-01 16:40:07] [INFO ] Deduced a trap composed of 143 places in 450 ms of which 5 ms to minimize.
[2024-06-01 16:40:08] [INFO ] Deduced a trap composed of 144 places in 514 ms of which 5 ms to minimize.
[2024-06-01 16:40:08] [INFO ] Deduced a trap composed of 177 places in 499 ms of which 5 ms to minimize.
[2024-06-01 16:40:09] [INFO ] Deduced a trap composed of 174 places in 519 ms of which 4 ms to minimize.
[2024-06-01 16:40:09] [INFO ] Deduced a trap composed of 201 places in 505 ms of which 5 ms to minimize.
[2024-06-01 16:40:10] [INFO ] Deduced a trap composed of 199 places in 513 ms of which 7 ms to minimize.
[2024-06-01 16:40:10] [INFO ] Deduced a trap composed of 192 places in 623 ms of which 5 ms to minimize.
[2024-06-01 16:40:11] [INFO ] Deduced a trap composed of 211 places in 529 ms of which 5 ms to minimize.
[2024-06-01 16:40:12] [INFO ] Deduced a trap composed of 212 places in 560 ms of which 5 ms to minimize.
[2024-06-01 16:40:12] [INFO ] Deduced a trap composed of 178 places in 544 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 20/95 constraints. Problems are: Problem set: 2 solved, 24 unsolved
[2024-06-01 16:40:14] [INFO ] Deduced a trap composed of 99 places in 544 ms of which 5 ms to minimize.
[2024-06-01 16:40:14] [INFO ] Deduced a trap composed of 123 places in 531 ms of which 4 ms to minimize.
[2024-06-01 16:40:15] [INFO ] Deduced a trap composed of 68 places in 570 ms of which 5 ms to minimize.
[2024-06-01 16:40:15] [INFO ] Deduced a trap composed of 213 places in 475 ms of which 4 ms to minimize.
[2024-06-01 16:40:16] [INFO ] Deduced a trap composed of 136 places in 552 ms of which 5 ms to minimize.
[2024-06-01 16:40:16] [INFO ] Deduced a trap composed of 104 places in 541 ms of which 5 ms to minimize.
[2024-06-01 16:40:17] [INFO ] Deduced a trap composed of 115 places in 524 ms of which 5 ms to minimize.
[2024-06-01 16:40:17] [INFO ] Deduced a trap composed of 59 places in 534 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 8/103 constraints. Problems are: Problem set: 2 solved, 24 unsolved
[2024-06-01 16:40:20] [INFO ] Deduced a trap composed of 197 places in 504 ms of which 5 ms to minimize.
[2024-06-01 16:40:21] [INFO ] Deduced a trap composed of 141 places in 564 ms of which 5 ms to minimize.
[2024-06-01 16:40:21] [INFO ] Deduced a trap composed of 204 places in 551 ms of which 5 ms to minimize.
[2024-06-01 16:40:22] [INFO ] Deduced a trap composed of 211 places in 564 ms of which 5 ms to minimize.
[2024-06-01 16:40:22] [INFO ] Deduced a trap composed of 165 places in 569 ms of which 4 ms to minimize.
[2024-06-01 16:40:23] [INFO ] Deduced a trap composed of 101 places in 549 ms of which 5 ms to minimize.
[2024-06-01 16:40:23] [INFO ] Deduced a trap composed of 117 places in 532 ms of which 4 ms to minimize.
[2024-06-01 16:40:24] [INFO ] Deduced a trap composed of 128 places in 526 ms of which 5 ms to minimize.
[2024-06-01 16:40:24] [INFO ] Deduced a trap composed of 194 places in 503 ms of which 4 ms to minimize.
[2024-06-01 16:40:25] [INFO ] Deduced a trap composed of 66 places in 480 ms of which 4 ms to minimize.
[2024-06-01 16:40:25] [INFO ] Deduced a trap composed of 113 places in 485 ms of which 5 ms to minimize.
[2024-06-01 16:40:26] [INFO ] Deduced a trap composed of 113 places in 401 ms of which 4 ms to minimize.
[2024-06-01 16:40:26] [INFO ] Deduced a trap composed of 121 places in 501 ms of which 5 ms to minimize.
[2024-06-01 16:40:27] [INFO ] Deduced a trap composed of 127 places in 459 ms of which 5 ms to minimize.
[2024-06-01 16:40:27] [INFO ] Deduced a trap composed of 127 places in 494 ms of which 5 ms to minimize.
[2024-06-01 16:40:28] [INFO ] Deduced a trap composed of 182 places in 536 ms of which 4 ms to minimize.
[2024-06-01 16:40:28] [INFO ] Deduced a trap composed of 189 places in 474 ms of which 5 ms to minimize.
[2024-06-01 16:40:29] [INFO ] Deduced a trap composed of 141 places in 492 ms of which 5 ms to minimize.
[2024-06-01 16:40:29] [INFO ] Deduced a trap composed of 115 places in 495 ms of which 5 ms to minimize.
[2024-06-01 16:40:30] [INFO ] Deduced a trap composed of 162 places in 519 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 20/123 constraints. Problems are: Problem set: 2 solved, 24 unsolved
[2024-06-01 16:40:31] [INFO ] Deduced a trap composed of 114 places in 514 ms of which 5 ms to minimize.
[2024-06-01 16:40:32] [INFO ] Deduced a trap composed of 145 places in 491 ms of which 4 ms to minimize.
[2024-06-01 16:40:33] [INFO ] Deduced a trap composed of 70 places in 512 ms of which 5 ms to minimize.
[2024-06-01 16:40:33] [INFO ] Deduced a trap composed of 164 places in 498 ms of which 4 ms to minimize.
[2024-06-01 16:40:34] [INFO ] Deduced a trap composed of 204 places in 523 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 5/128 constraints. Problems are: Problem set: 2 solved, 24 unsolved
[2024-06-01 16:40:36] [INFO ] Deduced a trap composed of 125 places in 457 ms of which 5 ms to minimize.
[2024-06-01 16:40:37] [INFO ] Deduced a trap composed of 106 places in 561 ms of which 4 ms to minimize.
[2024-06-01 16:40:37] [INFO ] Deduced a trap composed of 148 places in 579 ms of which 4 ms to minimize.
[2024-06-01 16:40:38] [INFO ] Deduced a trap composed of 181 places in 578 ms of which 4 ms to minimize.
[2024-06-01 16:40:38] [INFO ] Deduced a trap composed of 131 places in 579 ms of which 4 ms to minimize.
[2024-06-01 16:40:39] [INFO ] Deduced a trap composed of 151 places in 571 ms of which 5 ms to minimize.
[2024-06-01 16:40:40] [INFO ] Deduced a trap composed of 129 places in 520 ms of which 4 ms to minimize.
[2024-06-01 16:40:40] [INFO ] Deduced a trap composed of 224 places in 493 ms of which 5 ms to minimize.
[2024-06-01 16:40:41] [INFO ] Deduced a trap composed of 170 places in 530 ms of which 5 ms to minimize.
[2024-06-01 16:40:41] [INFO ] Deduced a trap composed of 117 places in 452 ms of which 4 ms to minimize.
[2024-06-01 16:40:42] [INFO ] Deduced a trap composed of 208 places in 517 ms of which 5 ms to minimize.
[2024-06-01 16:40:42] [INFO ] Deduced a trap composed of 109 places in 528 ms of which 5 ms to minimize.
[2024-06-01 16:40:43] [INFO ] Deduced a trap composed of 120 places in 525 ms of which 5 ms to minimize.
[2024-06-01 16:40:44] [INFO ] Deduced a trap composed of 115 places in 521 ms of which 5 ms to minimize.
[2024-06-01 16:40:44] [INFO ] Deduced a trap composed of 231 places in 508 ms of which 5 ms to minimize.
[2024-06-01 16:40:45] [INFO ] Deduced a trap composed of 165 places in 500 ms of which 4 ms to minimize.
[2024-06-01 16:40:45] [INFO ] Deduced a trap composed of 221 places in 478 ms of which 5 ms to minimize.
SMT process timed out in 90545ms, After SMT, problems are : Problem set: 2 solved, 24 unsolved
Fused 24 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 43 out of 459 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 459/459 places, 1495/1495 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 447 transition count 1243
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 447 transition count 1243
Applied a total of 24 rules in 63 ms. Remains 447 /459 variables (removed 12) and now considering 1243/1495 (removed 252) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 447/459 places, 1243/1495 transitions.
RANDOM walk for 40000 steps (8 resets) in 692 ms. (57 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 69 ms. (57 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 108232 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :2 out of 23
Probabilistic random walk after 108232 steps, saw 82348 distinct states, run finished after 3007 ms. (steps per millisecond=35 ) properties seen :2
// Phase 1: matrix 1243 rows 447 cols
[2024-06-01 16:40:49] [INFO ] Computed 25 invariants in 21 ms
[2024-06-01 16:40:49] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 398/438 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 9/447 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 16:40:50] [INFO ] Deduced a trap composed of 97 places in 442 ms of which 8 ms to minimize.
[2024-06-01 16:40:51] [INFO ] Deduced a trap composed of 236 places in 481 ms of which 5 ms to minimize.
[2024-06-01 16:40:51] [INFO ] Deduced a trap composed of 138 places in 436 ms of which 4 ms to minimize.
[2024-06-01 16:40:52] [INFO ] Deduced a trap composed of 186 places in 495 ms of which 4 ms to minimize.
[2024-06-01 16:40:52] [INFO ] Deduced a trap composed of 246 places in 452 ms of which 5 ms to minimize.
[2024-06-01 16:40:53] [INFO ] Deduced a trap composed of 107 places in 531 ms of which 5 ms to minimize.
[2024-06-01 16:40:53] [INFO ] Deduced a trap composed of 176 places in 469 ms of which 5 ms to minimize.
[2024-06-01 16:40:54] [INFO ] Deduced a trap composed of 188 places in 541 ms of which 4 ms to minimize.
[2024-06-01 16:40:54] [INFO ] Deduced a trap composed of 128 places in 563 ms of which 4 ms to minimize.
[2024-06-01 16:40:55] [INFO ] Deduced a trap composed of 98 places in 493 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 10/35 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 16:40:56] [INFO ] Deduced a trap composed of 121 places in 513 ms of which 5 ms to minimize.
[2024-06-01 16:40:56] [INFO ] Deduced a trap composed of 141 places in 523 ms of which 5 ms to minimize.
[2024-06-01 16:40:57] [INFO ] Deduced a trap composed of 133 places in 533 ms of which 4 ms to minimize.
[2024-06-01 16:40:57] [INFO ] Deduced a trap composed of 178 places in 387 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 16:40:58] [INFO ] Deduced a trap composed of 161 places in 462 ms of which 4 ms to minimize.
[2024-06-01 16:40:58] [INFO ] Deduced a trap composed of 109 places in 499 ms of which 5 ms to minimize.
[2024-06-01 16:40:59] [INFO ] Deduced a trap composed of 117 places in 463 ms of which 4 ms to minimize.
[2024-06-01 16:40:59] [INFO ] Deduced a trap composed of 125 places in 506 ms of which 5 ms to minimize.
[2024-06-01 16:41:00] [INFO ] Deduced a trap composed of 251 places in 507 ms of which 4 ms to minimize.
[2024-06-01 16:41:00] [INFO ] Deduced a trap composed of 263 places in 474 ms of which 6 ms to minimize.
[2024-06-01 16:41:01] [INFO ] Deduced a trap composed of 147 places in 450 ms of which 4 ms to minimize.
[2024-06-01 16:41:01] [INFO ] Deduced a trap composed of 276 places in 476 ms of which 4 ms to minimize.
[2024-06-01 16:41:02] [INFO ] Deduced a trap composed of 281 places in 464 ms of which 4 ms to minimize.
[2024-06-01 16:41:02] [INFO ] Deduced a trap composed of 230 places in 475 ms of which 5 ms to minimize.
[2024-06-01 16:41:03] [INFO ] Deduced a trap composed of 118 places in 500 ms of which 4 ms to minimize.
[2024-06-01 16:41:04] [INFO ] Deduced a trap composed of 199 places in 490 ms of which 5 ms to minimize.
[2024-06-01 16:41:04] [INFO ] Deduced a trap composed of 166 places in 442 ms of which 4 ms to minimize.
[2024-06-01 16:41:05] [INFO ] Deduced a trap composed of 169 places in 485 ms of which 5 ms to minimize.
[2024-06-01 16:41:05] [INFO ] Deduced a trap composed of 147 places in 515 ms of which 4 ms to minimize.
[2024-06-01 16:41:06] [INFO ] Deduced a trap composed of 240 places in 476 ms of which 5 ms to minimize.
[2024-06-01 16:41:06] [INFO ] Deduced a trap composed of 236 places in 465 ms of which 4 ms to minimize.
[2024-06-01 16:41:07] [INFO ] Deduced a trap composed of 177 places in 516 ms of which 5 ms to minimize.
[2024-06-01 16:41:07] [INFO ] Deduced a trap composed of 138 places in 471 ms of which 5 ms to minimize.
[2024-06-01 16:41:07] [INFO ] Deduced a trap composed of 220 places in 460 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 16:41:08] [INFO ] Deduced a trap composed of 86 places in 492 ms of which 4 ms to minimize.
[2024-06-01 16:41:09] [INFO ] Deduced a trap composed of 159 places in 475 ms of which 4 ms to minimize.
[2024-06-01 16:41:09] [INFO ] Deduced a trap composed of 183 places in 487 ms of which 4 ms to minimize.
[2024-06-01 16:41:10] [INFO ] Deduced a trap composed of 220 places in 532 ms of which 4 ms to minimize.
[2024-06-01 16:41:10] [INFO ] Deduced a trap composed of 194 places in 477 ms of which 5 ms to minimize.
[2024-06-01 16:41:11] [INFO ] Deduced a trap composed of 285 places in 478 ms of which 5 ms to minimize.
[2024-06-01 16:41:11] [INFO ] Deduced a trap composed of 173 places in 484 ms of which 4 ms to minimize.
[2024-06-01 16:41:12] [INFO ] Deduced a trap composed of 197 places in 491 ms of which 4 ms to minimize.
[2024-06-01 16:41:12] [INFO ] Deduced a trap composed of 204 places in 486 ms of which 4 ms to minimize.
[2024-06-01 16:41:13] [INFO ] Deduced a trap composed of 201 places in 479 ms of which 5 ms to minimize.
[2024-06-01 16:41:13] [INFO ] Deduced a trap composed of 146 places in 473 ms of which 5 ms to minimize.
[2024-06-01 16:41:14] [INFO ] Deduced a trap composed of 189 places in 493 ms of which 5 ms to minimize.
[2024-06-01 16:41:14] [INFO ] Deduced a trap composed of 174 places in 479 ms of which 5 ms to minimize.
[2024-06-01 16:41:15] [INFO ] Deduced a trap composed of 182 places in 483 ms of which 5 ms to minimize.
[2024-06-01 16:41:15] [INFO ] Deduced a trap composed of 89 places in 474 ms of which 4 ms to minimize.
[2024-06-01 16:41:16] [INFO ] Deduced a trap composed of 196 places in 483 ms of which 4 ms to minimize.
[2024-06-01 16:41:17] [INFO ] Deduced a trap composed of 187 places in 488 ms of which 4 ms to minimize.
[2024-06-01 16:41:17] [INFO ] Deduced a trap composed of 119 places in 497 ms of which 4 ms to minimize.
[2024-06-01 16:41:18] [INFO ] Deduced a trap composed of 167 places in 493 ms of which 4 ms to minimize.
[2024-06-01 16:41:18] [INFO ] Deduced a trap composed of 176 places in 457 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 16:41:19] [INFO ] Deduced a trap composed of 133 places in 472 ms of which 4 ms to minimize.
[2024-06-01 16:41:20] [INFO ] Deduced a trap composed of 199 places in 468 ms of which 4 ms to minimize.
[2024-06-01 16:41:20] [INFO ] Deduced a trap composed of 175 places in 474 ms of which 4 ms to minimize.
[2024-06-01 16:41:21] [INFO ] Deduced a trap composed of 86 places in 469 ms of which 4 ms to minimize.
[2024-06-01 16:41:21] [INFO ] Deduced a trap composed of 121 places in 481 ms of which 5 ms to minimize.
[2024-06-01 16:41:22] [INFO ] Deduced a trap composed of 168 places in 481 ms of which 5 ms to minimize.
[2024-06-01 16:41:22] [INFO ] Deduced a trap composed of 166 places in 483 ms of which 5 ms to minimize.
[2024-06-01 16:41:23] [INFO ] Deduced a trap composed of 173 places in 478 ms of which 4 ms to minimize.
[2024-06-01 16:41:23] [INFO ] Deduced a trap composed of 241 places in 473 ms of which 5 ms to minimize.
[2024-06-01 16:41:24] [INFO ] Deduced a trap composed of 161 places in 482 ms of which 5 ms to minimize.
[2024-06-01 16:41:24] [INFO ] Deduced a trap composed of 90 places in 479 ms of which 4 ms to minimize.
[2024-06-01 16:41:25] [INFO ] Deduced a trap composed of 130 places in 480 ms of which 4 ms to minimize.
[2024-06-01 16:41:25] [INFO ] Deduced a trap composed of 133 places in 481 ms of which 4 ms to minimize.
[2024-06-01 16:41:26] [INFO ] Deduced a trap composed of 87 places in 469 ms of which 5 ms to minimize.
[2024-06-01 16:41:26] [INFO ] Deduced a trap composed of 134 places in 493 ms of which 5 ms to minimize.
[2024-06-01 16:41:27] [INFO ] Deduced a trap composed of 126 places in 498 ms of which 5 ms to minimize.
[2024-06-01 16:41:28] [INFO ] Deduced a trap composed of 145 places in 525 ms of which 5 ms to minimize.
[2024-06-01 16:41:28] [INFO ] Deduced a trap composed of 230 places in 523 ms of which 4 ms to minimize.
[2024-06-01 16:41:29] [INFO ] Deduced a trap composed of 144 places in 481 ms of which 5 ms to minimize.
[2024-06-01 16:41:29] [INFO ] Deduced a trap composed of 221 places in 477 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 16:41:31] [INFO ] Deduced a trap composed of 184 places in 495 ms of which 5 ms to minimize.
[2024-06-01 16:41:31] [INFO ] Deduced a trap composed of 192 places in 507 ms of which 5 ms to minimize.
[2024-06-01 16:41:32] [INFO ] Deduced a trap composed of 193 places in 499 ms of which 5 ms to minimize.
[2024-06-01 16:41:32] [INFO ] Deduced a trap composed of 152 places in 472 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 1243/1690 variables, 447/550 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1690 variables, 110/660 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1690 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (OVERLAPS) 0/1690 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1690/1690 variables, and 660 constraints, problems are : Problem set: 0 solved, 21 unsolved in 55792 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 447/447 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 398/438 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 16:41:45] [INFO ] Deduced a trap composed of 307 places in 398 ms of which 5 ms to minimize.
[2024-06-01 16:41:46] [INFO ] Deduced a trap composed of 355 places in 406 ms of which 4 ms to minimize.
[2024-06-01 16:41:46] [INFO ] Deduced a trap composed of 354 places in 409 ms of which 5 ms to minimize.
[2024-06-01 16:41:47] [INFO ] Deduced a trap composed of 343 places in 392 ms of which 4 ms to minimize.
[2024-06-01 16:41:47] [INFO ] Deduced a trap composed of 355 places in 413 ms of which 5 ms to minimize.
[2024-06-01 16:41:48] [INFO ] Deduced a trap composed of 358 places in 404 ms of which 5 ms to minimize.
[2024-06-01 16:41:48] [INFO ] Deduced a trap composed of 343 places in 415 ms of which 5 ms to minimize.
[2024-06-01 16:41:48] [INFO ] Deduced a trap composed of 327 places in 408 ms of which 4 ms to minimize.
[2024-06-01 16:41:49] [INFO ] Deduced a trap composed of 358 places in 413 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 16:41:49] [INFO ] Deduced a trap composed of 301 places in 415 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 9/447 variables, 9/35 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 78/113 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 16:41:51] [INFO ] Deduced a trap composed of 231 places in 361 ms of which 4 ms to minimize.
[2024-06-01 16:41:52] [INFO ] Deduced a trap composed of 104 places in 469 ms of which 4 ms to minimize.
[2024-06-01 16:41:52] [INFO ] Deduced a trap composed of 109 places in 492 ms of which 4 ms to minimize.
[2024-06-01 16:41:53] [INFO ] Deduced a trap composed of 112 places in 487 ms of which 5 ms to minimize.
[2024-06-01 16:41:53] [INFO ] Deduced a trap composed of 214 places in 453 ms of which 4 ms to minimize.
[2024-06-01 16:41:54] [INFO ] Deduced a trap composed of 171 places in 439 ms of which 5 ms to minimize.
[2024-06-01 16:41:54] [INFO ] Deduced a trap composed of 153 places in 423 ms of which 4 ms to minimize.
[2024-06-01 16:41:55] [INFO ] Deduced a trap composed of 110 places in 440 ms of which 4 ms to minimize.
[2024-06-01 16:41:55] [INFO ] Deduced a trap composed of 214 places in 475 ms of which 5 ms to minimize.
[2024-06-01 16:41:56] [INFO ] Deduced a trap composed of 214 places in 466 ms of which 5 ms to minimize.
[2024-06-01 16:41:56] [INFO ] Deduced a trap composed of 71 places in 395 ms of which 4 ms to minimize.
[2024-06-01 16:41:57] [INFO ] Deduced a trap composed of 109 places in 497 ms of which 5 ms to minimize.
[2024-06-01 16:41:57] [INFO ] Deduced a trap composed of 147 places in 462 ms of which 4 ms to minimize.
[2024-06-01 16:41:58] [INFO ] Deduced a trap composed of 202 places in 464 ms of which 4 ms to minimize.
[2024-06-01 16:41:58] [INFO ] Deduced a trap composed of 134 places in 476 ms of which 5 ms to minimize.
[2024-06-01 16:41:59] [INFO ] Deduced a trap composed of 122 places in 454 ms of which 5 ms to minimize.
[2024-06-01 16:41:59] [INFO ] Deduced a trap composed of 143 places in 478 ms of which 5 ms to minimize.
[2024-06-01 16:42:00] [INFO ] Deduced a trap composed of 130 places in 504 ms of which 5 ms to minimize.
[2024-06-01 16:42:00] [INFO ] Deduced a trap composed of 93 places in 502 ms of which 4 ms to minimize.
[2024-06-01 16:42:01] [INFO ] Deduced a trap composed of 74 places in 458 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 16:42:03] [INFO ] Deduced a trap composed of 168 places in 474 ms of which 5 ms to minimize.
[2024-06-01 16:42:04] [INFO ] Deduced a trap composed of 245 places in 485 ms of which 5 ms to minimize.
[2024-06-01 16:42:04] [INFO ] Deduced a trap composed of 160 places in 483 ms of which 5 ms to minimize.
[2024-06-01 16:42:05] [INFO ] Deduced a trap composed of 218 places in 496 ms of which 4 ms to minimize.
[2024-06-01 16:42:05] [INFO ] Deduced a trap composed of 151 places in 470 ms of which 4 ms to minimize.
[2024-06-01 16:42:06] [INFO ] Deduced a trap composed of 151 places in 497 ms of which 4 ms to minimize.
[2024-06-01 16:42:06] [INFO ] Deduced a trap composed of 129 places in 376 ms of which 4 ms to minimize.
[2024-06-01 16:42:07] [INFO ] Deduced a trap composed of 153 places in 504 ms of which 4 ms to minimize.
[2024-06-01 16:42:08] [INFO ] Deduced a trap composed of 132 places in 430 ms of which 4 ms to minimize.
[2024-06-01 16:42:08] [INFO ] Deduced a trap composed of 166 places in 364 ms of which 5 ms to minimize.
[2024-06-01 16:42:09] [INFO ] Deduced a trap composed of 187 places in 431 ms of which 4 ms to minimize.
[2024-06-01 16:42:09] [INFO ] Deduced a trap composed of 173 places in 425 ms of which 5 ms to minimize.
[2024-06-01 16:42:09] [INFO ] Deduced a trap composed of 167 places in 449 ms of which 4 ms to minimize.
[2024-06-01 16:42:10] [INFO ] Deduced a trap composed of 170 places in 449 ms of which 4 ms to minimize.
[2024-06-01 16:42:10] [INFO ] Deduced a trap composed of 174 places in 452 ms of which 4 ms to minimize.
[2024-06-01 16:42:11] [INFO ] Deduced a trap composed of 192 places in 473 ms of which 4 ms to minimize.
[2024-06-01 16:42:12] [INFO ] Deduced a trap composed of 248 places in 458 ms of which 4 ms to minimize.
[2024-06-01 16:42:12] [INFO ] Deduced a trap composed of 136 places in 437 ms of which 10 ms to minimize.
[2024-06-01 16:42:12] [INFO ] Deduced a trap composed of 104 places in 461 ms of which 5 ms to minimize.
[2024-06-01 16:42:13] [INFO ] Deduced a trap composed of 146 places in 499 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 16:42:16] [INFO ] Deduced a trap composed of 154 places in 462 ms of which 5 ms to minimize.
[2024-06-01 16:42:16] [INFO ] Deduced a trap composed of 106 places in 354 ms of which 4 ms to minimize.
[2024-06-01 16:42:17] [INFO ] Deduced a trap composed of 188 places in 464 ms of which 4 ms to minimize.
[2024-06-01 16:42:17] [INFO ] Deduced a trap composed of 169 places in 387 ms of which 4 ms to minimize.
[2024-06-01 16:42:18] [INFO ] Deduced a trap composed of 131 places in 485 ms of which 5 ms to minimize.
[2024-06-01 16:42:18] [INFO ] Deduced a trap composed of 126 places in 493 ms of which 5 ms to minimize.
[2024-06-01 16:42:19] [INFO ] Deduced a trap composed of 126 places in 556 ms of which 4 ms to minimize.
[2024-06-01 16:42:20] [INFO ] Deduced a trap composed of 119 places in 521 ms of which 5 ms to minimize.
[2024-06-01 16:42:21] [INFO ] Deduced a trap composed of 132 places in 451 ms of which 4 ms to minimize.
[2024-06-01 16:42:21] [INFO ] Deduced a trap composed of 100 places in 470 ms of which 4 ms to minimize.
[2024-06-01 16:42:23] [INFO ] Deduced a trap composed of 164 places in 411 ms of which 4 ms to minimize.
[2024-06-01 16:42:23] [INFO ] Deduced a trap composed of 151 places in 464 ms of which 4 ms to minimize.
[2024-06-01 16:42:24] [INFO ] Deduced a trap composed of 170 places in 471 ms of which 4 ms to minimize.
[2024-06-01 16:42:24] [INFO ] Deduced a trap composed of 238 places in 491 ms of which 5 ms to minimize.
[2024-06-01 16:42:25] [INFO ] Deduced a trap composed of 138 places in 462 ms of which 5 ms to minimize.
[2024-06-01 16:42:25] [INFO ] Deduced a trap composed of 131 places in 454 ms of which 4 ms to minimize.
[2024-06-01 16:42:26] [INFO ] Deduced a trap composed of 124 places in 449 ms of which 4 ms to minimize.
[2024-06-01 16:42:27] [INFO ] Deduced a trap composed of 224 places in 441 ms of which 5 ms to minimize.
[2024-06-01 16:42:27] [INFO ] Deduced a trap composed of 185 places in 499 ms of which 4 ms to minimize.
[2024-06-01 16:42:28] [INFO ] Deduced a trap composed of 231 places in 510 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 16:42:33] [INFO ] Deduced a trap composed of 174 places in 687 ms of which 7 ms to minimize.
[2024-06-01 16:42:33] [INFO ] Deduced a trap composed of 247 places in 649 ms of which 7 ms to minimize.
[2024-06-01 16:42:34] [INFO ] Deduced a trap composed of 161 places in 762 ms of which 7 ms to minimize.
[2024-06-01 16:42:35] [INFO ] Deduced a trap composed of 199 places in 721 ms of which 7 ms to minimize.
[2024-06-01 16:42:36] [INFO ] Deduced a trap composed of 238 places in 667 ms of which 6 ms to minimize.
[2024-06-01 16:42:36] [INFO ] Deduced a trap composed of 158 places in 696 ms of which 7 ms to minimize.
[2024-06-01 16:42:37] [INFO ] Deduced a trap composed of 133 places in 696 ms of which 7 ms to minimize.
[2024-06-01 16:42:38] [INFO ] Deduced a trap composed of 100 places in 692 ms of which 6 ms to minimize.
[2024-06-01 16:42:39] [INFO ] Deduced a trap composed of 155 places in 577 ms of which 5 ms to minimize.
[2024-06-01 16:42:39] [INFO ] Deduced a trap composed of 101 places in 692 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 10/183 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 16:42:44] [INFO ] Deduced a trap composed of 162 places in 631 ms of which 7 ms to minimize.
[2024-06-01 16:42:45] [INFO ] Deduced a trap composed of 246 places in 654 ms of which 7 ms to minimize.
[2024-06-01 16:42:46] [INFO ] Deduced a trap composed of 99 places in 701 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 16:42:54] [INFO ] Deduced a trap composed of 230 places in 478 ms of which 6 ms to minimize.
[2024-06-01 16:42:55] [INFO ] Deduced a trap composed of 246 places in 662 ms of which 6 ms to minimize.
[2024-06-01 16:42:56] [INFO ] Deduced a trap composed of 178 places in 673 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/1690 variables, and 189 constraints, problems are : Problem set: 0 solved, 21 unsolved in 75012 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/447 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/21 constraints, Known Traps: 164/164 constraints]
After SMT, in 130973ms problems are : Problem set: 0 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1243/1243 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 445 transition count 1201
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 445 transition count 1201
Applied a total of 4 rules in 76 ms. Remains 445 /447 variables (removed 2) and now considering 1201/1243 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 445/447 places, 1201/1243 transitions.
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-11-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:43:00] [INFO ] Flatten gal took : 193 ms
[2024-06-01 16:43:00] [INFO ] Flatten gal took : 177 ms
[2024-06-01 16:43:01] [INFO ] Input system was already deterministic with 2177 transitions.
Support contains 92 out of 601 places (down from 94) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 2177/2177 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 537 transition count 973
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 537 transition count 973
Applied a total of 128 rules in 43 ms. Remains 537 /601 variables (removed 64) and now considering 973/2177 (removed 1204) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 537/601 places, 973/2177 transitions.
[2024-06-01 16:43:01] [INFO ] Flatten gal took : 34 ms
[2024-06-01 16:43:01] [INFO ] Flatten gal took : 37 ms
[2024-06-01 16:43:01] [INFO ] Input system was already deterministic with 973 transitions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 2177/2177 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 530 transition count 826
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 530 transition count 826
Applied a total of 142 rules in 32 ms. Remains 530 /601 variables (removed 71) and now considering 826/2177 (removed 1351) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 530/601 places, 826/2177 transitions.
[2024-06-01 16:43:01] [INFO ] Flatten gal took : 29 ms
[2024-06-01 16:43:01] [INFO ] Flatten gal took : 33 ms
[2024-06-01 16:43:01] [INFO ] Input system was already deterministic with 826 transitions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 2177/2177 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 544 transition count 1120
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 544 transition count 1120
Applied a total of 114 rules in 44 ms. Remains 544 /601 variables (removed 57) and now considering 1120/2177 (removed 1057) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 544/601 places, 1120/2177 transitions.
[2024-06-01 16:43:01] [INFO ] Flatten gal took : 40 ms
[2024-06-01 16:43:01] [INFO ] Flatten gal took : 46 ms
[2024-06-01 16:43:01] [INFO ] Input system was already deterministic with 1120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 2177/2177 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 531 transition count 867
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 531 transition count 867
Applied a total of 140 rules in 29 ms. Remains 531 /601 variables (removed 70) and now considering 867/2177 (removed 1310) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 531/601 places, 867/2177 transitions.
[2024-06-01 16:43:01] [INFO ] Flatten gal took : 26 ms
[2024-06-01 16:43:01] [INFO ] Flatten gal took : 28 ms
[2024-06-01 16:43:01] [INFO ] Input system was already deterministic with 867 transitions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 2177/2177 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 531 transition count 867
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 531 transition count 867
Applied a total of 140 rules in 24 ms. Remains 531 /601 variables (removed 70) and now considering 867/2177 (removed 1310) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 531/601 places, 867/2177 transitions.
[2024-06-01 16:43:02] [INFO ] Flatten gal took : 27 ms
[2024-06-01 16:43:02] [INFO ] Flatten gal took : 29 ms
[2024-06-01 16:43:02] [INFO ] Input system was already deterministic with 867 transitions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 2177/2177 transitions.
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 67 place count 534 transition count 930
Iterating global reduction 0 with 67 rules applied. Total rules applied 134 place count 534 transition count 930
Applied a total of 134 rules in 35 ms. Remains 534 /601 variables (removed 67) and now considering 930/2177 (removed 1247) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 534/601 places, 930/2177 transitions.
[2024-06-01 16:43:02] [INFO ] Flatten gal took : 29 ms
[2024-06-01 16:43:02] [INFO ] Flatten gal took : 34 ms
[2024-06-01 16:43:02] [INFO ] Input system was already deterministic with 930 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 601/601 places, 2177/2177 transitions.
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 109 Pre rules applied. Total rules applied 0 place count 601 transition count 2068
Deduced a syphon composed of 109 places in 1 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 0 with 218 rules applied. Total rules applied 218 place count 492 transition count 2068
Discarding 69 places :
Symmetric choice reduction at 0 with 69 rule applications. Total rules 287 place count 423 transition count 759
Iterating global reduction 0 with 69 rules applied. Total rules applied 356 place count 423 transition count 759
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 358 place count 422 transition count 758
Applied a total of 358 rules in 90 ms. Remains 422 /601 variables (removed 179) and now considering 758/2177 (removed 1419) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 90 ms. Remains : 422/601 places, 758/2177 transitions.
[2024-06-01 16:43:02] [INFO ] Flatten gal took : 23 ms
[2024-06-01 16:43:02] [INFO ] Flatten gal took : 26 ms
[2024-06-01 16:43:02] [INFO ] Input system was already deterministic with 758 transitions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 2177/2177 transitions.
Discarding 69 places :
Symmetric choice reduction at 0 with 69 rule applications. Total rules 69 place count 532 transition count 888
Iterating global reduction 0 with 69 rules applied. Total rules applied 138 place count 532 transition count 888
Applied a total of 138 rules in 32 ms. Remains 532 /601 variables (removed 69) and now considering 888/2177 (removed 1289) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 532/601 places, 888/2177 transitions.
[2024-06-01 16:43:02] [INFO ] Flatten gal took : 29 ms
[2024-06-01 16:43:02] [INFO ] Flatten gal took : 30 ms
[2024-06-01 16:43:02] [INFO ] Input system was already deterministic with 888 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 601/601 places, 2177/2177 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 601 transition count 2067
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 491 transition count 2067
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 290 place count 421 transition count 757
Iterating global reduction 0 with 70 rules applied. Total rules applied 360 place count 421 transition count 757
Applied a total of 360 rules in 63 ms. Remains 421 /601 variables (removed 180) and now considering 757/2177 (removed 1420) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64 ms. Remains : 421/601 places, 757/2177 transitions.
[2024-06-01 16:43:02] [INFO ] Flatten gal took : 23 ms
[2024-06-01 16:43:02] [INFO ] Flatten gal took : 27 ms
[2024-06-01 16:43:02] [INFO ] Input system was already deterministic with 757 transitions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 2177/2177 transitions.
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 67 place count 534 transition count 930
Iterating global reduction 0 with 67 rules applied. Total rules applied 134 place count 534 transition count 930
Applied a total of 134 rules in 26 ms. Remains 534 /601 variables (removed 67) and now considering 930/2177 (removed 1247) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 534/601 places, 930/2177 transitions.
[2024-06-01 16:43:02] [INFO ] Flatten gal took : 28 ms
[2024-06-01 16:43:02] [INFO ] Flatten gal took : 31 ms
[2024-06-01 16:43:03] [INFO ] Input system was already deterministic with 930 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 601/601 places, 2177/2177 transitions.
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 109 Pre rules applied. Total rules applied 0 place count 601 transition count 2068
Deduced a syphon composed of 109 places in 1 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 0 with 218 rules applied. Total rules applied 218 place count 492 transition count 2068
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 289 place count 421 transition count 717
Iterating global reduction 0 with 71 rules applied. Total rules applied 360 place count 421 transition count 717
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 362 place count 420 transition count 716
Applied a total of 362 rules in 73 ms. Remains 420 /601 variables (removed 181) and now considering 716/2177 (removed 1461) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 74 ms. Remains : 420/601 places, 716/2177 transitions.
[2024-06-01 16:43:03] [INFO ] Flatten gal took : 21 ms
[2024-06-01 16:43:03] [INFO ] Flatten gal took : 21 ms
[2024-06-01 16:43:03] [INFO ] Input system was already deterministic with 716 transitions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 2177/2177 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 530 transition count 846
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 530 transition count 846
Applied a total of 142 rules in 33 ms. Remains 530 /601 variables (removed 71) and now considering 846/2177 (removed 1331) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 530/601 places, 846/2177 transitions.
[2024-06-01 16:43:03] [INFO ] Flatten gal took : 22 ms
[2024-06-01 16:43:03] [INFO ] Flatten gal took : 25 ms
[2024-06-01 16:43:03] [INFO ] Input system was already deterministic with 846 transitions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 2177/2177 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 538 transition count 974
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 538 transition count 974
Applied a total of 126 rules in 32 ms. Remains 538 /601 variables (removed 63) and now considering 974/2177 (removed 1203) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 538/601 places, 974/2177 transitions.
[2024-06-01 16:43:03] [INFO ] Flatten gal took : 26 ms
[2024-06-01 16:43:03] [INFO ] Flatten gal took : 28 ms
[2024-06-01 16:43:03] [INFO ] Input system was already deterministic with 974 transitions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 2177/2177 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 541 transition count 1057
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 541 transition count 1057
Applied a total of 120 rules in 46 ms. Remains 541 /601 variables (removed 60) and now considering 1057/2177 (removed 1120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 541/601 places, 1057/2177 transitions.
[2024-06-01 16:43:03] [INFO ] Flatten gal took : 27 ms
[2024-06-01 16:43:03] [INFO ] Flatten gal took : 31 ms
[2024-06-01 16:43:03] [INFO ] Input system was already deterministic with 1057 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 601/601 places, 2177/2177 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 601 transition count 2067
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 491 transition count 2067
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 291 place count 420 transition count 736
Iterating global reduction 0 with 71 rules applied. Total rules applied 362 place count 420 transition count 736
Applied a total of 362 rules in 69 ms. Remains 420 /601 variables (removed 181) and now considering 736/2177 (removed 1441) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 70 ms. Remains : 420/601 places, 736/2177 transitions.
[2024-06-01 16:43:03] [INFO ] Flatten gal took : 19 ms
[2024-06-01 16:43:03] [INFO ] Flatten gal took : 20 ms
[2024-06-01 16:43:03] [INFO ] Input system was already deterministic with 736 transitions.
RANDOM walk for 26687 steps (6 resets) in 143 ms. (185 steps per ms) remains 0/1 properties
FORMULA Anderson-PT-11-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-01 16:43:03] [INFO ] Flatten gal took : 65 ms
[2024-06-01 16:43:04] [INFO ] Flatten gal took : 68 ms
[2024-06-01 16:43:04] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-06-01 16:43:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 601 places, 2177 transitions and 8472 arcs took 17 ms.
Total runtime 288992 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Anderson-PT-11-CTLFireability-2024-00
Could not compute solution for formula : Anderson-PT-11-CTLFireability-2024-01
Could not compute solution for formula : Anderson-PT-11-CTLFireability-2024-02
Could not compute solution for formula : Anderson-PT-11-CTLFireability-2024-03
Could not compute solution for formula : Anderson-PT-11-CTLFireability-2024-04
Could not compute solution for formula : Anderson-PT-11-CTLFireability-2024-05
Could not compute solution for formula : Anderson-PT-11-CTLFireability-2024-07
Could not compute solution for formula : Anderson-PT-11-CTLFireability-2024-08
Could not compute solution for formula : Anderson-PT-11-CTLFireability-2024-09
Could not compute solution for formula : Anderson-PT-11-CTLFireability-2024-10
Could not compute solution for formula : Anderson-PT-11-CTLFireability-2024-11
Could not compute solution for formula : Anderson-PT-11-CTLFireability-2023-12
Could not compute solution for formula : Anderson-PT-11-CTLFireability-2023-13
Could not compute solution for formula : Anderson-PT-11-CTLFireability-2023-14

BK_STOP 1717260184612

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-11"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Anderson-PT-11, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620118400370"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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