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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 22:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 11 22:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 22:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 22:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 46K 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 GPUForwardProgress-PT-08b-LTLCardinality-00
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-01
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-02
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-03
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-04
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-05
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-06
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-07
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-08
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-09
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-10
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-11
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-12
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-13
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-14
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717197639169

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-08b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:20:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 23:20:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:20:40] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-31 23:20:40] [INFO ] Transformed 188 places.
[2024-05-31 23:20:40] [INFO ] Transformed 197 transitions.
[2024-05-31 23:20:40] [INFO ] Found NUPN structural information;
[2024-05-31 23:20:40] [INFO ] Parsed PT model containing 188 places and 197 transitions and 477 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 197/197 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 197
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 172 transition count 182
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 172 transition count 182
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 164 transition count 174
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 164 transition count 174
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 53 place count 164 transition count 168
Applied a total of 53 rules in 52 ms. Remains 164 /188 variables (removed 24) and now considering 168/197 (removed 29) transitions.
// Phase 1: matrix 168 rows 164 cols
[2024-05-31 23:20:40] [INFO ] Computed 9 invariants in 18 ms
[2024-05-31 23:20:41] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-31 23:20:41] [INFO ] Invariant cache hit.
[2024-05-31 23:20:41] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-31 23:20:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 168/331 variables, 163/172 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 1/332 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 0/332 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 173 constraints, problems are : Problem set: 0 solved, 167 unsolved in 5402 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 168/331 variables, 163/172 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 167/339 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 1/332 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/332 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 340 constraints, problems are : Problem set: 0 solved, 167 unsolved in 5636 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 11104ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 11120ms
Starting structural reductions in LTL mode, iteration 1 : 164/188 places, 168/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11574 ms. Remains : 164/188 places, 168/197 transitions.
Support contains 35 out of 164 places after structural reductions.
[2024-05-31 23:20:52] [INFO ] Flatten gal took : 35 ms
[2024-05-31 23:20:52] [INFO ] Flatten gal took : 15 ms
[2024-05-31 23:20:52] [INFO ] Input system was already deterministic with 168 transitions.
Support contains 34 out of 164 places (down from 35) after GAL structural reductions.
RANDOM walk for 40000 steps (496 resets) in 1343 ms. (29 steps per ms) remains 2/20 properties
BEST_FIRST walk for 40003 steps (83 resets) in 219 ms. (181 steps per ms) remains 1/2 properties
BEST_FIRST walk for 32782 steps (70 resets) in 80 ms. (404 steps per ms) remains 0/1 properties
Computed a total of 33 stabilizing places and 33 stable transitions
Graph (complete) has 249 edges and 164 vertex of which 152 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.4 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)||(G(p1)&&F(p2))))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Graph (trivial) has 134 edges and 164 vertex of which 6 / 164 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 243 edges and 159 vertex of which 147 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 146 transition count 87
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 74 rules applied. Total rules applied 147 place count 75 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 148 place count 74 transition count 84
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 148 place count 74 transition count 64
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 188 place count 54 transition count 64
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 195 place count 47 transition count 57
Iterating global reduction 3 with 7 rules applied. Total rules applied 202 place count 47 transition count 57
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 248 place count 24 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 249 place count 24 transition count 33
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 255 place count 18 transition count 22
Iterating global reduction 4 with 6 rules applied. Total rules applied 261 place count 18 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 265 place count 16 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 266 place count 15 transition count 20
Applied a total of 266 rules in 31 ms. Remains 15 /164 variables (removed 149) and now considering 20/168 (removed 148) transitions.
[2024-05-31 23:20:53] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 15 cols
[2024-05-31 23:20:53] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:20:53] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-31 23:20:53] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-31 23:20:53] [INFO ] Invariant cache hit.
[2024-05-31 23:20:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:20:53] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-31 23:20:53] [INFO ] Redundant transitions in 11 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-31 23:20:53] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-31 23:20:53] [INFO ] Invariant cache hit.
[2024-05-31 23:20:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 18/29 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 4/33 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1/34 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/34 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 16 constraints, problems are : Problem set: 0 solved, 14 unsolved in 143 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 18/29 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 4/33 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 11/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/34 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/34 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/34 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 30 constraints, problems are : Problem set: 0 solved, 14 unsolved in 130 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 281ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 281ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/164 places, 20/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 400 ms. Remains : 15/164 places, 20/168 transitions.
Stuttering acceptance computed with spot in 287 ms :[true, (OR (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLCardinality-00 finished in 751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Graph (trivial) has 139 edges and 164 vertex of which 6 / 164 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 243 edges and 159 vertex of which 147 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 146 transition count 83
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 78 rules applied. Total rules applied 155 place count 71 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 156 place count 70 transition count 80
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 156 place count 70 transition count 60
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 196 place count 50 transition count 60
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 204 place count 42 transition count 52
Iterating global reduction 3 with 8 rules applied. Total rules applied 212 place count 42 transition count 52
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 258 place count 19 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 259 place count 19 transition count 28
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 267 place count 11 transition count 13
Iterating global reduction 4 with 8 rules applied. Total rules applied 275 place count 11 transition count 13
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 4 with 2 rules applied. Total rules applied 277 place count 10 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 278 place count 9 transition count 11
Applied a total of 278 rules in 21 ms. Remains 9 /164 variables (removed 155) and now considering 11/168 (removed 157) transitions.
// Phase 1: matrix 11 rows 9 cols
[2024-05-31 23:20:54] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:20:54] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-31 23:20:54] [INFO ] Invariant cache hit.
[2024-05-31 23:20:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:20:54] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-31 23:20:54] [INFO ] Redundant transitions in 11 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-31 23:20:54] [INFO ] Invariant cache hit.
[2024-05-31 23:20:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/19 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/20 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 10 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/19 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/20 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 16 constraints, problems are : Problem set: 0 solved, 6 unsolved in 52 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 117ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/164 places, 11/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 194 ms. Remains : 9/164 places, 11/168 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLCardinality-03
Stuttering criterion allowed to conclude after 126 steps with 14 reset in 2 ms.
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLCardinality-03 finished in 307 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 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Graph (trivial) has 133 edges and 164 vertex of which 6 / 164 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 158 transition count 90
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 87 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 145 place count 86 transition count 89
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 145 place count 86 transition count 70
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 183 place count 67 transition count 70
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 185 place count 65 transition count 68
Iterating global reduction 3 with 2 rules applied. Total rules applied 187 place count 65 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 188 place count 65 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 188 place count 65 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 190 place count 64 transition count 66
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 236 place count 41 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 237 place count 41 transition count 42
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 238 place count 40 transition count 41
Iterating global reduction 5 with 1 rules applied. Total rules applied 239 place count 40 transition count 41
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 245 place count 37 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 246 place count 36 transition count 45
Applied a total of 246 rules in 22 ms. Remains 36 /164 variables (removed 128) and now considering 45/168 (removed 123) transitions.
[2024-05-31 23:20:54] [INFO ] Flow matrix only has 39 transitions (discarded 6 similar events)
// Phase 1: matrix 39 rows 36 cols
[2024-05-31 23:20:54] [INFO ] Computed 9 invariants in 1 ms
[2024-05-31 23:20:54] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-31 23:20:54] [INFO ] Flow matrix only has 39 transitions (discarded 6 similar events)
[2024-05-31 23:20:54] [INFO ] Invariant cache hit.
[2024-05-31 23:20:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:20:54] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-31 23:20:54] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-31 23:20:54] [INFO ] Flow matrix only has 39 transitions (discarded 6 similar events)
[2024-05-31 23:20:54] [INFO ] Invariant cache hit.
[2024-05-31 23:20:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 8/36 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 38/74 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 1/75 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/75 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 46 constraints, problems are : Problem set: 0 solved, 30 unsolved in 432 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 8/36 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 38/74 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 30/75 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 1/75 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 0/75 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 76 constraints, problems are : Problem set: 0 solved, 30 unsolved in 410 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 861ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 862ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/164 places, 45/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1013 ms. Remains : 36/164 places, 45/168 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLCardinality-04
Stuttering criterion allowed to conclude after 983 steps with 65 reset in 8 ms.
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLCardinality-04 finished in 1099 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(F(p0)&&G((p1&&X(p1))))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 156 transition count 160
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 156 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 155 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 155 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 155 transition count 158
Applied a total of 19 rules in 7 ms. Remains 155 /164 variables (removed 9) and now considering 158/168 (removed 10) transitions.
// Phase 1: matrix 158 rows 155 cols
[2024-05-31 23:20:55] [INFO ] Computed 9 invariants in 1 ms
[2024-05-31 23:20:55] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-31 23:20:55] [INFO ] Invariant cache hit.
[2024-05-31 23:20:55] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-05-31 23:20:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 158/312 variables, 154/163 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 1/313 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 0/313 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 164 constraints, problems are : Problem set: 0 solved, 157 unsolved in 4367 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 158/312 variables, 154/163 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 157/320 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 1/313 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 0/313 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/313 variables, and 321 constraints, problems are : Problem set: 0 solved, 157 unsolved in 4759 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 0/0 constraints]
After SMT, in 9147ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 9150ms
Starting structural reductions in LTL mode, iteration 1 : 155/164 places, 158/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9372 ms. Remains : 155/164 places, 158/168 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 183 ms.
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 239 edges and 155 vertex of which 143 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Computed a total of 28 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 79 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-08b-LTLCardinality-05 finished in 9936 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((X(G(p1))||p0)))'
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 156 transition count 160
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 156 transition count 160
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 153 transition count 157
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 153 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 153 transition count 155
Applied a total of 24 rules in 8 ms. Remains 153 /164 variables (removed 11) and now considering 155/168 (removed 13) transitions.
// Phase 1: matrix 155 rows 153 cols
[2024-05-31 23:21:05] [INFO ] Computed 9 invariants in 1 ms
[2024-05-31 23:21:05] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-31 23:21:05] [INFO ] Invariant cache hit.
[2024-05-31 23:21:05] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2024-05-31 23:21:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 155/307 variables, 152/161 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 1/308 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 0/308 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 162 constraints, problems are : Problem set: 0 solved, 154 unsolved in 4332 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 155/307 variables, 152/161 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 154/315 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (OVERLAPS) 1/308 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 0/308 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 316 constraints, problems are : Problem set: 0 solved, 154 unsolved in 4912 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints]
After SMT, in 9265ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 9270ms
Starting structural reductions in LTL mode, iteration 1 : 153/164 places, 155/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9528 ms. Remains : 153/164 places, 155/168 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLCardinality-06 finished in 9635 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(p0)||F(p1)))))'
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 158 transition count 162
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 158 transition count 162
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 156 transition count 160
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 156 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 156 transition count 159
Applied a total of 17 rules in 6 ms. Remains 156 /164 variables (removed 8) and now considering 159/168 (removed 9) transitions.
// Phase 1: matrix 159 rows 156 cols
[2024-05-31 23:21:15] [INFO ] Computed 9 invariants in 3 ms
[2024-05-31 23:21:15] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 23:21:15] [INFO ] Invariant cache hit.
[2024-05-31 23:21:15] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 158 sub problems to find dead transitions.
[2024-05-31 23:21:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (OVERLAPS) 159/314 variables, 155/164 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 1/315 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (OVERLAPS) 0/315 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 165 constraints, problems are : Problem set: 0 solved, 158 unsolved in 4553 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (OVERLAPS) 159/314 variables, 155/164 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 158/322 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (OVERLAPS) 1/315 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (OVERLAPS) 0/315 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 323 constraints, problems are : Problem set: 0 solved, 158 unsolved in 5037 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 0/0 constraints]
After SMT, in 9612ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 9614ms
Starting structural reductions in LTL mode, iteration 1 : 156/164 places, 159/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9778 ms. Remains : 156/164 places, 159/168 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLCardinality-08
Product exploration explored 100000 steps with 33333 reset in 67 ms.
Product exploration explored 100000 steps with 33333 reset in 148 ms.
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 240 edges and 156 vertex of which 144 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Computed a total of 28 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-08b-LTLCardinality-08 finished in 10217 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(p0) U (F(p2)||p1)) U p0)))'
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 155 transition count 159
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 155 transition count 159
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 152 transition count 156
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 152 transition count 156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 152 transition count 154
Applied a total of 26 rules in 15 ms. Remains 152 /164 variables (removed 12) and now considering 154/168 (removed 14) transitions.
// Phase 1: matrix 154 rows 152 cols
[2024-05-31 23:21:25] [INFO ] Computed 9 invariants in 1 ms
[2024-05-31 23:21:25] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-31 23:21:25] [INFO ] Invariant cache hit.
[2024-05-31 23:21:25] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2024-05-31 23:21:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 154/305 variables, 151/160 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 1/306 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 0/306 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 161 constraints, problems are : Problem set: 0 solved, 153 unsolved in 4182 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 154/305 variables, 151/160 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 153/313 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 1/306 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 314 constraints, problems are : Problem set: 0 solved, 153 unsolved in 4709 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints]
After SMT, in 8908ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 8910ms
Starting structural reductions in LTL mode, iteration 1 : 152/164 places, 154/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9122 ms. Remains : 152/164 places, 154/168 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 133 ms.
Product exploration explored 100000 steps with 50000 reset in 144 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Graph (complete) has 235 edges and 152 vertex of which 140 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Computed a total of 27 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 17 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-08b-LTLCardinality-10 finished in 9590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G((F(p1) U X(p2))))))'
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 156 transition count 160
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 156 transition count 160
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 153 transition count 157
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 153 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 153 transition count 155
Applied a total of 24 rules in 6 ms. Remains 153 /164 variables (removed 11) and now considering 155/168 (removed 13) transitions.
// Phase 1: matrix 155 rows 153 cols
[2024-05-31 23:21:34] [INFO ] Computed 9 invariants in 1 ms
[2024-05-31 23:21:34] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-31 23:21:34] [INFO ] Invariant cache hit.
[2024-05-31 23:21:34] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2024-05-31 23:21:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 155/307 variables, 152/161 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 1/308 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 0/308 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 162 constraints, problems are : Problem set: 0 solved, 154 unsolved in 4246 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 155/307 variables, 152/161 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 154/315 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (OVERLAPS) 1/308 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 0/308 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 316 constraints, problems are : Problem set: 0 solved, 154 unsolved in 4897 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints]
After SMT, in 9161ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 9162ms
Starting structural reductions in LTL mode, iteration 1 : 153/164 places, 155/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9299 ms. Remains : 153/164 places, 155/168 transitions.
Stuttering acceptance computed with spot in 366 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLCardinality-11
Product exploration explored 100000 steps with 33253 reset in 93 ms.
Product exploration explored 100000 steps with 33334 reset in 98 ms.
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 236 edges and 153 vertex of which 141 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Computed a total of 28 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 126 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter sensitive) to 10 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 401 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
RANDOM walk for 40000 steps (503 resets) in 379 ms. (105 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40004 steps (91 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 14950 steps (14 resets) in 27 ms. (533 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p0))), (F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p0)), (F (NOT (OR p2 p0 p1))), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 23 factoid took 538 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter sensitive) to 10 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 382 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 380 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 155/155 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 155/155 (removed 0) transitions.
[2024-05-31 23:21:46] [INFO ] Invariant cache hit.
[2024-05-31 23:21:46] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-31 23:21:46] [INFO ] Invariant cache hit.
[2024-05-31 23:21:46] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2024-05-31 23:21:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 155/307 variables, 152/161 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 1/308 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 0/308 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 162 constraints, problems are : Problem set: 0 solved, 154 unsolved in 4518 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 155/307 variables, 152/161 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 154/315 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (OVERLAPS) 1/308 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 0/308 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 316 constraints, problems are : Problem set: 0 solved, 154 unsolved in 4964 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints]
After SMT, in 9497ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 9499ms
Finished structural reductions in LTL mode , in 1 iterations and 9633 ms. Remains : 153/153 places, 155/155 transitions.
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 236 edges and 153 vertex of which 141 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Computed a total of 28 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 126 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter sensitive) to 10 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
RANDOM walk for 40000 steps (498 resets) in 135 ms. (294 steps per ms) remains 2/12 properties
BEST_FIRST walk for 6609 steps (4 resets) in 15 ms. (413 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p0))), (F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p0)), (F (NOT (OR p2 p0 p1))), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 23 factoid took 530 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter sensitive) to 10 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 452 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 374 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Product exploration explored 100000 steps with 33234 reset in 105 ms.
Product exploration explored 100000 steps with 33346 reset in 101 ms.
Applying partial POR strategy [false, false, true, false, false, false, false, true, false, false]
Stuttering acceptance computed with spot in 405 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 155/155 transitions.
Graph (trivial) has 123 edges and 153 vertex of which 6 / 153 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 148 transition count 149
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 65 place count 148 transition count 151
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 76 place count 148 transition count 151
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 113 place count 111 transition count 114
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 150 place count 111 transition count 114
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 178 place count 111 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 180 place count 111 transition count 112
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 201 place count 90 transition count 91
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 222 place count 90 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 223 place count 90 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 224 place count 89 transition count 90
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 225 place count 89 transition count 90
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 234 place count 89 transition count 121
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 243 place count 80 transition count 103
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 252 place count 80 transition count 103
Deduced a syphon composed of 45 places in 0 ms
Applied a total of 252 rules in 32 ms. Remains 80 /153 variables (removed 73) and now considering 103/155 (removed 52) transitions.
[2024-05-31 23:21:59] [INFO ] Redundant transitions in 1 ms returned []
Running 102 sub problems to find dead transitions.
[2024-05-31 23:21:59] [INFO ] Flow matrix only has 97 transitions (discarded 6 similar events)
// Phase 1: matrix 97 rows 80 cols
[2024-05-31 23:21:59] [INFO ] Computed 9 invariants in 0 ms
[2024-05-31 23:21:59] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
At refinement iteration 2 (OVERLAPS) 96/175 variables, 79/88 constraints. Problems are: Problem set: 61 solved, 41 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 32/120 constraints. Problems are: Problem set: 61 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/120 constraints. Problems are: Problem set: 61 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 1/176 variables, 1/121 constraints. Problems are: Problem set: 61 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/121 constraints. Problems are: Problem set: 61 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 1/177 variables, 1/122 constraints. Problems are: Problem set: 61 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/122 constraints. Problems are: Problem set: 61 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 0/177 variables, 0/122 constraints. Problems are: Problem set: 61 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 122 constraints, problems are : Problem set: 61 solved, 41 unsolved in 1055 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 80/80 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 61 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 61 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 45/79 variables, 9/9 constraints. Problems are: Problem set: 61 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/9 constraints. Problems are: Problem set: 61 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 96/175 variables, 79/88 constraints. Problems are: Problem set: 61 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 32/120 constraints. Problems are: Problem set: 61 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 41/161 constraints. Problems are: Problem set: 61 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/161 constraints. Problems are: Problem set: 61 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 1/176 variables, 1/162 constraints. Problems are: Problem set: 61 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/162 constraints. Problems are: Problem set: 61 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 1/177 variables, 1/163 constraints. Problems are: Problem set: 61 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/163 constraints. Problems are: Problem set: 61 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 0/177 variables, 0/163 constraints. Problems are: Problem set: 61 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 163 constraints, problems are : Problem set: 61 solved, 41 unsolved in 1570 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 80/80 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 41/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 2669ms problems are : Problem set: 61 solved, 41 unsolved
Search for dead transitions found 61 dead transitions in 2671ms
Found 61 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 61 transitions
Dead transitions reduction (with SMT) removed 61 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 80/153 places, 42/155 transitions.
Graph (complete) has 138 edges and 80 vertex of which 35 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 35 /80 variables (removed 45) and now considering 42/42 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/153 places, 42/155 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2716 ms. Remains : 35/153 places, 42/155 transitions.
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 155/155 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 155/155 (removed 0) transitions.
// Phase 1: matrix 155 rows 153 cols
[2024-05-31 23:22:02] [INFO ] Computed 9 invariants in 1 ms
[2024-05-31 23:22:02] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-31 23:22:02] [INFO ] Invariant cache hit.
[2024-05-31 23:22:02] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2024-05-31 23:22:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 155/307 variables, 152/161 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 1/308 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 0/308 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 162 constraints, problems are : Problem set: 0 solved, 154 unsolved in 4307 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 155/307 variables, 152/161 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 154/315 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (OVERLAPS) 1/308 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 0/308 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 316 constraints, problems are : Problem set: 0 solved, 154 unsolved in 4893 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints]
After SMT, in 9215ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 9217ms
Finished structural reductions in LTL mode , in 1 iterations and 9356 ms. Remains : 153/153 places, 155/155 transitions.
Treatment of property GPUForwardProgress-PT-08b-LTLCardinality-11 finished in 36767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(!p1 U (p2||G(!p1))))))'
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 156 transition count 160
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 156 transition count 160
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 154 transition count 158
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 154 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 154 transition count 157
Applied a total of 21 rules in 8 ms. Remains 154 /164 variables (removed 10) and now considering 157/168 (removed 11) transitions.
// Phase 1: matrix 157 rows 154 cols
[2024-05-31 23:22:11] [INFO ] Computed 9 invariants in 6 ms
[2024-05-31 23:22:11] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-31 23:22:11] [INFO ] Invariant cache hit.
[2024-05-31 23:22:11] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2024-05-31 23:22:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 157/310 variables, 153/162 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 1/311 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 0/311 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 163 constraints, problems are : Problem set: 0 solved, 156 unsolved in 4461 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 157/310 variables, 153/162 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 156/318 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (OVERLAPS) 1/311 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 319 constraints, problems are : Problem set: 0 solved, 156 unsolved in 4862 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints]
After SMT, in 9337ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 9339ms
Starting structural reductions in LTL mode, iteration 1 : 154/164 places, 157/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9484 ms. Remains : 154/164 places, 157/168 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p2) p1), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), true, (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLCardinality-15 finished in 9660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G((F(p1) U X(p2))))))'
Found a Lengthening insensitive property : GPUForwardProgress-PT-08b-LTLCardinality-11
Stuttering acceptance computed with spot in 395 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Graph (trivial) has 136 edges and 164 vertex of which 6 / 164 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 158 transition count 86
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 78 rules applied. Total rules applied 154 place count 83 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 155 place count 82 transition count 83
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 155 place count 82 transition count 64
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 193 place count 63 transition count 64
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 245 place count 37 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 246 place count 37 transition count 37
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 247 place count 36 transition count 36
Iterating global reduction 4 with 1 rules applied. Total rules applied 248 place count 36 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 252 place count 34 transition count 41
Applied a total of 252 rules in 9 ms. Remains 34 /164 variables (removed 130) and now considering 41/168 (removed 127) transitions.
[2024-05-31 23:22:21] [INFO ] Flow matrix only has 35 transitions (discarded 6 similar events)
// Phase 1: matrix 35 rows 34 cols
[2024-05-31 23:22:21] [INFO ] Computed 9 invariants in 0 ms
[2024-05-31 23:22:21] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-31 23:22:21] [INFO ] Flow matrix only has 35 transitions (discarded 6 similar events)
[2024-05-31 23:22:21] [INFO ] Invariant cache hit.
[2024-05-31 23:22:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:22:21] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-31 23:22:21] [INFO ] Flow matrix only has 35 transitions (discarded 6 similar events)
[2024-05-31 23:22:21] [INFO ] Invariant cache hit.
[2024-05-31 23:22:21] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 34/68 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 1/69 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/69 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 45 constraints, problems are : Problem set: 0 solved, 40 unsolved in 397 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 34/34 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 34/68 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 40/84 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 1/69 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 85 constraints, problems are : Problem set: 0 solved, 40 unsolved in 744 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 34/34 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1159ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1160ms
Starting structural reductions in LI_LTL mode, iteration 1 : 34/164 places, 41/168 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1243 ms. Remains : 34/164 places, 41/168 transitions.
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLCardinality-11
Product exploration explored 100000 steps with 33646 reset in 137 ms.
Product exploration explored 100000 steps with 33686 reset in 181 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Graph (complete) has 136 edges and 34 vertex of which 24 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Computed a total of 25 stabilizing places and 25 stable transitions
Detected a total of 25/34 stabilizing places and 25/41 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 23 factoid took 219 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter sensitive) to 10 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 378 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
RANDOM walk for 3661 steps (185 resets) in 34 ms. (104 steps per ms) remains 0/12 properties
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p0))), (F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p0)), (F (NOT (OR p2 p0 p1))), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 23 factoid took 666 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter sensitive) to 10 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 407 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 371 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Support contains 5 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 41/41 transitions.
Applied a total of 0 rules in 0 ms. Remains 34 /34 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-31 23:22:25] [INFO ] Flow matrix only has 35 transitions (discarded 6 similar events)
[2024-05-31 23:22:25] [INFO ] Invariant cache hit.
[2024-05-31 23:22:25] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-31 23:22:25] [INFO ] Flow matrix only has 35 transitions (discarded 6 similar events)
[2024-05-31 23:22:25] [INFO ] Invariant cache hit.
[2024-05-31 23:22:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:22:25] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-31 23:22:25] [INFO ] Flow matrix only has 35 transitions (discarded 6 similar events)
[2024-05-31 23:22:25] [INFO ] Invariant cache hit.
[2024-05-31 23:22:25] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 34/68 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 1/69 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/69 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 45 constraints, problems are : Problem set: 0 solved, 40 unsolved in 395 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 34/34 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 34/68 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 40/84 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 1/69 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 85 constraints, problems are : Problem set: 0 solved, 40 unsolved in 706 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 34/34 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1120ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1121ms
Finished structural reductions in LTL mode , in 1 iterations and 1191 ms. Remains : 34/34 places, 41/41 transitions.
Computed a total of 25 stabilizing places and 25 stable transitions
Graph (complete) has 136 edges and 34 vertex of which 24 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Computed a total of 25 stabilizing places and 25 stable transitions
Detected a total of 25/34 stabilizing places and 25/41 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 23 factoid took 223 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter sensitive) to 10 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 397 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
RANDOM walk for 11622 steps (577 resets) in 47 ms. (242 steps per ms) remains 0/12 properties
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p0))), (F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p0)), (F (NOT (OR p2 p0 p1))), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 23 factoid took 685 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter sensitive) to 10 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 527 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 373 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 363 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Product exploration explored 100000 steps with 33537 reset in 105 ms.
Stuttering criterion allowed to conclude after 29401 steps with 9860 reset in 40 ms.
Treatment of property GPUForwardProgress-PT-08b-LTLCardinality-11 finished in 8136 ms.
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-11 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-31 23:22:29] [INFO ] Flatten gal took : 11 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 109127 ms.
ITS solved all properties within timeout

BK_STOP 1717197749465

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

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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