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

About the Execution of GreatSPN+red for CloudDeployment-PT-6a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2604.359 1658774.00 1864303.00 4131.40 TFFFFTTFFFFFFFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r069-tall-171620504900604.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-6a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504900604
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K 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 44K 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.4K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 317K 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-6a-LTLFireability-00
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-01
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-02
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-03
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-04
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-05
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-06
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-07
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-08
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-09
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-10
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-11
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-12
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-13
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-14
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716470401032

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-6a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 13:20:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 13:20:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 13:20:02] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2024-05-23 13:20:02] [INFO ] Transformed 221 places.
[2024-05-23 13:20:02] [INFO ] Transformed 908 transitions.
[2024-05-23 13:20:02] [INFO ] Found NUPN structural information;
[2024-05-23 13:20:02] [INFO ] Parsed PT model containing 221 places and 908 transitions and 5517 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 114 transitions
Reduce redundant transitions removed 114 transitions.
FORMULA CloudDeployment-PT-6a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 794/794 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 209 transition count 794
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 205 transition count 790
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 205 transition count 790
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 202 transition count 787
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 202 transition count 787
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 200 transition count 785
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 200 transition count 785
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 199 transition count 784
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 199 transition count 784
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 1 with 75 rules applied. Total rules applied 107 place count 199 transition count 709
Applied a total of 107 rules in 84 ms. Remains 199 /221 variables (removed 22) and now considering 709/794 (removed 85) transitions.
[2024-05-23 13:20:02] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-23 13:20:02] [INFO ] Computed 24 invariants in 22 ms
[2024-05-23 13:20:02] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-23 13:20:03] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:20:03] [INFO ] Invariant cache hit.
[2024-05-23 13:20:03] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-23 13:20:03] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-23 13:20:03] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:20:03] [INFO ] Invariant cache hit.
[2024-05-23 13:20:03] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
SMT process timed out in 31449ms, After SMT, problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 31473ms
Starting structural reductions in LTL mode, iteration 1 : 199/221 places, 709/794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32157 ms. Remains : 199/221 places, 709/794 transitions.
Support contains 42 out of 199 places after structural reductions.
[2024-05-23 13:20:35] [INFO ] Flatten gal took : 91 ms
[2024-05-23 13:20:35] [INFO ] Flatten gal took : 53 ms
[2024-05-23 13:20:35] [INFO ] Input system was already deterministic with 709 transitions.
RANDOM walk for 40000 steps (447 resets) in 1344 ms. (29 steps per ms) remains 4/30 properties
BEST_FIRST walk for 40004 steps (34 resets) in 221 ms. (180 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (49 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
[2024-05-23 13:20:35] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:20:35] [INFO ] Invariant cache hit.
[2024-05-23 13:20:35] [INFO ] State equation strengthened by 172 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 1 (OVERLAPS) 184/198 variables, 24/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/573 variables, 1/395 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 0/395 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/573 variables, 0/395 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 573/573 variables, and 395 constraints, problems are : Problem set: 1 solved, 1 unsolved in 205 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 192/198 variables, 24/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 1/394 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 0/394 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp29 is UNSAT
After SMT solving in domain Int declared 572/573 variables, and 395 constraints, problems are : Problem set: 2 solved, 0 unsolved in 208 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 449ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CloudDeployment-PT-6a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6a-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 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(F((G(p2)&&p1)))))))'
Support contains 9 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 4 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-23 13:20:36] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:20:36] [INFO ] Invariant cache hit.
[2024-05-23 13:20:36] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-23 13:20:36] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:20:36] [INFO ] Invariant cache hit.
[2024-05-23 13:20:37] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-23 13:20:37] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-23 13:20:37] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:20:37] [INFO ] Invariant cache hit.
[2024-05-23 13:20:37] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
SMT process timed out in 31129ms, After SMT, problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 31141ms
Finished structural reductions in LTL mode , in 1 iterations and 31558 ms. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 393 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-01 finished in 32010 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((G(p1) U (p0&&G(p1)))))))'
Support contains 1 out of 199 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 : 199/199 places, 709/709 transitions.
Graph (trivial) has 234 edges and 199 vertex of which 58 / 199 are part of one of the 18 SCC in 4 ms
Free SCC test removed 40 places
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 152 transition count 545
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 152 transition count 545
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 47 place count 135 transition count 610
Drop transitions (Redundant composition of simpler transitions.) removed 107 transitions
Redundant transition composition rules discarded 107 transitions
Iterating global reduction 0 with 107 rules applied. Total rules applied 154 place count 135 transition count 503
Applied a total of 154 rules in 99 ms. Remains 135 /199 variables (removed 64) and now considering 503/709 (removed 206) transitions.
[2024-05-23 13:21:08] [INFO ] Flow matrix only has 204 transitions (discarded 299 similar events)
// Phase 1: matrix 204 rows 135 cols
[2024-05-23 13:21:08] [INFO ] Computed 24 invariants in 4 ms
[2024-05-23 13:21:09] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-23 13:21:09] [INFO ] Flow matrix only has 204 transitions (discarded 299 similar events)
[2024-05-23 13:21:09] [INFO ] Invariant cache hit.
[2024-05-23 13:21:09] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 13:21:09] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2024-05-23 13:21:09] [INFO ] Redundant transitions in 315 ms returned []
Running 460 sub problems to find dead transitions.
[2024-05-23 13:21:09] [INFO ] Flow matrix only has 204 transitions (discarded 299 similar events)
[2024-05-23 13:21:09] [INFO ] Invariant cache hit.
[2024-05-23 13:21:09] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 6/135 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 203/338 variables, 135/159 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 7/166 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (OVERLAPS) 0/338 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/339 variables, and 166 constraints, problems are : Problem set: 0 solved, 460 unsolved in 12467 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 135/135 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 6/135 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 203/338 variables, 135/159 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 7/166 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 460/626 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 8 (OVERLAPS) 0/338 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/339 variables, and 626 constraints, problems are : Problem set: 0 solved, 460 unsolved in 21880 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 135/135 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 34764ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 34770ms
Starting structural reductions in SI_LTL mode, iteration 1 : 135/199 places, 503/709 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35499 ms. Remains : 135/199 places, 503/709 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-02 finished in 35568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 5 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 234 edges and 199 vertex of which 58 / 199 are part of one of the 17 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 153 transition count 550
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 153 transition count 550
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 45 place count 136 transition count 606
Drop transitions (Redundant composition of simpler transitions.) removed 96 transitions
Redundant transition composition rules discarded 96 transitions
Iterating global reduction 0 with 96 rules applied. Total rules applied 141 place count 136 transition count 510
Applied a total of 141 rules in 62 ms. Remains 136 /199 variables (removed 63) and now considering 510/709 (removed 199) transitions.
[2024-05-23 13:21:44] [INFO ] Flow matrix only has 205 transitions (discarded 305 similar events)
// Phase 1: matrix 205 rows 136 cols
[2024-05-23 13:21:44] [INFO ] Computed 24 invariants in 1 ms
[2024-05-23 13:21:44] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-23 13:21:44] [INFO ] Flow matrix only has 205 transitions (discarded 305 similar events)
[2024-05-23 13:21:44] [INFO ] Invariant cache hit.
[2024-05-23 13:21:44] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-23 13:21:44] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2024-05-23 13:21:45] [INFO ] Redundant transitions in 381 ms returned []
Running 509 sub problems to find dead transitions.
[2024-05-23 13:21:45] [INFO ] Flow matrix only has 205 transitions (discarded 305 similar events)
[2024-05-23 13:21:45] [INFO ] Invariant cache hit.
[2024-05-23 13:21:45] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (OVERLAPS) 204/339 variables, 135/159 constraints. Problems are: Problem set: 0 solved, 509 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 129/288 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 1/340 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 7 (OVERLAPS) 1/341 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 9 (OVERLAPS) 0/341 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 290 constraints, problems are : Problem set: 0 solved, 509 unsolved in 24689 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 136/136 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (OVERLAPS) 204/339 variables, 135/159 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 129/288 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 509/797 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 1/340 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 8 (OVERLAPS) 1/341 variables, 1/799 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/341 variables, and 799 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 136/136 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 55190ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 55195ms
Starting structural reductions in SI_LTL mode, iteration 1 : 136/199 places, 510/709 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56025 ms. Remains : 136/199 places, 510/709 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-03 finished in 56128 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(F(p0)) U G((p1||F(p2))))))'
Support contains 7 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 5 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-23 13:22:40] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-23 13:22:40] [INFO ] Computed 24 invariants in 4 ms
[2024-05-23 13:22:40] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-23 13:22:40] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:22:40] [INFO ] Invariant cache hit.
[2024-05-23 13:22:40] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-23 13:22:40] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-23 13:22:40] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:22:40] [INFO ] Invariant cache hit.
[2024-05-23 13:22:40] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
SMT process timed out in 30845ms, After SMT, problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 30851ms
Finished structural reductions in LTL mode , in 1 iterations and 31224 ms. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-04 finished in 31464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((F(p0)&&(p1||F(p2))))))))'
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 3 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-23 13:23:12] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:23:12] [INFO ] Invariant cache hit.
[2024-05-23 13:23:12] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-23 13:23:12] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:23:12] [INFO ] Invariant cache hit.
[2024-05-23 13:23:12] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-23 13:23:12] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-23 13:23:12] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:23:12] [INFO ] Invariant cache hit.
[2024-05-23 13:23:12] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
SMT process timed out in 30921ms, After SMT, problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 30932ms
Finished structural reductions in LTL mode , in 1 iterations and 31333 ms. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 293 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-05
Product exploration explored 100000 steps with 25000 reset in 1274 ms.
Product exploration explored 100000 steps with 25000 reset in 1130 ms.
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 97 stabilizing places and 505 stable transitions
Detected a total of 97/199 stabilizing places and 505/709 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 24735 steps (276 resets) in 255 ms. (96 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p1 p2 p0), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (AND (OR (NOT p2) p0) (OR p0 (NOT p1))))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 325 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 269 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 3 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-23 13:23:47] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:23:47] [INFO ] Invariant cache hit.
[2024-05-23 13:23:47] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-23 13:23:47] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:23:47] [INFO ] Invariant cache hit.
[2024-05-23 13:23:47] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-23 13:23:47] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-23 13:23:47] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:23:47] [INFO ] Invariant cache hit.
[2024-05-23 13:23:47] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
SMT process timed out in 31009ms, After SMT, problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 31017ms
Finished structural reductions in LTL mode , in 1 iterations and 31394 ms. Remains : 199/199 places, 709/709 transitions.
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 97 stabilizing places and 505 stable transitions
Detected a total of 97/199 stabilizing places and 505/709 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 26663 steps (307 resets) in 114 ms. (231 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p2 p1 p0), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (AND (OR (NOT p2) p0) (OR p0 (NOT p1))))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 353 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 280 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 277 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 25000 reset in 1118 ms.
Product exploration explored 100000 steps with 25000 reset in 1174 ms.
Applying partial POR strategy [true, true, true, true, false, false, false]
Stuttering acceptance computed with spot in 291 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 229 edges and 199 vertex of which 59 / 199 are part of one of the 18 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 152 transition count 543
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 152 transition count 543
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -108
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 0 with 18 rules applied. Total rules applied 31 place count 152 transition count 651
Deduced a syphon composed of 18 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 125 transitions
Redundant transition composition rules discarded 125 transitions
Iterating global reduction 0 with 125 rules applied. Total rules applied 156 place count 152 transition count 526
Deduced a syphon composed of 18 places in 0 ms
Applied a total of 156 rules in 52 ms. Remains 152 /199 variables (removed 47) and now considering 526/709 (removed 183) transitions.
[2024-05-23 13:24:23] [INFO ] Redundant transitions in 402 ms returned []
Running 525 sub problems to find dead transitions.
[2024-05-23 13:24:23] [INFO ] Flow matrix only has 227 transitions (discarded 299 similar events)
// Phase 1: matrix 227 rows 152 cols
[2024-05-23 13:24:23] [INFO ] Computed 24 invariants in 1 ms
[2024-05-23 13:24:23] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 525 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 525 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD99 is UNSAT
At refinement iteration 2 (OVERLAPS) 226/377 variables, 151/175 constraints. Problems are: Problem set: 24 solved, 501 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 129/304 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 0/304 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 5 (OVERLAPS) 1/378 variables, 1/305 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/305 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 7 (OVERLAPS) 1/379 variables, 1/306 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/306 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 9 (OVERLAPS) 0/379 variables, 0/306 constraints. Problems are: Problem set: 24 solved, 501 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 306 constraints, problems are : Problem set: 24 solved, 501 unsolved in 26902 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 525/525 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 501 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 18/18 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/18 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 18/151 variables, 6/24 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/24 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 4 (OVERLAPS) 226/377 variables, 151/175 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 129/304 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 501/805 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 0/805 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 8 (OVERLAPS) 1/378 variables, 1/806 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/806 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 10 (OVERLAPS) 1/379 variables, 1/807 constraints. Problems are: Problem set: 24 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 379/379 variables, and 807 constraints, problems are : Problem set: 24 solved, 501 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 501/525 constraints, Known Traps: 0/0 constraints]
After SMT, in 57400ms problems are : Problem set: 24 solved, 501 unsolved
Search for dead transitions found 24 dead transitions in 57406ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 152/199 places, 502/709 transitions.
Graph (complete) has 1609 edges and 152 vertex of which 134 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 134 /152 variables (removed 18) and now considering 502/502 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 134/199 places, 502/709 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57887 ms. Remains : 134/199 places, 502/709 transitions.
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 2 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-23 13:25:21] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-23 13:25:21] [INFO ] Computed 24 invariants in 2 ms
[2024-05-23 13:25:21] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-23 13:25:21] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:25:21] [INFO ] Invariant cache hit.
[2024-05-23 13:25:21] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-23 13:25:21] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-23 13:25:21] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:25:21] [INFO ] Invariant cache hit.
[2024-05-23 13:25:21] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
SMT process timed out in 30820ms, After SMT, problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 30829ms
Finished structural reductions in LTL mode , in 1 iterations and 31241 ms. Remains : 199/199 places, 709/709 transitions.
Treatment of property CloudDeployment-PT-6a-LTLFireability-05 finished in 160476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(F(p0))))||(X(!p1) U ((p2&&X(!p1))||X(G(!p1))))))'
Support contains 6 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 2 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-23 13:25:52] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:25:52] [INFO ] Invariant cache hit.
[2024-05-23 13:25:52] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-23 13:25:52] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:25:52] [INFO ] Invariant cache hit.
[2024-05-23 13:25:52] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-23 13:25:53] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-23 13:25:53] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:25:53] [INFO ] Invariant cache hit.
[2024-05-23 13:25:53] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 7 (OVERLAPS) 1/573 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/573 variables, and 395 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 708/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (OVERLAPS) 1/572 variables, 1/1102 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/573 variables, and 1102 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
After SMT, in 60973ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 60981ms
Finished structural reductions in LTL mode , in 1 iterations and 61508 ms. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 403 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 1722 ms.
Product exploration explored 100000 steps with 50000 reset in 1711 ms.
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 97 stabilizing places and 505 stable transitions
Detected a total of 97/199 stabilizing places and 505/709 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 14 ms. Reduced automaton from 9 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-6a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-6a-LTLFireability-06 finished in 65417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 6 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 230 edges and 199 vertex of which 59 / 199 are part of one of the 18 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 153 transition count 551
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 153 transition count 551
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 43 place count 137 transition count 606
Drop transitions (Redundant composition of simpler transitions.) removed 95 transitions
Redundant transition composition rules discarded 95 transitions
Iterating global reduction 0 with 95 rules applied. Total rules applied 138 place count 137 transition count 511
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 140 place count 136 transition count 510
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 136 transition count 510
Applied a total of 141 rules in 47 ms. Remains 136 /199 variables (removed 63) and now considering 510/709 (removed 199) transitions.
[2024-05-23 13:26:57] [INFO ] Flow matrix only has 204 transitions (discarded 306 similar events)
// Phase 1: matrix 204 rows 136 cols
[2024-05-23 13:26:57] [INFO ] Computed 24 invariants in 3 ms
[2024-05-23 13:26:58] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-23 13:26:58] [INFO ] Flow matrix only has 204 transitions (discarded 306 similar events)
[2024-05-23 13:26:58] [INFO ] Invariant cache hit.
[2024-05-23 13:26:58] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-23 13:26:58] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2024-05-23 13:26:58] [INFO ] Redundant transitions in 294 ms returned []
Running 509 sub problems to find dead transitions.
[2024-05-23 13:26:58] [INFO ] Flow matrix only has 204 transitions (discarded 306 similar events)
[2024-05-23 13:26:58] [INFO ] Invariant cache hit.
[2024-05-23 13:26:58] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (OVERLAPS) 203/338 variables, 135/159 constraints. Problems are: Problem set: 0 solved, 509 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 129/288 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 1/339 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 7 (OVERLAPS) 1/340 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 290 constraints, problems are : Problem set: 0 solved, 509 unsolved in 24449 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 136/136 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (OVERLAPS) 203/338 variables, 135/159 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 129/288 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 509/797 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 1/339 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 8 (OVERLAPS) 1/340 variables, 1/799 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/340 variables, and 799 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 136/136 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 54959ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 54964ms
Starting structural reductions in SI_LTL mode, iteration 1 : 136/199 places, 510/709 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55582 ms. Remains : 136/199 places, 510/709 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-08 finished in 55694 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 5 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 4 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-23 13:27:53] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-23 13:27:53] [INFO ] Computed 24 invariants in 5 ms
[2024-05-23 13:27:53] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-23 13:27:53] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:27:53] [INFO ] Invariant cache hit.
[2024-05-23 13:27:53] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-23 13:27:53] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-23 13:27:53] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:27:53] [INFO ] Invariant cache hit.
[2024-05-23 13:27:53] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
SMT process timed out in 30785ms, After SMT, problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 30794ms
Finished structural reductions in LTL mode , in 1 iterations and 31167 ms. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-09 finished in 31274 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(p0)||F(p1)))'
Support contains 9 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 235 edges and 199 vertex of which 60 / 199 are part of one of the 18 SCC in 0 ms
Free SCC test removed 42 places
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 151 transition count 541
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 151 transition count 541
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 47 place count 134 transition count 606
Drop transitions (Redundant composition of simpler transitions.) removed 104 transitions
Redundant transition composition rules discarded 104 transitions
Iterating global reduction 0 with 104 rules applied. Total rules applied 151 place count 134 transition count 502
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 153 place count 134 transition count 502
Applied a total of 153 rules in 39 ms. Remains 134 /199 variables (removed 65) and now considering 502/709 (removed 207) transitions.
[2024-05-23 13:28:24] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
// Phase 1: matrix 203 rows 134 cols
[2024-05-23 13:28:24] [INFO ] Computed 24 invariants in 2 ms
[2024-05-23 13:28:24] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-23 13:28:24] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-23 13:28:24] [INFO ] Invariant cache hit.
[2024-05-23 13:28:25] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-23 13:28:25] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2024-05-23 13:28:25] [INFO ] Redundant transitions in 282 ms returned []
Running 501 sub problems to find dead transitions.
[2024-05-23 13:28:25] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-23 13:28:25] [INFO ] Invariant cache hit.
[2024-05-23 13:28:25] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 202/335 variables, 133/157 constraints. Problems are: Problem set: 0 solved, 501 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 129/286 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (OVERLAPS) 1/336 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 7 (OVERLAPS) 1/337 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 9 (OVERLAPS) 0/337 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 501 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 288 constraints, problems are : Problem set: 0 solved, 501 unsolved in 24588 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 134/134 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 501 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 202/335 variables, 133/157 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 129/286 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 501/787 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (OVERLAPS) 1/336 variables, 1/788 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 8 (OVERLAPS) 1/337 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 789 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 134/134 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 0/0 constraints]
After SMT, in 55016ms problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 55021ms
Starting structural reductions in SI_LTL mode, iteration 1 : 134/199 places, 502/709 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55621 ms. Remains : 134/199 places, 502/709 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 108 ms.
Product exploration explored 100000 steps with 0 reset in 149 ms.
Computed a total of 80 stabilizing places and 394 stable transitions
Graph (complete) has 1610 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 80 stabilizing places and 394 stable transitions
Detected a total of 80/134 stabilizing places and 394/502 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 31976 steps (515 resets) in 395 ms. (80 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 274 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 9 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 502/502 transitions.
Applied a total of 0 rules in 14 ms. Remains 134 /134 variables (removed 0) and now considering 502/502 (removed 0) transitions.
[2024-05-23 13:29:21] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-23 13:29:21] [INFO ] Invariant cache hit.
[2024-05-23 13:29:21] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-23 13:29:21] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-23 13:29:21] [INFO ] Invariant cache hit.
[2024-05-23 13:29:21] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-23 13:29:21] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2024-05-23 13:29:22] [INFO ] Redundant transitions in 307 ms returned []
Running 501 sub problems to find dead transitions.
[2024-05-23 13:29:22] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-23 13:29:22] [INFO ] Invariant cache hit.
[2024-05-23 13:29:22] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 202/335 variables, 133/157 constraints. Problems are: Problem set: 0 solved, 501 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 129/286 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (OVERLAPS) 1/336 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 7 (OVERLAPS) 1/337 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 9 (OVERLAPS) 0/337 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 501 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 288 constraints, problems are : Problem set: 0 solved, 501 unsolved in 24702 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 134/134 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 501 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 202/335 variables, 133/157 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 129/286 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 501/787 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (OVERLAPS) 1/336 variables, 1/788 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 8 (OVERLAPS) 1/337 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 789 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 134/134 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 0/0 constraints]
After SMT, in 55119ms problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 55124ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55702 ms. Remains : 134/134 places, 502/502 transitions.
Computed a total of 80 stabilizing places and 394 stable transitions
Graph (complete) has 1610 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 80 stabilizing places and 394 stable transitions
Detected a total of 80/134 stabilizing places and 394/502 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (653 resets) in 366 ms. (108 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 291 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 109 ms.
Product exploration explored 100000 steps with 0 reset in 218 ms.
Support contains 9 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 502/502 transitions.
Applied a total of 0 rules in 11 ms. Remains 134 /134 variables (removed 0) and now considering 502/502 (removed 0) transitions.
[2024-05-23 13:30:18] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-23 13:30:18] [INFO ] Invariant cache hit.
[2024-05-23 13:30:18] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-23 13:30:18] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-23 13:30:18] [INFO ] Invariant cache hit.
[2024-05-23 13:30:18] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-23 13:30:18] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2024-05-23 13:30:19] [INFO ] Redundant transitions in 278 ms returned []
Running 501 sub problems to find dead transitions.
[2024-05-23 13:30:19] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-23 13:30:19] [INFO ] Invariant cache hit.
[2024-05-23 13:30:19] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 202/335 variables, 133/157 constraints. Problems are: Problem set: 0 solved, 501 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 129/286 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (OVERLAPS) 1/336 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 7 (OVERLAPS) 1/337 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 9 (OVERLAPS) 0/337 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 501 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 288 constraints, problems are : Problem set: 0 solved, 501 unsolved in 24210 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 134/134 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 501 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 202/335 variables, 133/157 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 129/286 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 501/787 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (OVERLAPS) 1/336 variables, 1/788 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 8 (OVERLAPS) 1/337 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 789 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 134/134 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 0/0 constraints]
After SMT, in 54631ms problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 54636ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55232 ms. Remains : 134/134 places, 502/502 transitions.
Treatment of property CloudDeployment-PT-6a-LTLFireability-10 finished in 169055 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&&F(((X(F(!p1))&&(!p2 U (G(!p2)||(!p2&&G(!p3)))))||G(F(!p1)))))))'
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 6 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-23 13:31:13] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-23 13:31:13] [INFO ] Computed 24 invariants in 3 ms
[2024-05-23 13:31:14] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-23 13:31:14] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:31:14] [INFO ] Invariant cache hit.
[2024-05-23 13:31:14] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-23 13:31:14] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-23 13:31:14] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:31:14] [INFO ] Invariant cache hit.
[2024-05-23 13:31:14] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 7 (OVERLAPS) 1/573 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/573 variables, and 395 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 708/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (OVERLAPS) 1/572 variables, 1/1102 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/573 variables, and 1102 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
After SMT, in 60906ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 60916ms
Finished structural reductions in LTL mode , in 1 iterations and 61311 ms. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p0) p1), p1, (AND p1 p2 p3), p1, (AND p1 p2), (AND p1 p3), (AND p1 p3)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-12
Product exploration explored 100000 steps with 3 reset in 117 ms.
Product exploration explored 100000 steps with 1 reset in 123 ms.
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Computed a total of 97 stabilizing places and 505 stable transitions
Detected a total of 97/199 stabilizing places and 505/709 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (OR p1 (NOT p2)))), (X p0), (X (AND (NOT p3) p2)), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p1 p2))), (X (AND p0 p2)), (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2))))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p1 p3 p2))), (X (NOT (AND p3 p2))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (OR p1 (NOT p2))))), (X (X p0)), (X (X (AND (NOT p3) p2))), (X (X (NOT (OR (AND p1 p3) (AND p3 (NOT p2)))))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2)))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 35 factoid took 755 ms. Reduced automaton from 7 states, 27 edges and 4 AP (stutter sensitive) to 7 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(AND p1 p2 p3), p1, (AND p1 p2 p3), p1, (AND p1 p2), (AND p1 p3), (AND p1 p3)]
RANDOM walk for 40000 steps (460 resets) in 384 ms. (103 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40003 steps (35 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (29 resets) in 262 ms. (152 steps per ms) remains 1/4 properties
[2024-05-23 13:32:17] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:32:17] [INFO ] Invariant cache hit.
[2024-05-23 13:32:17] [INFO ] State equation strengthened by 172 read => feed constraints.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 169/198 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/573 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/573 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/573 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 573/573 variables, and 395 constraints, problems are : Problem set: 0 solved, 1 unsolved in 164 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 169/198 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/572 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/573 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/573 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/573 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 573/573 variables, and 396 constraints, problems are : Problem set: 0 solved, 1 unsolved in 214 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 387ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 3 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 237 edges and 199 vertex of which 58 / 199 are part of one of the 18 SCC in 0 ms
Free SCC test removed 40 places
Drop transitions (Empty/Sink Transition effects.) removed 129 transitions
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 170 transitions.
Graph (complete) has 1063 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 8 place count 152 transition count 497
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 152 transition count 497
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 26 place count 146 transition count 491
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 62 place count 128 transition count 557
Drop transitions (Redundant composition of simpler transitions.) removed 109 transitions
Redundant transition composition rules discarded 109 transitions
Iterating global reduction 0 with 109 rules applied. Total rules applied 171 place count 128 transition count 448
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 172 place count 128 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 173 place count 127 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 174 place count 127 transition count 448
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 175 place count 127 transition count 448
Applied a total of 175 rules in 73 ms. Remains 127 /199 variables (removed 72) and now considering 448/709 (removed 261) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 127/199 places, 448/709 transitions.
RANDOM walk for 40000 steps (603 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (30 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 994946 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :0 out of 1
Probabilistic random walk after 994946 steps, saw 176693 distinct states, run finished after 3004 ms. (steps per millisecond=331 ) properties seen :0
[2024-05-23 13:32:20] [INFO ] Flow matrix only has 196 transitions (discarded 252 similar events)
// Phase 1: matrix 196 rows 127 cols
[2024-05-23 13:32:20] [INFO ] Computed 24 invariants in 2 ms
[2024-05-23 13:32:20] [INFO ] State equation strengthened by 131 read => feed constraints.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/76 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/78 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 13:32:20] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 49/127 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 196/323 variables, 127/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 131/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/323 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 127/127 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/76 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/78 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 49/127 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 196/323 variables, 127/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 131/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 13:32:21] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 2 ms to minimize.
Problem apf5 is UNSAT
After SMT solving in domain Int declared 323/323 variables, and 285 constraints, problems are : Problem set: 1 solved, 0 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 127/127 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 412ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (OR p1 (NOT p2)))), (X p0), (X (AND (NOT p3) p2)), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p1 p2))), (X (AND p0 p2)), (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2))))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p1 p3 p2))), (X (NOT (AND p3 p2))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (OR p1 (NOT p2))))), (X (X p0)), (X (X (AND (NOT p3) p2))), (X (X (NOT (OR (AND p1 p3) (AND p3 (NOT p2)))))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2)))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p2 (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR p3 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND (OR p2 (NOT p3)) (OR (NOT p3) (NOT p1))))), (F p1), (F p2), (F (NOT (OR (NOT p2) p3))), (F p3), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p3) (NOT p1))))]
Knowledge based reduction with 36 factoid took 2816 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Stuttering acceptance computed with spot in 181 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 6 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-23 13:32:24] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-23 13:32:24] [INFO ] Computed 24 invariants in 2 ms
[2024-05-23 13:32:24] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-23 13:32:24] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:32:24] [INFO ] Invariant cache hit.
[2024-05-23 13:32:24] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-23 13:32:24] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-23 13:32:24] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:32:24] [INFO ] Invariant cache hit.
[2024-05-23 13:32:24] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 7 (OVERLAPS) 1/573 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/573 variables, and 395 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 708/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (OVERLAPS) 1/572 variables, 1/1102 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/573 variables, and 1102 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
After SMT, in 61062ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 61073ms
Finished structural reductions in LTL mode , in 1 iterations and 61443 ms. Remains : 199/199 places, 709/709 transitions.
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 97 stabilizing places and 505 stable transitions
Detected a total of 97/199 stabilizing places and 505/709 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (OR (NOT p2) p1)))), (X (X (NOT (AND p3 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 276 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
RANDOM walk for 40000 steps (452 resets) in 158 ms. (251 steps per ms) remains 1/5 properties
BEST_FIRST walk for 25254 steps (19 resets) in 36 ms. (682 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (OR (NOT p2) p1)))), (X (X (NOT (AND p3 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p3) (NOT p1)))), (F p2), (F (NOT (OR p1 (NOT p2)))), (F p3)]
Knowledge based reduction with 11 factoid took 610 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Stuttering acceptance computed with spot in 178 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Stuttering acceptance computed with spot in 175 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Product exploration explored 100000 steps with 0 reset in 90 ms.
Product exploration explored 100000 steps with 0 reset in 93 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 164 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 233 edges and 199 vertex of which 58 / 199 are part of one of the 18 SCC in 1 ms
Free SCC test removed 40 places
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 153 transition count 546
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 153 transition count 546
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -104
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 0 with 17 rules applied. Total rules applied 30 place count 153 transition count 650
Deduced a syphon composed of 17 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 121 transitions
Redundant transition composition rules discarded 121 transitions
Iterating global reduction 0 with 121 rules applied. Total rules applied 151 place count 153 transition count 529
Deduced a syphon composed of 17 places in 1 ms
Applied a total of 151 rules in 40 ms. Remains 153 /199 variables (removed 46) and now considering 529/709 (removed 180) transitions.
[2024-05-23 13:33:28] [INFO ] Redundant transitions in 271 ms returned []
Running 528 sub problems to find dead transitions.
[2024-05-23 13:33:28] [INFO ] Flow matrix only has 230 transitions (discarded 299 similar events)
// Phase 1: matrix 230 rows 153 cols
[2024-05-23 13:33:28] [INFO ] Computed 24 invariants in 1 ms
[2024-05-23 13:33:28] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 528 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD101 is UNSAT
At refinement iteration 2 (OVERLAPS) 229/381 variables, 152/176 constraints. Problems are: Problem set: 23 solved, 505 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 130/306 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/306 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 5 (OVERLAPS) 1/382 variables, 1/307 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 0/307 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 7 (OVERLAPS) 1/383 variables, 1/308 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 0/308 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 9 (OVERLAPS) 0/383 variables, 0/308 constraints. Problems are: Problem set: 23 solved, 505 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 308 constraints, problems are : Problem set: 23 solved, 505 unsolved in 25885 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 153/153 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 528/528 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 23 solved, 505 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 18/18 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 2 (OVERLAPS) 17/152 variables, 6/24 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/24 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 4 (OVERLAPS) 229/381 variables, 152/176 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 130/306 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 505/811 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/811 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 8 (OVERLAPS) 1/382 variables, 1/812 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/812 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 10 (OVERLAPS) 1/383 variables, 1/813 constraints. Problems are: Problem set: 23 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/383 variables, and 813 constraints, problems are : Problem set: 23 solved, 505 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 153/153 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 505/528 constraints, Known Traps: 0/0 constraints]
After SMT, in 56444ms problems are : Problem set: 23 solved, 505 unsolved
Search for dead transitions found 23 dead transitions in 56449ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 153/199 places, 506/709 transitions.
Graph (complete) has 1622 edges and 153 vertex of which 136 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 21 ms. Remains 136 /153 variables (removed 17) and now considering 506/506 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 136/199 places, 506/709 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56790 ms. Remains : 136/199 places, 506/709 transitions.
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 2 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-23 13:34:24] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-23 13:34:24] [INFO ] Computed 24 invariants in 2 ms
[2024-05-23 13:34:24] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-23 13:34:24] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:34:24] [INFO ] Invariant cache hit.
[2024-05-23 13:34:24] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-23 13:34:25] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-23 13:34:25] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:34:25] [INFO ] Invariant cache hit.
[2024-05-23 13:34:25] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 7 (OVERLAPS) 1/573 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/573 variables, and 395 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 708/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (OVERLAPS) 1/572 variables, 1/1102 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/573 variables, and 1102 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
After SMT, in 61311ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 61320ms
Finished structural reductions in LTL mode , in 1 iterations and 61664 ms. Remains : 199/199 places, 709/709 transitions.
Treatment of property CloudDeployment-PT-6a-LTLFireability-12 finished in 252526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 3 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 3 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-23 13:35:26] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:35:26] [INFO ] Invariant cache hit.
[2024-05-23 13:35:26] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-23 13:35:26] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:35:26] [INFO ] Invariant cache hit.
[2024-05-23 13:35:26] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-23 13:35:26] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-23 13:35:26] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-23 13:35:26] [INFO ] Invariant cache hit.
[2024-05-23 13:35:26] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 7 (OVERLAPS) 1/573 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/573 variables, and 395 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 708/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (OVERLAPS) 1/572 variables, 1/1102 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/573 variables, and 1102 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
After SMT, in 61036ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 61046ms
Finished structural reductions in LTL mode , in 1 iterations and 61443 ms. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-13 finished in 61573 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((G(p1)||p0)))'
Support contains 9 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 235 edges and 199 vertex of which 60 / 199 are part of one of the 18 SCC in 0 ms
Free SCC test removed 42 places
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 151 transition count 541
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 151 transition count 541
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 49 place count 133 transition count 607
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 0 with 108 rules applied. Total rules applied 157 place count 133 transition count 499
Applied a total of 157 rules in 39 ms. Remains 133 /199 variables (removed 66) and now considering 499/709 (removed 210) transitions.
[2024-05-23 13:36:28] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
// Phase 1: matrix 200 rows 133 cols
[2024-05-23 13:36:28] [INFO ] Computed 24 invariants in 2 ms
[2024-05-23 13:36:28] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-23 13:36:28] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-23 13:36:28] [INFO ] Invariant cache hit.
[2024-05-23 13:36:28] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-23 13:36:28] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-05-23 13:36:28] [INFO ] Redundant transitions in 272 ms returned []
Running 498 sub problems to find dead transitions.
[2024-05-23 13:36:28] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-23 13:36:28] [INFO ] Invariant cache hit.
[2024-05-23 13:36:28] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 199/331 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 498 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 129/285 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 1/332 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (OVERLAPS) 1/333 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 9 (OVERLAPS) 0/333 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 498 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 287 constraints, problems are : Problem set: 0 solved, 498 unsolved in 23238 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 133/133 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 199/331 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 129/285 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 498/783 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (OVERLAPS) 1/332 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 8 (OVERLAPS) 1/333 variables, 1/785 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/333 variables, and 785 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 133/133 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 0/0 constraints]
After SMT, in 53752ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 53757ms
Starting structural reductions in SI_LTL mode, iteration 1 : 133/199 places, 499/709 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54395 ms. Remains : 133/199 places, 499/709 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 100 ms.
Product exploration explored 100000 steps with 0 reset in 107 ms.
Computed a total of 79 stabilizing places and 391 stable transitions
Graph (complete) has 1607 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 79 stabilizing places and 391 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 8 factoid took 131 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (649 resets) in 160 ms. (248 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (71 resets) in 40 ms. (975 steps per ms) remains 1/3 properties
[2024-05-23 13:37:22] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-23 13:37:22] [INFO ] Invariant cache hit.
[2024-05-23 13:37:23] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 132/333 variables, and 24 constraints, problems are : Problem set: 1 solved, 0 unsolved in 40 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/133 constraints, ReadFeed: 0/130 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 62ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (G (OR p1 p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 9 factoid took 219 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 9 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 499/499 transitions.
Applied a total of 0 rules in 14 ms. Remains 133 /133 variables (removed 0) and now considering 499/499 (removed 0) transitions.
[2024-05-23 13:37:23] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-23 13:37:23] [INFO ] Invariant cache hit.
[2024-05-23 13:37:23] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-23 13:37:23] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-23 13:37:23] [INFO ] Invariant cache hit.
[2024-05-23 13:37:23] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-23 13:37:23] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-05-23 13:37:24] [INFO ] Redundant transitions in 281 ms returned []
Running 498 sub problems to find dead transitions.
[2024-05-23 13:37:24] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-23 13:37:24] [INFO ] Invariant cache hit.
[2024-05-23 13:37:24] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 199/331 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 498 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 129/285 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 1/332 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (OVERLAPS) 1/333 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 9 (OVERLAPS) 0/333 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 498 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 287 constraints, problems are : Problem set: 0 solved, 498 unsolved in 23362 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 133/133 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 199/331 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 129/285 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 498/783 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (OVERLAPS) 1/332 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 8 (OVERLAPS) 1/333 variables, 1/785 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/333 variables, and 785 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 133/133 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 0/0 constraints]
After SMT, in 53891ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 53895ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54511 ms. Remains : 133/133 places, 499/499 transitions.
Computed a total of 79 stabilizing places and 391 stable transitions
Graph (complete) has 1607 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 79 stabilizing places and 391 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 144 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (643 resets) in 182 ms. (218 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (71 resets) in 51 ms. (769 steps per ms) remains 1/3 properties
[2024-05-23 13:38:18] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-23 13:38:18] [INFO ] Invariant cache hit.
[2024-05-23 13:38:18] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 132/333 variables, and 24 constraints, problems are : Problem set: 1 solved, 0 unsolved in 34 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/133 constraints, ReadFeed: 0/130 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 44ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 244 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 99 ms.
Product exploration explored 100000 steps with 0 reset in 115 ms.
Support contains 9 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 499/499 transitions.
Applied a total of 0 rules in 18 ms. Remains 133 /133 variables (removed 0) and now considering 499/499 (removed 0) transitions.
[2024-05-23 13:38:19] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-23 13:38:19] [INFO ] Invariant cache hit.
[2024-05-23 13:38:19] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-23 13:38:19] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-23 13:38:19] [INFO ] Invariant cache hit.
[2024-05-23 13:38:19] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-23 13:38:19] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2024-05-23 13:38:19] [INFO ] Redundant transitions in 281 ms returned []
Running 498 sub problems to find dead transitions.
[2024-05-23 13:38:19] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-23 13:38:19] [INFO ] Invariant cache hit.
[2024-05-23 13:38:19] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 199/331 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 498 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 129/285 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 1/332 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (OVERLAPS) 1/333 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 9 (OVERLAPS) 0/333 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 498 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 287 constraints, problems are : Problem set: 0 solved, 498 unsolved in 23997 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 133/133 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 199/331 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 129/285 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 498/783 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (OVERLAPS) 1/332 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 8 (OVERLAPS) 1/333 variables, 1/785 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/333 variables, and 785 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 133/133 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 0/0 constraints]
After SMT, in 54495ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 54500ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55093 ms. Remains : 133/133 places, 499/499 transitions.
Treatment of property CloudDeployment-PT-6a-LTLFireability-14 finished in 166165 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((F(p0)&&(p1||F(p2))))))))'
Found a Shortening insensitive property : CloudDeployment-PT-6a-LTLFireability-05
Stuttering acceptance computed with spot in 272 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 229 edges and 199 vertex of which 59 / 199 are part of one of the 18 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 152 transition count 543
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 152 transition count 543
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 49 place count 134 transition count 609
Applied a total of 49 rules in 37 ms. Remains 134 /199 variables (removed 65) and now considering 609/709 (removed 100) transitions.
[2024-05-23 13:39:14] [INFO ] Flow matrix only has 310 transitions (discarded 299 similar events)
// Phase 1: matrix 310 rows 134 cols
[2024-05-23 13:39:14] [INFO ] Computed 24 invariants in 1 ms
[2024-05-23 13:39:14] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-23 13:39:14] [INFO ] Flow matrix only has 310 transitions (discarded 299 similar events)
[2024-05-23 13:39:14] [INFO ] Invariant cache hit.
[2024-05-23 13:39:14] [INFO ] State equation strengthened by 202 read => feed constraints.
[2024-05-23 13:39:14] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 608 sub problems to find dead transitions.
[2024-05-23 13:39:14] [INFO ] Flow matrix only has 310 transitions (discarded 299 similar events)
[2024-05-23 13:39:14] [INFO ] Invariant cache hit.
[2024-05-23 13:39:14] [INFO ] State equation strengthened by 202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 2 (OVERLAPS) 309/442 variables, 133/157 constraints. Problems are: Problem set: 0 solved, 608 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 201/358 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 5 (OVERLAPS) 1/443 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 7 (OVERLAPS) 1/444 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 360 constraints, problems are : Problem set: 0 solved, 608 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 134/134 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 608/608 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 2 (OVERLAPS) 309/442 variables, 133/157 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 201/358 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 608/966 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 0/966 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 6 (OVERLAPS) 1/443 variables, 1/967 constraints. Problems are: Problem set: 0 solved, 608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/444 variables, and 967 constraints, problems are : Problem set: 0 solved, 608 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 134/134 constraints, ReadFeed: 201/202 constraints, PredecessorRefiner: 608/608 constraints, Known Traps: 0/0 constraints]
After SMT, in 60679ms problems are : Problem set: 0 solved, 608 unsolved
Search for dead transitions found 0 dead transitions in 60689ms
Starting structural reductions in LI_LTL mode, iteration 1 : 134/199 places, 609/709 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61092 ms. Remains : 134/199 places, 609/709 transitions.
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-05
Product exploration explored 100000 steps with 25000 reset in 1315 ms.
Product exploration explored 100000 steps with 25000 reset in 1223 ms.
Computed a total of 79 stabilizing places and 493 stable transitions
Graph (complete) has 1717 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 79 stabilizing places and 493 stable transitions
Detected a total of 79/134 stabilizing places and 493/609 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 19204 steps (392 resets) in 88 ms. (215 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p1 p2 p0), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (AND (OR (NOT p2) p0) (OR p0 (NOT p1))))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 340 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 253 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 609/609 transitions.
Applied a total of 0 rules in 1 ms. Remains 134 /134 variables (removed 0) and now considering 609/609 (removed 0) transitions.
[2024-05-23 13:40:19] [INFO ] Flow matrix only has 310 transitions (discarded 299 similar events)
[2024-05-23 13:40:19] [INFO ] Invariant cache hit.
[2024-05-23 13:40:19] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-23 13:40:19] [INFO ] Flow matrix only has 310 transitions (discarded 299 similar events)
[2024-05-23 13:40:19] [INFO ] Invariant cache hit.
[2024-05-23 13:40:19] [INFO ] State equation strengthened by 202 read => feed constraints.
[2024-05-23 13:40:19] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 608 sub problems to find dead transitions.
[2024-05-23 13:40:19] [INFO ] Flow matrix only has 310 transitions (discarded 299 similar events)
[2024-05-23 13:40:19] [INFO ] Invariant cache hit.
[2024-05-23 13:40:19] [INFO ] State equation strengthened by 202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 2 (OVERLAPS) 309/442 variables, 133/157 constraints. Problems are: Problem set: 0 solved, 608 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 201/358 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 5 (OVERLAPS) 1/443 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 7 (OVERLAPS) 1/444 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 360 constraints, problems are : Problem set: 0 solved, 608 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 134/134 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 608/608 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 2 (OVERLAPS) 309/442 variables, 133/157 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 201/358 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 608/966 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 0/966 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 6 (OVERLAPS) 1/443 variables, 1/967 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 608 unsolved
SMT process timed out in 60675ms, After SMT, problems are : Problem set: 0 solved, 608 unsolved
Search for dead transitions found 0 dead transitions in 60681ms
Finished structural reductions in LTL mode , in 1 iterations and 61042 ms. Remains : 134/134 places, 609/609 transitions.
Computed a total of 79 stabilizing places and 493 stable transitions
Graph (complete) has 1717 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 79 stabilizing places and 493 stable transitions
Detected a total of 79/134 stabilizing places and 493/609 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 12193 steps (250 resets) in 60 ms. (199 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p2 p1 p0), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (AND (OR (NOT p2) p0) (OR p0 (NOT p1))))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 299 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 229 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 298 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 25000 reset in 1255 ms.
Product exploration explored 100000 steps with 25000 reset in 1252 ms.
Applying partial POR strategy [true, true, true, true, false, false, false]
Stuttering acceptance computed with spot in 247 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 609/609 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 107 transitions
Redundant transition composition rules discarded 107 transitions
Iterating global reduction 0 with 107 rules applied. Total rules applied 107 place count 134 transition count 502
Applied a total of 107 rules in 23 ms. Remains 134 /134 variables (removed 0) and now considering 502/609 (removed 107) transitions.
[2024-05-23 13:41:25] [INFO ] Redundant transitions in 282 ms returned []
Running 501 sub problems to find dead transitions.
[2024-05-23 13:41:25] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
// Phase 1: matrix 203 rows 134 cols
[2024-05-23 13:41:25] [INFO ] Computed 24 invariants in 3 ms
[2024-05-23 13:41:25] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 202/335 variables, 133/157 constraints. Problems are: Problem set: 0 solved, 501 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 129/286 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (OVERLAPS) 1/336 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 7 (OVERLAPS) 1/337 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 9 (OVERLAPS) 0/337 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 501 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 288 constraints, problems are : Problem set: 0 solved, 501 unsolved in 23795 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 134/134 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 501 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 202/335 variables, 133/157 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 129/286 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 501/787 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (OVERLAPS) 1/336 variables, 1/788 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 8 (OVERLAPS) 1/337 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 789 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 134/134 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 0/0 constraints]
After SMT, in 54346ms problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 54351ms
Starting structural reductions in SI_LTL mode, iteration 1 : 134/134 places, 502/609 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54664 ms. Remains : 134/134 places, 502/609 transitions.
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 609/609 transitions.
Applied a total of 0 rules in 2 ms. Remains 134 /134 variables (removed 0) and now considering 609/609 (removed 0) transitions.
[2024-05-23 13:42:19] [INFO ] Flow matrix only has 310 transitions (discarded 299 similar events)
// Phase 1: matrix 310 rows 134 cols
[2024-05-23 13:42:19] [INFO ] Computed 24 invariants in 1 ms
[2024-05-23 13:42:19] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-23 13:42:19] [INFO ] Flow matrix only has 310 transitions (discarded 299 similar events)
[2024-05-23 13:42:19] [INFO ] Invariant cache hit.
[2024-05-23 13:42:19] [INFO ] State equation strengthened by 202 read => feed constraints.
[2024-05-23 13:42:19] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 608 sub problems to find dead transitions.
[2024-05-23 13:42:19] [INFO ] Flow matrix only has 310 transitions (discarded 299 similar events)
[2024-05-23 13:42:19] [INFO ] Invariant cache hit.
[2024-05-23 13:42:19] [INFO ] State equation strengthened by 202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 2 (OVERLAPS) 309/442 variables, 133/157 constraints. Problems are: Problem set: 0 solved, 608 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 201/358 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 5 (OVERLAPS) 1/443 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 7 (OVERLAPS) 1/444 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 360 constraints, problems are : Problem set: 0 solved, 608 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 134/134 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 608/608 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 2 (OVERLAPS) 309/442 variables, 133/157 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 201/358 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 608/966 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 0/966 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 6 (OVERLAPS) 1/443 variables, 1/967 constraints. Problems are: Problem set: 0 solved, 608 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 1)
(s17 1)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 1)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 1)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 1)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)timeout

(s111 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/444 variables, and 967 constraints, problems are : Problem set: 0 solved, 608 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 134/134 constraints, ReadFeed: 201/202 constraints, PredecessorRefiner: 608/608 constraints, Known Traps: 0/0 constraints]
After SMT, in 60671ms problems are : Problem set: 0 solved, 608 unsolved
Search for dead transitions found 0 dead transitions in 60676ms
Finished structural reductions in LTL mode , in 1 iterations and 61051 ms. Remains : 134/134 places, 609/609 transitions.
Treatment of property CloudDeployment-PT-6a-LTLFireability-05 finished in 246489 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(p0)||F(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(((X(F(!p1))&&(!p2 U (G(!p2)||(!p2&&G(!p3)))))||G(F(!p1)))))))'
Found a Shortening insensitive property : CloudDeployment-PT-6a-LTLFireability-12
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) p1), p1, (AND p1 p2 p3), p1, (AND p1 p2), (AND p1 p3), (AND p1 p3)]
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 233 edges and 199 vertex of which 58 / 199 are part of one of the 18 SCC in 0 ms
Free SCC test removed 40 places
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 153 transition count 546
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 153 transition count 546
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 47 place count 136 transition count 611
Applied a total of 47 rules in 11 ms. Remains 136 /199 variables (removed 63) and now considering 611/709 (removed 98) transitions.
[2024-05-23 13:43:21] [INFO ] Flow matrix only has 312 transitions (discarded 299 similar events)
// Phase 1: matrix 312 rows 136 cols
[2024-05-23 13:43:21] [INFO ] Computed 24 invariants in 2 ms
[2024-05-23 13:43:21] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-23 13:43:21] [INFO ] Flow matrix only has 312 transitions (discarded 299 similar events)
[2024-05-23 13:43:21] [INFO ] Invariant cache hit.
[2024-05-23 13:43:21] [INFO ] State equation strengthened by 203 read => feed constraints.
[2024-05-23 13:43:21] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 610 sub problems to find dead transitions.
[2024-05-23 13:43:21] [INFO ] Flow matrix only has 312 transitions (discarded 299 similar events)
[2024-05-23 13:43:21] [INFO ] Invariant cache hit.
[2024-05-23 13:43:21] [INFO ] State equation strengthened by 203 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (OVERLAPS) 311/446 variables, 135/159 constraints. Problems are: Problem set: 0 solved, 610 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 202/361 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 5 (OVERLAPS) 1/447 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 7 (OVERLAPS) 1/448 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/448 variables, and 363 constraints, problems are : Problem set: 0 solved, 610 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 136/136 constraints, ReadFeed: 203/203 constraints, PredecessorRefiner: 610/610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (OVERLAPS) 311/446 variables, 135/159 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 202/361 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 610/971 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 6 (OVERLAPS) 1/447 variables, 1/972 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 0/972 constraints. Problems are: Problem set: 0 solved, 610 unsolved
SMT process timed out in 60663ms, After SMT, problems are : Problem set: 0 solved, 610 unsolved
Search for dead transitions found 0 dead transitions in 60668ms
Starting structural reductions in LI_LTL mode, iteration 1 : 136/199 places, 611/709 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61004 ms. Remains : 136/199 places, 611/709 transitions.
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-12
Product exploration explored 100000 steps with 2 reset in 117 ms.
Product exploration explored 100000 steps with 1 reset in 127 ms.
Computed a total of 80 stabilizing places and 493 stable transitions
Graph (complete) has 1727 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 80 stabilizing places and 493 stable transitions
Detected a total of 80/136 stabilizing places and 493/611 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (OR p1 (NOT p2)))), (X p0), (X (AND (NOT p3) p2)), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p1 p2))), (X (AND p0 p2)), (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2))))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p1 p3 p2))), (X (NOT (AND p3 p2))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (OR p1 (NOT p2))))), (X (X p0)), (X (X (AND (NOT p3) p2))), (X (X (NOT (OR (AND p1 p3) (AND p3 (NOT p2)))))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2)))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 35 factoid took 657 ms. Reduced automaton from 7 states, 27 edges and 4 AP (stutter sensitive) to 7 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(AND p1 p2 p3), p1, (AND p1 p2 p3), p1, (AND p1 p2), (AND p1 p3), (AND p1 p3)]
RANDOM walk for 40000 steps (797 resets) in 235 ms. (169 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40001 steps (24 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (25 resets) in 71 ms. (555 steps per ms) remains 1/4 properties
[2024-05-23 13:44:23] [INFO ] Flow matrix only has 312 transitions (discarded 299 similar events)
[2024-05-23 13:44:23] [INFO ] Invariant cache hit.
[2024-05-23 13:44:23] [INFO ] State equation strengthened by 203 read => feed constraints.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/135 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 311/446 variables, 135/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 202/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/447 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/448 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/448 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/448 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/448 variables, and 363 constraints, problems are : Problem set: 0 solved, 1 unsolved in 134 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 136/136 constraints, ReadFeed: 203/203 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/135 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 311/446 variables, 135/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 202/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/447 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/448 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/448 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/448 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 448/448 variables, and 364 constraints, problems are : Problem set: 0 solved, 1 unsolved in 186 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 136/136 constraints, ReadFeed: 203/203 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 329ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 611/611 transitions.
Graph (complete) has 1098 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 135 transition count 562
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 62 place count 129 transition count 556
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 1 with 2 rules applied. Total rules applied 64 place count 128 transition count 557
Drop transitions (Redundant composition of simpler transitions.) removed 109 transitions
Redundant transition composition rules discarded 109 transitions
Iterating global reduction 1 with 109 rules applied. Total rules applied 173 place count 128 transition count 448
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 174 place count 128 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 175 place count 127 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 127 transition count 448
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 177 place count 127 transition count 448
Applied a total of 177 rules in 39 ms. Remains 127 /136 variables (removed 9) and now considering 448/611 (removed 163) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 127/136 places, 448/611 transitions.
RANDOM walk for 40000 steps (599 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (13 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1043871 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :0 out of 1
Probabilistic random walk after 1043871 steps, saw 184804 distinct states, run finished after 3001 ms. (steps per millisecond=347 ) properties seen :0
[2024-05-23 13:44:27] [INFO ] Flow matrix only has 196 transitions (discarded 252 similar events)
// Phase 1: matrix 196 rows 127 cols
[2024-05-23 13:44:27] [INFO ] Computed 24 invariants in 7 ms
[2024-05-23 13:44:27] [INFO ] State equation strengthened by 131 read => feed constraints.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/76 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/78 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 13:44:27] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 49/127 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 196/323 variables, 127/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 131/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/323 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 127/127 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/76 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/78 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 49/127 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 196/323 variables, 127/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 131/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 13:44:27] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
Problem apf5 is UNSAT
After SMT solving in domain Int declared 323/323 variables, and 285 constraints, problems are : Problem set: 1 solved, 0 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 127/127 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 350ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (OR p1 (NOT p2)))), (X p0), (X (AND (NOT p3) p2)), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p1 p2))), (X (AND p0 p2)), (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2))))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p1 p3 p2))), (X (NOT (AND p3 p2))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (OR p1 (NOT p2))))), (X (X p0)), (X (X (AND (NOT p3) p2))), (X (X (NOT (OR (AND p1 p3) (AND p3 (NOT p2)))))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2)))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p2 (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR p3 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND (OR p2 (NOT p3)) (OR (NOT p3) (NOT p1))))), (F p1), (F p2), (F (NOT (OR (NOT p2) p3))), (F p3), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p3) (NOT p1))))]
Knowledge based reduction with 36 factoid took 2580 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Stuttering acceptance computed with spot in 149 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Support contains 8 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 611/611 transitions.
Applied a total of 0 rules in 2 ms. Remains 136 /136 variables (removed 0) and now considering 611/611 (removed 0) transitions.
[2024-05-23 13:44:30] [INFO ] Flow matrix only has 312 transitions (discarded 299 similar events)
// Phase 1: matrix 312 rows 136 cols
[2024-05-23 13:44:30] [INFO ] Computed 24 invariants in 2 ms
[2024-05-23 13:44:30] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-23 13:44:30] [INFO ] Flow matrix only has 312 transitions (discarded 299 similar events)
[2024-05-23 13:44:30] [INFO ] Invariant cache hit.
[2024-05-23 13:44:30] [INFO ] State equation strengthened by 203 read => feed constraints.
[2024-05-23 13:44:30] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 610 sub problems to find dead transitions.
[2024-05-23 13:44:30] [INFO ] Flow matrix only has 312 transitions (discarded 299 similar events)
[2024-05-23 13:44:30] [INFO ] Invariant cache hit.
[2024-05-23 13:44:30] [INFO ] State equation strengthened by 203 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (OVERLAPS) 311/446 variables, 135/159 constraints. Problems are: Problem set: 0 solved, 610 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 202/361 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 5 (OVERLAPS) 1/447 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 7 (OVERLAPS) 1/448 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/448 variables, and 363 constraints, problems are : Problem set: 0 solved, 610 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 136/136 constraints, ReadFeed: 203/203 constraints, PredecessorRefiner: 610/610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (OVERLAPS) 311/446 variables, 135/159 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 202/361 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 610/971 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 6 (OVERLAPS) 1/447 variables, 1/972 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 0/972 constraints. Problems are: Problem set: 0 solved, 610 unsolved
SMT process timed out in 60705ms, After SMT, problems are : Problem set: 0 solved, 610 unsolved
Search for dead transitions found 0 dead transitions in 60712ms
Finished structural reductions in LTL mode , in 1 iterations and 61037 ms. Remains : 136/136 places, 611/611 transitions.
Computed a total of 80 stabilizing places and 493 stable transitions
Graph (complete) has 1727 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 80 stabilizing places and 493 stable transitions
Detected a total of 80/136 stabilizing places and 493/611 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (OR (NOT p2) p1)))), (X (X (NOT (AND p3 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 259 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
RANDOM walk for 40000 steps (789 resets) in 354 ms. (112 steps per ms) remains 1/5 properties
BEST_FIRST walk for 22872 steps (28 resets) in 30 ms. (737 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (OR (NOT p2) p1)))), (X (X (NOT (AND p3 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p3) (NOT p1)))), (F p2), (F (NOT (OR p1 (NOT p2)))), (F p3)]
Knowledge based reduction with 11 factoid took 603 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Stuttering acceptance computed with spot in 161 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Stuttering acceptance computed with spot in 162 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Product exploration explored 100000 steps with 0 reset in 79 ms.
Product exploration explored 100000 steps with 0 reset in 90 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 167 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Support contains 8 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 611/611 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 105 transitions
Redundant transition composition rules discarded 105 transitions
Iterating global reduction 0 with 105 rules applied. Total rules applied 105 place count 136 transition count 506
Applied a total of 105 rules in 23 ms. Remains 136 /136 variables (removed 0) and now considering 506/611 (removed 105) transitions.
[2024-05-23 13:45:33] [INFO ] Redundant transitions in 285 ms returned []
Running 505 sub problems to find dead transitions.
[2024-05-23 13:45:33] [INFO ] Flow matrix only has 207 transitions (discarded 299 similar events)
// Phase 1: matrix 207 rows 136 cols
[2024-05-23 13:45:33] [INFO ] Computed 24 invariants in 3 ms
[2024-05-23 13:45:33] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (OVERLAPS) 206/341 variables, 135/159 constraints. Problems are: Problem set: 0 solved, 505 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 130/289 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 5 (OVERLAPS) 1/342 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 505 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 291 constraints, problems are : Problem set: 0 solved, 505 unsolved in 24632 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 136/136 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 505 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (OVERLAPS) 206/341 variables, 135/159 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 130/289 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 505/794 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 6 (OVERLAPS) 1/342 variables, 1/795 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/796 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/343 variables, and 796 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 136/136 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 0/0 constraints]
After SMT, in 55190ms problems are : Problem set: 0 solved, 505 unsolved
Search for dead transitions found 0 dead transitions in 55195ms
Starting structural reductions in SI_LTL mode, iteration 1 : 136/136 places, 506/611 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55511 ms. Remains : 136/136 places, 506/611 transitions.
Support contains 8 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 611/611 transitions.
Applied a total of 0 rules in 2 ms. Remains 136 /136 variables (removed 0) and now considering 611/611 (removed 0) transitions.
[2024-05-23 13:46:28] [INFO ] Flow matrix only has 312 transitions (discarded 299 similar events)
// Phase 1: matrix 312 rows 136 cols
[2024-05-23 13:46:28] [INFO ] Computed 24 invariants in 2 ms
[2024-05-23 13:46:28] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-23 13:46:28] [INFO ] Flow matrix only has 312 transitions (discarded 299 similar events)
[2024-05-23 13:46:28] [INFO ] Invariant cache hit.
[2024-05-23 13:46:29] [INFO ] State equation strengthened by 203 read => feed constraints.
[2024-05-23 13:46:29] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 610 sub problems to find dead transitions.
[2024-05-23 13:46:29] [INFO ] Flow matrix only has 312 transitions (discarded 299 similar events)
[2024-05-23 13:46:29] [INFO ] Invariant cache hit.
[2024-05-23 13:46:29] [INFO ] State equation strengthened by 203 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (OVERLAPS) 311/446 variables, 135/159 constraints. Problems are: Problem set: 0 solved, 610 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 202/361 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 5 (OVERLAPS) 1/447 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 7 (OVERLAPS) 1/448 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/448 variables, and 363 constraints, problems are : Problem set: 0 solved, 610 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 136/136 constraints, ReadFeed: 203/203 constraints, PredecessorRefiner: 610/610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (OVERLAPS) 311/446 variables, 135/159 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 202/361 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 610/971 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 6 (OVERLAPS) 1/447 variables, 1/972 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 0/972 constraints. Problems are: Problem set: 0 solved, 610 unsolved
SMT process timed out in 60683ms, After SMT, problems are : Problem set: 0 solved, 610 unsolved
Search for dead transitions found 0 dead transitions in 60691ms
Finished structural reductions in LTL mode , in 1 iterations and 61015 ms. Remains : 136/136 places, 611/611 transitions.
Treatment of property CloudDeployment-PT-6a-LTLFireability-12 finished in 249188 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((G(p1)||p0)))'
[2024-05-23 13:47:30] [INFO ] Flatten gal took : 39 ms
[2024-05-23 13:47:30] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-23 13:47:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 199 places, 709 transitions and 4745 arcs took 11 ms.
Total runtime 1647932 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CloudDeployment-PT-6a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 199
TRANSITIONS: 709
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.024s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.003s, 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: 2705
MODEL NAME: /home/mcc/execution/412/model
199 places, 709 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.
Building monolithic NSF...
FORMULA CloudDeployment-PT-6a-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-6a-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-6a-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-6a-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716472059806

--------------------
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 LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudDeployment-PT-6a"
export BK_EXAMINATION="LTLFireability"
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-6a, examination is LTLFireability"
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-171620504900604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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