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.r069-tall-171620504800563.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is CloudDeployment-PT-3b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504800563
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.5K Apr 22 14:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 15:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 189K Apr 11 15:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 11 15:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 15:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 308K 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 CloudDeployment-PT-3b-LTLCardinality-00
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-01
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-02
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-03
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-04
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-05
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-06
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-07
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-08
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-09
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-10
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-11
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-12
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-13
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-14
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716465289082

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-3b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 11:54:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 11:54:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 11:54:50] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-05-23 11:54:50] [INFO ] Transformed 859 places.
[2024-05-23 11:54:50] [INFO ] Transformed 1152 transitions.
[2024-05-23 11:54:50] [INFO ] Found NUPN structural information;
[2024-05-23 11:54:50] [INFO ] Parsed PT model containing 859 places and 1152 transitions and 4030 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CloudDeployment-PT-3b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 859 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 859/859 places, 1152/1152 transitions.
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 855 transition count 1152
Discarding 193 places :
Symmetric choice reduction at 1 with 193 rule applications. Total rules 197 place count 662 transition count 902
Iterating global reduction 1 with 193 rules applied. Total rules applied 390 place count 662 transition count 902
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 456 place count 596 transition count 836
Iterating global reduction 1 with 66 rules applied. Total rules applied 522 place count 596 transition count 836
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 525 place count 596 transition count 833
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 534 place count 587 transition count 824
Iterating global reduction 2 with 9 rules applied. Total rules applied 543 place count 587 transition count 824
Applied a total of 543 rules in 185 ms. Remains 587 /859 variables (removed 272) and now considering 824/1152 (removed 328) transitions.
// Phase 1: matrix 824 rows 587 cols
[2024-05-23 11:54:50] [INFO ] Computed 9 invariants in 25 ms
[2024-05-23 11:54:51] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-23 11:54:51] [INFO ] Invariant cache hit.
[2024-05-23 11:54:51] [INFO ] Implicit Places using invariants and state equation in 480 ms returned [375]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 829 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 586/859 places, 824/1152 transitions.
Applied a total of 0 rules in 18 ms. Remains 586 /586 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1055 ms. Remains : 586/859 places, 824/1152 transitions.
Support contains 41 out of 586 places after structural reductions.
[2024-05-23 11:54:51] [INFO ] Flatten gal took : 96 ms
[2024-05-23 11:54:51] [INFO ] Flatten gal took : 56 ms
[2024-05-23 11:54:52] [INFO ] Input system was already deterministic with 824 transitions.
Support contains 37 out of 586 places (down from 41) after GAL structural reductions.
RANDOM walk for 40000 steps (416 resets) in 1433 ms. (27 steps per ms) remains 10/21 properties
BEST_FIRST walk for 40004 steps (61 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (76 resets) in 89 ms. (444 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (76 resets) in 72 ms. (547 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (74 resets) in 145 ms. (274 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (71 resets) in 81 ms. (487 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (75 resets) in 88 ms. (449 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (84 resets) in 65 ms. (606 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (73 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (68 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
// Phase 1: matrix 824 rows 586 cols
[2024-05-23 11:54:52] [INFO ] Computed 8 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 73/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 47/140 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 334/474 variables, 140/148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 318/792 variables, 138/286 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/792 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 272/1064 variables, 123/409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1064 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 236/1300 variables, 111/520 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1300 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 81/1381 variables, 56/576 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1381 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 24/1405 variables, 14/590 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1405 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 5/1410 variables, 4/594 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1410 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 0/1410 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1410/1410 variables, and 594 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1501 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 586/586 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/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 73/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 47/140 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 334/474 variables, 140/148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 318/792 variables, 138/288 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/792 variables, 7/295 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/792 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 272/1064 variables, 123/418 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1064 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 236/1300 variables, 111/529 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1300 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 81/1381 variables, 56/585 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1381 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 24/1405 variables, 14/599 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1405 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 5/1410 variables, 4/603 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1410 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 0/1410 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1410/1410 variables, and 603 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2229 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 3778ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 8 properties in 1230 ms.
Support contains 2 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 824/824 transitions.
Graph (trivial) has 610 edges and 586 vertex of which 214 / 586 are part of one of the 24 SCC in 4 ms
Free SCC test removed 190 places
Drop transitions (Empty/Sink Transition effects.) removed 244 transitions
Reduce isomorphic transitions removed 244 transitions.
Graph (complete) has 1174 edges and 396 vertex of which 385 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 167 transitions
Trivial Post-agglo rules discarded 167 transitions
Performed 167 trivial Post agglomeration. Transition count delta: 167
Iterating post reduction 0 with 179 rules applied. Total rules applied 181 place count 385 transition count 401
Reduce places removed 167 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 168 rules applied. Total rules applied 349 place count 218 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 350 place count 217 transition count 400
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 350 place count 217 transition count 373
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 404 place count 190 transition count 373
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 417 place count 177 transition count 360
Iterating global reduction 3 with 13 rules applied. Total rules applied 430 place count 177 transition count 360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 431 place count 177 transition count 359
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 431 place count 177 transition count 352
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 445 place count 170 transition count 352
Performed 49 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 543 place count 121 transition count 301
Performed 21 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 585 place count 100 transition count 375
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 602 place count 100 transition count 358
Drop transitions (Redundant composition of simpler transitions.) removed 63 transitions
Redundant transition composition rules discarded 63 transitions
Iterating global reduction 5 with 63 rules applied. Total rules applied 665 place count 100 transition count 295
Free-agglomeration rule applied 30 times with reduction of 6 identical transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 695 place count 100 transition count 259
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 403 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 82 rules applied. Total rules applied 777 place count 69 transition count 208
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 778 place count 69 transition count 207
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 781 place count 66 transition count 195
Iterating global reduction 7 with 3 rules applied. Total rules applied 784 place count 66 transition count 195
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 7 with 27 rules applied. Total rules applied 811 place count 66 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 812 place count 65 transition count 167
Applied a total of 812 rules in 142 ms. Remains 65 /586 variables (removed 521) and now considering 167/824 (removed 657) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 65/586 places, 167/824 transitions.
RANDOM walk for 284 steps (4 resets) in 13 ms. (20 steps per ms) remains 0/1 properties
FORMULA CloudDeployment-PT-3b-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 88 stabilizing places and 209 stable transitions
Graph (complete) has 1496 edges and 586 vertex of which 575 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.11 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((G(!p0)||(!p0&&F(p1))))))'
Support contains 4 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 824/824 transitions.
Graph (trivial) has 603 edges and 586 vertex of which 202 / 586 are part of one of the 22 SCC in 2 ms
Free SCC test removed 180 places
Ensure Unique test removed 207 transitions
Reduce isomorphic transitions removed 207 transitions.
Graph (complete) has 1257 edges and 406 vertex of which 395 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 169 transitions
Trivial Post-agglo rules discarded 169 transitions
Performed 169 trivial Post agglomeration. Transition count delta: 169
Iterating post reduction 0 with 169 rules applied. Total rules applied 171 place count 394 transition count 444
Reduce places removed 169 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 171 rules applied. Total rules applied 342 place count 225 transition count 442
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 344 place count 223 transition count 442
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 344 place count 223 transition count 417
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 394 place count 198 transition count 417
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 405 place count 187 transition count 406
Iterating global reduction 3 with 11 rules applied. Total rules applied 416 place count 187 transition count 406
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 417 place count 187 transition count 405
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 417 place count 187 transition count 401
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 425 place count 183 transition count 401
Performed 57 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 539 place count 126 transition count 343
Performed 19 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 577 place count 107 transition count 421
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 593 place count 107 transition count 405
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 5 with 50 rules applied. Total rules applied 643 place count 107 transition count 355
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 644 place count 106 transition count 354
Applied a total of 644 rules in 72 ms. Remains 106 /586 variables (removed 480) and now considering 354/824 (removed 470) transitions.
[2024-05-23 11:54:58] [INFO ] Flow matrix only has 282 transitions (discarded 72 similar events)
// Phase 1: matrix 282 rows 106 cols
[2024-05-23 11:54:58] [INFO ] Computed 3 invariants in 2 ms
[2024-05-23 11:54:58] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-23 11:54:58] [INFO ] Flow matrix only has 282 transitions (discarded 72 similar events)
[2024-05-23 11:54:58] [INFO ] Invariant cache hit.
[2024-05-23 11:54:58] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 11:54:58] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-05-23 11:54:58] [INFO ] Redundant transitions in 216 ms returned []
Running 330 sub problems to find dead transitions.
[2024-05-23 11:54:58] [INFO ] Flow matrix only has 282 transitions (discarded 72 similar events)
[2024-05-23 11:54:58] [INFO ] Invariant cache hit.
[2024-05-23 11:54:58] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (OVERLAPS) 281/384 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (OVERLAPS) 3/387 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (OVERLAPS) 0/387 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/388 variables, and 121 constraints, problems are : Problem set: 0 solved, 330 unsolved in 9259 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (OVERLAPS) 281/384 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 16/134 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (OVERLAPS) 3/387 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 314/451 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/388 variables, and 451 constraints, problems are : Problem set: 0 solved, 330 unsolved in 14785 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints]
After SMT, in 24577ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 24584ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/586 places, 354/824 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25072 ms. Remains : 106/586 places, 354/824 transitions.
Stuttering acceptance computed with spot in 252 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : CloudDeployment-PT-3b-LTLCardinality-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA CloudDeployment-PT-3b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLCardinality-00 finished in 25402 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))||(F(p1)&&G(p2))))'
Support contains 5 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 824/824 transitions.
Graph (trivial) has 603 edges and 586 vertex of which 189 / 586 are part of one of the 23 SCC in 2 ms
Free SCC test removed 166 places
Ensure Unique test removed 188 transitions
Reduce isomorphic transitions removed 188 transitions.
Graph (complete) has 1285 edges and 420 vertex of which 409 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 169 transitions
Trivial Post-agglo rules discarded 169 transitions
Performed 169 trivial Post agglomeration. Transition count delta: 169
Iterating post reduction 0 with 169 rules applied. Total rules applied 171 place count 408 transition count 463
Reduce places removed 169 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 173 rules applied. Total rules applied 344 place count 239 transition count 459
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 347 place count 236 transition count 459
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 347 place count 236 transition count 433
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 399 place count 210 transition count 433
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 410 place count 199 transition count 422
Iterating global reduction 3 with 11 rules applied. Total rules applied 421 place count 199 transition count 422
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 422 place count 199 transition count 421
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 422 place count 199 transition count 416
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 432 place count 194 transition count 416
Performed 61 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 554 place count 133 transition count 353
Performed 20 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 594 place count 113 transition count 416
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 610 place count 113 transition count 400
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 5 with 31 rules applied. Total rules applied 641 place count 113 transition count 369
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 642 place count 112 transition count 368
Applied a total of 642 rules in 72 ms. Remains 112 /586 variables (removed 474) and now considering 368/824 (removed 456) transitions.
[2024-05-23 11:55:23] [INFO ] Flow matrix only has 298 transitions (discarded 70 similar events)
// Phase 1: matrix 298 rows 112 cols
[2024-05-23 11:55:23] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 11:55:23] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-23 11:55:23] [INFO ] Flow matrix only has 298 transitions (discarded 70 similar events)
[2024-05-23 11:55:23] [INFO ] Invariant cache hit.
[2024-05-23 11:55:23] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 11:55:24] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-23 11:55:24] [INFO ] Redundant transitions in 202 ms returned []
Running 347 sub problems to find dead transitions.
[2024-05-23 11:55:24] [INFO ] Flow matrix only has 298 transitions (discarded 70 similar events)
[2024-05-23 11:55:24] [INFO ] Invariant cache hit.
[2024-05-23 11:55:24] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 297/405 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 13/124 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 5 (OVERLAPS) 4/409 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 7 (OVERLAPS) 0/409 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 347 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/410 variables, and 128 constraints, problems are : Problem set: 0 solved, 347 unsolved in 10574 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 347 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 297/405 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 13/124 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 27/151 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 6 (OVERLAPS) 4/409 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 320/475 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 9 (OVERLAPS) 0/409 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 347 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/410 variables, and 475 constraints, problems are : Problem set: 0 solved, 347 unsolved in 17049 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 0/0 constraints]
After SMT, in 28098ms problems are : Problem set: 0 solved, 347 unsolved
Search for dead transitions found 0 dead transitions in 28102ms
Starting structural reductions in SI_LTL mode, iteration 1 : 112/586 places, 368/824 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28591 ms. Remains : 112/586 places, 368/824 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-3b-LTLCardinality-01
Product exploration explored 100000 steps with 5521 reset in 290 ms.
Product exploration explored 100000 steps with 5522 reset in 249 ms.
Computed a total of 33 stabilizing places and 217 stable transitions
Computed a total of 33 stabilizing places and 217 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 114 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2308 resets) in 795 ms. (50 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (261 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2039648 steps, run timeout after 3001 ms. (steps per millisecond=679 ) properties seen :0 out of 1
Probabilistic random walk after 2039648 steps, saw 312270 distinct states, run finished after 3004 ms. (steps per millisecond=678 ) properties seen :0
[2024-05-23 11:55:56] [INFO ] Flow matrix only has 298 transitions (discarded 70 similar events)
[2024-05-23 11:55:56] [INFO ] Invariant cache hit.
[2024-05-23 11:55:56] [INFO ] State equation strengthened by 13 read => feed constraints.
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) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/53 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 205/258 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/260 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 137/397 variables, 60/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 11/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/409 variables, 10/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/409 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/409 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/410 variables, and 128 constraints, problems are : Problem set: 0 solved, 1 unsolved in 98 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 13/13 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) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/53 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 205/258 variables, 32/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/260 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 137/397 variables, 60/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/397 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/409 variables, 10/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/409 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/409 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/410 variables, and 129 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 224ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 368/368 transitions.
Graph (trivial) has 101 edges and 112 vertex of which 7 / 112 are part of one of the 2 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 107 transition count 324
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 3 place count 106 transition count 324
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 17 place count 99 transition count 355
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 23 place count 99 transition count 349
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 1 with 45 rules applied. Total rules applied 68 place count 99 transition count 304
Free-agglomeration rule applied 29 times with reduction of 6 identical transitions.
Iterating global reduction 1 with 29 rules applied. Total rules applied 97 place count 99 transition count 269
Reduce places removed 29 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 47 transitions.
Graph (complete) has 406 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 77 rules applied. Total rules applied 174 place count 69 transition count 222
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 175 place count 69 transition count 221
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 177 place count 67 transition count 213
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 67 transition count 213
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 206 place count 67 transition count 186
Applied a total of 206 rules in 32 ms. Remains 67 /112 variables (removed 45) and now considering 186/368 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 67/112 places, 186/368 transitions.
RANDOM walk for 9330 steps (267 resets) in 18 ms. (491 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 11 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 112 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 368/368 transitions.
Applied a total of 0 rules in 14 ms. Remains 112 /112 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2024-05-23 11:55:57] [INFO ] Flow matrix only has 298 transitions (discarded 70 similar events)
[2024-05-23 11:55:57] [INFO ] Invariant cache hit.
[2024-05-23 11:55:57] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-23 11:55:57] [INFO ] Flow matrix only has 298 transitions (discarded 70 similar events)
[2024-05-23 11:55:57] [INFO ] Invariant cache hit.
[2024-05-23 11:55:57] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 11:55:57] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-23 11:55:57] [INFO ] Redundant transitions in 197 ms returned []
Running 347 sub problems to find dead transitions.
[2024-05-23 11:55:57] [INFO ] Flow matrix only has 298 transitions (discarded 70 similar events)
[2024-05-23 11:55:57] [INFO ] Invariant cache hit.
[2024-05-23 11:55:57] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 297/405 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 13/124 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 5 (OVERLAPS) 4/409 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 7 (OVERLAPS) 0/409 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 347 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/410 variables, and 128 constraints, problems are : Problem set: 0 solved, 347 unsolved in 10807 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 347 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 297/405 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 13/124 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 27/151 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 6 (OVERLAPS) 4/409 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 320/475 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 9 (OVERLAPS) 0/409 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 347 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/410 variables, and 475 constraints, problems are : Problem set: 0 solved, 347 unsolved in 16943 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 0/0 constraints]
After SMT, in 28171ms problems are : Problem set: 0 solved, 347 unsolved
Search for dead transitions found 0 dead transitions in 28175ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 28572 ms. Remains : 112/112 places, 368/368 transitions.
Computed a total of 33 stabilizing places and 217 stable transitions
Computed a total of 33 stabilizing places and 217 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2342 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (262 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2077519 steps, run timeout after 3001 ms. (steps per millisecond=692 ) properties seen :0 out of 1
Probabilistic random walk after 2077519 steps, saw 318343 distinct states, run finished after 3001 ms. (steps per millisecond=692 ) properties seen :0
[2024-05-23 11:56:29] [INFO ] Flow matrix only has 298 transitions (discarded 70 similar events)
[2024-05-23 11:56:29] [INFO ] Invariant cache hit.
[2024-05-23 11:56:29] [INFO ] State equation strengthened by 13 read => feed constraints.
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) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/53 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 205/258 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/260 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 137/397 variables, 60/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 11/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/409 variables, 10/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/409 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/409 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/410 variables, and 128 constraints, problems are : Problem set: 0 solved, 1 unsolved in 100 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 13/13 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) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/53 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 205/258 variables, 32/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/260 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 137/397 variables, 60/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/397 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/409 variables, 10/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/409 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/409 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/410 variables, and 129 constraints, problems are : Problem set: 0 solved, 1 unsolved in 111 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 216ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 368/368 transitions.
Graph (trivial) has 101 edges and 112 vertex of which 7 / 112 are part of one of the 2 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 107 transition count 324
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 3 place count 106 transition count 324
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 17 place count 99 transition count 355
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 23 place count 99 transition count 349
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 1 with 45 rules applied. Total rules applied 68 place count 99 transition count 304
Free-agglomeration rule applied 29 times with reduction of 6 identical transitions.
Iterating global reduction 1 with 29 rules applied. Total rules applied 97 place count 99 transition count 269
Reduce places removed 29 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 47 transitions.
Graph (complete) has 406 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 77 rules applied. Total rules applied 174 place count 69 transition count 222
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 175 place count 69 transition count 221
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 177 place count 67 transition count 213
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 67 transition count 213
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 206 place count 67 transition count 186
Applied a total of 206 rules in 26 ms. Remains 67 /112 variables (removed 45) and now considering 186/368 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 67/112 places, 186/368 transitions.
RANDOM walk for 8139 steps (232 resets) in 22 ms. (353 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5534 reset in 195 ms.
Product exploration explored 100000 steps with 5553 reset in 210 ms.
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 368/368 transitions.
Graph (trivial) has 101 edges and 112 vertex of which 7 / 112 are part of one of the 2 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 107 transition count 361
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 3 place count 106 transition count 361
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 5 place count 105 transition count 362
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 18 place count 105 transition count 349
Applied a total of 18 rules in 16 ms. Remains 105 /112 variables (removed 7) and now considering 349/368 (removed 19) transitions.
[2024-05-23 11:56:30] [INFO ] Flow matrix only has 275 transitions (discarded 74 similar events)
// Phase 1: matrix 275 rows 105 cols
[2024-05-23 11:56:30] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 11:56:30] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-23 11:56:30] [INFO ] Flow matrix only has 275 transitions (discarded 74 similar events)
[2024-05-23 11:56:30] [INFO ] Invariant cache hit.
[2024-05-23 11:56:30] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 11:56:30] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-23 11:56:30] [INFO ] Redundant transitions in 180 ms returned []
Running 324 sub problems to find dead transitions.
[2024-05-23 11:56:30] [INFO ] Flow matrix only has 275 transitions (discarded 74 similar events)
[2024-05-23 11:56:30] [INFO ] Invariant cache hit.
[2024-05-23 11:56:30] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (OVERLAPS) 274/376 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 3/379 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (OVERLAPS) 0/379 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/380 variables, and 120 constraints, problems are : Problem set: 0 solved, 324 unsolved in 9018 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (OVERLAPS) 274/376 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 23/140 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 3/379 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 301/444 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 9 (OVERLAPS) 0/379 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/380 variables, and 444 constraints, problems are : Problem set: 0 solved, 324 unsolved in 14472 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
After SMT, in 23835ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 23838ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/112 places, 349/368 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24212 ms. Remains : 105/112 places, 349/368 transitions.
Treatment of property CloudDeployment-PT-3b-LTLCardinality-01 finished in 90803 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((G((F(p2)||p1))||F(p3)||p0))))'
Support contains 6 out of 586 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 824/824 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 571 transition count 809
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 571 transition count 809
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 565 transition count 803
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 565 transition count 803
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 565 transition count 801
Applied a total of 44 rules in 32 ms. Remains 565 /586 variables (removed 21) and now considering 801/824 (removed 23) transitions.
// Phase 1: matrix 801 rows 565 cols
[2024-05-23 11:56:54] [INFO ] Computed 8 invariants in 13 ms
[2024-05-23 11:56:54] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-23 11:56:54] [INFO ] Invariant cache hit.
[2024-05-23 11:56:55] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Running 800 sub problems to find dead transitions.
[2024-05-23 11:56:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/564 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/564 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (OVERLAPS) 801/1365 variables, 564/572 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1365 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 800 unsolved
SMT process timed out in 30432ms, After SMT, problems are : Problem set: 0 solved, 800 unsolved
Search for dead transitions found 0 dead transitions in 30447ms
Starting structural reductions in LTL mode, iteration 1 : 565/586 places, 801/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31082 ms. Remains : 565/586 places, 801/824 transitions.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND p0 (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-3b-LTLCardinality-02
Product exploration explored 100000 steps with 1041 reset in 141 ms.
Product exploration explored 100000 steps with 1052 reset in 159 ms.
Computed a total of 81 stabilizing places and 202 stable transitions
Graph (complete) has 1462 edges and 565 vertex of which 554 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Computed a total of 81 stabilizing places and 202 stable transitions
Knowledge obtained : [(AND p0 p3 p1 p2), (X p2), (X p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 90 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND p0 (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2))]
RANDOM walk for 40000 steps (406 resets) in 197 ms. (202 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (75 resets) in 32 ms. (1212 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (75 resets) in 32 ms. (1212 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (75 resets) in 256 ms. (155 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (73 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (72 resets) in 38 ms. (1025 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (74 resets) in 34 ms. (1142 steps per ms) remains 6/6 properties
[2024-05-23 11:57:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 40/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 75/121 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 303/424 variables, 121/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 304/728 variables, 129/258 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/728 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 260/988 variables, 118/376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/988 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 247/1235 variables, 109/485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1235 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 101/1336 variables, 70/555 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1336 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 21/1357 variables, 12/567 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1357 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 9/1366 variables, 6/573 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1366 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/1366 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1366/1366 variables, and 573 constraints, problems are : Problem set: 0 solved, 6 unsolved in 857 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 565/565 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 40/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 75/121 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 303/424 variables, 121/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 304/728 variables, 129/258 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/728 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/728 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 260/988 variables, 118/382 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/988 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 247/1235 variables, 109/491 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1235 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 101/1336 variables, 70/561 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1336 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 21/1357 variables, 12/573 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1357 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 9/1366 variables, 6/579 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1366 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/1366 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1366/1366 variables, and 579 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1208 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 565/565 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 2073ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 770 ms.
Support contains 6 out of 565 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 565/565 places, 801/801 transitions.
Graph (trivial) has 581 edges and 565 vertex of which 213 / 565 are part of one of the 24 SCC in 1 ms
Free SCC test removed 189 places
Drop transitions (Empty/Sink Transition effects.) removed 243 transitions
Reduce isomorphic transitions removed 243 transitions.
Graph (complete) has 1138 edges and 376 vertex of which 365 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 164 rules applied. Total rules applied 166 place count 365 transition count 394
Reduce places removed 152 places and 0 transitions.
Iterating post reduction 1 with 152 rules applied. Total rules applied 318 place count 213 transition count 394
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 318 place count 213 transition count 363
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 380 place count 182 transition count 363
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 383 place count 179 transition count 360
Iterating global reduction 2 with 3 rules applied. Total rules applied 386 place count 179 transition count 360
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 386 place count 179 transition count 357
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 392 place count 176 transition count 357
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 492 place count 126 transition count 307
Performed 20 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 532 place count 106 transition count 379
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 550 place count 106 transition count 361
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 3 with 46 rules applied. Total rules applied 596 place count 106 transition count 315
Free-agglomeration rule applied 30 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 626 place count 106 transition count 279
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 29 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 47 transitions.
Graph (complete) has 439 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 78 rules applied. Total rules applied 704 place count 75 transition count 232
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 705 place count 75 transition count 231
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 708 place count 72 transition count 218
Iterating global reduction 5 with 3 rules applied. Total rules applied 711 place count 72 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 723 place count 72 transition count 206
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 724 place count 71 transition count 205
Applied a total of 724 rules in 41 ms. Remains 71 /565 variables (removed 494) and now considering 205/801 (removed 596) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 71/565 places, 205/801 transitions.
RANDOM walk for 40000 steps (8 resets) in 129 ms. (307 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 122 ms. (325 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 432 ms. (92 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 157 ms. (253 steps per ms) remains 2/3 properties
[2024-05-23 11:57:29] [INFO ] Flow matrix only has 135 transitions (discarded 70 similar events)
// Phase 1: matrix 135 rows 71 cols
[2024-05-23 11:57:29] [INFO ] Computed 11 invariants in 0 ms
[2024-05-23 11:57:29] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/50 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/57 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 116/173 variables, 57/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 18/191 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 8/199 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/199 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 7/206 variables, 8/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/206 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/206 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/206 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 87 constraints, problems are : Problem set: 0 solved, 2 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 71/71 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/50 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 11:57:29] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/57 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Int declared 173/206 variables, and 68 constraints, problems are : Problem set: 2 solved, 0 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 57/71 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 199ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p3 p1 p2), (X p2), (X p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X p1)), (G (OR p0 p3)), (G (OR p0 p3 p1 p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p3))), (F (NOT (OR p3 p2))), (F (NOT (OR (NOT p0) p3 p1 p2))), (F (NOT p2)), (F (NOT p3)), (F (NOT p1)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 12 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-3b-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-3b-LTLCardinality-02 finished in 35498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 586 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 824/824 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 568 transition count 806
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 568 transition count 806
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 560 transition count 798
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 560 transition count 798
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 560 transition count 795
Applied a total of 55 rules in 34 ms. Remains 560 /586 variables (removed 26) and now considering 795/824 (removed 29) transitions.
// Phase 1: matrix 795 rows 560 cols
[2024-05-23 11:57:30] [INFO ] Computed 8 invariants in 6 ms
[2024-05-23 11:57:30] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-23 11:57:30] [INFO ] Invariant cache hit.
[2024-05-23 11:57:30] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
Running 794 sub problems to find dead transitions.
[2024-05-23 11:57:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/559 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 794 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/559 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 794 unsolved
At refinement iteration 2 (OVERLAPS) 795/1354 variables, 559/567 constraints. Problems are: Problem set: 0 solved, 794 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1354 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 794 unsolved
SMT process timed out in 30440ms, After SMT, problems are : Problem set: 0 solved, 794 unsolved
Search for dead transitions found 0 dead transitions in 30450ms
Starting structural reductions in LTL mode, iteration 1 : 560/586 places, 795/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31072 ms. Remains : 560/586 places, 795/824 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-3b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLCardinality-03 finished in 31172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 586 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 824/824 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 567 transition count 805
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 567 transition count 805
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 560 transition count 798
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 560 transition count 798
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 560 transition count 795
Applied a total of 55 rules in 26 ms. Remains 560 /586 variables (removed 26) and now considering 795/824 (removed 29) transitions.
// Phase 1: matrix 795 rows 560 cols
[2024-05-23 11:58:01] [INFO ] Computed 8 invariants in 6 ms
[2024-05-23 11:58:01] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-23 11:58:01] [INFO ] Invariant cache hit.
[2024-05-23 11:58:01] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
Running 794 sub problems to find dead transitions.
[2024-05-23 11:58:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/559 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 794 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/559 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 794 unsolved
At refinement iteration 2 (OVERLAPS) 795/1354 variables, 559/567 constraints. Problems are: Problem set: 0 solved, 794 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/1354 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 794 unsolved
SMT process timed out in 30371ms, After SMT, problems are : Problem set: 0 solved, 794 unsolved
Search for dead transitions found 0 dead transitions in 30383ms
Starting structural reductions in LTL mode, iteration 1 : 560/586 places, 795/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30905 ms. Remains : 560/586 places, 795/824 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 253 ms.
Product exploration explored 100000 steps with 50000 reset in 273 ms.
Computed a total of 80 stabilizing places and 201 stable transitions
Graph (complete) has 1455 edges and 560 vertex of which 549 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.4 ms
Computed a total of 80 stabilizing places and 201 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 11 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-3b-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-3b-LTLCardinality-05 finished in 31556 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(G(p0))&&(p1||F(G(!p0))))))'
Support contains 4 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 824/824 transitions.
Graph (trivial) has 605 edges and 586 vertex of which 214 / 586 are part of one of the 24 SCC in 1 ms
Free SCC test removed 190 places
Ensure Unique test removed 217 transitions
Reduce isomorphic transitions removed 217 transitions.
Graph (complete) has 1247 edges and 396 vertex of which 385 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 162 rules applied. Total rules applied 164 place count 384 transition count 441
Reduce places removed 162 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 164 rules applied. Total rules applied 328 place count 222 transition count 439
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 330 place count 220 transition count 439
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 330 place count 220 transition count 414
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 380 place count 195 transition count 414
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 390 place count 185 transition count 404
Iterating global reduction 3 with 10 rules applied. Total rules applied 400 place count 185 transition count 404
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 401 place count 185 transition count 403
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 401 place count 185 transition count 399
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 409 place count 181 transition count 399
Performed 56 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 521 place count 125 transition count 341
Performed 17 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 555 place count 108 transition count 396
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 567 place count 108 transition count 384
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 5 with 31 rules applied. Total rules applied 598 place count 108 transition count 353
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 599 place count 107 transition count 352
Applied a total of 599 rules in 55 ms. Remains 107 /586 variables (removed 479) and now considering 352/824 (removed 472) transitions.
[2024-05-23 11:58:32] [INFO ] Flow matrix only has 281 transitions (discarded 71 similar events)
// Phase 1: matrix 281 rows 107 cols
[2024-05-23 11:58:32] [INFO ] Computed 3 invariants in 3 ms
[2024-05-23 11:58:32] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-23 11:58:32] [INFO ] Flow matrix only has 281 transitions (discarded 71 similar events)
[2024-05-23 11:58:32] [INFO ] Invariant cache hit.
[2024-05-23 11:58:32] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 11:58:33] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-23 11:58:33] [INFO ] Redundant transitions in 181 ms returned []
Running 327 sub problems to find dead transitions.
[2024-05-23 11:58:33] [INFO ] Flow matrix only has 281 transitions (discarded 71 similar events)
[2024-05-23 11:58:33] [INFO ] Invariant cache hit.
[2024-05-23 11:58:33] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (OVERLAPS) 280/384 variables, 104/107 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 12/119 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (OVERLAPS) 3/387 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 7 (OVERLAPS) 0/387 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/388 variables, and 122 constraints, problems are : Problem set: 0 solved, 327 unsolved in 9838 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (OVERLAPS) 280/384 variables, 104/107 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 12/119 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 21/140 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (OVERLAPS) 3/387 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 306/449 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/388 variables, and 449 constraints, problems are : Problem set: 0 solved, 327 unsolved in 15048 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints]
After SMT, in 25213ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 25218ms
Starting structural reductions in SI_LTL mode, iteration 1 : 107/586 places, 352/824 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25643 ms. Remains : 107/586 places, 352/824 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p0), false]
Running random walk in product with property : CloudDeployment-PT-3b-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-3b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLCardinality-07 finished in 25835 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 p1) U X((G(p1)&&F(G(p2))))))'
Support contains 5 out of 586 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 824/824 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 569 transition count 807
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 569 transition count 807
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 562 transition count 800
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 562 transition count 800
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 562 transition count 797
Applied a total of 51 rules in 32 ms. Remains 562 /586 variables (removed 24) and now considering 797/824 (removed 27) transitions.
// Phase 1: matrix 797 rows 562 cols
[2024-05-23 11:58:58] [INFO ] Computed 8 invariants in 9 ms
[2024-05-23 11:58:58] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-23 11:58:58] [INFO ] Invariant cache hit.
[2024-05-23 11:58:59] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
Running 796 sub problems to find dead transitions.
[2024-05-23 11:58:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 2 (OVERLAPS) 797/1358 variables, 561/569 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1358 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 796 unsolved
SMT process timed out in 30400ms, After SMT, problems are : Problem set: 0 solved, 796 unsolved
Search for dead transitions found 0 dead transitions in 30409ms
Starting structural reductions in LTL mode, iteration 1 : 562/586 places, 797/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31016 ms. Remains : 562/586 places, 797/824 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLCardinality-12
Product exploration explored 100000 steps with 1042 reset in 144 ms.
Product exploration explored 100000 steps with 1059 reset in 193 ms.
Computed a total of 81 stabilizing places and 202 stable transitions
Graph (complete) has 1456 edges and 562 vertex of which 551 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Computed a total of 81 stabilizing places and 202 stable transitions
Detected a total of 81/562 stabilizing places and 202/797 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 175 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
RANDOM walk for 40000 steps (418 resets) in 211 ms. (188 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (78 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (79 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
[2024-05-23 11:59:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 87/115 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 292/407 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 294/701 variables, 122/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/701 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 266/967 variables, 120/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/967 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 258/1225 variables, 114/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1225 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 106/1331 variables, 74/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1331 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 21/1352 variables, 12/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1352 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 7/1359 variables, 5/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1359 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1359 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1359/1359 variables, and 570 constraints, problems are : Problem set: 0 solved, 2 unsolved in 420 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 87/115 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 292/407 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 294/701 variables, 122/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/701 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/701 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 266/967 variables, 120/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/967 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 258/1225 variables, 114/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1225 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 106/1331 variables, 74/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1331 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 21/1352 variables, 12/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1352 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 7/1359 variables, 5/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1359 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1359 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1359/1359 variables, and 572 constraints, problems are : Problem set: 0 solved, 2 unsolved in 548 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 974ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 158 steps, including 1 resets, run visited all 2 properties in 3 ms. (steps per millisecond=52 )
Parikh walk visited 2 properties in 15 ms.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (OR p2 (NOT p1)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 14 factoid took 392 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Support contains 5 out of 562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 562/562 places, 797/797 transitions.
Applied a total of 0 rules in 12 ms. Remains 562 /562 variables (removed 0) and now considering 797/797 (removed 0) transitions.
[2024-05-23 11:59:32] [INFO ] Invariant cache hit.
[2024-05-23 11:59:32] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-23 11:59:32] [INFO ] Invariant cache hit.
[2024-05-23 11:59:33] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
Running 796 sub problems to find dead transitions.
[2024-05-23 11:59:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 2 (OVERLAPS) 797/1358 variables, 561/569 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1358 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 796 unsolved
SMT process timed out in 30372ms, After SMT, problems are : Problem set: 0 solved, 796 unsolved
Search for dead transitions found 0 dead transitions in 30380ms
Finished structural reductions in LTL mode , in 1 iterations and 30953 ms. Remains : 562/562 places, 797/797 transitions.
Computed a total of 81 stabilizing places and 202 stable transitions
Graph (complete) has 1456 edges and 562 vertex of which 551 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.6 ms
Computed a total of 81 stabilizing places and 202 stable transitions
Detected a total of 81/562 stabilizing places and 202/797 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 172 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
RANDOM walk for 40000 steps (420 resets) in 173 ms. (229 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (73 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (78 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
[2024-05-23 12:00:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 87/115 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 292/407 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 294/701 variables, 122/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/701 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 266/967 variables, 120/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/967 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 258/1225 variables, 114/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1225 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 106/1331 variables, 74/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1331 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 21/1352 variables, 12/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1352 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 7/1359 variables, 5/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1359 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1359 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1359/1359 variables, and 570 constraints, problems are : Problem set: 0 solved, 2 unsolved in 424 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 87/115 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 292/407 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 294/701 variables, 122/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/701 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/701 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 266/967 variables, 120/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/967 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 258/1225 variables, 114/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1225 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 106/1331 variables, 74/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1331 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 21/1352 variables, 12/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1352 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 7/1359 variables, 5/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1359 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1359 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1359/1359 variables, and 572 constraints, problems are : Problem set: 0 solved, 2 unsolved in 531 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 961ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 158 steps, including 1 resets, run visited all 2 properties in 3 ms. (steps per millisecond=52 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p1) p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 470 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Product exploration explored 100000 steps with 1048 reset in 141 ms.
Stack based approach found an accepted trace after 67906 steps with 715 reset with depth 161 and stack size 161 in 110 ms.
FORMULA CloudDeployment-PT-3b-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CloudDeployment-PT-3b-LTLCardinality-12 finished in 67943 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(p0)&&X(X(G(p1)))))'
Support contains 4 out of 586 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 824/824 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 568 transition count 806
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 568 transition count 806
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 561 transition count 799
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 561 transition count 799
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 561 transition count 797
Applied a total of 52 rules in 32 ms. Remains 561 /586 variables (removed 25) and now considering 797/824 (removed 27) transitions.
// Phase 1: matrix 797 rows 561 cols
[2024-05-23 12:00:06] [INFO ] Computed 8 invariants in 9 ms
[2024-05-23 12:00:06] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-23 12:00:06] [INFO ] Invariant cache hit.
[2024-05-23 12:00:07] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
Running 796 sub problems to find dead transitions.
[2024-05-23 12:00:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 796 unsolved
At refinement iteration 2 (OVERLAPS) 797/1357 variables, 560/568 constraints. Problems are: Problem set: 0 solved, 796 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 119.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 137.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 128.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 135.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 48.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 81.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 98.0)
(s354 1.0)
(s355 1.0)
(s356 13.0)
(s357 1.0)
(s358 28.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 31.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 0.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 0.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 0.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 0.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 1.0)
(s430 0.0)
(s431 0.0)
(s432 1.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 1.0)
(s451 0.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1357 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 796 unsolved
SMT process timed out in 30407ms, After SMT, problems are : Problem set: 0 solved, 796 unsolved
Search for dead transitions found 0 dead transitions in 30417ms
Starting structural reductions in LTL mode, iteration 1 : 561/586 places, 797/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31028 ms. Remains : 561/586 places, 797/824 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : CloudDeployment-PT-3b-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-3b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLCardinality-13 finished in 31237 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))||(F(p1)&&G(p2))))'
[2024-05-23 12:00:38] [INFO ] Flatten gal took : 40 ms
[2024-05-23 12:00:38] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-23 12:00:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 586 places, 824 transitions and 2802 arcs took 6 ms.
Total runtime 347817 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CloudDeployment-PT-3b

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1246
MODEL NAME: /home/mcc/execution/413/model
586 places, 824 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CloudDeployment-PT-3b-LTLCardinality-01 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716466409565

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

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

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="CloudDeployment-PT-3b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CloudDeployment-PT-3b, 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 r069-tall-171620504800563"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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