Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 14:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 14:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 332K 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 ShieldIIPs-PT-020B-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717226151057

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:15:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:15:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:15:52] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2024-06-01 07:15:52] [INFO ] Transformed 1203 places.
[2024-06-01 07:15:52] [INFO ] Transformed 1183 transitions.
[2024-06-01 07:15:52] [INFO ] Found NUPN structural information;
[2024-06-01 07:15:52] [INFO ] Parsed PT model containing 1203 places and 1183 transitions and 3566 arcs in 264 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Discarding 138 places :
Symmetric choice reduction at 0 with 138 rule applications. Total rules 138 place count 1065 transition count 1045
Iterating global reduction 0 with 138 rules applied. Total rules applied 276 place count 1065 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 277 place count 1064 transition count 1044
Iterating global reduction 0 with 1 rules applied. Total rules applied 278 place count 1064 transition count 1044
Applied a total of 278 rules in 234 ms. Remains 1064 /1203 variables (removed 139) and now considering 1044/1183 (removed 139) transitions.
// Phase 1: matrix 1044 rows 1064 cols
[2024-06-01 07:15:52] [INFO ] Computed 181 invariants in 27 ms
[2024-06-01 07:15:53] [INFO ] Implicit Places using invariants in 567 ms returned []
[2024-06-01 07:15:53] [INFO ] Invariant cache hit.
[2024-06-01 07:15:54] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1463 ms to find 0 implicit places.
Running 1043 sub problems to find dead transitions.
[2024-06-01 07:15:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1063 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
At refinement iteration 1 (OVERLAPS) 1/1064 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 1.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 1.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 1.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 0.0)
(s452 1.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 1.0)
(s462 0.0)
(s463 0.0)
(s464 1.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 1.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 1.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 1.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 1.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 1.0)
(s502 0.0)
(s503 0.0)
(s504 1.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 1.0)
(s514 0.0)
(s515 0.0)
(s516 1.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 1.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 1.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 1.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 1.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 1.0)
(s554 0.0)
(s555 0.0)
(s556 1.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 1.0)
(s566 0.0)
(s567 0.0)
(s568 1.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 1.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 1.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 1.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 1.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 1.0)
(s606 0.0)
(s607 0.0)
(s608 1.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 1.0)
(s618 0.0)
(s619 0.0)
(s620 1.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 1.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 1.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 1.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 1.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 1.0)
(s658 0.0)
(s659 0.0)
(s660 1.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 1.0)
(s670 0.0)
(s671 0.0)
(s672 1.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 1.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 1.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 1.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 1.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 1.0)
(s710 0.0)
(s711 0.0)
(s712 1.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 1.0)
(s722 0.0)
(s723 0.0)
(s724 1.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 1.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 1.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 1.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 1.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 1.0)
(s762 0.0)
(s763 0.0)
(s764 1.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 1.0)
(s774 0.0)
(s775 0.0)
(s776 1.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 1.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 1.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 1.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 1.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 1.0)
(s814 0.0)
(s815 0.0)
(s816 1.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 1.0)
(s826 0.0)
(s827 0.0)
(s828 1.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 1.0)
(s834 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1064/2108 variables, and 181 constraints, problems are : Problem set: 0 solved, 1043 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1064 constraints, PredecessorRefiner: 1043/1043 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1043 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1063 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
At refinement iteration 1 (OVERLAPS) 1/1064 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 25 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 48 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 6 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 48 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:16:44] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 4 ms to minimize.
[2024-06-01 07:16:44] [INFO ] Deduced a trap composed of 51 places in 173 ms of which 4 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 4 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 4 ms to minimize.
[2024-06-01 07:16:46] [INFO ] Deduced a trap composed of 35 places in 215 ms of which 4 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 34 places in 220 ms of which 4 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 47 places in 235 ms of which 5 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 17 places in 238 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1064 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 20 places in 230 ms of which 5 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1064/2108 variables, and 209 constraints, problems are : Problem set: 0 solved, 1043 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1064 constraints, PredecessorRefiner: 0/1043 constraints, Known Traps: 28/28 constraints]
After SMT, in 60423ms problems are : Problem set: 0 solved, 1043 unsolved
Search for dead transitions found 0 dead transitions in 60466ms
Starting structural reductions in LTL mode, iteration 1 : 1064/1203 places, 1044/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62191 ms. Remains : 1064/1203 places, 1044/1183 transitions.
Support contains 19 out of 1064 places after structural reductions.
[2024-06-01 07:16:55] [INFO ] Flatten gal took : 121 ms
[2024-06-01 07:16:55] [INFO ] Flatten gal took : 56 ms
[2024-06-01 07:16:55] [INFO ] Input system was already deterministic with 1044 transitions.
RANDOM walk for 6850 steps (0 resets) in 427 ms. (16 steps per ms) remains 0/12 properties
Computed a total of 240 stabilizing places and 240 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1064 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1063 transition count 942
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 962 transition count 942
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 962 transition count 841
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 861 transition count 841
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 406 place count 859 transition count 839
Iterating global reduction 2 with 2 rules applied. Total rules applied 408 place count 859 transition count 839
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 408 place count 859 transition count 838
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 410 place count 858 transition count 838
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 2 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 2 with 710 rules applied. Total rules applied 1120 place count 503 transition count 483
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1122 place count 501 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1123 place count 500 transition count 481
Applied a total of 1123 rules in 226 ms. Remains 500 /1064 variables (removed 564) and now considering 481/1044 (removed 563) transitions.
// Phase 1: matrix 481 rows 500 cols
[2024-06-01 07:16:56] [INFO ] Computed 180 invariants in 4 ms
[2024-06-01 07:16:56] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-06-01 07:16:56] [INFO ] Invariant cache hit.
[2024-06-01 07:16:56] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
[2024-06-01 07:16:57] [INFO ] Redundant transitions in 99 ms returned [480]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 479 sub problems to find dead transitions.
// Phase 1: matrix 480 rows 500 cols
[2024-06-01 07:16:57] [INFO ] Computed 180 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 5 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 19/259 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 8/267 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 500/980 variables, and 269 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 89/89 constraints]
Escalating to Integer solving :Problem set: 0 solved, 479 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 89/269 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (OVERLAPS) 480/980 variables, 500/770 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/980 variables, 479/1249 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 1263 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 104/104 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60129ms
Starting structural reductions in SI_LTL mode, iteration 1 : 500/1064 places, 480/1044 transitions.
Applied a total of 0 rules in 23 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61368 ms. Remains : 500/1064 places, 480/1044 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-02
Product exploration explored 100000 steps with 95 reset in 680 ms.
Product exploration explored 100000 steps with 94 reset in 638 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 1036 steps (0 resets) in 16 ms. (60 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 1 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 480/480 transitions.
Applied a total of 0 rules in 13 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2024-06-01 07:17:59] [INFO ] Invariant cache hit.
[2024-06-01 07:17:59] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-06-01 07:17:59] [INFO ] Invariant cache hit.
[2024-06-01 07:17:59] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
[2024-06-01 07:17:59] [INFO ] Redundant transitions in 44 ms returned []
Running 479 sub problems to find dead transitions.
[2024-06-01 07:17:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 8/268 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 479 unsolved
SMT process timed out in 30113ms, After SMT, problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 30117ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30840 ms. Remains : 500/500 places, 480/480 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 875 steps (0 resets) in 11 ms. (72 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 95 reset in 510 ms.
Product exploration explored 100000 steps with 96 reset in 599 ms.
Support contains 1 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 480/480 transitions.
Applied a total of 0 rules in 12 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2024-06-01 07:18:31] [INFO ] Invariant cache hit.
[2024-06-01 07:18:31] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-06-01 07:18:31] [INFO ] Invariant cache hit.
[2024-06-01 07:18:31] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
[2024-06-01 07:18:32] [INFO ] Redundant transitions in 75 ms returned []
Running 479 sub problems to find dead transitions.
[2024-06-01 07:18:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 2 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:18:38] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:18:38] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:18:38] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:18:38] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:18:38] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:18:38] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:18:38] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:18:38] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 8/268 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 479 unsolved
SMT process timed out in 30078ms, After SMT, problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 30083ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30772 ms. Remains : 500/500 places, 480/480 transitions.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-02 finished in 126380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1062 transition count 1042
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1062 transition count 1042
Applied a total of 4 rules in 53 ms. Remains 1062 /1064 variables (removed 2) and now considering 1042/1044 (removed 2) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2024-06-01 07:19:02] [INFO ] Computed 181 invariants in 11 ms
[2024-06-01 07:19:02] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-06-01 07:19:02] [INFO ] Invariant cache hit.
[2024-06-01 07:19:03] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
Running 1041 sub problems to find dead transitions.
[2024-06-01 07:19:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:19:33] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:19:33] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:19:33] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
SMT process timed out in 30263ms, After SMT, problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 30272ms
Starting structural reductions in LTL mode, iteration 1 : 1062/1064 places, 1042/1044 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31421 ms. Remains : 1062/1064 places, 1042/1044 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 357 ms.
Product exploration explored 100000 steps with 50000 reset in 269 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-020B-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-04 finished in 32182 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(X(p1)))))'
Support contains 4 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1062 transition count 1042
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1062 transition count 1042
Applied a total of 4 rules in 61 ms. Remains 1062 /1064 variables (removed 2) and now considering 1042/1044 (removed 2) transitions.
[2024-06-01 07:19:34] [INFO ] Invariant cache hit.
[2024-06-01 07:19:34] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-06-01 07:19:34] [INFO ] Invariant cache hit.
[2024-06-01 07:19:35] [INFO ] Implicit Places using invariants and state equation in 771 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
Running 1041 sub problems to find dead transitions.
[2024-06-01 07:19:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-06-01 07:20:05] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:20:05] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:20:05] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
SMT process timed out in 30219ms, After SMT, problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 30229ms
Starting structural reductions in LTL mode, iteration 1 : 1062/1064 places, 1042/1044 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31352 ms. Remains : 1062/1064 places, 1042/1044 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-05
Product exploration explored 100000 steps with 950 reset in 272 ms.
Product exploration explored 100000 steps with 979 reset in 302 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
RANDOM walk for 6035 steps (0 resets) in 42 ms. (140 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
[2024-06-01 07:20:07] [INFO ] Invariant cache hit.
[2024-06-01 07:20:07] [INFO ] [Real]Absence check using 181 positive place invariants in 88 ms returned sat
[2024-06-01 07:20:10] [INFO ] [Real]Absence check using state equation in 2499 ms returned sat
[2024-06-01 07:20:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:20:10] [INFO ] [Nat]Absence check using 181 positive place invariants in 86 ms returned sat
[2024-06-01 07:20:12] [INFO ] [Nat]Absence check using state equation in 1630 ms returned sat
[2024-06-01 07:20:12] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:20:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2024-06-01 07:20:12] [INFO ] Computed and/alt/rep : 1041/2342/1041 causal constraints (skipped 0 transitions) in 66 ms.
[2024-06-01 07:20:25] [INFO ] Added : 570 causal constraints over 114 iterations in 12665 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 4 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Applied a total of 0 rules in 27 ms. Remains 1062 /1062 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
[2024-06-01 07:20:25] [INFO ] Invariant cache hit.
[2024-06-01 07:20:25] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-06-01 07:20:25] [INFO ] Invariant cache hit.
[2024-06-01 07:20:26] [INFO ] Implicit Places using invariants and state equation in 734 ms returned []
Implicit Place search using SMT with State Equation took 1059 ms to find 0 implicit places.
Running 1041 sub problems to find dead transitions.
[2024-06-01 07:20:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-06-01 07:20:55] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:20:55] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:20:55] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:20:55] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:20:56] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:20:56] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1062/2104 variables, and 187 constraints, problems are : Problem set: 0 solved, 1041 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1062 constraints, PredecessorRefiner: 1041/1041 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1041 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1062 variables, 6/187 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-06-01 07:21:12] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 95 places in 171 ms of which 4 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 4 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 69 places in 181 ms of which 4 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 5 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 4 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 51 places in 221 ms of which 4 ms to minimize.
[2024-06-01 07:21:18] [INFO ] Deduced a trap composed of 33 places in 221 ms of which 5 ms to minimize.
[2024-06-01 07:21:18] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 0 ms to minimize.
[2024-06-01 07:21:18] [INFO ] Deduced a trap composed of 28 places in 229 ms of which 5 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 19 places in 219 ms of which 4 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 16 places in 217 ms of which 5 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1062 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:21:26] [INFO ] Deduced a trap composed of 17 places in 346 ms of which 6 ms to minimize.
[2024-06-01 07:21:26] [INFO ] Deduced a trap composed of 16 places in 342 ms of which 7 ms to minimize.
[2024-06-01 07:21:26] [INFO ] Deduced a trap composed of 18 places in 345 ms of which 6 ms to minimize.
SMT process timed out in 60371ms, After SMT, problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 60381ms
Finished structural reductions in LTL mode , in 1 iterations and 61470 ms. Remains : 1062/1062 places, 1042/1042 transitions.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 64 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
RANDOM walk for 6397 steps (0 resets) in 60 ms. (104 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
[2024-06-01 07:21:27] [INFO ] Invariant cache hit.
[2024-06-01 07:21:28] [INFO ] [Real]Absence check using 181 positive place invariants in 88 ms returned sat
[2024-06-01 07:21:30] [INFO ] [Real]Absence check using state equation in 2414 ms returned sat
[2024-06-01 07:21:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:21:31] [INFO ] [Nat]Absence check using 181 positive place invariants in 85 ms returned sat
[2024-06-01 07:21:32] [INFO ] [Nat]Absence check using state equation in 1641 ms returned sat
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2024-06-01 07:21:33] [INFO ] Computed and/alt/rep : 1041/2342/1041 causal constraints (skipped 0 transitions) in 56 ms.
[2024-06-01 07:21:45] [INFO ] Added : 575 causal constraints over 115 iterations in 12686 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 913 reset in 278 ms.
Product exploration explored 100000 steps with 914 reset in 298 ms.
Applying partial POR strategy [false, false, true, false, true, true]
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Support contains 4 out of 1062 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1062 transition count 1042
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 99 place count 1062 transition count 1044
Deduced a syphon composed of 140 places in 1 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 140 place count 1062 transition count 1044
Performed 415 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 555 places in 1 ms
Iterating global reduction 1 with 415 rules applied. Total rules applied 555 place count 1062 transition count 1044
Renaming transitions due to excessive name length > 1024 char.
Discarding 138 places :
Symmetric choice reduction at 1 with 138 rule applications. Total rules 693 place count 924 transition count 906
Deduced a syphon composed of 417 places in 1 ms
Iterating global reduction 1 with 138 rules applied. Total rules applied 831 place count 924 transition count 906
Deduced a syphon composed of 417 places in 1 ms
Applied a total of 831 rules in 282 ms. Remains 924 /1062 variables (removed 138) and now considering 906/1042 (removed 136) transitions.
[2024-06-01 07:21:47] [INFO ] Redundant transitions in 53 ms returned [905]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 904 sub problems to find dead transitions.
// Phase 1: matrix 905 rows 924 cols
[2024-06-01 07:21:47] [INFO ] Computed 181 invariants in 7 ms
[2024-06-01 07:21:47] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/923 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 1 (OVERLAPS) 1/924 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 904 unsolved
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD872 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/924 variables, 20/201 constraints. Problems are: Problem set: 92 solved, 812 unsolved
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
Problem TDEAD90 is UNSAT
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
Problem TDEAD108 is UNSAT
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD736 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/924 variables, 20/221 constraints. Problems are: Problem set: 167 solved, 737 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 924/1829 variables, and 221 constraints, problems are : Problem set: 167 solved, 737 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/924 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 904/904 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 167 solved, 737 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/756 variables, 0/0 constraints. Problems are: Problem set: 167 solved, 737 unsolved
At refinement iteration 1 (OVERLAPS) 168/924 variables, 181/181 constraints. Problems are: Problem set: 167 solved, 737 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/924 variables, 40/221 constraints. Problems are: Problem set: 167 solved, 737 unsolved
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
Problem TDEAD120 is UNSAT
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
Problem TDEAD123 is UNSAT
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
Problem TDEAD126 is UNSAT
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
Problem TDEAD129 is UNSAT
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
Problem TDEAD132 is UNSAT
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD135 is UNSAT
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
Problem TDEAD138 is UNSAT
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
Problem TDEAD141 is UNSAT
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
Problem TDEAD144 is UNSAT
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD147 is UNSAT
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
Problem TDEAD150 is UNSAT
[2024-06-01 07:22:27] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD153 is UNSAT
[2024-06-01 07:22:27] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
Problem TDEAD156 is UNSAT
[2024-06-01 07:22:27] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD159 is UNSAT
[2024-06-01 07:22:27] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
Problem TDEAD162 is UNSAT
[2024-06-01 07:22:27] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD165 is UNSAT
[2024-06-01 07:22:27] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD168 is UNSAT
[2024-06-01 07:22:27] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD171 is UNSAT
[2024-06-01 07:22:27] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD174 is UNSAT
[2024-06-01 07:22:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD899 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/924 variables, 20/241 constraints. Problems are: Problem set: 239 solved, 665 unsolved
[2024-06-01 07:22:29] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
[2024-06-01 07:22:29] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD181 is UNSAT
[2024-06-01 07:22:29] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
Problem TDEAD182 is UNSAT
[2024-06-01 07:22:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD183 is UNSAT
[2024-06-01 07:22:29] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
Problem TDEAD184 is UNSAT
[2024-06-01 07:22:29] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
[2024-06-01 07:22:29] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD188 is UNSAT
[2024-06-01 07:22:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD189 is UNSAT
[2024-06-01 07:22:30] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD190 is UNSAT
[2024-06-01 07:22:30] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
[2024-06-01 07:22:30] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
Problem TDEAD194 is UNSAT
[2024-06-01 07:22:30] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
Problem TDEAD195 is UNSAT
[2024-06-01 07:22:30] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
Problem TDEAD196 is UNSAT
[2024-06-01 07:22:30] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
[2024-06-01 07:22:30] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
Problem TDEAD200 is UNSAT
[2024-06-01 07:22:30] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD201 is UNSAT
[2024-06-01 07:22:30] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD202 is UNSAT
[2024-06-01 07:22:30] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
[2024-06-01 07:22:30] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD206 is UNSAT
[2024-06-01 07:22:30] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/924 variables, 20/261 constraints. Problems are: Problem set: 279 solved, 625 unsolved
[2024-06-01 07:22:32] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
Problem TDEAD208 is UNSAT
[2024-06-01 07:22:32] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
[2024-06-01 07:22:32] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
Problem TDEAD212 is UNSAT
[2024-06-01 07:22:32] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
Problem TDEAD213 is UNSAT
[2024-06-01 07:22:32] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
[2024-06-01 07:22:32] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
Problem TDEAD217 is UNSAT
[2024-06-01 07:22:32] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
Problem TDEAD218 is UNSAT
[2024-06-01 07:22:32] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Problem TDEAD219 is UNSAT
[2024-06-01 07:22:32] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
Problem TDEAD220 is UNSAT
[2024-06-01 07:22:32] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
Problem TDEAD224 is UNSAT
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
Problem TDEAD225 is UNSAT
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
Problem TDEAD229 is UNSAT
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
Problem TDEAD230 is UNSAT
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
Problem TDEAD231 is UNSAT
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
Problem TDEAD232 is UNSAT
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD239 is UNSAT
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/924 variables, 20/281 constraints. Problems are: Problem set: 319 solved, 585 unsolved
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD244 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD245 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD246 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD250 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD251 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD252 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD253 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Problem TDEAD258 is UNSAT
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD262 is UNSAT
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
Problem TDEAD263 is UNSAT
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
Problem TDEAD264 is UNSAT
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
Problem TDEAD265 is UNSAT
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
Problem TDEAD269 is UNSAT
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
Problem TDEAD270 is UNSAT
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/924 variables, 20/301 constraints. Problems are: Problem set: 361 solved, 543 unsolved
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
Problem TDEAD274 is UNSAT
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
Problem TDEAD275 is UNSAT
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
Problem TDEAD276 is UNSAT
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
Problem TDEAD277 is UNSAT
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
Problem TDEAD281 is UNSAT
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
Problem TDEAD282 is UNSAT
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
Problem TDEAD286 is UNSAT
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
Problem TDEAD287 is UNSAT
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
Problem TDEAD288 is UNSAT
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
Problem TDEAD292 is UNSAT
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 2 ms to minimize.
Problem TDEAD293 is UNSAT
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
Problem TDEAD294 is UNSAT
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
Problem TDEAD298 is UNSAT
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
Problem TDEAD299 is UNSAT
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
Problem TDEAD300 is UNSAT
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD901 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/924 variables, 20/321 constraints. Problems are: Problem set: 399 solved, 505 unsolved
[2024-06-01 07:22:42] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD369 is UNSAT
[2024-06-01 07:22:43] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD396 is UNSAT
[2024-06-01 07:22:43] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
Problem TDEAD423 is UNSAT
[2024-06-01 07:22:43] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD450 is UNSAT
[2024-06-01 07:22:43] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
Problem TDEAD476 is UNSAT
[2024-06-01 07:22:44] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:22:44] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:22:44] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD504 is UNSAT
[2024-06-01 07:22:44] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:22:44] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:22:44] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
Problem TDEAD531 is UNSAT
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD557 is UNSAT
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD584 is UNSAT
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
Problem TDEAD611 is UNSAT
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD636 is UNSAT
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD663 is UNSAT
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD690 is UNSAT
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD717 is UNSAT
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD744 is UNSAT
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD369 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD771 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/924 variables, 20/341 constraints. Problems are: Problem set: 415 solved, 489 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 924/1829 variables, and 341 constraints, problems are : Problem set: 415 solved, 489 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/924 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/904 constraints, Known Traps: 160/160 constraints]
After SMT, in 60272ms problems are : Problem set: 415 solved, 489 unsolved
Search for dead transitions found 415 dead transitions in 60280ms
Found 415 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 415 transitions
Dead transitions reduction (with SMT) removed 415 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 924/1062 places, 490/1042 transitions.
Graph (complete) has 1772 edges and 924 vertex of which 511 are kept as prefixes of interest. Removing 413 places using SCC suffix rule.3 ms
Discarding 413 places :
Also discarding 0 output transitions
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 1 rules in 17 ms. Remains 511 /924 variables (removed 413) and now considering 490/490 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 511/1062 places, 490/1042 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60645 ms. Remains : 511/1062 places, 490/1042 transitions.
Support contains 4 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Applied a total of 0 rules in 25 ms. Remains 1062 /1062 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2024-06-01 07:22:47] [INFO ] Computed 181 invariants in 4 ms
[2024-06-01 07:22:47] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-06-01 07:22:47] [INFO ] Invariant cache hit.
[2024-06-01 07:22:48] [INFO ] Implicit Places using invariants and state equation in 798 ms returned []
Implicit Place search using SMT with State Equation took 1088 ms to find 0 implicit places.
Running 1041 sub problems to find dead transitions.
[2024-06-01 07:22:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-06-01 07:23:16] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:23:17] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:23:17] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:23:17] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:23:18] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:23:18] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:23:18] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1062/2104 variables, and 188 constraints, problems are : Problem set: 0 solved, 1041 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1062 constraints, PredecessorRefiner: 1041/1041 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1041 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1062 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:23:37] [INFO ] Deduced a trap composed of 95 places in 170 ms of which 4 ms to minimize.
[2024-06-01 07:23:37] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 4 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 69 places in 183 ms of which 4 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 4 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 5 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 51 places in 223 ms of which 4 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 33 places in 232 ms of which 5 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 4 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1062 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-06-01 07:23:44] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 4 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 5 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 5 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 5 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 23 places in 356 ms of which 7 ms to minimize.
SMT process timed out in 60499ms, After SMT, problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 60509ms
Finished structural reductions in LTL mode , in 1 iterations and 61625 ms. Remains : 1062/1062 places, 1042/1042 transitions.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-05 finished in 254746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1062 transition count 1042
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1062 transition count 1042
Applied a total of 4 rules in 55 ms. Remains 1062 /1064 variables (removed 2) and now considering 1042/1044 (removed 2) transitions.
[2024-06-01 07:23:49] [INFO ] Invariant cache hit.
[2024-06-01 07:23:49] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-06-01 07:23:49] [INFO ] Invariant cache hit.
[2024-06-01 07:23:50] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1098 ms to find 0 implicit places.
Running 1041 sub problems to find dead transitions.
[2024-06-01 07:23:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-06-01 07:24:19] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:24:19] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:24:19] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:24:19] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:24:20] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:24:20] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1062/2104 variables, and 187 constraints, problems are : Problem set: 0 solved, 1041 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1062 constraints, PredecessorRefiner: 1041/1041 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1041 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1062 variables, 6/187 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-06-01 07:24:36] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:24:36] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:24:37] [INFO ] Deduced a trap composed of 57 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:24:37] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:24:37] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:24:38] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:24:38] [INFO ] Deduced a trap composed of 95 places in 162 ms of which 4 ms to minimize.
[2024-06-01 07:24:39] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:24:39] [INFO ] Deduced a trap composed of 69 places in 189 ms of which 4 ms to minimize.
[2024-06-01 07:24:40] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 4 ms to minimize.
[2024-06-01 07:24:40] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 4 ms to minimize.
[2024-06-01 07:24:41] [INFO ] Deduced a trap composed of 51 places in 224 ms of which 5 ms to minimize.
[2024-06-01 07:24:42] [INFO ] Deduced a trap composed of 33 places in 225 ms of which 4 ms to minimize.
[2024-06-01 07:24:42] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:24:42] [INFO ] Deduced a trap composed of 28 places in 242 ms of which 5 ms to minimize.
[2024-06-01 07:24:42] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 5 ms to minimize.
[2024-06-01 07:24:43] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 5 ms to minimize.
[2024-06-01 07:24:43] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:24:43] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:24:43] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1062 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-06-01 07:24:49] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2024-06-01 07:24:49] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2024-06-01 07:24:49] [INFO ] Deduced a trap composed of 17 places in 349 ms of which 7 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 16 places in 341 ms of which 6 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 18 places in 328 ms of which 6 ms to minimize.
SMT process timed out in 60313ms, After SMT, problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 60322ms
Starting structural reductions in LTL mode, iteration 1 : 1062/1064 places, 1042/1044 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61478 ms. Remains : 1062/1064 places, 1042/1044 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 437 steps with 0 reset in 4 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-06 finished in 61571 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Applied a total of 0 rules in 24 ms. Remains 1064 /1064 variables (removed 0) and now considering 1044/1044 (removed 0) transitions.
// Phase 1: matrix 1044 rows 1064 cols
[2024-06-01 07:24:50] [INFO ] Computed 181 invariants in 6 ms
[2024-06-01 07:24:51] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-06-01 07:24:51] [INFO ] Invariant cache hit.
[2024-06-01 07:24:51] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
Running 1043 sub problems to find dead transitions.
[2024-06-01 07:24:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1063 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
At refinement iteration 1 (OVERLAPS) 1/1064 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
[2024-06-01 07:25:21] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:25:21] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1064/2108 variables, and 183 constraints, problems are : Problem set: 0 solved, 1043 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1064 constraints, PredecessorRefiner: 1043/1043 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1043 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1063 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
At refinement iteration 1 (OVERLAPS) 1/1064 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1064 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
[2024-06-01 07:25:37] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:25:37] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:25:37] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 48 places in 155 ms of which 4 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 4 ms to minimize.
[2024-06-01 07:25:41] [INFO ] Deduced a trap composed of 51 places in 186 ms of which 3 ms to minimize.
[2024-06-01 07:25:41] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 4 ms to minimize.
[2024-06-01 07:25:42] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 4 ms to minimize.
[2024-06-01 07:25:43] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 4 ms to minimize.
[2024-06-01 07:25:43] [INFO ] Deduced a trap composed of 34 places in 211 ms of which 4 ms to minimize.
[2024-06-01 07:25:44] [INFO ] Deduced a trap composed of 47 places in 227 ms of which 5 ms to minimize.
[2024-06-01 07:25:44] [INFO ] Deduced a trap composed of 17 places in 233 ms of which 5 ms to minimize.
[2024-06-01 07:25:44] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:25:44] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1064 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
[2024-06-01 07:25:48] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:25:51] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2024-06-01 07:25:52] [INFO ] Deduced a trap composed of 21 places in 369 ms of which 7 ms to minimize.
SMT process timed out in 60306ms, After SMT, problems are : Problem set: 0 solved, 1043 unsolved
Search for dead transitions found 0 dead transitions in 60321ms
Finished structural reductions in LTL mode , in 1 iterations and 61440 ms. Remains : 1064/1064 places, 1044/1044 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-07 finished in 61538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(F(p1)))))'
Support contains 4 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1062 transition count 1042
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1062 transition count 1042
Applied a total of 4 rules in 46 ms. Remains 1062 /1064 variables (removed 2) and now considering 1042/1044 (removed 2) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2024-06-01 07:25:52] [INFO ] Computed 181 invariants in 7 ms
[2024-06-01 07:25:52] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-06-01 07:25:52] [INFO ] Invariant cache hit.
[2024-06-01 07:25:53] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1077 ms to find 0 implicit places.
Running 1041 sub problems to find dead transitions.
[2024-06-01 07:25:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-06-01 07:26:21] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:26:22] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:26:22] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:26:22] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:26:22] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:26:23] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:26:23] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 2 ms to minimize.
SMT process timed out in 30241ms, After SMT, problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 30252ms
Starting structural reductions in LTL mode, iteration 1 : 1062/1064 places, 1042/1044 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31378 ms. Remains : 1062/1064 places, 1042/1044 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-08
Product exploration explored 100000 steps with 33333 reset in 214 ms.
Product exploration explored 100000 steps with 33333 reset in 225 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-020B-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-08 finished in 31991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (p1&&F(p2))))'
Support contains 4 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1062 transition count 1042
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1062 transition count 1042
Applied a total of 4 rules in 42 ms. Remains 1062 /1064 variables (removed 2) and now considering 1042/1044 (removed 2) transitions.
[2024-06-01 07:26:24] [INFO ] Invariant cache hit.
[2024-06-01 07:26:24] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-06-01 07:26:24] [INFO ] Invariant cache hit.
[2024-06-01 07:26:25] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
Running 1041 sub problems to find dead transitions.
[2024-06-01 07:26:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1062/2104 variables, and 186 constraints, problems are : Problem set: 0 solved, 1041 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1062 constraints, PredecessorRefiner: 1041/1041 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1041 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1062 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-06-01 07:27:11] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:27:12] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:27:12] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:27:12] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:27:13] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:27:13] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:27:13] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:27:14] [INFO ] Deduced a trap composed of 95 places in 160 ms of which 4 ms to minimize.
[2024-06-01 07:27:14] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 4 ms to minimize.
[2024-06-01 07:27:15] [INFO ] Deduced a trap composed of 69 places in 179 ms of which 4 ms to minimize.
[2024-06-01 07:27:15] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 4 ms to minimize.
[2024-06-01 07:27:16] [INFO ] Deduced a trap composed of 34 places in 211 ms of which 4 ms to minimize.
[2024-06-01 07:27:17] [INFO ] Deduced a trap composed of 51 places in 223 ms of which 4 ms to minimize.
[2024-06-01 07:27:17] [INFO ] Deduced a trap composed of 33 places in 230 ms of which 4 ms to minimize.
[2024-06-01 07:27:18] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 5 ms to minimize.
[2024-06-01 07:27:18] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:27:18] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:27:18] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:27:18] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:27:18] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1062 variables, 20/206 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-06-01 07:27:19] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 0 ms to minimize.
[2024-06-01 07:27:24] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 5 ms to minimize.
[2024-06-01 07:27:25] [INFO ] Deduced a trap composed of 16 places in 224 ms of which 5 ms to minimize.
[2024-06-01 07:27:25] [INFO ] Deduced a trap composed of 17 places in 355 ms of which 7 ms to minimize.
SMT process timed out in 60364ms, After SMT, problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 60375ms
Starting structural reductions in LTL mode, iteration 1 : 1062/1064 places, 1042/1044 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61525 ms. Remains : 1062/1064 places, 1042/1044 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-11
Product exploration explored 100000 steps with 11613 reset in 149 ms.
Product exploration explored 100000 steps with 11666 reset in 154 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/1062 stabilizing places and 239/1042 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X p0), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p2) p0)), (X p1), (X (X p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p2) p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 148 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p2) p0), (X p0), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p2) p0)), (X p1), (X (X p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p2) p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 12 factoid took 247 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p2), (NOT p2)]
[2024-06-01 07:27:26] [INFO ] Invariant cache hit.
[2024-06-01 07:27:27] [INFO ] [Real]Absence check using 181 positive place invariants in 79 ms returned sat
[2024-06-01 07:27:30] [INFO ] [Real]Absence check using state equation in 2760 ms returned sat
[2024-06-01 07:27:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:27:30] [INFO ] [Nat]Absence check using 181 positive place invariants in 53 ms returned sat
[2024-06-01 07:27:31] [INFO ] [Nat]Absence check using state equation in 1104 ms returned sat
[2024-06-01 07:27:31] [INFO ] Computed and/alt/rep : 1041/2342/1041 causal constraints (skipped 0 transitions) in 48 ms.
[2024-06-01 07:27:40] [INFO ] Added : 419 causal constraints over 85 iterations in 8536 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 1062 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1061 transition count 942
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 962 transition count 942
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 198 place count 962 transition count 841
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 400 place count 861 transition count 841
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 1 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 2 with 710 rules applied. Total rules applied 1110 place count 506 transition count 486
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1112 place count 504 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1113 place count 503 transition count 484
Applied a total of 1113 rules in 80 ms. Remains 503 /1062 variables (removed 559) and now considering 484/1042 (removed 558) transitions.
// Phase 1: matrix 484 rows 503 cols
[2024-06-01 07:27:40] [INFO ] Computed 180 invariants in 2 ms
[2024-06-01 07:27:40] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-06-01 07:27:40] [INFO ] Invariant cache hit.
[2024-06-01 07:27:40] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2024-06-01 07:27:40] [INFO ] Redundant transitions in 45 ms returned [483]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 481 sub problems to find dead transitions.
// Phase 1: matrix 483 rows 503 cols
[2024-06-01 07:27:40] [INFO ] Computed 180 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-06-01 07:27:44] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:27:44] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:27:45] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:27:48] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (OVERLAPS) 1/503 variables, 163/184 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-06-01 07:27:55] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:27:55] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:27:55] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:27:55] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:27:55] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:27:55] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:27:55] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:27:55] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:27:55] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:28:08] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:28:08] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:28:08] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:28:08] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:28:08] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:28:09] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:28:09] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:28:09] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:28:09] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:28:09] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:28:09] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:28:10] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:28:10] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:28:10] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:28:10] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:28:10] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 18/262 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-06-01 07:28:10] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:28:10] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 503/986 variables, and 264 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/503 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 84/84 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (OVERLAPS) 1/503 variables, 163/190 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 74/264 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-06-01 07:28:15] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:28:15] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:28:15] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:28:15] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:28:15] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:28:15] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:28:15] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:28:15] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:28:15] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:28:16] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:28:16] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:28:16] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:28:16] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:28:16] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-06-01 07:28:21] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:28:21] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (OVERLAPS) 483/986 variables, 503/783 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/986 variables, 481/1264 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 986/986 variables, and 1264 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 100/100 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in SI_LTL mode, iteration 1 : 503/1062 places, 483/1042 transitions.
Applied a total of 0 rules in 11 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60865 ms. Remains : 503/1062 places, 483/1042 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/503 stabilizing places and 2/483 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 199 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p2), (NOT p2)]
[2024-06-01 07:28:41] [INFO ] Invariant cache hit.
[2024-06-01 07:28:41] [INFO ] [Real]Absence check using 180 positive place invariants in 58 ms returned sat
[2024-06-01 07:28:42] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2024-06-01 07:28:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:28:42] [INFO ] [Nat]Absence check using 180 positive place invariants in 33 ms returned sat
[2024-06-01 07:28:42] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2024-06-01 07:28:42] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:28:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2024-06-01 07:28:43] [INFO ] Computed and/alt/rep : 446/1486/446 causal constraints (skipped 35 transitions) in 26 ms.
[2024-06-01 07:28:43] [INFO ] Added : 110 causal constraints over 24 iterations in 935 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 72 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 27488 reset in 158 ms.
Product exploration explored 100000 steps with 27622 reset in 188 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 503 transition count 481
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 501 transition count 481
Applied a total of 4 rules in 19 ms. Remains 501 /503 variables (removed 2) and now considering 481/483 (removed 2) transitions.
// Phase 1: matrix 481 rows 501 cols
[2024-06-01 07:28:44] [INFO ] Computed 180 invariants in 4 ms
[2024-06-01 07:28:44] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-06-01 07:28:44] [INFO ] Invariant cache hit.
[2024-06-01 07:28:45] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
[2024-06-01 07:28:45] [INFO ] Redundant transitions in 45 ms returned []
Running 479 sub problems to find dead transitions.
[2024-06-01 07:28:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:28:49] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 11 places in 15 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (OVERLAPS) 1/501 variables, 163/184 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:29:01] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:29:01] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:29:01] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:29:01] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:29:01] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:29:01] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2024-06-01 07:29:01] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:29:01] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:29:01] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:29:02] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:29:02] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:29:02] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:29:02] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:29:02] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:29:02] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:29:02] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 2 ms to minimize.
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 6 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 1.0)
(s122 0.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 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 1.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 timeout
1.0)
(s346 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/982 variables, and 267 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 87/87 constraints]
Escalating to Integer solving :Problem set: 0 solved, 479 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (OVERLAPS) 1/501 variables, 163/194 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 73/267 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:29:20] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:29:23] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:29:23] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:29:23] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:29:23] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:29:23] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 12/279 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:29:24] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:29:24] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:29:24] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:29:24] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:29:25] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 5/284 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 8 (OVERLAPS) 481/982 variables, 501/785 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/982 variables, 479/1264 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 982/982 variables, and 1264 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 104/104 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Starting structural reductions in SI_LTL mode, iteration 1 : 501/503 places, 481/483 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60802 ms. Remains : 501/503 places, 481/483 transitions.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-11 finished in 200960 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1064 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1063 transition count 943
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 963 transition count 943
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 200 place count 963 transition count 841
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 404 place count 861 transition count 841
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 406 place count 859 transition count 839
Iterating global reduction 2 with 2 rules applied. Total rules applied 408 place count 859 transition count 839
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 408 place count 859 transition count 838
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 410 place count 858 transition count 838
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 0 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 2 with 710 rules applied. Total rules applied 1120 place count 503 transition count 483
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1122 place count 501 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1123 place count 500 transition count 481
Applied a total of 1123 rules in 89 ms. Remains 500 /1064 variables (removed 564) and now considering 481/1044 (removed 563) transitions.
// Phase 1: matrix 481 rows 500 cols
[2024-06-01 07:29:45] [INFO ] Computed 180 invariants in 1 ms
[2024-06-01 07:29:45] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-06-01 07:29:45] [INFO ] Invariant cache hit.
[2024-06-01 07:29:45] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
[2024-06-01 07:29:46] [INFO ] Redundant transitions in 44 ms returned [480]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 478 sub problems to find dead transitions.
// Phase 1: matrix 480 rows 500 cols
[2024-06-01 07:29:46] [INFO ] Computed 180 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 177/177 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:29:49] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:29:49] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:29:49] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:29:49] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:29:49] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:29:52] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:29:52] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:29:52] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:29:52] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:29:52] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:29:52] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:29:52] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:29:52] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:29:53] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:29:53] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:29:53] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:29:53] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:29:53] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:29:53] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:29:53] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:29:53] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:29:54] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:29:54] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:29:54] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:29:54] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:29:54] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:29:55] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:29:55] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:29:55] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:29:56] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:29:59] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:29:59] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:30:00] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:30:00] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:30:00] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:30:00] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:30:00] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:30:00] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:30:00] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:30:00] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:30:01] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:30:03] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:30:03] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:30:03] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:30:03] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:30:03] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:30:04] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:30:07] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:30:07] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:30:07] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:30:07] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:30:08] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 6/263 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:30:08] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:30:08] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:30:09] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:30:09] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 499/980 variables, and 267 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 177/180 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 90/90 constraints]
Escalating to Integer solving :Problem set: 0 solved, 478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 177/177 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 90/267 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (OVERLAPS) 1/500 variables, 3/270 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:30:20] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:30:21] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:30:24] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 7 (OVERLAPS) 480/980 variables, 500/774 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/980 variables, 478/1252 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:30:38] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:30:38] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:30:39] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:30:40] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:30:40] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:30:40] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:30:40] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:30:41] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:30:41] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:30:42] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:30:42] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:30:42] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:30:43] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:30:43] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:30:43] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:30:45] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 1268 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 110/110 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Starting structural reductions in SI_LTL mode, iteration 1 : 500/1064 places, 480/1044 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60949 ms. Remains : 500/1064 places, 480/1044 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-14
Product exploration explored 100000 steps with 3492 reset in 441 ms.
Product exploration explored 100000 steps with 3423 reset in 508 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 164 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2024-06-01 07:30:47] [INFO ] Invariant cache hit.
[2024-06-01 07:30:48] [INFO ] [Real]Absence check using 180 positive place invariants in 46 ms returned sat
[2024-06-01 07:30:48] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2024-06-01 07:30:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:30:48] [INFO ] [Nat]Absence check using 180 positive place invariants in 51 ms returned sat
[2024-06-01 07:30:49] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2024-06-01 07:30:49] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:30:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-06-01 07:30:49] [INFO ] Computed and/alt/rep : 478/1191/478 causal constraints (skipped 0 transitions) in 22 ms.
[2024-06-01 07:30:55] [INFO ] Added : 478 causal constraints over 96 iterations in 6630 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 480/480 transitions.
Applied a total of 0 rules in 20 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2024-06-01 07:30:55] [INFO ] Invariant cache hit.
[2024-06-01 07:30:56] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-06-01 07:30:56] [INFO ] Invariant cache hit.
[2024-06-01 07:30:56] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2024-06-01 07:30:56] [INFO ] Redundant transitions in 53 ms returned []
Running 478 sub problems to find dead transitions.
[2024-06-01 07:30:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 177/177 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:31:00] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:31:00] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:31:00] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:31:00] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:31:00] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:31:00] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:31:00] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:31:00] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:31:00] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:31:00] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:31:00] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:31:00] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:31:01] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:31:01] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:31:01] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:31:01] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:31:01] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:31:01] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:31:01] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:31:01] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:31:01] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:31:01] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:31:01] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:31:01] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:31:01] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:31:01] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:31:01] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:31:01] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:31:02] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:31:02] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:31:02] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:31:02] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:31:02] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:31:02] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:31:02] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:31:02] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:31:02] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:31:02] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:31:02] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:31:02] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:31:04] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:31:04] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:31:04] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:31:04] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:31:04] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:31:04] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:31:04] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:31:05] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:31:05] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:31:05] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:31:05] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:31:06] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:31:06] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:31:06] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:31:06] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:31:10] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:31:10] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:31:10] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:31:12] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:31:12] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:31:12] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:31:12] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:31:13] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:31:13] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:31:13] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:31:13] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:31:13] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:31:13] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:31:14] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:31:14] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:31:14] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:31:14] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:31:14] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 18/255 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:31:15] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:31:15] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:31:15] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:31:15] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:31:15] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:31:20] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 499/980 variables, and 262 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 177/180 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 177/177 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 85/262 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (OVERLAPS) 1/500 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:31:31] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:31:32] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:31:32] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:31:34] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 6 (OVERLAPS) 480/980 variables, 500/769 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/980 variables, 478/1247 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:31:47] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:31:50] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:31:51] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:31:51] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:31:53] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 1252 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 94/94 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60751 ms. Remains : 500/500 places, 480/480 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 6 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 209 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
[2024-06-01 07:31:57] [INFO ] Invariant cache hit.
[2024-06-01 07:31:57] [INFO ] [Real]Absence check using 180 positive place invariants in 46 ms returned sat
[2024-06-01 07:31:58] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2024-06-01 07:31:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:31:58] [INFO ] [Nat]Absence check using 180 positive place invariants in 45 ms returned sat
[2024-06-01 07:31:58] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2024-06-01 07:31:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:31:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-06-01 07:31:58] [INFO ] Computed and/alt/rep : 478/1191/478 causal constraints (skipped 0 transitions) in 23 ms.
[2024-06-01 07:32:05] [INFO ] Added : 478 causal constraints over 96 iterations in 6670 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3239 reset in 440 ms.
Product exploration explored 100000 steps with 3348 reset in 525 ms.
Support contains 1 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 480/480 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2024-06-01 07:32:06] [INFO ] Invariant cache hit.
[2024-06-01 07:32:06] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-06-01 07:32:06] [INFO ] Invariant cache hit.
[2024-06-01 07:32:07] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
[2024-06-01 07:32:07] [INFO ] Redundant transitions in 43 ms returned []
Running 478 sub problems to find dead transitions.
[2024-06-01 07:32:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 177/177 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:32:11] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:32:11] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:32:11] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:32:11] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:32:11] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:32:11] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:32:11] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:32:11] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:32:11] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:32:11] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:32:11] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:32:13] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:32:13] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:32:13] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:32:13] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:32:13] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:32:13] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:32:13] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:32:13] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:32:13] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:32:13] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:32:14] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:32:14] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:32:14] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:32:14] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:32:14] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:32:14] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:32:15] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:32:15] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:32:15] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:32:15] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:32:15] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:32:15] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:32:15] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:32:16] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:32:16] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:32:16] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:32:16] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:32:16] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:32:17] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:32:17] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:32:17] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:32:18] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:32:21] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:32:21] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:32:22] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:32:23] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:32:24] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:32:24] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:32:24] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:32:24] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:32:24] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:32:24] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:32:25] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:32:25] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:32:25] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:32:25] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:32:25] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:32:25] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:32:26] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:32:26] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 18/255 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:32:26] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:32:26] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:32:26] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:32:27] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:32:27] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:32:27] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:32:31] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 499/980 variables, and 262 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 177/180 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 177/177 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 85/262 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (OVERLAPS) 1/500 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:32:41] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:32:42] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:32:43] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:32:45] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 6 (OVERLAPS) 480/980 variables, 500/769 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/980 variables, 478/1247 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:32:58] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:33:02] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:33:03] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:33:03] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:33:04] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 1252 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 94/94 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60845 ms. Remains : 500/500 places, 480/480 transitions.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-14 finished in 202246 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(X(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (p1&&F(p2))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-020B-LTLCardinality-11
Stuttering acceptance computed with spot in 119 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2)]
Support contains 4 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1063 transition count 944
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 964 transition count 944
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 198 place count 964 transition count 843
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 400 place count 863 transition count 843
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 402 place count 861 transition count 841
Iterating global reduction 2 with 2 rules applied. Total rules applied 404 place count 861 transition count 841
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 404 place count 861 transition count 840
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 406 place count 860 transition count 840
Performed 354 Post agglomeration using F-continuation condition.Transition count delta: 354
Deduced a syphon composed of 354 places in 0 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 2 with 708 rules applied. Total rules applied 1114 place count 506 transition count 486
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1116 place count 504 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1117 place count 503 transition count 484
Applied a total of 1117 rules in 92 ms. Remains 503 /1064 variables (removed 561) and now considering 484/1044 (removed 560) transitions.
// Phase 1: matrix 484 rows 503 cols
[2024-06-01 07:33:07] [INFO ] Computed 180 invariants in 5 ms
[2024-06-01 07:33:08] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-06-01 07:33:08] [INFO ] Invariant cache hit.
[2024-06-01 07:33:08] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
Running 482 sub problems to find dead transitions.
[2024-06-01 07:33:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-06-01 07:33:12] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:33:12] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:33:12] [INFO ] Deduced a trap composed of 9 places in 14 ms of which 1 ms to minimize.
[2024-06-01 07:33:13] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:33:15] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:33:15] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (OVERLAPS) 1/503 variables, 163/186 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-06-01 07:33:22] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:33:22] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:33:23] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:33:23] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:33:23] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:33:23] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:33:23] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:33:23] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:33:23] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:33:23] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:33:23] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:33:23] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:33:23] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:33:23] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:33:23] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:33:23] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:33:24] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:33:24] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:33:24] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:33:24] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/206 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-06-01 07:33:24] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:33:24] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:33:24] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:33:24] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:33:24] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:33:24] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:33:24] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:33:24] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:33:24] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:33:24] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:33:24] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:33:25] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:33:25] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:33:25] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:33:25] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:33:25] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:33:25] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:33:25] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:33:25] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:33:25] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 20/226 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-06-01 07:33:25] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:33:25] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:33:25] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:33:26] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:33:26] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:33:26] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:33:26] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:33:27] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:33:27] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:33:27] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:33:27] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:33:27] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:33:27] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:33:27] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:33:27] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:33:28] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:33:28] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:33:28] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:33:28] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:33:28] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 20/246 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-06-01 07:33:32] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:33:32] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:33:33] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:33:33] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:33:33] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:33:33] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:33:34] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:33:36] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:33:36] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:33:36] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:33:36] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:33:37] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:33:37] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:33:37] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 20/266 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-06-01 07:33:37] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:33:37] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:33:37] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:33:37] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:33:38] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:33:38] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:33:38] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:33:38] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:33:38] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:33:38] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 503/987 variables, and 276 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/503 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 96/96 constraints]
Escalating to Integer solving :Problem set: 0 solved, 482 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (OVERLAPS) 1/503 variables, 163/194 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 82/276 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-06-01 07:33:42] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:33:42] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:33:43] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:33:43] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:33:43] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:33:43] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 6/282 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-06-01 07:33:47] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:33:47] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:33:47] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:33:47] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:33:47] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:33:47] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:33:47] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:33:48] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 8/290 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-06-01 07:33:51] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:33:52] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:33:52] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:33:52] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:33:56] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 5/295 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 9 (OVERLAPS) 484/987 variables, 503/798 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/987 variables, 482/1280 constraints. Problems are: Problem set: 0 solved, 482 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 987/987 variables, and 1280 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 115/115 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Starting structural reductions in LI_LTL mode, iteration 1 : 503/1064 places, 484/1044 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 60843 ms. Remains : 503/1064 places, 484/1044 transitions.
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-11
Product exploration explored 100000 steps with 27586 reset in 169 ms.
Product exploration explored 100000 steps with 27790 reset in 172 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/503 stabilizing places and 2/484 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 378 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 7 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p2) p0), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (F p2)]
Knowledge based reduction with 8 factoid took 418 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p2), (NOT p2)]
[2024-06-01 07:34:10] [INFO ] Invariant cache hit.
[2024-06-01 07:34:10] [INFO ] [Real]Absence check using 180 positive place invariants in 48 ms returned sat
[2024-06-01 07:34:10] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2024-06-01 07:34:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:34:11] [INFO ] [Nat]Absence check using 180 positive place invariants in 49 ms returned sat
[2024-06-01 07:34:11] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2024-06-01 07:34:11] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:34:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2024-06-01 07:34:11] [INFO ] Computed and/alt/rep : 447/1491/447 causal constraints (skipped 35 transitions) in 25 ms.
[2024-06-01 07:34:12] [INFO ] Added : 110 causal constraints over 22 iterations in 912 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 503 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 484/484 transitions.
Applied a total of 0 rules in 11 ms. Remains 503 /503 variables (removed 0) and now considering 484/484 (removed 0) transitions.
[2024-06-01 07:34:12] [INFO ] Invariant cache hit.
[2024-06-01 07:34:12] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-06-01 07:34:12] [INFO ] Invariant cache hit.
[2024-06-01 07:34:12] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2024-06-01 07:34:13] [INFO ] Redundant transitions in 46 ms returned [483]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 481 sub problems to find dead transitions.
// Phase 1: matrix 483 rows 503 cols
[2024-06-01 07:34:13] [INFO ] Computed 180 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-06-01 07:34:16] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:34:16] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:34:17] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (OVERLAPS) 1/503 variables, 163/184 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-06-01 07:34:27] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:34:27] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:34:27] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:34:27] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:34:27] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:34:27] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:34:27] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:34:27] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:34:28] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:34:28] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:34:28] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:34:28] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:34:28] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:34:28] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:34:28] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:34:28] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:34:28] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:34:28] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:34:28] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:34:28] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-06-01 07:34:28] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:34:28] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:34:28] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:34:28] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:34:28] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:34:29] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:34:29] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:34:29] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:34:29] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:34:29] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:34:29] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:34:29] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:34:29] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:34:29] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:34:29] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:34:30] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:34:30] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:34:30] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:34:30] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:34:30] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-06-01 07:34:30] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:34:31] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:34:31] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:34:31] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:34:31] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:34:31] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:34:31] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:34:31] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:34:31] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:34:32] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:34:32] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:34:32] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:34:32] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:34:32] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:34:32] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:34:33] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:34:33] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:34:34] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:34:34] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:34:34] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-06-01 07:34:38] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:34:38] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:34:40] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:34:40] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:34:40] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:34:41] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:34:41] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:34:41] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:34:41] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:34:41] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:34:41] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:34:42] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:34:42] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:34:42] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:34:42] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:34:42] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:34:42] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:34:42] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 18/262 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-06-01 07:34:43] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
SMT process timed out in 30122ms, After SMT, problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 30126ms
Starting structural reductions in SI_LTL mode, iteration 1 : 503/503 places, 483/484 transitions.
Applied a total of 0 rules in 10 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30797 ms. Remains : 503/503 places, 483/484 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/503 stabilizing places and 2/483 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 21 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p2), (NOT p2)]
[2024-06-01 07:34:43] [INFO ] Invariant cache hit.
[2024-06-01 07:34:44] [INFO ] [Real]Absence check using 180 positive place invariants in 61 ms returned sat
[2024-06-01 07:34:44] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2024-06-01 07:34:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:34:44] [INFO ] [Nat]Absence check using 180 positive place invariants in 34 ms returned sat
[2024-06-01 07:34:44] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2024-06-01 07:34:45] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:34:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2024-06-01 07:34:45] [INFO ] Computed and/alt/rep : 446/1486/446 causal constraints (skipped 35 transitions) in 26 ms.
[2024-06-01 07:34:46] [INFO ] Added : 110 causal constraints over 24 iterations in 983 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 178 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 27607 reset in 171 ms.
Product exploration explored 100000 steps with 27377 reset in 171 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 503 transition count 481
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 501 transition count 481
Applied a total of 4 rules in 10 ms. Remains 501 /503 variables (removed 2) and now considering 481/483 (removed 2) transitions.
// Phase 1: matrix 481 rows 501 cols
[2024-06-01 07:34:46] [INFO ] Computed 180 invariants in 4 ms
[2024-06-01 07:34:46] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-06-01 07:34:46] [INFO ] Invariant cache hit.
[2024-06-01 07:34:47] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2024-06-01 07:34:47] [INFO ] Redundant transitions in 43 ms returned []
Running 479 sub problems to find dead transitions.
[2024-06-01 07:34:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:34:50] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:34:51] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:34:54] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:34:54] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (OVERLAPS) 1/501 variables, 163/184 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:35:01] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:35:01] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:35:01] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:35:01] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:35:01] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:35:01] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:35:01] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:35:01] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:35:04] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:35:04] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:35:04] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:35:04] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:35:04] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:35:04] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:35:04] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:35:04] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:35:05] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:35:05] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:35:05] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:35:05] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:35:05] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:35:05] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:35:05] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:35:06] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:35:06] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:35:06] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:35:06] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:35:06] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:35:06] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:35:06] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:35:07] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:35:07] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:35:11] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:35:11] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:35:11] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:35:11] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2024-06-01 07:35:12] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:35:12] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:35:12] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:35:14] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:35:14] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:35:14] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:35:14] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:35:14] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:35:14] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:35:15] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:35:15] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:35:15] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:35:15] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:35:15] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:35:15] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:35:15] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:35:16] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:35:16] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:35:16] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/982 variables, and 267 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 87/87 constraints]
Escalating to Integer solving :Problem set: 0 solved, 479 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (OVERLAPS) 1/501 variables, 163/194 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 73/267 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:35:21] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:35:21] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:35:21] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:35:21] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:35:22] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:35:22] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:35:22] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:35:25] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:35:25] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:35:25] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:35:25] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:35:25] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 12/279 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:35:26] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:35:26] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:35:27] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:35:27] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:35:27] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 5/284 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 8 (OVERLAPS) 481/982 variables, 501/785 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/982 variables, 479/1264 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 982/982 variables, and 1264 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 104/104 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Starting structural reductions in SI_LTL mode, iteration 1 : 501/503 places, 481/483 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60791 ms. Remains : 501/503 places, 481/483 transitions.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-11 finished in 159815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-01 07:35:47] [INFO ] Flatten gal took : 42 ms
[2024-06-01 07:35:47] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 07:35:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1064 places, 1044 transitions and 3288 arcs took 15 ms.
Total runtime 1195506 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : ShieldIIPs-PT-020B-LTLCardinality-02
FORMULA ShieldIIPs-PT-020B-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldIIPs-PT-020B-LTLCardinality-11
Could not compute solution for formula : ShieldIIPs-PT-020B-LTLCardinality-14

BK_STOP 1717228372054

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldIIPs-PT-020B-LTLCardinality-02
ltl formula formula --ltl=/tmp/6084/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1064 places, 1044 transitions and 3288 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.180 real 0.040 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/6084/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6084/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6084/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6084/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 1065 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1065, there are 1050 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2436 levels ~10000 states ~86824 transitions
pnml2lts-mc( 2/ 4): ~2448 levels ~20000 states ~128324 transitions
pnml2lts-mc( 2/ 4): ~2463 levels ~40000 states ~206232 transitions
pnml2lts-mc( 2/ 4): ~2463 levels ~80000 states ~402336 transitions
pnml2lts-mc( 2/ 4): ~2463 levels ~160000 states ~839616 transitions
pnml2lts-mc( 2/ 4): ~2463 levels ~320000 states ~1734040 transitions
pnml2lts-mc( 2/ 4): ~2463 levels ~640000 states ~3697092 transitions
pnml2lts-mc( 3/ 4): ~2432 levels ~1280000 states ~8215576 transitions
pnml2lts-mc( 2/ 4): ~2463 levels ~2560000 states ~16358356 transitions
pnml2lts-mc( 2/ 4): ~2463 levels ~5120000 states ~34629620 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6146611
pnml2lts-mc( 0/ 4): unique states count: 6156214
pnml2lts-mc( 0/ 4): unique transitions count: 45258128
pnml2lts-mc( 0/ 4): - self-loop count: 42
pnml2lts-mc( 0/ 4): - claim dead count: 39012668
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 6156222
pnml2lts-mc( 0/ 4): - cum. max stack depth: 9706
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6156222 states 45258145 transitions, fanout: 7.352
pnml2lts-mc( 0/ 4): Total exploration time 223.620 sec (223.620 sec minimum, 223.620 sec on average)
pnml2lts-mc( 0/ 4): States per second: 27530, Transitions per second: 202389
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 111.6MB, 18.7 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 18.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1074 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 111.6MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-020B-LTLCardinality-05
ltl formula formula --ltl=/tmp/6084/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1064 places, 1044 transitions and 3288 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.030 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6084/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6084/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/6084/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6084/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1066 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1065, there are 1077 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~1552 levels ~10000 states ~60028 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~2305!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5004
pnml2lts-mc( 0/ 4): unique states count: 12415
pnml2lts-mc( 0/ 4): unique transitions count: 97184
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 3953
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 12425
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7447
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12425 states 97209 transitions, fanout: 7.824
pnml2lts-mc( 0/ 4): Total exploration time 0.700 sec (0.700 sec minimum, 0.700 sec on average)
pnml2lts-mc( 0/ 4): States per second: 17750, Transitions per second: 138870
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 2.0MB, 23.5 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 1074 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.0MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-020B-LTLCardinality-11
ltl formula formula --ltl=/tmp/6084/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1064 places, 1044 transitions and 3288 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.030 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6084/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6084/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6084/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/6084/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1066 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1065, there are 1087 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~116 levels ~10000 states ~24168 transitions
pnml2lts-mc( 3/ 4): ~116 levels ~20000 states ~53200 transitions
pnml2lts-mc( 3/ 4): ~124 levels ~40000 states ~111916 transitions
pnml2lts-mc( 3/ 4): ~130 levels ~80000 states ~228672 transitions
pnml2lts-mc( 3/ 4): ~130 levels ~160000 states ~469304 transitions
pnml2lts-mc( 3/ 4): ~130 levels ~320000 states ~1008296 transitions
pnml2lts-mc( 3/ 4): ~130 levels ~640000 states ~2156136 transitions
pnml2lts-mc( 3/ 4): ~130 levels ~1280000 states ~4531136 transitions
pnml2lts-mc( 0/ 4): ~129 levels ~2560000 states ~9756820 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3275149
pnml2lts-mc( 0/ 4): unique states count: 3275532
pnml2lts-mc( 0/ 4): unique transitions count: 11929012
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 8652234
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 3275544
pnml2lts-mc( 0/ 4): - cum. max stack depth: 521
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3275544 states 11929041 transitions, fanout: 3.642
pnml2lts-mc( 0/ 4): Total exploration time 116.110 sec (116.080 sec minimum, 116.092 sec on average)
pnml2lts-mc( 0/ 4): States per second: 28211, Transitions per second: 102739
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 89.0MB, 28.5 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 9.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1074 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 89.0MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-020B-LTLCardinality-14
ltl formula formula --ltl=/tmp/6084/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1064 places, 1044 transitions and 3288 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.040 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/6084/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6084/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6084/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6084/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1066 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1065, there are 1049 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~1487 levels ~10000 states ~71528 transitions
pnml2lts-mc( 0/ 4): ~1924 levels ~20000 states ~101796 transitions
pnml2lts-mc( 0/ 4): ~1924 levels ~40000 states ~155376 transitions
pnml2lts-mc( 0/ 4): ~1924 levels ~80000 states ~275168 transitions
pnml2lts-mc( 0/ 4): ~1924 levels ~160000 states ~543412 transitions
pnml2lts-mc( 2/ 4): ~2243 levels ~320000 states ~1051340 transitions
pnml2lts-mc( 0/ 4): ~1924 levels ~640000 states ~2232452 transitions
pnml2lts-mc( 0/ 4): ~1924 levels ~1280000 states ~4551956 transitions
pnml2lts-mc( 0/ 4): ~1924 levels ~2560000 states ~9653484 transitions
pnml2lts-mc( 0/ 4): ~1924 levels ~5120000 states ~20308880 transitions
pnml2lts-mc( 0/ 4): ~1924 levels ~10240000 states ~42081164 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 19287942
pnml2lts-mc( 0/ 4): unique states count: 19296202
pnml2lts-mc( 0/ 4): unique transitions count: 80661241
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 61269275
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 19296212
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8363
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 19296212 states 80661270 transitions, fanout: 4.180
pnml2lts-mc( 0/ 4): Total exploration time 681.120 sec (681.100 sec minimum, 681.105 sec on average)
pnml2lts-mc( 0/ 4): States per second: 28330, Transitions per second: 118424
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 211.9MB, 11.5 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 57.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1074 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 211.9MB (~256.0MB paged-in)

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="ShieldIIPs-PT-020B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPs-PT-020B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683760400107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-020B.tgz
mv ShieldIIPs-PT-020B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;