fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r092-tall-171624188700171
Last Updated
July 7, 2024

About the Execution of ITS-Tools for CloudReconfiguration-PT-308

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1708.523 699092.00 899446.00 1721.70 FTTFFFTTTTFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r092-tall-171624188700171.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 itstools
Input is CloudReconfiguration-PT-308, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624188700171
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K 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:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 19:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 11 19:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 19:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 11 19:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 660K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716268795129

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-308
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 05:19:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 05:19:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 05:19:56] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2024-05-21 05:19:56] [INFO ] Transformed 2585 places.
[2024-05-21 05:19:56] [INFO ] Transformed 3095 transitions.
[2024-05-21 05:19:56] [INFO ] Found NUPN structural information;
[2024-05-21 05:19:56] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 291 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 2 formulas.
FORMULA CloudReconfiguration-PT-308-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-308-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-308-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-308-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-308-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-308-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-308-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 517 places :
Symmetric choice reduction at 0 with 517 rule applications. Total rules 517 place count 2068 transition count 2578
Iterating global reduction 0 with 517 rules applied. Total rules applied 1034 place count 2068 transition count 2578
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 1063 place count 2068 transition count 2549
Discarding 236 places :
Symmetric choice reduction at 1 with 236 rule applications. Total rules 1299 place count 1832 transition count 2313
Iterating global reduction 1 with 236 rules applied. Total rules applied 1535 place count 1832 transition count 2313
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 1624 place count 1743 transition count 2224
Iterating global reduction 1 with 89 rules applied. Total rules applied 1713 place count 1743 transition count 2224
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 1729 place count 1743 transition count 2208
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 1778 place count 1694 transition count 2159
Iterating global reduction 2 with 49 rules applied. Total rules applied 1827 place count 1694 transition count 2159
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1836 place count 1694 transition count 2150
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1873 place count 1657 transition count 2109
Iterating global reduction 3 with 37 rules applied. Total rules applied 1910 place count 1657 transition count 2109
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1937 place count 1630 transition count 2082
Iterating global reduction 3 with 27 rules applied. Total rules applied 1964 place count 1630 transition count 2082
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1989 place count 1605 transition count 2057
Iterating global reduction 3 with 25 rules applied. Total rules applied 2014 place count 1605 transition count 2057
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 2038 place count 1581 transition count 2033
Iterating global reduction 3 with 24 rules applied. Total rules applied 2062 place count 1581 transition count 2033
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 2083 place count 1560 transition count 1999
Iterating global reduction 3 with 21 rules applied. Total rules applied 2104 place count 1560 transition count 1999
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2112 place count 1552 transition count 1985
Iterating global reduction 3 with 8 rules applied. Total rules applied 2120 place count 1552 transition count 1985
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2128 place count 1544 transition count 1974
Iterating global reduction 3 with 8 rules applied. Total rules applied 2136 place count 1544 transition count 1974
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2139 place count 1544 transition count 1971
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2142 place count 1541 transition count 1968
Iterating global reduction 4 with 3 rules applied. Total rules applied 2145 place count 1541 transition count 1968
Applied a total of 2145 rules in 1919 ms. Remains 1541 /2585 variables (removed 1044) and now considering 1968/3095 (removed 1127) transitions.
// Phase 1: matrix 1968 rows 1541 cols
[2024-05-21 05:19:58] [INFO ] Computed 4 invariants in 37 ms
[2024-05-21 05:19:59] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-21 05:19:59] [INFO ] Invariant cache hit.
[2024-05-21 05:20:00] [INFO ] Implicit Places using invariants and state equation in 1120 ms returned []
Implicit Place search using SMT with State Equation took 1607 ms to find 0 implicit places.
Running 1967 sub problems to find dead transitions.
[2024-05-21 05:20:00] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1540 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1967 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1540/3509 variables, and 4 constraints, problems are : Problem set: 0 solved, 1967 unsolved in 30086 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1541 constraints, PredecessorRefiner: 1967/1967 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1967 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1540 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1967 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 0)
(s298 0)
(s299 1)
(s300 1)
(s301 1)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 1)
(s309 1)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 1)
(s318 0)
(s319 1)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(timeout
s665 0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1540/3509 variables, and 4 constraints, problems are : Problem set: 0 solved, 1967 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1541 constraints, PredecessorRefiner: 0/1967 constraints, Known Traps: 0/0 constraints]
After SMT, in 60788ms problems are : Problem set: 0 solved, 1967 unsolved
Search for dead transitions found 0 dead transitions in 60826ms
Starting structural reductions in LTL mode, iteration 1 : 1541/2585 places, 1968/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64389 ms. Remains : 1541/2585 places, 1968/3095 transitions.
Support contains 32 out of 1541 places after structural reductions.
[2024-05-21 05:21:01] [INFO ] Flatten gal took : 132 ms
[2024-05-21 05:21:01] [INFO ] Flatten gal took : 70 ms
[2024-05-21 05:21:01] [INFO ] Input system was already deterministic with 1968 transitions.
RANDOM walk for 40000 steps (286 resets) in 2273 ms. (17 steps per ms) remains 10/17 properties
BEST_FIRST walk for 40003 steps (72 resets) in 125 ms. (317 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (74 resets) in 84 ms. (470 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (75 resets) in 102 ms. (388 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (80 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (75 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (77 resets) in 83 ms. (476 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (77 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (75 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (81 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (76 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
[2024-05-21 05:21:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1513/1530 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1530 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1958/3488 variables, 1530/1534 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3488 variables, 0/1534 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/3490 variables, 1/1535 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3490 variables, 0/1535 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 2/3492 variables, 1/1536 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3492 variables, 0/1536 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 2/3494 variables, 1/1537 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3494 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 2/3496 variables, 1/1538 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3496 variables, 0/1538 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 2/3498 variables, 1/1539 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3498 variables, 0/1539 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 2/3500 variables, 1/1540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3500 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 2/3502 variables, 1/1541 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3502 variables, 0/1541 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 2/3504 variables, 1/1542 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3504 variables, 0/1542 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 2/3506 variables, 1/1543 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3506 variables, 0/1543 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 2/3508 variables, 1/1544 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3508/3509 variables, and 1544 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5016 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1540/1541 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1513/1530 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1530 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1958/3488 variables, 1530/1534 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3488 variables, 9/1543 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3488 variables, 0/1543 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 2/3490 variables, 1/1544 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3490 variables, 0/1544 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 2/3492 variables, 1/1545 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3492 variables, 0/1545 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 2/3494 variables, 1/1546 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3494 variables, 0/1546 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 2/3496 variables, 1/1547 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3496 variables, 0/1547 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 2/3498 variables, 1/1548 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3498 variables, 0/1548 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 2/3500 variables, 1/1549 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3500 variables, 0/1549 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 2/3502 variables, 1/1550 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3502 variables, 0/1550 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 2/3504 variables, 1/1551 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3504 variables, 0/1551 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 2/3506 variables, 1/1552 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3506 variables, 0/1552 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 2/3508 variables, 1/1553 constraints. Problems are: Problem set: 0 solved, 9 unsolved
(s386 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 3)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 1)
(s264 1)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 3)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0timeout
)
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3508/3509 variables, and 1553 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5017 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1540/1541 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 10049ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 1541 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1541/1541 places, 1968/1968 transitions.
Graph (trivial) has 1846 edges and 1541 vertex of which 663 / 1541 are part of one of the 61 SCC in 11 ms
Free SCC test removed 602 places
Drop transitions (Empty/Sink Transition effects.) removed 755 transitions
Reduce isomorphic transitions removed 755 transitions.
Graph (complete) has 1386 edges and 939 vertex of which 930 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 506 transitions
Trivial Post-agglo rules discarded 506 transitions
Performed 506 trivial Post agglomeration. Transition count delta: 506
Iterating post reduction 0 with 513 rules applied. Total rules applied 515 place count 930 transition count 696
Reduce places removed 506 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 1 with 564 rules applied. Total rules applied 1079 place count 424 transition count 638
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 41 rules applied. Total rules applied 1120 place count 387 transition count 634
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 1124 place count 385 transition count 632
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 1128 place count 384 transition count 629
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 5 rules applied. Total rules applied 1133 place count 382 transition count 626
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1136 place count 379 transition count 626
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 53 Pre rules applied. Total rules applied 1136 place count 379 transition count 573
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 7 with 106 rules applied. Total rules applied 1242 place count 326 transition count 573
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1250 place count 318 transition count 563
Iterating global reduction 7 with 8 rules applied. Total rules applied 1258 place count 318 transition count 563
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1259 place count 318 transition count 562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1260 place count 317 transition count 562
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1266 place count 311 transition count 556
Iterating global reduction 9 with 6 rules applied. Total rules applied 1272 place count 311 transition count 556
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1278 place count 311 transition count 550
Performed 153 Post agglomeration using F-continuation condition with reduction of 97 identical transitions.
Deduced a syphon composed of 153 places in 0 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 10 with 306 rules applied. Total rules applied 1584 place count 158 transition count 300
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 10 with 22 rules applied. Total rules applied 1606 place count 158 transition count 278
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1610 place count 154 transition count 274
Iterating global reduction 11 with 4 rules applied. Total rules applied 1614 place count 154 transition count 274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1615 place count 154 transition count 273
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 12 with 22 rules applied. Total rules applied 1637 place count 143 transition count 261
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 1650 place count 143 transition count 248
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1652 place count 142 transition count 247
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1653 place count 142 transition count 246
Performed 34 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 14 with 68 rules applied. Total rules applied 1721 place count 108 transition count 278
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 14 with 35 rules applied. Total rules applied 1756 place count 108 transition count 243
Discarding 18 places :
Symmetric choice reduction at 15 with 18 rule applications. Total rules 1774 place count 90 transition count 215
Iterating global reduction 15 with 18 rules applied. Total rules applied 1792 place count 90 transition count 215
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 15 with 9 rules applied. Total rules applied 1801 place count 90 transition count 206
Discarding 3 places :
Symmetric choice reduction at 16 with 3 rule applications. Total rules 1804 place count 87 transition count 200
Iterating global reduction 16 with 3 rules applied. Total rules applied 1807 place count 87 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 1809 place count 87 transition count 198
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 17 with 19 rules applied. Total rules applied 1828 place count 87 transition count 179
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 1829 place count 86 transition count 176
Iterating global reduction 17 with 1 rules applied. Total rules applied 1830 place count 86 transition count 176
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 1831 place count 85 transition count 175
Iterating global reduction 17 with 1 rules applied. Total rules applied 1832 place count 85 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 1833 place count 85 transition count 174
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 1834 place count 85 transition count 173
Free-agglomeration rule applied 7 times.
Iterating global reduction 18 with 7 rules applied. Total rules applied 1841 place count 85 transition count 166
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 8 rules applied. Total rules applied 1849 place count 78 transition count 165
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 19 with 4 rules applied. Total rules applied 1853 place count 78 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 1855 place count 78 transition count 163
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 1856 place count 77 transition count 162
Applied a total of 1856 rules in 209 ms. Remains 77 /1541 variables (removed 1464) and now considering 162/1968 (removed 1806) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 77/1541 places, 162/1968 transitions.
RANDOM walk for 6812 steps (86 resets) in 175 ms. (38 steps per ms) remains 0/9 properties
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2146 edges and 1541 vertex of which 1532 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.28 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)))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 1968/1968 transitions.
Graph (trivial) has 1876 edges and 1541 vertex of which 696 / 1541 are part of one of the 62 SCC in 3 ms
Free SCC test removed 634 places
Ensure Unique test removed 736 transitions
Reduce isomorphic transitions removed 736 transitions.
Graph (complete) has 1404 edges and 907 vertex of which 898 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 492 transitions
Trivial Post-agglo rules discarded 492 transitions
Performed 492 trivial Post agglomeration. Transition count delta: 492
Iterating post reduction 0 with 492 rules applied. Total rules applied 494 place count 897 transition count 734
Reduce places removed 492 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 515 rules applied. Total rules applied 1009 place count 405 transition count 711
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1020 place count 394 transition count 711
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 1020 place count 394 transition count 663
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 1116 place count 346 transition count 663
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1132 place count 330 transition count 638
Iterating global reduction 3 with 16 rules applied. Total rules applied 1148 place count 330 transition count 638
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 1149 place count 330 transition count 637
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1150 place count 329 transition count 637
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1159 place count 320 transition count 625
Iterating global reduction 5 with 9 rules applied. Total rules applied 1168 place count 320 transition count 625
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1174 place count 320 transition count 619
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1175 place count 319 transition count 617
Iterating global reduction 6 with 1 rules applied. Total rules applied 1176 place count 319 transition count 617
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1177 place count 318 transition count 615
Iterating global reduction 6 with 1 rules applied. Total rules applied 1178 place count 318 transition count 615
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1179 place count 317 transition count 613
Iterating global reduction 6 with 1 rules applied. Total rules applied 1180 place count 317 transition count 613
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1181 place count 316 transition count 611
Iterating global reduction 6 with 1 rules applied. Total rules applied 1182 place count 316 transition count 611
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1183 place count 315 transition count 609
Iterating global reduction 6 with 1 rules applied. Total rules applied 1184 place count 315 transition count 609
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1185 place count 314 transition count 602
Iterating global reduction 6 with 1 rules applied. Total rules applied 1186 place count 314 transition count 602
Performed 151 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 6 with 302 rules applied. Total rules applied 1488 place count 163 transition count 364
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1499 place count 163 transition count 353
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1503 place count 159 transition count 348
Iterating global reduction 7 with 4 rules applied. Total rules applied 1507 place count 159 transition count 348
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1529 place count 148 transition count 336
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 1541 place count 148 transition count 324
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1542 place count 147 transition count 322
Iterating global reduction 8 with 1 rules applied. Total rules applied 1543 place count 147 transition count 322
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 38 rules applied. Total rules applied 1581 place count 128 transition count 358
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 1602 place count 128 transition count 337
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1611 place count 119 transition count 319
Iterating global reduction 9 with 9 rules applied. Total rules applied 1620 place count 119 transition count 319
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1626 place count 119 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 10 with 41 rules applied. Total rules applied 1667 place count 119 transition count 272
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1668 place count 119 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1669 place count 118 transition count 271
Applied a total of 1669 rules in 142 ms. Remains 118 /1541 variables (removed 1423) and now considering 271/1968 (removed 1697) transitions.
[2024-05-21 05:21:13] [INFO ] Flow matrix only has 214 transitions (discarded 57 similar events)
// Phase 1: matrix 214 rows 118 cols
[2024-05-21 05:21:13] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 05:21:13] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 05:21:13] [INFO ] Flow matrix only has 214 transitions (discarded 57 similar events)
[2024-05-21 05:21:13] [INFO ] Invariant cache hit.
[2024-05-21 05:21:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 05:21:13] [INFO ] Implicit Places using invariants and state equation in 229 ms returned [13, 80]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 288 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/1541 places, 271/1968 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 269
Applied a total of 2 rules in 21 ms. Remains 114 /116 variables (removed 2) and now considering 269/271 (removed 2) transitions.
[2024-05-21 05:21:14] [INFO ] Flow matrix only has 212 transitions (discarded 57 similar events)
// Phase 1: matrix 212 rows 114 cols
[2024-05-21 05:21:14] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 05:21:14] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 05:21:14] [INFO ] Flow matrix only has 212 transitions (discarded 57 similar events)
[2024-05-21 05:21:14] [INFO ] Invariant cache hit.
[2024-05-21 05:21:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 05:21:14] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 114/1541 places, 269/1968 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 629 ms. Remains : 114/1541 places, 269/1968 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-308-LTLCardinality-00
Stuttering criterion allowed to conclude after 30218 steps with 2686 reset in 119 ms.
FORMULA CloudReconfiguration-PT-308-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-308-LTLCardinality-00 finished in 974 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(p1)||p0)))'
Support contains 4 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1968/1968 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1529 transition count 1956
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1529 transition count 1956
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 1523 transition count 1949
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 1523 transition count 1949
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1523 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 1520 transition count 1944
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 1520 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 1518 transition count 1942
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 1518 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 1516 transition count 1939
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 1516 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1515 transition count 1938
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1515 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1514 transition count 1937
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1514 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1513 transition count 1936
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1513 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1512 transition count 1935
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1512 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1511 transition count 1934
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1511 transition count 1934
Applied a total of 61 rules in 559 ms. Remains 1511 /1541 variables (removed 30) and now considering 1934/1968 (removed 34) transitions.
// Phase 1: matrix 1934 rows 1511 cols
[2024-05-21 05:21:15] [INFO ] Computed 4 invariants in 22 ms
[2024-05-21 05:21:15] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-21 05:21:15] [INFO ] Invariant cache hit.
[2024-05-21 05:21:16] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1203 ms to find 0 implicit places.
Running 1933 sub problems to find dead transitions.
[2024-05-21 05:21:16] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3445 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1933/1933 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1933 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3445 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1933 constraints, Known Traps: 0/0 constraints]
After SMT, in 60693ms problems are : Problem set: 0 solved, 1933 unsolved
Search for dead transitions found 0 dead transitions in 60713ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1541 places, 1934/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62480 ms. Remains : 1511/1541 places, 1934/1968 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-308-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 446 ms.
Product exploration explored 100000 steps with 50000 reset in 462 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2111 edges and 1511 vertex of which 1502 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.10 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 60 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-308-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-308-LTLCardinality-02 finished in 63642 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(X(G(p0))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1968/1968 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1527 transition count 1954
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1527 transition count 1954
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 1520 transition count 1946
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 1520 transition count 1946
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 1520 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 1518 transition count 1941
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 1518 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 1517 transition count 1940
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 1517 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 1516 transition count 1938
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 1516 transition count 1938
Applied a total of 52 rules in 326 ms. Remains 1516 /1541 variables (removed 25) and now considering 1938/1968 (removed 30) transitions.
// Phase 1: matrix 1938 rows 1516 cols
[2024-05-21 05:22:18] [INFO ] Computed 4 invariants in 16 ms
[2024-05-21 05:22:18] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-21 05:22:18] [INFO ] Invariant cache hit.
[2024-05-21 05:22:19] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1148 ms to find 0 implicit places.
Running 1937 sub problems to find dead transitions.
[2024-05-21 05:22:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1515 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1515/3454 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1516 constraints, PredecessorRefiner: 1937/1937 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1937 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1515 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1515/3454 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1516 constraints, PredecessorRefiner: 0/1937 constraints, Known Traps: 0/0 constraints]
After SMT, in 60602ms problems are : Problem set: 0 solved, 1937 unsolved
Search for dead transitions found 0 dead transitions in 60622ms
Starting structural reductions in LTL mode, iteration 1 : 1516/1541 places, 1938/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62103 ms. Remains : 1516/1541 places, 1938/1968 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-308-LTLCardinality-03
Product exploration explored 100000 steps with 716 reset in 186 ms.
Product exploration explored 100000 steps with 710 reset in 261 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2116 edges and 1516 vertex of which 1507 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (277 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (75 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 418869 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 1
Probabilistic random walk after 418869 steps, saw 102719 distinct states, run finished after 3004 ms. (steps per millisecond=139 ) properties seen :0
[2024-05-21 05:23:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 826/828 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 677/1505 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1505 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1928/3433 variables, 1505/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3439 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3439 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3441 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3441 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3443 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3443 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3445 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3445 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3447 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3447 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3449 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3449 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3451 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3451 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3453 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3453 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3454 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3454 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3454 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3454/3454 variables, and 1520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1142 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1516/1516 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 826/828 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 677/1505 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1505 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1928/3433 variables, 1505/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3433 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3433 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3435 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3435 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3437 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3439 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3439 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3441 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3441 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3443 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3443 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3445 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3445 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3447 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3447 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3449 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3449 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3451 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3451 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3453 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3453 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3454 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3454 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3454 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3454/3454 variables, and 1521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1381 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1516/1516 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2533ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 124 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=62 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1516/1516 places, 1938/1938 transitions.
Applied a total of 0 rules in 56 ms. Remains 1516 /1516 variables (removed 0) and now considering 1938/1938 (removed 0) transitions.
[2024-05-21 05:23:27] [INFO ] Invariant cache hit.
[2024-05-21 05:23:27] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-21 05:23:27] [INFO ] Invariant cache hit.
[2024-05-21 05:23:28] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
Running 1937 sub problems to find dead transitions.
[2024-05-21 05:23:28] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 1.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 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.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 0.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 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 timeout
0.0)
(s362 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1515 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1515/3454 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1516 constraints, PredecessorRefiner: 1937/1937 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1937 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1515 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1515/3454 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1516 constraints, PredecessorRefiner: 0/1937 constraints, Known Traps: 0/0 constraints]
After SMT, in 60578ms problems are : Problem set: 0 solved, 1937 unsolved
Search for dead transitions found 0 dead transitions in 60606ms
Finished structural reductions in LTL mode , in 1 iterations and 61817 ms. Remains : 1516/1516 places, 1938/1938 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2116 edges and 1516 vertex of which 1507 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (282 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (75 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 440541 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 1
Probabilistic random walk after 440541 steps, saw 107054 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
[2024-05-21 05:24:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 826/828 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 677/1505 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1505 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1928/3433 variables, 1505/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3439 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3439 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3441 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3441 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3443 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3443 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3445 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3445 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3447 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3447 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3449 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3449 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3451 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3451 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3453 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3453 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3454 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3454 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3454 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3454/3454 variables, and 1520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1161 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1516/1516 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 826/828 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 677/1505 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1505 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1928/3433 variables, 1505/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3433 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3433 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3435 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3435 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3437 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3439 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3439 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3441 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3441 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3443 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3443 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3445 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3445 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3447 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3447 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3449 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3449 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3451 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3451 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3453 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3453 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3454 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3454 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3454 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3454/3454 variables, and 1521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1389 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1516/1516 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2581ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 485 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=242 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 698 reset in 147 ms.
Product exploration explored 100000 steps with 703 reset in 155 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1516/1516 places, 1938/1938 transitions.
Graph (trivial) has 1847 edges and 1516 vertex of which 693 / 1516 are part of one of the 63 SCC in 3 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1378 edges and 886 vertex of which 877 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 482 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 482 rules applied. Total rules applied 484 place count 877 transition count 1201
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 496 place count 877 transition count 1189
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 496 place count 877 transition count 1202
Deduced a syphon composed of 503 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 517 place count 877 transition count 1202
Discarding 291 places :
Symmetric choice reduction at 2 with 291 rule applications. Total rules 808 place count 586 transition count 902
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 2 with 291 rules applied. Total rules applied 1099 place count 586 transition count 902
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1111 place count 574 transition count 886
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1123 place count 574 transition count 886
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1129 place count 574 transition count 880
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1141 place count 562 transition count 868
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1153 place count 562 transition count 868
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1155 place count 560 transition count 864
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1157 place count 560 transition count 864
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1159 place count 558 transition count 860
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1161 place count 558 transition count 860
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1165 place count 554 transition count 856
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1169 place count 554 transition count 856
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1171 place count 552 transition count 852
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1173 place count 552 transition count 852
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1175 place count 550 transition count 848
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1177 place count 550 transition count 848
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1181 place count 546 transition count 842
Deduced a syphon composed of 211 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1185 place count 546 transition count 842
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1189 place count 542 transition count 826
Deduced a syphon composed of 209 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1193 place count 542 transition count 826
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1194 place count 542 transition count 826
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1198 place count 538 transition count 822
Deduced a syphon composed of 208 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1202 place count 538 transition count 822
Performed 105 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 313 places in 0 ms
Iterating global reduction 4 with 105 rules applied. Total rules applied 1307 place count 538 transition count 899
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 4 with 41 rules applied. Total rules applied 1348 place count 538 transition count 858
Discarding 97 places :
Symmetric choice reduction at 5 with 97 rule applications. Total rules 1445 place count 441 transition count 751
Deduced a syphon composed of 226 places in 1 ms
Iterating global reduction 5 with 97 rules applied. Total rules applied 1542 place count 441 transition count 751
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1548 place count 435 transition count 742
Deduced a syphon composed of 220 places in 1 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1554 place count 435 transition count 742
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1561 place count 435 transition count 742
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1566 place count 435 transition count 737
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1582 place count 419 transition count 717
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 6 with 16 rules applied. Total rules applied 1598 place count 419 transition count 717
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1604 place count 419 transition count 711
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1608 place count 415 transition count 707
Deduced a syphon composed of 211 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1612 place count 415 transition count 707
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 1614 place count 415 transition count 707
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1618 place count 415 transition count 703
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1620 place count 413 transition count 701
Deduced a syphon composed of 211 places in 1 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 1622 place count 413 transition count 701
Performed 70 Post agglomeration using F-continuation condition with reduction of 121 identical transitions.
Deduced a syphon composed of 281 places in 0 ms
Iterating global reduction 8 with 70 rules applied. Total rules applied 1692 place count 413 transition count 1022
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 8 with 121 rules applied. Total rules applied 1813 place count 413 transition count 901
Discarding 124 places :
Symmetric choice reduction at 9 with 124 rule applications. Total rules 1937 place count 289 transition count 570
Deduced a syphon composed of 166 places in 1 ms
Iterating global reduction 9 with 124 rules applied. Total rules applied 2061 place count 289 transition count 570
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 2076 place count 289 transition count 555
Discarding 26 places :
Symmetric choice reduction at 10 with 26 rule applications. Total rules 2102 place count 263 transition count 501
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 10 with 26 rules applied. Total rules applied 2128 place count 263 transition count 501
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2131 place count 263 transition count 551
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2134 place count 260 transition count 523
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2137 place count 260 transition count 523
Deduced a syphon composed of 140 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 10 with 45 rules applied. Total rules applied 2182 place count 260 transition count 478
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2186 place count 256 transition count 474
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2190 place count 256 transition count 474
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2193 place count 256 transition count 534
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2196 place count 253 transition count 519
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2199 place count 253 transition count 519
Deduced a syphon composed of 136 places in 0 ms
Applied a total of 2199 rules in 316 ms. Remains 253 /1516 variables (removed 1263) and now considering 519/1938 (removed 1419) transitions.
[2024-05-21 05:24:36] [INFO ] Redundant transitions in 26 ms returned []
Running 518 sub problems to find dead transitions.
[2024-05-21 05:24:36] [INFO ] Flow matrix only has 462 transitions (discarded 57 similar events)
// Phase 1: matrix 462 rows 253 cols
[2024-05-21 05:24:36] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 05:24:36] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 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 TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
At refinement iteration 1 (OVERLAPS) 461/713 variables, 252/252 constraints. Problems are: Problem set: 252 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/713 variables, 2/254 constraints. Problems are: Problem set: 252 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/713 variables, 0/254 constraints. Problems are: Problem set: 252 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 1/714 variables, 1/255 constraints. Problems are: Problem set: 252 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/714 variables, 0/255 constraints. Problems are: Problem set: 252 solved, 266 unsolved
At refinement iteration 6 (OVERLAPS) 1/715 variables, 1/256 constraints. Problems are: Problem set: 252 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/715 variables, 0/256 constraints. Problems are: Problem set: 252 solved, 266 unsolved
At refinement iteration 8 (OVERLAPS) 0/715 variables, 0/256 constraints. Problems are: Problem set: 252 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 715/715 variables, and 256 constraints, problems are : Problem set: 252 solved, 266 unsolved in 18561 ms.
Refiners :[State Equation: 253/253 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 252 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 252 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 458/574 variables, 116/116 constraints. Problems are: Problem set: 252 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/574 variables, 2/118 constraints. Problems are: Problem set: 252 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/574 variables, 266/384 constraints. Problems are: Problem set: 252 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 0/384 constraints. Problems are: Problem set: 252 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 140/714 variables, 137/521 constraints. Problems are: Problem set: 252 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/714 variables, 0/521 constraints. Problems are: Problem set: 252 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 1/715 variables, 1/522 constraints. Problems are: Problem set: 252 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/715 variables, 0/522 constraints. Problems are: Problem set: 252 solved, 266 unsolved
At refinement iteration 9 (OVERLAPS) 0/715 variables, 0/522 constraints. Problems are: Problem set: 252 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 715/715 variables, and 522 constraints, problems are : Problem set: 252 solved, 266 unsolved in 26921 ms.
Refiners :[State Equation: 253/253 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 266/518 constraints, Known Traps: 0/0 constraints]
After SMT, in 45737ms problems are : Problem set: 252 solved, 266 unsolved
Search for dead transitions found 252 dead transitions in 45745ms
Found 252 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 252 transitions
Dead transitions reduction (with SMT) removed 252 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 253/1516 places, 267/1938 transitions.
Graph (complete) has 417 edges and 253 vertex of which 117 are kept as prefixes of interest. Removing 136 places using SCC suffix rule.1 ms
Discarding 136 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 117 /253 variables (removed 136) and now considering 267/267 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 117/1516 places, 267/1938 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46110 ms. Remains : 117/1516 places, 267/1938 transitions.
Built C files in :
/tmp/ltsmin12025950136948140853
[2024-05-21 05:25:22] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12025950136948140853
Running compilation step : cd /tmp/ltsmin12025950136948140853;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12025950136948140853;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12025950136948140853;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 1516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1516/1516 places, 1938/1938 transitions.
Applied a total of 0 rules in 46 ms. Remains 1516 /1516 variables (removed 0) and now considering 1938/1938 (removed 0) transitions.
// Phase 1: matrix 1938 rows 1516 cols
[2024-05-21 05:25:25] [INFO ] Computed 4 invariants in 16 ms
[2024-05-21 05:25:25] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-05-21 05:25:25] [INFO ] Invariant cache hit.
[2024-05-21 05:25:26] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1166 ms to find 0 implicit places.
Running 1937 sub problems to find dead transitions.
[2024-05-21 05:25:26] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1515 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1515/3454 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1516 constraints, PredecessorRefiner: 1937/1937 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1937 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1515 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1515/3454 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1516 constraints, PredecessorRefiner: 0/1937 constraints, Known Traps: 0/0 constraints]
After SMT, in 60624ms problems are : Problem set: 0 solved, 1937 unsolved
Search for dead transitions found 0 dead transitions in 60645ms
Finished structural reductions in LTL mode , in 1 iterations and 61863 ms. Remains : 1516/1516 places, 1938/1938 transitions.
Built C files in :
/tmp/ltsmin6475162045936676346
[2024-05-21 05:26:27] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6475162045936676346
Running compilation step : cd /tmp/ltsmin6475162045936676346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6475162045936676346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6475162045936676346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 05:26:30] [INFO ] Flatten gal took : 54 ms
[2024-05-21 05:26:30] [INFO ] Flatten gal took : 47 ms
[2024-05-21 05:26:30] [INFO ] Time to serialize gal into /tmp/LTL3290088252750875039.gal : 14 ms
[2024-05-21 05:26:30] [INFO ] Time to serialize properties into /tmp/LTL17187100689388049218.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3290088252750875039.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18200647214443071717.hoa' '-atoms' '/tmp/LTL17187100689388049218.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17187100689388049218.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18200647214443071717.hoa
Detected timeout of ITS tools.
[2024-05-21 05:26:45] [INFO ] Flatten gal took : 46 ms
[2024-05-21 05:26:45] [INFO ] Flatten gal took : 43 ms
[2024-05-21 05:26:45] [INFO ] Time to serialize gal into /tmp/LTL5368315211286908943.gal : 9 ms
[2024-05-21 05:26:45] [INFO ] Time to serialize properties into /tmp/LTL1494821315680685523.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5368315211286908943.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1494821315680685523.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((p2094==0)||(p1876==1))")))))
Formula 0 simplified : XXF!"((p2094==0)||(p1876==1))"
Detected timeout of ITS tools.
[2024-05-21 05:27:00] [INFO ] Flatten gal took : 38 ms
[2024-05-21 05:27:00] [INFO ] Applying decomposition
[2024-05-21 05:27:00] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13088046303900647504.txt' '-o' '/tmp/graph13088046303900647504.bin' '-w' '/tmp/graph13088046303900647504.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13088046303900647504.bin' '-l' '-1' '-v' '-w' '/tmp/graph13088046303900647504.weights' '-q' '0' '-e' '0.001'
[2024-05-21 05:27:00] [INFO ] Decomposing Gal with order
[2024-05-21 05:27:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 05:27:01] [INFO ] Removed a total of 518 redundant transitions.
[2024-05-21 05:27:01] [INFO ] Flatten gal took : 127 ms
[2024-05-21 05:27:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 39 ms.
[2024-05-21 05:27:01] [INFO ] Time to serialize gal into /tmp/LTL7076833122797017825.gal : 22 ms
[2024-05-21 05:27:01] [INFO ] Time to serialize properties into /tmp/LTL15585267833686466545.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7076833122797017825.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15585267833686466545.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((i33.u509.p2094==0)||(i29.u441.p1876==1))")))))
Formula 0 simplified : XXF!"((i33.u509.p2094==0)||(i29.u441.p1876==1))"
Reverse transition relation is NOT exact ! Due to transitions t23, t26, t190, t221, t273, t334, t384, t455, t507, t696, t748, t779, t931, t983, t1166, t121...2138
Computing Next relation with stutter on 147296 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
488 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.0443,171300,1,0,293368,8161,22768,533760,500,56318,1226422
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-308-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-308-LTLCardinality-03 finished in 288961 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)))'
Support contains 1 out of 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 1968/1968 transitions.
Graph (trivial) has 1878 edges and 1541 vertex of which 673 / 1541 are part of one of the 62 SCC in 2 ms
Free SCC test removed 611 places
Ensure Unique test removed 712 transitions
Reduce isomorphic transitions removed 712 transitions.
Graph (complete) has 1430 edges and 930 vertex of which 921 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 510 transitions
Trivial Post-agglo rules discarded 510 transitions
Performed 510 trivial Post agglomeration. Transition count delta: 510
Iterating post reduction 0 with 510 rules applied. Total rules applied 512 place count 920 transition count 740
Reduce places removed 510 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 537 rules applied. Total rules applied 1049 place count 410 transition count 713
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1062 place count 397 transition count 713
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 1062 place count 397 transition count 663
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 1162 place count 347 transition count 663
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1176 place count 333 transition count 640
Iterating global reduction 3 with 14 rules applied. Total rules applied 1190 place count 333 transition count 640
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 1191 place count 333 transition count 639
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1192 place count 332 transition count 639
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1199 place count 325 transition count 629
Iterating global reduction 5 with 7 rules applied. Total rules applied 1206 place count 325 transition count 629
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1210 place count 325 transition count 625
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1211 place count 324 transition count 623
Iterating global reduction 6 with 1 rules applied. Total rules applied 1212 place count 324 transition count 623
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1213 place count 323 transition count 621
Iterating global reduction 6 with 1 rules applied. Total rules applied 1214 place count 323 transition count 621
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1215 place count 322 transition count 619
Iterating global reduction 6 with 1 rules applied. Total rules applied 1216 place count 322 transition count 619
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1217 place count 321 transition count 617
Iterating global reduction 6 with 1 rules applied. Total rules applied 1218 place count 321 transition count 617
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1219 place count 320 transition count 615
Iterating global reduction 6 with 1 rules applied. Total rules applied 1220 place count 320 transition count 615
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1221 place count 319 transition count 608
Iterating global reduction 6 with 1 rules applied. Total rules applied 1222 place count 319 transition count 608
Performed 151 Post agglomeration using F-continuation condition with reduction of 86 identical transitions.
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 6 with 302 rules applied. Total rules applied 1524 place count 168 transition count 371
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1535 place count 168 transition count 360
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1540 place count 163 transition count 353
Iterating global reduction 7 with 5 rules applied. Total rules applied 1545 place count 163 transition count 353
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1546 place count 162 transition count 351
Iterating global reduction 7 with 1 rules applied. Total rules applied 1547 place count 162 transition count 351
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1548 place count 161 transition count 349
Iterating global reduction 7 with 1 rules applied. Total rules applied 1549 place count 161 transition count 349
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1550 place count 160 transition count 347
Iterating global reduction 7 with 1 rules applied. Total rules applied 1551 place count 160 transition count 347
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1552 place count 159 transition count 340
Iterating global reduction 7 with 1 rules applied. Total rules applied 1553 place count 159 transition count 340
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1577 place count 147 transition count 327
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1590 place count 147 transition count 314
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 8 with 40 rules applied. Total rules applied 1630 place count 127 transition count 349
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 1648 place count 127 transition count 331
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1657 place count 118 transition count 313
Iterating global reduction 9 with 9 rules applied. Total rules applied 1666 place count 118 transition count 313
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1672 place count 118 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 10 with 36 rules applied. Total rules applied 1708 place count 118 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1709 place count 117 transition count 270
Applied a total of 1709 rules in 80 ms. Remains 117 /1541 variables (removed 1424) and now considering 270/1968 (removed 1698) transitions.
[2024-05-21 05:27:07] [INFO ] Flow matrix only has 214 transitions (discarded 56 similar events)
// Phase 1: matrix 214 rows 117 cols
[2024-05-21 05:27:07] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:27:07] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 05:27:07] [INFO ] Flow matrix only has 214 transitions (discarded 56 similar events)
[2024-05-21 05:27:07] [INFO ] Invariant cache hit.
[2024-05-21 05:27:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 05:27:07] [INFO ] Implicit Places using invariants and state equation in 117 ms returned [8, 79]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 184 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1541 places, 270/1968 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 268
Applied a total of 2 rules in 5 ms. Remains 113 /115 variables (removed 2) and now considering 268/270 (removed 2) transitions.
[2024-05-21 05:27:07] [INFO ] Flow matrix only has 212 transitions (discarded 56 similar events)
// Phase 1: matrix 212 rows 113 cols
[2024-05-21 05:27:07] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 05:27:07] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 05:27:07] [INFO ] Flow matrix only has 212 transitions (discarded 56 similar events)
[2024-05-21 05:27:07] [INFO ] Invariant cache hit.
[2024-05-21 05:27:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 05:27:07] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/1541 places, 268/1968 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 413 ms. Remains : 113/1541 places, 268/1968 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-308-LTLCardinality-05
Stuttering criterion allowed to conclude after 36 steps with 3 reset in 0 ms.
FORMULA CloudReconfiguration-PT-308-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-308-LTLCardinality-05 finished in 463 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(p1)||p0)))'
Support contains 4 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1968/1968 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1527 transition count 1954
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1527 transition count 1954
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 1519 transition count 1945
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 1519 transition count 1945
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 1519 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 1516 transition count 1939
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 1516 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 1514 transition count 1937
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 1514 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 1512 transition count 1934
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 1512 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 1511 transition count 1933
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 1511 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 1510 transition count 1932
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 1510 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 1509 transition count 1931
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 1509 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 1508 transition count 1930
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 1507 transition count 1929
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 1507 transition count 1929
Applied a total of 70 rules in 485 ms. Remains 1507 /1541 variables (removed 34) and now considering 1929/1968 (removed 39) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-21 05:27:08] [INFO ] Computed 4 invariants in 17 ms
[2024-05-21 05:27:08] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-21 05:27:08] [INFO ] Invariant cache hit.
[2024-05-21 05:27:09] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 1124 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-21 05:27:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60557ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60578ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1541 places, 1929/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62193 ms. Remains : 1507/1541 places, 1929/1968 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-308-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 436 ms.
Product exploration explored 100000 steps with 50000 reset in 406 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2106 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-308-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-308-LTLCardinality-06 finished in 63213 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((X(p0)&&(G(F(p2))||p1))))'
Support contains 6 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1968/1968 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1530 transition count 1957
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1530 transition count 1957
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 1524 transition count 1951
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 1524 transition count 1951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 1524 transition count 1950
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 1522 transition count 1948
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 1522 transition count 1948
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 1520 transition count 1946
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 1520 transition count 1946
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 1518 transition count 1943
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 1518 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1517 transition count 1942
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1517 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1516 transition count 1941
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1516 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1515 transition count 1940
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1515 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1514 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1514 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1513 transition count 1938
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1513 transition count 1938
Applied a total of 57 rules in 469 ms. Remains 1513 /1541 variables (removed 28) and now considering 1938/1968 (removed 30) transitions.
// Phase 1: matrix 1938 rows 1513 cols
[2024-05-21 05:28:11] [INFO ] Computed 4 invariants in 18 ms
[2024-05-21 05:28:11] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-21 05:28:11] [INFO ] Invariant cache hit.
[2024-05-21 05:28:12] [INFO ] Implicit Places using invariants and state equation in 997 ms returned []
Implicit Place search using SMT with State Equation took 1229 ms to find 0 implicit places.
Running 1937 sub problems to find dead transitions.
[2024-05-21 05:28:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1512/3451 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 1937/1937 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1937 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 0)
(s172 1)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 1)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 1)
(s292 1)
(s293 0)
(s294 0)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 0)
(s300 0)
(s301 0)
(s302 1)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 1)
(s310 0)
(s311 0)
(s312 1)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 1)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 1)
(s698 1)
(s699 0)
(s700 1)
(s701 0)
(s702 0)
(s703 1)
(s704 1)
(s705 1)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 1)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 1)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 1)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 0)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 0)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 0)
(s1029 0)
(s1030 0)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 0)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 0)
(s1046 0)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 0)
(s1053 0)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 0)
(s1062 0)
(s1063 0)
(s1064 0)
(s1065 0)
(s1066 0)
(s1067 0)
(s1068 0)
(s1069 0)
(s1070 0)
(s1071 0)
(s1072 0)
(s1073 0)
(s1074 0)
(s1075 0)
(s1076 0)
(s1077 0)
(s1078 0)
(s1079 0)
(s1080 0)
(s1081 0)
(s1082 0)
(s1083 0)
(s1084 0)
(s1085 0)
(s1086 0)
(s1087 0)
(s1088 0)
(s1089 0)
(s1090 0)
(s1091 0)
(s1092 0)
(s1093 0)
(s1094 1)
(s1095 0)
(s1096 0)
(s1097 0)
(s1098 0)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 0)
(s1103 0)
(s1104 0)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 0)
(s1111 0)
(s1112 0)
(s1113 1)
(s1114 0)
(s1115 0)
(s1116 0)
(s1117 1)
(s1118 0)
(s1119 0)
(s1120 0)
(s1121 1)
(s1122 0)
(s1123 0)
(s1124 0)
(s1125 0)
(s1126 0)
(s1127 0)
(s1128 0)
(s1129 0)
(s1130 0)
(s1131 0)
(s1132 0)
(s1133 0)
(s1134 0)
(s1135 0)
(s1136 0)
(s1137 0)
(s1138 0)
(s1139 0)
(s1140 0)
(s1141 0)
(s1142 0)
(s1143 0)
(s1144 0)
(s1145 0)
(s1146 0)
(s1147 0)
(s1148 0)
(s1149 0)
(s1150 0)
(s1151 0)
(s1152 0)
(s1153 0)
(s1154 0)
(s1155 0)
(s1156 0)
(s1157 0)
(s1158 0)
(s1159 0)
(s1160 0)
(s1161 0)
(s1162 0)
(s1163 0)
(s1164 0)
(s1165 0)
(s1166 0)
(s1167 0)
(s1168 0)
(s1169 0)
(s1170 0)
(s1171 0)
(s1172 0)
(s1173 0)
(s1174 0)
(s1175 0)
(s1176 0)
(s1177 0)
(s1178 0)
(s1179 0)
(s1180 0)
(s1181 0)
(s1182 0)
(s1183 0)
(s1184 0)
(s1185 0)
(s1186 0)
(s1187 0)
(s1188 0)
(s1189 0)
(s1190 0)
(s1191 0)
(s1192 0)
(s1193 0)
(s1194 0)
(s1195 0)
(s1196 0)
(s1197 0)
(s1198 0)
(s1199 0)
(s1200 0)
(s1201 0)
(s1202 0)
(s1203 0)
(s1204 0)
(s1205 0)
(s1206 0)
(s1207 0)
(s1208 0)
(s1209 0)
(s1210 0)
(s1211 0)
(s1212 0)
(s1213 0)
(s1214 0)
(s1215 0)
(s1216 0)
(s1217 0)
(s1218 0)
(s1219 0)
(s1220 0)
(s1221 0)
(s1222 0)
(s1223 0)
(s1224 0)
(s1225 0)
(s1226 0)
(s1227 0)
(s1228 0)
(s1229 0)
(s1230 0)
(s1231 0)
(s1232 0)
(s1233 0)
(s1234 0)
(s1235 0)
(s1236 0)
(s1237 0)
(s1238 0)
(s1239 0)
(s1240 0)
(s1241 0)
(s1242 0)
(s1243 0)
(s1244 0)
(s1245 0)
(s1246 0)
(s1247 0)
(s1248 0)
(s1249 0)
(s1250 0)
(s1251 0)
(s1252 0)
(s1253 0)
(s1254 0)
(s1255 0)
(s1256 0)
(s1257 0)
(s1258 0)
(s1259 0)
(s1260 0)
(s1261 0)
(s1262 0)
(s1263 0)
(s1264 0)
(s1265 0)
(s1266 0)
(s1267 0)
(s1268 0)
(s1269 0)
(s1270 0)
(s1271 0)
(s1272 0)
(s1273 0)
(s1274 0)
(s1275 0)
(s1276 0)
(s1277 0)
(s1278 0)
(s1279 0)
(s1280 0)
(s1281 0)
(s1282 0)
(s1283 0)
(s1284 0)
(s1285 0)
(s1286 0)
(s1287 0)
(s1288 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1512/3451 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 0/1937 constraints, Known Traps: 0/0 constraints]
After SMT, in 60561ms problems are : Problem set: 0 solved, 1937 unsolved
Search for dead transitions found 0 dead transitions in 60579ms
Starting structural reductions in LTL mode, iteration 1 : 1513/1541 places, 1938/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62283 ms. Remains : 1513/1541 places, 1938/1968 transitions.
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-308-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 406 ms.
Product exploration explored 100000 steps with 50000 reset in 394 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2115 edges and 1513 vertex of which 1504 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 15 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-308-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-308-LTLCardinality-08 finished in 63431 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(X((!X((G((F(p0)&&p0))||G(p1))) U p2))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1968/1968 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1529 transition count 1956
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1529 transition count 1956
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 1522 transition count 1948
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 1522 transition count 1948
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 1522 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 1519 transition count 1942
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 1519 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 1517 transition count 1940
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 1517 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 1515 transition count 1937
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 1515 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 1514 transition count 1936
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 1514 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 1513 transition count 1935
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 1513 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 1512 transition count 1934
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 1512 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 1511 transition count 1933
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 1511 transition count 1933
Applied a total of 62 rules in 402 ms. Remains 1511 /1541 variables (removed 30) and now considering 1933/1968 (removed 35) transitions.
// Phase 1: matrix 1933 rows 1511 cols
[2024-05-21 05:29:14] [INFO ] Computed 4 invariants in 16 ms
[2024-05-21 05:29:14] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-21 05:29:14] [INFO ] Invariant cache hit.
[2024-05-21 05:29:15] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 1183 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2024-05-21 05:29:15] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.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 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.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 0.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 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 0.0)
(s264 1.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 1.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.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 0.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 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.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 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3444 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1932/1932 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1932 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 0)
(s263 0)
(s264 1)
(s265 1)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 1)
(s294 0)
(s295 1)
(s296 0)
(s297 0)
(s298 1)
(s299 1)
(s300 0)
(s301 1)
(s302 1)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 1)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 1)
(s694 1)
(s695 0)
(s696 1)
(s697 0)
(s698 0)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 1)
(s712 1)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 0)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 0)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 0)
(s1029 0)
(s1030 0)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 0)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 0)
(s1046 0)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 0)
(s1053 0)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 0)
(s1062 0)
(s1063 0)
(s1064 0)
(s1065 0)
(s1066 0)
(s1067 0)
(s1068 0)
(s1069 0)
(s1070 0)
(s1071 0)
(s1072 0)
(s1073 0)
(s1074 0)
(s1075 0)
(s1076 0)
(s1077 0)
(s1078 0)
(s1079 0)
(s1080 0)
(s1081 0)
(s1082 0)
(s1083 0)
(s1084 0)
(s1085 0)
(s1086 0)
(s1087 0)
(s1088 0)
(s1089 0)
(s1090 0)
(s1091 0)
(s1092 0)
(s1093 0)
(s1094 0)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 0)
(s1100 0)
(s1101 0)
(s1102 1)
(s1103 1)
(s1104 0)
(s1105 1)
(s1106 0)
(s1107 0)
(s1108 0)
(s1109 1)
(s1110 1)
(s1111 0)
(s1112 0)
(s1113 1)
(s1114 1)
(s1115 0)
(s1116 0)
(s1117 0)
(s1118 0)
(s1119 0)
(s1120 0)
(s1121 0)
(s1122 0)
(s1123 0)
(s1124 0)
(s1125 0)
(s1126 0)
(s1127 0)
(s1128 0)
(s1129 0)
(s1130 0)
(s1131 0)
(s1132 0)
(s1133 0)
(s1134 0)
(s1135 0)
(s1136 0)
(s1137 0)
(s1138 0)
(s1139 0)
(s1140 0)
(s1141 0)
(s1142 0)
(s1143 0)
(s1144 0)
(s1145 0)
(s1146 0)
(s1147 0)
(s1148 0)
(s1149 0)
(s1150 0)
(s1151 0)
(s1152 0)
(s1153 0)
(s1154 0)
(s1155 0)
(s1156 0)
(s1157 0)
(s1158 0)
(s1159 0)
(s1160 0)
(s1161 0)
(s1162 0)
(s1163 0)
(s1164 0)
(s1165 0)
(s1166 0)
(s1167 0)
(s1168 0)
(s1169 0)
(s1170 0)
(s1171 0)
(s1172 0)
(s1173 0)
(s1174 0)
(s1175 0)
(s1176 0)
(s1177 0)
(s1178 0)
(s1179 0)
(s1180 0)
(s1181 0)
(s1182 0)
(s1183 0)
(s1184 0)
(s1185 0)
(s1186 0)
(s1187 0)
(s1188 0)
(s1189 0)
(s1190 0)
(s1191 0)
(s1192 0)
(s1193 0)
(s1194 0)
(s1195 0)
(s1196 0)
(s1197 0)
(s1198 0)
(s1199 0)
(s1200 0)
(s1201 0)
(s1202 0)
(s1203 0)
(s1204 0)
(s1205 0)
(s1206 0)
(s1207 0)
(s1208 0)
(s1209 0)
(s1210 0)
(s1211 0)
(s1212 0)
(s1213 0)
(s1214 0)
(s1215 0)
(s1216 0)
(s1217 0)
(s1218 0)
(s1219 0)
(s1220 0)
(s1221 0)
(s1222 0)
(s1223 0)
(s1224 0)
(s1225 0)
(s1226 0)
(s1227 0)
(s1228 0)
(s1229 0)
(s1230 0)
(s1231 0)
(s1232 0)
(s1233 0)
(s1234 0)
(s1235 0)
(s1236 0)
(s1237 0)
(s1238 0)
(s1239 0)
(s1240 0)
(s1241 0)
(s1242 0)
(s1243 0)
(s1244 0)
(s1245 0)
(s1246 0)
(s1247 0)
(s1248 0)
(s1249 0)
(s1250 0)
(s1251 0)
(s1252 0)
(s1253 0)
(s1254 0)
(s1255 0)
(s1256 0)
(s1257 0)
(s1258 0)
(s1259 0)
(s1260 0)
(s1261 0)
(s1262 0)
(s1263 0)
(s1264 0)
(s1265 0)
(s1266 0)
(s1267 0)
(s1268 0)
(s1269 0)
(s1270 0)
(s1271 0)
(s1272 0)
(s1273 0)
(s1274 0)
(s1275 0)
(s1276 0)
(s1277 0)
(s1278 0)
(s1279 0)
(s1280 0)
(s1281 0)
(s1282 0)
(s1283 0)
(s1284 0)
(s1285 0)
(s1286 0)
(s1287 0)
(s1288 0)
(s1289 0)
(s1290 0)
(s1291 0)
(s1292 0)
(s1293 0)
(s1294 0)
(s1295 0)
(s1296 0)
(s1297 0)
(s1298 0)
(s1299 0)
(s1300 timeout
0)
(s1301 0)
(s1302 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3444 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1932 constraints, Known Traps: 0/0 constraints]
After SMT, in 60517ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60533ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1541 places, 1933/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62125 ms. Remains : 1511/1541 places, 1933/1968 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p2), (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-308-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 428 ms.
Product exploration explored 100000 steps with 50000 reset in 364 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2110 edges and 1511 vertex of which 1502 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-308-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-308-LTLCardinality-09 finished in 63057 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' '!((p0 U G((p1||G((X(p2)&&F(p0)))))))'
Support contains 5 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1968/1968 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1527 transition count 1954
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1527 transition count 1954
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 1520 transition count 1946
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 1520 transition count 1946
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 1520 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 1518 transition count 1941
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 1518 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 1517 transition count 1940
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 1517 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 1516 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 1516 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 1515 transition count 1938
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 1515 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 1514 transition count 1937
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 1514 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 1513 transition count 1936
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 1513 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 1512 transition count 1935
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 1512 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 1511 transition count 1934
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 1511 transition count 1934
Applied a total of 62 rules in 448 ms. Remains 1511 /1541 variables (removed 30) and now considering 1934/1968 (removed 34) transitions.
// Phase 1: matrix 1934 rows 1511 cols
[2024-05-21 05:30:17] [INFO ] Computed 4 invariants in 14 ms
[2024-05-21 05:30:17] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-21 05:30:17] [INFO ] Invariant cache hit.
[2024-05-21 05:30:18] [INFO ] Implicit Places using invariants and state equation in 998 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
Running 1933 sub problems to find dead transitions.
[2024-05-21 05:30:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3445 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1933/1933 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1933 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
(s722 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 1)
(s154 0)
(s155 1)
(s156 1)
(s157 1)
(s158 0)
(s159 1)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 1)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 1)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 1)
(s300 1)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 0)
(s310 1)
(s311 1)
(s312 0)
(s313 0)
(s314 1)
(s315 1)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 1)
(s694 0)
(s695 1)
(s696 1)
(s697 0)
(s698 0)
(s699 0)
(s700 1)
(s701 1)
(s702 0)
(s703 1)
(s704 0)
(s705 0)
(s706 1)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 1)
(s712 0)
(s713 0)
(s714 0)
(s715 1)
(s716 1)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3445 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1933 constraints, Known Traps: 0/0 constraints]
After SMT, in 60495ms problems are : Problem set: 0 solved, 1933 unsolved
Search for dead transitions found 0 dead transitions in 60511ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1541 places, 1934/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62186 ms. Remains : 1511/1541 places, 1934/1968 transitions.
Stuttering acceptance computed with spot in 314 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p0)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), true]
Running random walk in product with property : CloudReconfiguration-PT-308-LTLCardinality-10
Product exploration explored 100000 steps with 703 reset in 165 ms.
Product exploration explored 100000 steps with 726 reset in 175 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2111 edges and 1511 vertex of which 1502 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X p0), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND p1 p0)), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 p0))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 145 ms. Reduced automaton from 7 states, 27 edges and 3 AP (stutter sensitive) to 7 states, 27 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p0)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), true]
RANDOM walk for 40000 steps (280 resets) in 353 ms. (112 steps per ms) remains 10/15 properties
BEST_FIRST walk for 40003 steps (80 resets) in 230 ms. (173 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (79 resets) in 356 ms. (112 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (78 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (79 resets) in 296 ms. (134 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (75 resets) in 406 ms. (98 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (75 resets) in 186 ms. (213 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (75 resets) in 55 ms. (714 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (74 resets) in 120 ms. (330 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (76 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
[2024-05-21 05:31:21] [INFO ] Invariant cache hit.
Problem apf4 is UNSAT
Problem apf8 is UNSAT
Problem apf10 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 693/698 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/698 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 803/1501 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1501 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1926/3427 variables, 1501/1505 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3427 variables, 0/1505 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 6/3433 variables, 3/1508 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3433 variables, 0/1508 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 3/3436 variables, 2/1510 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2/3438 variables, 1/1511 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3438 variables, 0/1511 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 2/3440 variables, 1/1512 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/3442 variables, 1/1513 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 2/3444 variables, 1/1514 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3444 variables, 0/1514 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Problem apf1 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 19 (OVERLAPS) 1/3445 variables, 1/1515 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3445 variables, 0/1515 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/3445 variables, 0/1515 constraints. Problems are: Problem set: 5 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3445/3445 variables, and 1515 constraints, problems are : Problem set: 5 solved, 4 unsolved in 2824 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1511/1511 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 693/698 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/698 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 803/1501 variables, 2/4 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1501 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1926/3427 variables, 1501/1505 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3427 variables, 1/1506 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 6/3433 variables, 3/1509 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3433 variables, 3/1512 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3433 variables, 0/1512 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3/3436 variables, 2/1514 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3436 variables, 0/1514 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/3438 variables, 1/1515 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3438 variables, 0/1515 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/3440 variables, 1/1516 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3440 variables, 0/1516 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/3442 variables, 1/1517 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3442 variables, 0/1517 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/3444 variables, 1/1518 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3444 variables, 0/1518 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 1/3445 variables, 1/1519 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3445 variables, 0/1519 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/3445 variables, 0/1519 constraints. Problems are: Problem set: 5 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3445/3445 variables, and 1519 constraints, problems are : Problem set: 5 solved, 4 unsolved in 2495 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1511/1511 constraints, PredecessorRefiner: 4/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 5356ms problems are : Problem set: 5 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 514 ms.
Support contains 5 out of 1511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1511/1511 places, 1934/1934 transitions.
Graph (trivial) has 1839 edges and 1511 vertex of which 671 / 1511 are part of one of the 61 SCC in 2 ms
Free SCC test removed 610 places
Drop transitions (Empty/Sink Transition effects.) removed 769 transitions
Reduce isomorphic transitions removed 769 transitions.
Graph (complete) has 1337 edges and 901 vertex of which 892 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 493 transitions
Trivial Post-agglo rules discarded 493 transitions
Performed 493 trivial Post agglomeration. Transition count delta: 493
Iterating post reduction 0 with 500 rules applied. Total rules applied 502 place count 892 transition count 661
Reduce places removed 493 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 1 with 550 rules applied. Total rules applied 1052 place count 399 transition count 604
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 39 rules applied. Total rules applied 1091 place count 362 transition count 602
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1094 place count 361 transition count 600
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 1098 place count 360 transition count 597
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 1102 place count 358 transition count 595
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1104 place count 356 transition count 595
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 54 Pre rules applied. Total rules applied 1104 place count 356 transition count 541
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 7 with 108 rules applied. Total rules applied 1212 place count 302 transition count 541
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1222 place count 292 transition count 526
Iterating global reduction 7 with 10 rules applied. Total rules applied 1232 place count 292 transition count 526
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 3 rules applied. Total rules applied 1235 place count 292 transition count 523
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1238 place count 289 transition count 523
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1244 place count 283 transition count 516
Iterating global reduction 9 with 6 rules applied. Total rules applied 1250 place count 283 transition count 516
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1255 place count 283 transition count 511
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1256 place count 282 transition count 505
Iterating global reduction 10 with 1 rules applied. Total rules applied 1257 place count 282 transition count 505
Performed 147 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 10 with 294 rules applied. Total rules applied 1551 place count 135 transition count 262
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 1566 place count 135 transition count 247
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1569 place count 132 transition count 244
Iterating global reduction 11 with 3 rules applied. Total rules applied 1572 place count 132 transition count 244
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 1598 place count 119 transition count 228
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 11 with 15 rules applied. Total rules applied 1613 place count 119 transition count 213
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1615 place count 118 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1617 place count 118 transition count 210
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1619 place count 117 transition count 209
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1621 place count 117 transition count 207
Performed 34 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 14 with 68 rules applied. Total rules applied 1689 place count 83 transition count 241
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 14 with 47 rules applied. Total rules applied 1736 place count 83 transition count 194
Discarding 23 places :
Symmetric choice reduction at 15 with 23 rule applications. Total rules 1759 place count 60 transition count 164
Iterating global reduction 15 with 23 rules applied. Total rules applied 1782 place count 60 transition count 164
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 15 with 14 rules applied. Total rules applied 1796 place count 60 transition count 150
Discarding 6 places :
Symmetric choice reduction at 16 with 6 rule applications. Total rules 1802 place count 54 transition count 138
Iterating global reduction 16 with 6 rules applied. Total rules applied 1808 place count 54 transition count 138
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 1813 place count 54 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 17 with 25 rules applied. Total rules applied 1838 place count 54 transition count 108
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 1840 place count 52 transition count 102
Iterating global reduction 17 with 2 rules applied. Total rules applied 1842 place count 52 transition count 102
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 1844 place count 50 transition count 100
Iterating global reduction 17 with 2 rules applied. Total rules applied 1846 place count 50 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 1848 place count 50 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 1850 place count 49 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 1852 place count 49 transition count 95
Free-agglomeration rule applied 3 times.
Iterating global reduction 18 with 3 rules applied. Total rules applied 1855 place count 49 transition count 92
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 1858 place count 46 transition count 92
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 1859 place count 46 transition count 92
Applied a total of 1859 rules in 59 ms. Remains 46 /1511 variables (removed 1465) and now considering 92/1934 (removed 1842) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 46/1511 places, 92/1934 transitions.
RANDOM walk for 40000 steps (750 resets) in 68 ms. (579 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (9 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
[2024-05-21 05:31:27] [INFO ] Flow matrix only has 87 transitions (discarded 5 similar events)
// Phase 1: matrix 87 rows 46 cols
[2024-05-21 05:31:27] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 05:31:27] [INFO ] State equation strengthened by 27 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/127 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 26/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/133 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/133 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 77 constraints, problems are : Problem set: 0 solved, 1 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 46/46 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 05:31:28] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 7 ms to minimize.
Problem apf9 is UNSAT
After SMT solving in domain Int declared 41/133 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/46 constraints, ReadFeed: 0/27 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 404ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X p0), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND p1 p0)), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 p0))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (G (OR (NOT p2) p0)), (G (OR p1 p2 (NOT p0))), (G (OR p1 (NOT p2) p0)), (G (OR p1 p2 p0)), (G (OR p1 p0)), (G (OR (NOT p1) (NOT p2) p0))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (NOT (OR p1 (NOT p0)))), (F (NOT p2)), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 37 factoid took 524 ms. Reduced automaton from 7 states, 27 edges and 3 AP (stutter sensitive) to 6 states, 29 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Support contains 5 out of 1511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1511/1511 places, 1934/1934 transitions.
Graph (trivial) has 1839 edges and 1511 vertex of which 671 / 1511 are part of one of the 61 SCC in 0 ms
Free SCC test removed 610 places
Ensure Unique test removed 707 transitions
Reduce isomorphic transitions removed 707 transitions.
Graph (complete) has 1398 edges and 901 vertex of which 892 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 478 transitions
Trivial Post-agglo rules discarded 478 transitions
Performed 478 trivial Post agglomeration. Transition count delta: 478
Iterating post reduction 0 with 478 rules applied. Total rules applied 480 place count 891 transition count 743
Reduce places removed 478 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 502 rules applied. Total rules applied 982 place count 413 transition count 719
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 14 rules applied. Total rules applied 996 place count 401 transition count 717
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 999 place count 400 transition count 715
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 1003 place count 399 transition count 712
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 1007 place count 397 transition count 710
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1009 place count 395 transition count 710
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 51 Pre rules applied. Total rules applied 1009 place count 395 transition count 659
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 1111 place count 344 transition count 659
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1125 place count 330 transition count 636
Iterating global reduction 7 with 14 rules applied. Total rules applied 1139 place count 330 transition count 636
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 3 rules applied. Total rules applied 1142 place count 330 transition count 633
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1145 place count 327 transition count 633
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 1153 place count 319 transition count 622
Iterating global reduction 9 with 8 rules applied. Total rules applied 1161 place count 319 transition count 622
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1166 place count 319 transition count 617
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1167 place count 318 transition count 615
Iterating global reduction 10 with 1 rules applied. Total rules applied 1168 place count 318 transition count 615
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1169 place count 317 transition count 613
Iterating global reduction 10 with 1 rules applied. Total rules applied 1170 place count 317 transition count 613
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1171 place count 316 transition count 611
Iterating global reduction 10 with 1 rules applied. Total rules applied 1172 place count 316 transition count 611
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1173 place count 315 transition count 609
Iterating global reduction 10 with 1 rules applied. Total rules applied 1174 place count 315 transition count 609
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1175 place count 314 transition count 607
Iterating global reduction 10 with 1 rules applied. Total rules applied 1176 place count 314 transition count 607
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1177 place count 313 transition count 600
Iterating global reduction 10 with 1 rules applied. Total rules applied 1178 place count 313 transition count 600
Performed 142 Post agglomeration using F-continuation condition with reduction of 79 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 10 with 284 rules applied. Total rules applied 1462 place count 171 transition count 379
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 1473 place count 171 transition count 368
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1477 place count 167 transition count 363
Iterating global reduction 11 with 4 rules applied. Total rules applied 1481 place count 167 transition count 363
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 1507 place count 154 transition count 347
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 1521 place count 154 transition count 333
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1522 place count 153 transition count 331
Iterating global reduction 12 with 1 rules applied. Total rules applied 1523 place count 153 transition count 331
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 12 with 40 rules applied. Total rules applied 1563 place count 133 transition count 368
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 12 with 22 rules applied. Total rules applied 1585 place count 133 transition count 346
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1594 place count 124 transition count 328
Iterating global reduction 13 with 9 rules applied. Total rules applied 1603 place count 124 transition count 328
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1609 place count 124 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 14 with 43 rules applied. Total rules applied 1652 place count 124 transition count 279
Applied a total of 1652 rules in 73 ms. Remains 124 /1511 variables (removed 1387) and now considering 279/1934 (removed 1655) transitions.
[2024-05-21 05:31:29] [INFO ] Flow matrix only has 222 transitions (discarded 57 similar events)
// Phase 1: matrix 222 rows 124 cols
[2024-05-21 05:31:29] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:31:29] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-21 05:31:29] [INFO ] Flow matrix only has 222 transitions (discarded 57 similar events)
[2024-05-21 05:31:29] [INFO ] Invariant cache hit.
[2024-05-21 05:31:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 05:31:29] [INFO ] Implicit Places using invariants and state equation in 150 ms returned [15, 81]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 296 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/1511 places, 279/1934 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 120 transition count 277
Applied a total of 4 rules in 4 ms. Remains 120 /122 variables (removed 2) and now considering 277/279 (removed 2) transitions.
[2024-05-21 05:31:29] [INFO ] Flow matrix only has 220 transitions (discarded 57 similar events)
// Phase 1: matrix 220 rows 120 cols
[2024-05-21 05:31:29] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:31:29] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 05:31:29] [INFO ] Flow matrix only has 220 transitions (discarded 57 similar events)
[2024-05-21 05:31:29] [INFO ] Invariant cache hit.
[2024-05-21 05:31:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 05:31:29] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/1511 places, 277/1934 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 554 ms. Remains : 120/1511 places, 277/1934 transitions.
Computed a total of 5 stabilizing places and 19 stable transitions
Computed a total of 5 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT p2)), (X (NOT (OR (AND p1 p0) (AND p2 p0)))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (OR (AND p1 p2) (AND p1 p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT p0)), (X p1), (X (AND p1 (NOT p0))), (X (X p2)), (X (X (OR (AND p1 p0) (AND p2 p0)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (OR (AND p1 p2) (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 229 ms. Reduced automaton from 6 states, 29 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[true, (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (3585 resets) in 909 ms. (43 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40003 steps (147 resets) in 225 ms. (177 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (53 resets) in 166 ms. (239 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (123 resets) in 167 ms. (238 steps per ms) remains 3/3 properties
[2024-05-21 05:31:30] [INFO ] Flow matrix only has 220 transitions (discarded 57 similar events)
[2024-05-21 05:31:30] [INFO ] Invariant cache hit.
[2024-05-21 05:31:30] [INFO ] State equation strengthened by 4 read => feed constraints.
Problem apf3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 117/132 variables, 11/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 200/332 variables, 97/113 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 3/116 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/116 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem apf2 is UNSAT
At refinement iteration 8 (OVERLAPS) 7/339 variables, 7/123 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/123 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/340 variables, 1/124 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/124 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/340 variables, 0/124 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 124 constraints, problems are : Problem set: 2 solved, 1 unsolved in 103 ms.
Refiners :[State Equation: 120/120 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 117/132 variables, 11/16 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 1/17 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 200/332 variables, 97/114 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 3/117 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 0/117 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/339 variables, 7/124 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/124 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/340 variables, 1/125 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 0/125 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/340 variables, 0/125 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 125 constraints, problems are : Problem set: 2 solved, 1 unsolved in 117 ms.
Refiners :[State Equation: 120/120 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 229ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 277/277 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 120 transition count 211
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 75 place count 111 transition count 211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 75 place count 111 transition count 210
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 110 transition count 210
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 119 place count 89 transition count 189
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 128 place count 89 transition count 180
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 137 place count 80 transition count 171
Iterating global reduction 3 with 9 rules applied. Total rules applied 146 place count 80 transition count 171
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 149 place count 80 transition count 168
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 169 place count 70 transition count 158
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 179 place count 70 transition count 148
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 187 place count 62 transition count 138
Iterating global reduction 5 with 8 rules applied. Total rules applied 195 place count 62 transition count 138
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 202 place count 62 transition count 131
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 220 place count 53 transition count 136
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 230 place count 53 transition count 126
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 236 place count 47 transition count 118
Iterating global reduction 7 with 6 rules applied. Total rules applied 242 place count 47 transition count 118
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 248 place count 47 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 261 place count 47 transition count 99
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 263 place count 45 transition count 93
Iterating global reduction 8 with 2 rules applied. Total rules applied 265 place count 45 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 267 place count 45 transition count 91
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 269 place count 43 transition count 89
Iterating global reduction 9 with 2 rules applied. Total rules applied 271 place count 43 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 275 place count 43 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 277 place count 42 transition count 84
Free-agglomeration rule applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 280 place count 42 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 283 place count 39 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 284 place count 39 transition count 81
Applied a total of 284 rules in 25 ms. Remains 39 /120 variables (removed 81) and now considering 81/277 (removed 196) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 39/120 places, 81/277 transitions.
RANDOM walk for 40000 steps (573 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Probably explored full state space saw : 5137 states, properties seen :0
Probabilistic random walk after 22384 steps, saw 5137 distinct states, run finished after 33 ms. (steps per millisecond=678 ) properties seen :0
Explored full state space saw : 5137 states, properties seen :0
Exhaustive walk after 22384 steps, saw 5137 distinct states, run finished after 19 ms. (steps per millisecond=1178 ) properties seen :0
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT p2)), (X (NOT (OR (AND p1 p0) (AND p2 p0)))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (OR (AND p1 p2) (AND p1 p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT p0)), (X p1), (X (AND p1 (NOT p0))), (X (X p2)), (X (X (OR (AND p1 p0) (AND p2 p0)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (OR (AND p1 p2) (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (G (OR (NOT p2) p0 p1)), (G (OR p2 p0 p1)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 34 factoid took 325 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[true, (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 127 ms :[true, (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 7686 reset in 161 ms.
Product exploration explored 100000 steps with 7583 reset in 183 ms.
Built C files in :
/tmp/ltsmin561944010584182411
[2024-05-21 05:31:31] [INFO ] Computing symmetric may disable matrix : 277 transitions.
[2024-05-21 05:31:31] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 05:31:31] [INFO ] Computing symmetric may enable matrix : 277 transitions.
[2024-05-21 05:31:31] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 05:31:31] [INFO ] Computing Do-Not-Accords matrix : 277 transitions.
[2024-05-21 05:31:31] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 05:31:31] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin561944010584182411
Running compilation step : cd /tmp/ltsmin561944010584182411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 727 ms.
Running link step : cd /tmp/ltsmin561944010584182411;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin561944010584182411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16779430626761993317.hoa' '--buchi-type=spotba'
LTSmin run took 862 ms.
FORMULA CloudReconfiguration-PT-308-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudReconfiguration-PT-308-LTLCardinality-10 finished in 76379 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 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 1968/1968 transitions.
Graph (trivial) has 1875 edges and 1541 vertex of which 700 / 1541 are part of one of the 64 SCC in 2 ms
Free SCC test removed 636 places
Ensure Unique test removed 737 transitions
Reduce isomorphic transitions removed 737 transitions.
Graph (complete) has 1403 edges and 905 vertex of which 896 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 491 transitions
Trivial Post-agglo rules discarded 491 transitions
Performed 491 trivial Post agglomeration. Transition count delta: 491
Iterating post reduction 0 with 491 rules applied. Total rules applied 493 place count 895 transition count 734
Reduce places removed 491 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 516 rules applied. Total rules applied 1009 place count 404 transition count 709
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1021 place count 392 transition count 709
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 1021 place count 392 transition count 662
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1115 place count 345 transition count 662
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1131 place count 329 transition count 637
Iterating global reduction 3 with 16 rules applied. Total rules applied 1147 place count 329 transition count 637
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 1148 place count 329 transition count 636
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1149 place count 328 transition count 636
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1157 place count 320 transition count 626
Iterating global reduction 5 with 8 rules applied. Total rules applied 1165 place count 320 transition count 626
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1171 place count 320 transition count 620
Performed 151 Post agglomeration using F-continuation condition with reduction of 86 identical transitions.
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 6 with 302 rules applied. Total rules applied 1473 place count 169 transition count 383
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1486 place count 169 transition count 370
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1491 place count 164 transition count 363
Iterating global reduction 7 with 5 rules applied. Total rules applied 1496 place count 164 transition count 363
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1497 place count 163 transition count 361
Iterating global reduction 7 with 1 rules applied. Total rules applied 1498 place count 163 transition count 361
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1499 place count 162 transition count 359
Iterating global reduction 7 with 1 rules applied. Total rules applied 1500 place count 162 transition count 359
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1501 place count 161 transition count 357
Iterating global reduction 7 with 1 rules applied. Total rules applied 1502 place count 161 transition count 357
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1503 place count 160 transition count 350
Iterating global reduction 7 with 1 rules applied. Total rules applied 1504 place count 160 transition count 350
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1526 place count 149 transition count 338
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 1538 place count 149 transition count 326
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1539 place count 148 transition count 324
Iterating global reduction 8 with 1 rules applied. Total rules applied 1540 place count 148 transition count 324
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 8 with 36 rules applied. Total rules applied 1576 place count 130 transition count 360
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 1597 place count 130 transition count 339
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1606 place count 121 transition count 321
Iterating global reduction 9 with 9 rules applied. Total rules applied 1615 place count 121 transition count 321
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1621 place count 121 transition count 315
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 10 with 40 rules applied. Total rules applied 1661 place count 121 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1662 place count 120 transition count 274
Applied a total of 1662 rules in 66 ms. Remains 120 /1541 variables (removed 1421) and now considering 274/1968 (removed 1694) transitions.
[2024-05-21 05:31:33] [INFO ] Flow matrix only has 215 transitions (discarded 59 similar events)
// Phase 1: matrix 215 rows 120 cols
[2024-05-21 05:31:33] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 05:31:33] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 05:31:33] [INFO ] Flow matrix only has 215 transitions (discarded 59 similar events)
[2024-05-21 05:31:33] [INFO ] Invariant cache hit.
[2024-05-21 05:31:33] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 05:31:33] [INFO ] Implicit Places using invariants and state equation in 118 ms returned [13, 79]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 173 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/1541 places, 274/1968 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 272
Applied a total of 2 rules in 4 ms. Remains 116 /118 variables (removed 2) and now considering 272/274 (removed 2) transitions.
[2024-05-21 05:31:33] [INFO ] Flow matrix only has 213 transitions (discarded 59 similar events)
// Phase 1: matrix 213 rows 116 cols
[2024-05-21 05:31:33] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 05:31:33] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 05:31:33] [INFO ] Flow matrix only has 213 transitions (discarded 59 similar events)
[2024-05-21 05:31:33] [INFO ] Invariant cache hit.
[2024-05-21 05:31:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 05:31:34] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/1541 places, 272/1968 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 392 ms. Remains : 116/1541 places, 272/1968 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-308-LTLCardinality-13
Stuttering criterion allowed to conclude after 59854 steps with 5205 reset in 76 ms.
FORMULA CloudReconfiguration-PT-308-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-308-LTLCardinality-13 finished in 547 ms.
All properties solved by simple procedures.
Total runtime 697793 ms.

BK_STOP 1716269494221

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="CloudReconfiguration-PT-308"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is CloudReconfiguration-PT-308, 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 r092-tall-171624188700171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-308.tgz
mv CloudReconfiguration-PT-308 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 ;