MCC'2024- Execution of r289-tajo-171654445600281

About the Execution of GreatSPN+red for PolyORBLF-PT-S04J04T10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15519.300	3600000.00	13030003.00	222.20	?FFT?FF?????F??T	normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445600281.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S04J04T10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445600281
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.7M
-rw-r--r-- 1 mcc users 27K Apr 11 17:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 11 17:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 111K Apr 11 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 530K Apr 11 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 17:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 11 17:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 263K Apr 11 17:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.7K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716865356095

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 03:02:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 03:02:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 03:02:37] [INFO ] Load time of PNML (sax parser for PT used): 300 ms
[2024-05-28 03:02:37] [INFO ] Transformed 870 places.
[2024-05-28 03:02:37] [INFO ] Transformed 5034 transitions.
[2024-05-28 03:02:37] [INFO ] Parsed PT model containing 870 places and 5034 transitions and 34774 arcs in 454 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Support contains 563 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Applied a total of 0 rules in 64 ms. Remains 870 /870 variables (removed 0) and now considering 2324/2324 (removed 0) transitions.
Running 2320 sub problems to find dead transitions.
[2024-05-28 03:02:38] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 870 cols
[2024-05-28 03:02:38] [INFO ] Computed 58 invariants in 164 ms
[2024-05-28 03:02:38] [INFO ] State equation strengthened by 200 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 1.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 2.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 0.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 0.0)
(s190 1.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 1.0)
(s221 0.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 0.0)
(s228 1.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s258 0.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 1.0)
(s265 0.0)
(s266 1.0)
(s267 1.0)
(s268 0.0)
(s269 1.0)
(s270 1.0)
(s271 4.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 1.0)
(s331 1.0)
(s332 0.0)
(s333 1.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 1.0)
(s351 1.0)
(s352 9.0)
(s353 1.0)
(s354 1.0)
(s355 0.0)
(s356 1.0)
(s357 1.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 0.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s373 1.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 0.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 0.0)
(s392 1.0)
(s393 1.0)
(s394 0.0)
(s395 1.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 1.0)
(s415 1.0)
(s416 0.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 0.0)
(s423 0.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 0.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 0.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 0.0)
(s440 1.0)
(s441 1.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 0.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 0.0)
(s457 0.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 0.0)
(s465 1.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 1.0)
(s470 1.0)
(s471 0.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 0.0)
(s479 1.0)
(s480 1.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 0.0)
(s495 1.0)
(s496 0.0)
(s497 4.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 0.0)
(s510 1.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 1.0)
(s515 1.0)
(s516 0.0)
(s517 1.0)
(s518 0.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 0.0)
(s524 1.0)
(s525 1.0)
(s526 0.0)
(s527 0.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 0.0)
(s533 1.0)
(s534 0.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)timeout

(s538 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
SMT process timed out in 33315ms, After SMT, problems are : Problem set: 0 solved, 2320 unsolved
Search for dead transitions found 0 dead transitions in 33375ms
[2024-05-28 03:03:11] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-05-28 03:03:11] [INFO ] Invariant cache hit.
[2024-05-28 03:03:12] [INFO ] Implicit Places using invariants in 702 ms returned []
[2024-05-28 03:03:12] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-05-28 03:03:12] [INFO ] Invariant cache hit.
[2024-05-28 03:03:14] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 03:03:28] [INFO ] Implicit Places using invariants and state equation in 16337 ms returned []
Implicit Place search using SMT with State Equation took 17048 ms to find 0 implicit places.
Running 2320 sub problems to find dead transitions.
[2024-05-28 03:03:28] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-05-28 03:03:28] [INFO ] Invariant cache hit.
[2024-05-28 03:03:28] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/862 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
[2024-05-28 03:04:11] [INFO ] Deduced a trap composed of 76 places in 196 ms of which 21 ms to minimize.
[2024-05-28 03:04:11] [INFO ] Deduced a trap composed of 75 places in 168 ms of which 3 ms to minimize.
[2024-05-28 03:04:12] [INFO ] Deduced a trap composed of 75 places in 144 ms of which 3 ms to minimize.
[2024-05-28 03:04:12] [INFO ] Deduced a trap composed of 75 places in 167 ms of which 2 ms to minimize.
[2024-05-28 03:04:12] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 2 ms to minimize.
[2024-05-28 03:04:12] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-05-28 03:04:12] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-05-28 03:04:12] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 2 ms to minimize.
[2024-05-28 03:04:13] [INFO ] Deduced a trap composed of 498 places in 643 ms of which 6 ms to minimize.
SMT process timed out in 44752ms, After SMT, problems are : Problem set: 0 solved, 2320 unsolved
Search for dead transitions found 0 dead transitions in 44780ms
Finished structural reductions in LTL mode , in 1 iterations and 95340 ms. Remains : 870/870 places, 2324/2324 transitions.
Support contains 563 out of 870 places after structural reductions.
[2024-05-28 03:04:13] [INFO ] Flatten gal took : 246 ms
[2024-05-28 03:04:14] [INFO ] Flatten gal took : 173 ms
[2024-05-28 03:04:14] [INFO ] Input system was already deterministic with 2324 transitions.
RANDOM walk for 40000 steps (9 resets) in 2778 ms. (14 steps per ms) remains 78/121 properties
BEST_FIRST walk for 4001 steps (8 resets) in 130 ms. (30 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 142 ms. (27 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 75 ms. (52 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 69 ms. (57 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4000 steps (8 resets) in 49 ms. (80 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 72 ms. (54 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 60 ms. (65 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 90 ms. (43 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 74 ms. (53 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 81 ms. (48 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 68 ms. (57 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 86 ms. (46 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 66 ms. (59 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 78/78 properties
[2024-05-28 03:04:16] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-05-28 03:04:16] [INFO ] Invariant cache hit.
[2024-05-28 03:04:16] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp93 is UNSAT
Problem AtomicPropp94 is UNSAT
Problem AtomicPropp95 is UNSAT
Problem AtomicPropp105 is UNSAT
Problem AtomicPropp106 is UNSAT
Problem AtomicPropp107 is UNSAT
Problem AtomicPropp108 is UNSAT
Problem AtomicPropp110 is UNSAT
Problem AtomicPropp112 is UNSAT
Problem AtomicPropp117 is UNSAT
At refinement iteration 1 (OVERLAPS) 178/610 variables, 14/14 constraints. Problems are: Problem set: 31 solved, 47 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 4/18 constraints. Problems are: Problem set: 32 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/610 variables, 0/18 constraints. Problems are: Problem set: 32 solved, 46 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp97 is UNSAT
Problem AtomicPropp101 is UNSAT
Problem AtomicPropp103 is UNSAT
Problem AtomicPropp104 is UNSAT
Problem AtomicPropp109 is UNSAT
Problem AtomicPropp111 is UNSAT
Problem AtomicPropp113 is UNSAT
At refinement iteration 4 (OVERLAPS) 256/866 variables, 37/55 constraints. Problems are: Problem set: 76 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/866 variables, 0/55 constraints. Problems are: Problem set: 76 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/867 variables, 1/56 constraints. Problems are: Problem set: 76 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/867 variables, 0/56 constraints. Problems are: Problem set: 76 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/868 variables, 1/57 constraints. Problems are: Problem set: 76 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/868 variables, 0/57 constraints. Problems are: Problem set: 76 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3152/3154 variables, and 925 constraints, problems are : Problem set: 76 solved, 2 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 868/870 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 76 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 76 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 134/139 variables, 2/2 constraints. Problems are: Problem set: 76 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 76 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/141 variables, 2/4 constraints. Problems are: Problem set: 76 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/4 constraints. Problems are: Problem set: 76 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 679/820 variables, 20/24 constraints. Problems are: Problem set: 76 solved, 2 unsolved
[2024-05-28 03:04:22] [INFO ] Deduced a trap composed of 75 places in 261 ms of which 4 ms to minimize.
[2024-05-28 03:04:22] [INFO ] Deduced a trap composed of 75 places in 237 ms of which 3 ms to minimize.
[2024-05-28 03:04:22] [INFO ] Deduced a trap composed of 75 places in 195 ms of which 3 ms to minimize.
[2024-05-28 03:04:22] [INFO ] Deduced a trap composed of 75 places in 151 ms of which 2 ms to minimize.
[2024-05-28 03:04:23] [INFO ] Deduced a trap composed of 76 places in 138 ms of which 2 ms to minimize.
[2024-05-28 03:04:23] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 1 ms to minimize.
[2024-05-28 03:04:23] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 1 ms to minimize.
[2024-05-28 03:04:23] [INFO ] Deduced a trap composed of 76 places in 62 ms of which 1 ms to minimize.
Problem AtomicPropp120 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/820 variables, 8/32 constraints. Problems are: Problem set: 77 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/820 variables, 0/32 constraints. Problems are: Problem set: 77 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/832 variables, 10/42 constraints. Problems are: Problem set: 77 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/832 variables, 0/42 constraints. Problems are: Problem set: 77 solved, 1 unsolved
Problem AtomicPropp98 is UNSAT
After SMT solving in domain Int declared 867/3154 variables, and 64 constraints, problems are : Problem set: 78 solved, 0 unsolved in 1681 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/870 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/78 constraints, Known Traps: 8/8 constraints]
After SMT, in 6917ms problems are : Problem set: 78 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 78 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-PT-S04J04T10-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 03:04:23] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-28 03:04:23] [INFO ] Flatten gal took : 123 ms
[2024-05-28 03:04:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-PT-S04J04T10-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 03:04:23] [INFO ] Flatten gal took : 132 ms
[2024-05-28 03:04:24] [INFO ] Input system was already deterministic with 2324 transitions.
Support contains 103 out of 870 places (down from 153) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 856 transition count 2314
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 856 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 846 transition count 2304
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 846 transition count 2304
Applied a total of 44 rules in 150 ms. Remains 846 /870 variables (removed 24) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-05-28 03:04:24] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 846 cols
[2024-05-28 03:04:24] [INFO ] Computed 54 invariants in 131 ms
[2024-05-28 03:04:24] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/842 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 35202ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 35234ms
Finished structural reductions in LTL mode , in 1 iterations and 35393 ms. Remains : 846/870 places, 2304/2324 transitions.
[2024-05-28 03:04:59] [INFO ] Flatten gal took : 109 ms
[2024-05-28 03:04:59] [INFO ] Flatten gal took : 104 ms
[2024-05-28 03:04:59] [INFO ] Input system was already deterministic with 2304 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 866 transition count 2264
Reduce places removed 60 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 70 rules applied. Total rules applied 130 place count 806 transition count 2254
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 140 place count 796 transition count 2254
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 140 place count 796 transition count 2154
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 340 place count 696 transition count 2154
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 4 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 440 place count 646 transition count 2104
Applied a total of 440 rules in 275 ms. Remains 646 /870 variables (removed 224) and now considering 2104/2324 (removed 220) transitions.
Running 2100 sub problems to find dead transitions.
[2024-05-28 03:05:00] [INFO ] Flow matrix only has 2064 transitions (discarded 40 similar events)
// Phase 1: matrix 2064 rows 646 cols
[2024-05-28 03:05:00] [INFO ] Computed 54 invariants in 74 ms
[2024-05-28 03:05:00] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-05-28 03:05:32] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 8.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 2.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 3.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 2.0)
(s38 0.0)
(s39 3.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 4.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 3.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 2.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 1.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 1.0)
(s101 2.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 2.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.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 1.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 4.0)
(s166 0.0)
(s167 2.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 2.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 0.0)
(s179 1.0)
(s180 (/ 1.0 3.0))
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 4.0)
(s188 0.0)
(s189 4.0)
(s190 0.0)
(s191 1.0)
(s192 1.0)
(s193 0.0)
(s194 3.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 2.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 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 2.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 10.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 4.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 4.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 2.0)
(s265 0.0)
(s266 0.0)
(s267 3.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 1.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 (/ 1.0 3.0))
(s292 0.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 2.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 4.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s343 0.0)
(s344 0.0)
(s345 2.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 1.0)
(s352 0.0)
(s353 0.0)
(s354 4.0)
(s355 1.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 3.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 1.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 0.0)
(s378 2.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 2.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 1.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 2.0)
(s414 0.0)
(s415 0.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 3.0)
(s423 0.0)
(s424 1.0)
(s425 0.0)
(s426 4.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 1.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 0.0)
(s439 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2710 variables, and 46 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 35/43 constraints, State Equation: 0/646 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-05-28 03:05:39] [INFO ] Deduced a trap composed of 53 places in 405 ms of which 4 ms to minimize.
[2024-05-28 03:05:40] [INFO ] Deduced a trap composed of 53 places in 467 ms of which 3 ms to minimize.
[2024-05-28 03:05:40] [INFO ] Deduced a trap composed of 53 places in 428 ms of which 3 ms to minimize.
[2024-05-28 03:05:40] [INFO ] Deduced a trap composed of 53 places in 391 ms of which 4 ms to minimize.
[2024-05-28 03:05:41] [INFO ] Deduced a trap composed of 53 places in 334 ms of which 3 ms to minimize.
[2024-05-28 03:05:41] [INFO ] Deduced a trap composed of 69 places in 355 ms of which 3 ms to minimize.
[2024-05-28 03:05:42] [INFO ] Deduced a trap composed of 53 places in 366 ms of which 3 ms to minimize.
[2024-05-28 03:05:42] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2024-05-28 03:05:42] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-05-28 03:05:42] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
[2024-05-28 03:05:43] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
[2024-05-28 03:05:49] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 3 ms to minimize.
[2024-05-28 03:05:51] [INFO ] Deduced a trap composed of 39 places in 366 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2710 variables, and 59 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 35/43 constraints, State Equation: 0/646 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2100 constraints, Known Traps: 14/14 constraints]
After SMT, in 54168ms problems are : Problem set: 0 solved, 2100 unsolved
Search for dead transitions found 0 dead transitions in 54192ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 54474 ms. Remains : 646/870 places, 2104/2324 transitions.
[2024-05-28 03:05:54] [INFO ] Flatten gal took : 94 ms
[2024-05-28 03:05:54] [INFO ] Flatten gal took : 103 ms
[2024-05-28 03:05:54] [INFO ] Input system was already deterministic with 2104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 856 transition count 2314
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 856 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 846 transition count 2304
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 846 transition count 2304
Applied a total of 44 rules in 87 ms. Remains 846 /870 variables (removed 24) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-05-28 03:05:54] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 846 cols
[2024-05-28 03:05:55] [INFO ] Computed 54 invariants in 48 ms
[2024-05-28 03:05:55] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/842 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 36259ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 36291ms
Finished structural reductions in LTL mode , in 1 iterations and 36386 ms. Remains : 846/870 places, 2304/2324 transitions.
[2024-05-28 03:06:31] [INFO ] Flatten gal took : 143 ms
[2024-05-28 03:06:31] [INFO ] Flatten gal took : 132 ms
[2024-05-28 03:06:31] [INFO ] Input system was already deterministic with 2304 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 866 transition count 2236
Reduce places removed 88 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 89 rules applied. Total rules applied 177 place count 778 transition count 2235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 178 place count 777 transition count 2235
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 178 place count 777 transition count 2136
Deduced a syphon composed of 99 places in 3 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 376 place count 678 transition count 2136
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 2 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 572 place count 580 transition count 2038
Applied a total of 572 rules in 170 ms. Remains 580 /870 variables (removed 290) and now considering 2038/2324 (removed 286) transitions.
Running 2034 sub problems to find dead transitions.
[2024-05-28 03:06:31] [INFO ] Flow matrix only has 1998 transitions (discarded 40 similar events)
// Phase 1: matrix 1998 rows 580 cols
[2024-05-28 03:06:32] [INFO ] Computed 54 invariants in 54 ms
[2024-05-28 03:06:32] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2034 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 2034 unsolved
[2024-05-28 03:07:02] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-05-28 03:07:02] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-05-28 03:07:03] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 2 ms to minimize.
[2024-05-28 03:07:03] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 5 ms to minimize.
[2024-05-28 03:07:03] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-05-28 03:07:03] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-05-28 03:07:03] [INFO ] Deduced a trap composed of 198 places in 357 ms of which 4 ms to minimize.
[2024-05-28 03:07:03] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-05-28 03:07:03] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 2 ms to minimize.
[2024-05-28 03:07:03] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-28 03:07:04] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-05-28 03:07:05] [INFO ] Deduced a trap composed of 39 places in 269 ms of which 2 ms to minimize.
[2024-05-28 03:07:06] [INFO ] Deduced a trap composed of 23 places in 328 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/2578 variables, and 63 constraints, problems are : Problem set: 0 solved, 2034 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 39/42 constraints, State Equation: 0/580 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2034/2034 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2034 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2034 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 2034 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/576 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 2034 unsolved
[2024-05-28 03:07:18] [INFO ] Deduced a trap composed of 234 places in 395 ms of which 4 ms to minimize.
[2024-05-28 03:07:20] [INFO ] Deduced a trap composed of 199 places in 346 ms of which 4 ms to minimize.
[2024-05-28 03:07:21] [INFO ] Deduced a trap composed of 294 places in 344 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/2578 variables, and 66 constraints, problems are : Problem set: 0 solved, 2034 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 39/42 constraints, State Equation: 0/580 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2034 constraints, Known Traps: 16/16 constraints]
After SMT, in 54757ms problems are : Problem set: 0 solved, 2034 unsolved
Search for dead transitions found 0 dead transitions in 54788ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 54965 ms. Remains : 580/870 places, 2038/2324 transitions.
[2024-05-28 03:07:26] [INFO ] Flatten gal took : 90 ms
[2024-05-28 03:07:26] [INFO ] Flatten gal took : 100 ms
[2024-05-28 03:07:27] [INFO ] Input system was already deterministic with 2038 transitions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 856 transition count 2314
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 856 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 846 transition count 2304
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 846 transition count 2304
Applied a total of 44 rules in 74 ms. Remains 846 /870 variables (removed 24) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-05-28 03:07:27] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 846 cols
[2024-05-28 03:07:27] [INFO ] Computed 54 invariants in 40 ms
[2024-05-28 03:07:27] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.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 0.0)
(s31 0.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 3.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 3.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 4.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 1.0)
(s82 3.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 0.0)
(s110 2.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/842 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 35450ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 35481ms
Finished structural reductions in LTL mode , in 1 iterations and 35563 ms. Remains : 846/870 places, 2304/2324 transitions.
[2024-05-28 03:08:02] [INFO ] Flatten gal took : 101 ms
[2024-05-28 03:08:03] [INFO ] Flatten gal took : 157 ms
[2024-05-28 03:08:03] [INFO ] Input system was already deterministic with 2304 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 866 transition count 2235
Reduce places removed 89 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 90 rules applied. Total rules applied 179 place count 777 transition count 2234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 180 place count 776 transition count 2234
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 180 place count 776 transition count 2134
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 380 place count 676 transition count 2134
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 576 place count 578 transition count 2036
Applied a total of 576 rules in 120 ms. Remains 578 /870 variables (removed 292) and now considering 2036/2324 (removed 288) transitions.
Running 2032 sub problems to find dead transitions.
[2024-05-28 03:08:03] [INFO ] Flow matrix only has 1996 transitions (discarded 40 similar events)
// Phase 1: matrix 1996 rows 578 cols
[2024-05-28 03:08:03] [INFO ] Computed 54 invariants in 60 ms
[2024-05-28 03:08:03] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/574 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/574 variables, 37/49 constraints. Problems are: Problem set: 0 solved, 2032 unsolved
[2024-05-28 03:08:35] [INFO ] Deduced a trap composed of 207 places in 337 ms of which 8 ms to minimize.
[2024-05-28 03:08:36] [INFO ] Deduced a trap composed of 52 places in 219 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 574/2574 variables, and 51 constraints, problems are : Problem set: 0 solved, 2032 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 37/41 constraints, State Equation: 0/578 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2032/2032 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2032 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/574 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/574 variables, 37/49 constraints. Problems are: Problem set: 0 solved, 2032 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/574 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 2032 unsolved
[2024-05-28 03:08:46] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 2 ms to minimize.
[2024-05-28 03:08:46] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 3 ms to minimize.
[2024-05-28 03:08:47] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 4 ms to minimize.
[2024-05-28 03:08:47] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 2 ms to minimize.
[2024-05-28 03:08:47] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 1 ms to minimize.
[2024-05-28 03:08:47] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 1 ms to minimize.
[2024-05-28 03:08:47] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-05-28 03:08:47] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 3 ms to minimize.
[2024-05-28 03:08:47] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2024-05-28 03:08:50] [INFO ] Deduced a trap composed of 3 places in 419 ms of which 4 ms to minimize.
[2024-05-28 03:08:52] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 2 ms to minimize.
[2024-05-28 03:08:52] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/2574 variables, and 63 constraints, problems are : Problem set: 0 solved, 2032 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 37/41 constraints, State Equation: 0/578 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2032 constraints, Known Traps: 14/14 constraints]
After SMT, in 54420ms problems are : Problem set: 0 solved, 2032 unsolved
Search for dead transitions found 0 dead transitions in 54444ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 54570 ms. Remains : 578/870 places, 2036/2324 transitions.
[2024-05-28 03:08:57] [INFO ] Flatten gal took : 82 ms
[2024-05-28 03:08:57] [INFO ] Flatten gal took : 97 ms
[2024-05-28 03:08:58] [INFO ] Input system was already deterministic with 2036 transitions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 856 transition count 2314
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 856 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 846 transition count 2304
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 846 transition count 2304
Applied a total of 44 rules in 60 ms. Remains 846 /870 variables (removed 24) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-05-28 03:08:58] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 846 cols
[2024-05-28 03:08:58] [INFO ] Computed 54 invariants in 39 ms
[2024-05-28 03:08:58] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/842 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 35075ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 35095ms
Finished structural reductions in LTL mode , in 1 iterations and 35160 ms. Remains : 846/870 places, 2304/2324 transitions.
[2024-05-28 03:09:33] [INFO ] Flatten gal took : 88 ms
[2024-05-28 03:09:33] [INFO ] Flatten gal took : 86 ms
[2024-05-28 03:09:33] [INFO ] Input system was already deterministic with 2304 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 866 transition count 2234
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 776 transition count 2234
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 180 place count 776 transition count 2135
Deduced a syphon composed of 99 places in 2 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 378 place count 677 transition count 2135
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 2 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 558 place count 587 transition count 2045
Applied a total of 558 rules in 122 ms. Remains 587 /870 variables (removed 283) and now considering 2045/2324 (removed 279) transitions.
Running 2041 sub problems to find dead transitions.
[2024-05-28 03:09:33] [INFO ] Flow matrix only has 2005 transitions (discarded 40 similar events)
// Phase 1: matrix 2005 rows 587 cols
[2024-05-28 03:09:34] [INFO ] Computed 54 invariants in 86 ms
[2024-05-28 03:09:34] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/583 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2041 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/583 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 2041 unsolved
[2024-05-28 03:10:06] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 2 ms to minimize.
[2024-05-28 03:10:06] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 1 ms to minimize.
[2024-05-28 03:10:06] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 2 ms to minimize.
[2024-05-28 03:10:06] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2024-05-28 03:10:06] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-28 03:10:07] [INFO ] Deduced a trap composed of 231 places in 464 ms of which 4 ms to minimize.
[2024-05-28 03:10:07] [INFO ] Deduced a trap composed of 23 places in 465 ms of which 4 ms to minimize.
[2024-05-28 03:10:07] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2024-05-28 03:10:08] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 0 ms to minimize.
[2024-05-28 03:10:08] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-28 03:10:08] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-28 03:10:08] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 583/2592 variables, and 62 constraints, problems are : Problem set: 0 solved, 2041 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 39/42 constraints, State Equation: 0/587 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2041/2041 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2041 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/583 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2041 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/583 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 2041 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 2041 unsolved
[2024-05-28 03:10:21] [INFO ] Deduced a trap composed of 183 places in 437 ms of which 5 ms to minimize.
[2024-05-28 03:10:22] [INFO ] Deduced a trap composed of 242 places in 414 ms of which 5 ms to minimize.
[2024-05-28 03:10:22] [INFO ] Deduced a trap composed of 99 places in 465 ms of which 5 ms to minimize.
[2024-05-28 03:10:23] [INFO ] Deduced a trap composed of 242 places in 424 ms of which 4 ms to minimize.
[2024-05-28 03:10:24] [INFO ] Deduced a trap composed of 207 places in 458 ms of which 5 ms to minimize.
[2024-05-28 03:10:26] [INFO ] Deduced a trap composed of 277 places in 521 ms of which 5 ms to minimize.
[2024-05-28 03:10:26] [INFO ] Deduced a trap composed of 275 places in 460 ms of which 3 ms to minimize.
[2024-05-28 03:10:27] [INFO ] Deduced a trap composed of 221 places in 409 ms of which 4 ms to minimize.
[2024-05-28 03:10:27] [INFO ] Deduced a trap composed of 301 places in 454 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/2592 variables, and 71 constraints, problems are : Problem set: 0 solved, 2041 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 39/42 constraints, State Equation: 0/587 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2041 constraints, Known Traps: 21/21 constraints]
After SMT, in 55808ms problems are : Problem set: 0 solved, 2041 unsolved
Search for dead transitions found 0 dead transitions in 55826ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 55953 ms. Remains : 587/870 places, 2045/2324 transitions.
[2024-05-28 03:10:29] [INFO ] Flatten gal took : 94 ms
[2024-05-28 03:10:29] [INFO ] Flatten gal took : 88 ms
[2024-05-28 03:10:30] [INFO ] Input system was already deterministic with 2045 transitions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 856 transition count 2314
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 856 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 846 transition count 2304
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 846 transition count 2304
Applied a total of 44 rules in 61 ms. Remains 846 /870 variables (removed 24) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-05-28 03:10:30] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 846 cols
[2024-05-28 03:10:30] [INFO ] Computed 54 invariants in 80 ms
[2024-05-28 03:10:30] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/842 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 35376ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 35402ms
Finished structural reductions in LTL mode , in 1 iterations and 35469 ms. Remains : 846/870 places, 2304/2324 transitions.
[2024-05-28 03:11:05] [INFO ] Flatten gal took : 94 ms
[2024-05-28 03:11:05] [INFO ] Flatten gal took : 117 ms
[2024-05-28 03:11:06] [INFO ] Input system was already deterministic with 2304 transitions.
[2024-05-28 03:11:06] [INFO ] Flatten gal took : 87 ms
[2024-05-28 03:11:06] [INFO ] Flatten gal took : 95 ms
[2024-05-28 03:11:06] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-05-28 03:11:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 870 places, 2324 transitions and 11844 arcs took 16 ms.
Total runtime 508767 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S04J04T10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 870
TRANSITIONS: 2324
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.056s, Sys 0.008s]

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

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

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

Process ID: 897
MODEL NAME: /home/mcc/execution/416/model
870 places, 2324 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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