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-171640603600508.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-12b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603600508
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 22:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 11 22:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 22:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 22:22 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 65K 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-12b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717197734233

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-12b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:22:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 23:22:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:22:15] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-05-31 23:22:15] [INFO ] Transformed 264 places.
[2024-05-31 23:22:15] [INFO ] Transformed 277 transitions.
[2024-05-31 23:22:15] [INFO ] Found NUPN structural information;
[2024-05-31 23:22:15] [INFO ] Parsed PT model containing 264 places and 277 transitions and 677 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 277/277 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 263 transition count 277
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 240 transition count 254
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 240 transition count 254
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 56 place count 231 transition count 245
Iterating global reduction 1 with 9 rules applied. Total rules applied 65 place count 231 transition count 245
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 72 place count 231 transition count 238
Applied a total of 72 rules in 70 ms. Remains 231 /264 variables (removed 33) and now considering 238/277 (removed 39) transitions.
// Phase 1: matrix 238 rows 231 cols
[2024-05-31 23:22:15] [INFO ] Computed 13 invariants in 21 ms
[2024-05-31 23:22:16] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-31 23:22:16] [INFO ] Invariant cache hit.
[2024-05-31 23:22:16] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 237 sub problems to find dead transitions.
[2024-05-31 23:22:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 238/468 variables, 230/243 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 1/469 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (OVERLAPS) 0/469 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 469/469 variables, and 244 constraints, problems are : Problem set: 0 solved, 237 unsolved in 9411 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 238/468 variables, 230/243 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 237/480 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (OVERLAPS) 1/469 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 0/469 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 469/469 variables, and 481 constraints, problems are : Problem set: 0 solved, 237 unsolved in 10102 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints]
After SMT, in 19591ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 19607ms
Starting structural reductions in LTL mode, iteration 1 : 231/264 places, 238/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20095 ms. Remains : 231/264 places, 238/277 transitions.
Support contains 32 out of 231 places after structural reductions.
[2024-05-31 23:22:35] [INFO ] Flatten gal took : 36 ms
[2024-05-31 23:22:35] [INFO ] Flatten gal took : 17 ms
[2024-05-31 23:22:36] [INFO ] Input system was already deterministic with 238 transitions.
RANDOM walk for 34853 steps (301 resets) in 1257 ms. (27 steps per ms) remains 0/28 properties
Computed a total of 46 stabilizing places and 46 stable transitions
Graph (complete) has 355 edges and 231 vertex of which 215 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 238/238 transitions.
Graph (trivial) has 198 edges and 231 vertex of which 6 / 231 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 349 edges and 226 vertex of which 210 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 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 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 111 place count 209 transition count 119
Reduce places removed 109 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 116 rules applied. Total rules applied 227 place count 100 transition count 112
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 230 place count 98 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 231 place count 97 transition count 111
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 231 place count 97 transition count 84
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 285 place count 70 transition count 84
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 297 place count 58 transition count 72
Iterating global reduction 4 with 12 rules applied. Total rules applied 309 place count 58 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 309 place count 58 transition count 71
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 311 place count 57 transition count 71
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 383 place count 21 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 384 place count 21 transition count 34
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 396 place count 9 transition count 11
Iterating global reduction 5 with 12 rules applied. Total rules applied 408 place count 9 transition count 11
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 5 with 2 rules applied. Total rules applied 410 place count 8 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 411 place count 7 transition count 9
Applied a total of 411 rules in 35 ms. Remains 7 /231 variables (removed 224) and now considering 9/238 (removed 229) transitions.
// Phase 1: matrix 9 rows 7 cols
[2024-05-31 23:22:36] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:22:36] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-31 23:22:36] [INFO ] Invariant cache hit.
[2024-05-31 23:22:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:22:36] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-31 23:22:36] [INFO ] Redundant transitions in 11 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-31 23:22:36] [INFO ] Invariant cache hit.
[2024-05-31 23:22:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 8 constraints, problems are : Problem set: 0 solved, 5 unsolved in 55 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 13 constraints, problems are : Problem set: 0 solved, 5 unsolved in 42 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 104ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/231 places, 9/238 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 192 ms. Remains : 7/231 places, 9/238 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-00
Stuttering criterion allowed to conclude after 7 steps with 2 reset in 3 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-00 finished in 426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 5 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 238/238 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 222 transition count 229
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 222 transition count 229
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 222 transition count 228
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 218 transition count 224
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 218 transition count 224
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 30 place count 218 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 217 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 217 transition count 220
Applied a total of 32 rules in 31 ms. Remains 217 /231 variables (removed 14) and now considering 220/238 (removed 18) transitions.
// Phase 1: matrix 220 rows 217 cols
[2024-05-31 23:22:37] [INFO ] Computed 13 invariants in 2 ms
[2024-05-31 23:22:37] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-31 23:22:37] [INFO ] Invariant cache hit.
[2024-05-31 23:22:37] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-05-31 23:22:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 220/436 variables, 216/229 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 1/437 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 230 constraints, problems are : Problem set: 0 solved, 219 unsolved in 8010 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 220/436 variables, 216/229 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 219/448 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 1/437 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 449 constraints, problems are : Problem set: 0 solved, 219 unsolved in 10784 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints]
After SMT, in 18831ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 18834ms
Starting structural reductions in LTL mode, iteration 1 : 217/231 places, 220/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19026 ms. Remains : 217/231 places, 220/238 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-01 finished in 19200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)||(F(p1)&&(p0||X((X(p2) U (p0&&X(p2))))))))))'
Support contains 5 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 238/238 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 221 transition count 228
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 221 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 221 transition count 226
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 217 transition count 222
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 217 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 33 place count 217 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 216 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 216 transition count 218
Applied a total of 35 rules in 15 ms. Remains 216 /231 variables (removed 15) and now considering 218/238 (removed 20) transitions.
// Phase 1: matrix 218 rows 216 cols
[2024-05-31 23:22:56] [INFO ] Computed 13 invariants in 2 ms
[2024-05-31 23:22:56] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-31 23:22:56] [INFO ] Invariant cache hit.
[2024-05-31 23:22:56] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-31 23:22:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 1/434 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 229 constraints, problems are : Problem set: 0 solved, 217 unsolved in 7862 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 217/445 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 1/434 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 446 constraints, problems are : Problem set: 0 solved, 217 unsolved in 10036 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 17931ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 17935ms
Starting structural reductions in LTL mode, iteration 1 : 216/231 places, 218/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18151 ms. Remains : 216/231 places, 218/238 transitions.
Stuttering acceptance computed with spot in 389 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p2), (OR (NOT p0) (NOT p2)), true]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-02
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-02 finished in 18570 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(p1))&&F(p0)) U (p0||X((X(p2) U (p0&&X(p2)))))))'
Support contains 3 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 238/238 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 223 transition count 230
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 223 transition count 230
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 223 transition count 228
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 220 transition count 225
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 220 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 220 transition count 223
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 219 transition count 222
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 219 transition count 222
Applied a total of 28 rules in 14 ms. Remains 219 /231 variables (removed 12) and now considering 222/238 (removed 16) transitions.
// Phase 1: matrix 222 rows 219 cols
[2024-05-31 23:23:15] [INFO ] Computed 13 invariants in 1 ms
[2024-05-31 23:23:15] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 23:23:15] [INFO ] Invariant cache hit.
[2024-05-31 23:23:15] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-31 23:23:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 222/440 variables, 218/231 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 1/441 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 0/441 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 232 constraints, problems are : Problem set: 0 solved, 221 unsolved in 8096 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 222/440 variables, 218/231 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 221/452 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 1/441 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 0/441 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 441/441 variables, and 453 constraints, problems are : Problem set: 0 solved, 221 unsolved in 9736 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
After SMT, in 17861ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 17863ms
Starting structural reductions in LTL mode, iteration 1 : 219/231 places, 222/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18047 ms. Remains : 219/231 places, 222/238 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p2), true, (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-03 finished in 18253 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((F(G((p0 U p1))) U p2))))'
Support contains 3 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 238/238 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 222 transition count 229
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 222 transition count 229
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 222 transition count 228
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 218 transition count 224
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 218 transition count 224
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 30 place count 218 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 217 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 217 transition count 220
Applied a total of 32 rules in 8 ms. Remains 217 /231 variables (removed 14) and now considering 220/238 (removed 18) transitions.
// Phase 1: matrix 220 rows 217 cols
[2024-05-31 23:23:33] [INFO ] Computed 13 invariants in 4 ms
[2024-05-31 23:23:33] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-31 23:23:33] [INFO ] Invariant cache hit.
[2024-05-31 23:23:33] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-05-31 23:23:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 220/436 variables, 216/229 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 1/437 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 230 constraints, problems are : Problem set: 0 solved, 219 unsolved in 7938 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 220/436 variables, 216/229 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 219/448 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 1/437 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 449 constraints, problems are : Problem set: 0 solved, 219 unsolved in 9098 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints]
After SMT, in 17064ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 17066ms
Starting structural reductions in LTL mode, iteration 1 : 217/231 places, 220/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17252 ms. Remains : 217/231 places, 220/238 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-04
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-04 finished in 17495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(!p1)))'
Support contains 4 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 238/238 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 221 transition count 228
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 221 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 221 transition count 226
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 217 transition count 222
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 217 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 33 place count 217 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 216 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 216 transition count 218
Applied a total of 35 rules in 7 ms. Remains 216 /231 variables (removed 15) and now considering 218/238 (removed 20) transitions.
// Phase 1: matrix 218 rows 216 cols
[2024-05-31 23:23:50] [INFO ] Computed 13 invariants in 3 ms
[2024-05-31 23:23:50] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 23:23:50] [INFO ] Invariant cache hit.
[2024-05-31 23:23:50] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-31 23:23:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 1/434 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 229 constraints, problems are : Problem set: 0 solved, 217 unsolved in 7960 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 217/445 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 1/434 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 446 constraints, problems are : Problem set: 0 solved, 217 unsolved in 10175 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 18165ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 18167ms
Starting structural reductions in LTL mode, iteration 1 : 216/231 places, 218/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18377 ms. Remains : 216/231 places, 218/238 transitions.
Stuttering acceptance computed with spot in 196 ms :[p1, (NOT p0), (AND p1 (NOT p0)), true, (AND p1 p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-05
Product exploration explored 100000 steps with 25029 reset in 184 ms.
Product exploration explored 100000 steps with 25150 reset in 136 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 335 edges and 216 vertex of which 200 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.4 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 110 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[p1, (AND (NOT p1) (NOT p0)), true, (AND p1 p0)]
RANDOM walk for 40000 steps (359 resets) in 362 ms. (110 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (33 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
[2024-05-31 23:24:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 211/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/434 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 229 constraints, problems are : Problem set: 0 solved, 1 unsolved in 126 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 211/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/434 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/434 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 230 constraints, problems are : Problem set: 0 solved, 1 unsolved in 134 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 270ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 158 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=79 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p0), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p0) (NOT p1))))
Knowledge based reduction with 11 factoid took 131 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-12b-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-05 finished in 19817 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) U G(p1))||X(p2))))'
Support contains 4 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 238/238 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 222 transition count 229
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 222 transition count 229
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 222 transition count 227
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 218 transition count 223
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 218 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 218 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 217 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 217 transition count 219
Applied a total of 33 rules in 8 ms. Remains 217 /231 variables (removed 14) and now considering 219/238 (removed 19) transitions.
// Phase 1: matrix 219 rows 217 cols
[2024-05-31 23:24:10] [INFO ] Computed 13 invariants in 2 ms
[2024-05-31 23:24:10] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 23:24:10] [INFO ] Invariant cache hit.
[2024-05-31 23:24:10] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-31 23:24:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 219/435 variables, 216/229 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 1/436 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/436 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 230 constraints, problems are : Problem set: 0 solved, 218 unsolved in 8067 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 219/435 variables, 216/229 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 218/447 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 1/436 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/436 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 448 constraints, problems are : Problem set: 0 solved, 218 unsolved in 9178 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
After SMT, in 17278ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 17282ms
Starting structural reductions in LTL mode, iteration 1 : 217/231 places, 219/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17455 ms. Remains : 217/231 places, 219/238 transitions.
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 88 ms.
Product exploration explored 100000 steps with 33333 reset in 92 ms.
Computed a total of 40 stabilizing places and 40 stable transitions
Graph (complete) has 336 edges and 217 vertex of which 201 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 40 stable transitions
Detected a total of 40/217 stabilizing places and 40/219 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 19 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-12b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-07 finished in 18010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X(G(p1))))))'
Support contains 4 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 238/238 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 222 transition count 229
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 222 transition count 229
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 222 transition count 227
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 218 transition count 223
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 218 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 218 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 217 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 217 transition count 219
Applied a total of 33 rules in 8 ms. Remains 217 /231 variables (removed 14) and now considering 219/238 (removed 19) transitions.
// Phase 1: matrix 219 rows 217 cols
[2024-05-31 23:24:28] [INFO ] Computed 13 invariants in 1 ms
[2024-05-31 23:24:28] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 23:24:28] [INFO ] Invariant cache hit.
[2024-05-31 23:24:28] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-31 23:24:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 219/435 variables, 216/229 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 1/436 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/436 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 230 constraints, problems are : Problem set: 0 solved, 218 unsolved in 8101 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 219/435 variables, 216/229 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 218/447 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 1/436 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/436 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 448 constraints, problems are : Problem set: 0 solved, 218 unsolved in 9985 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
After SMT, in 18115ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 18117ms
Starting structural reductions in LTL mode, iteration 1 : 217/231 places, 219/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18290 ms. Remains : 217/231 places, 219/238 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 95 ms.
Product exploration explored 100000 steps with 50000 reset in 99 ms.
Computed a total of 40 stabilizing places and 40 stable transitions
Graph (complete) has 336 edges and 217 vertex of which 201 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Computed a total of 40 stabilizing places and 40 stable transitions
Detected a total of 40/217 stabilizing places and 40/219 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-12b-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-08 finished in 18728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 238/238 transitions.
Graph (trivial) has 197 edges and 231 vertex of which 6 / 231 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 349 edges and 226 vertex of which 210 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 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 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 110 place count 209 transition count 120
Reduce places removed 108 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 114 rules applied. Total rules applied 224 place count 101 transition count 114
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 228 place count 99 transition count 112
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 231 place count 97 transition count 111
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 231 place count 97 transition count 85
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 283 place count 71 transition count 85
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 295 place count 59 transition count 73
Iterating global reduction 4 with 12 rules applied. Total rules applied 307 place count 59 transition count 73
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 307 place count 59 transition count 72
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 309 place count 58 transition count 72
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 385 place count 20 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 386 place count 20 transition count 33
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 397 place count 9 transition count 12
Iterating global reduction 5 with 11 rules applied. Total rules applied 408 place count 9 transition count 12
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 5 with 2 rules applied. Total rules applied 410 place count 8 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 411 place count 7 transition count 10
Applied a total of 411 rules in 26 ms. Remains 7 /231 variables (removed 224) and now considering 10/238 (removed 228) transitions.
// Phase 1: matrix 10 rows 7 cols
[2024-05-31 23:24:47] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 23:24:47] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-31 23:24:47] [INFO ] Invariant cache hit.
[2024-05-31 23:24:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:24:47] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-31 23:24:47] [INFO ] Redundant transitions in 10 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-31 23:24:47] [INFO ] Invariant cache hit.
[2024-05-31 23:24:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/17 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/17 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 41 ms.
Refiners :[State Equation: 7/7 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/17 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/17 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 88ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/231 places, 10/238 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 7/231 places, 10/238 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-09 finished in 214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 238/238 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 221 transition count 228
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 221 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 221 transition count 226
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 217 transition count 222
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 217 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 33 place count 217 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 216 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 216 transition count 218
Applied a total of 35 rules in 12 ms. Remains 216 /231 variables (removed 15) and now considering 218/238 (removed 20) transitions.
// Phase 1: matrix 218 rows 216 cols
[2024-05-31 23:24:47] [INFO ] Computed 13 invariants in 1 ms
[2024-05-31 23:24:47] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-31 23:24:47] [INFO ] Invariant cache hit.
[2024-05-31 23:24:47] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-31 23:24:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 1/434 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 229 constraints, problems are : Problem set: 0 solved, 217 unsolved in 8285 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 217/445 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 1/434 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 446 constraints, problems are : Problem set: 0 solved, 217 unsolved in 10265 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 18575ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 18577ms
Starting structural reductions in LTL mode, iteration 1 : 216/231 places, 218/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18795 ms. Remains : 216/231 places, 218/238 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-10 finished in 18933 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 238/238 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 222 transition count 229
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 222 transition count 229
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 222 transition count 227
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 219 transition count 224
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 219 transition count 224
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 29 place count 219 transition count 221
Applied a total of 29 rules in 10 ms. Remains 219 /231 variables (removed 12) and now considering 221/238 (removed 17) transitions.
// Phase 1: matrix 221 rows 219 cols
[2024-05-31 23:25:06] [INFO ] Computed 13 invariants in 2 ms
[2024-05-31 23:25:06] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-31 23:25:06] [INFO ] Invariant cache hit.
[2024-05-31 23:25:06] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-05-31 23:25:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 221/439 variables, 218/231 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 1/440 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/440 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 232 constraints, problems are : Problem set: 0 solved, 220 unsolved in 8301 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 221/439 variables, 218/231 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 220/451 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 1/440 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/440 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 452 constraints, problems are : Problem set: 0 solved, 220 unsolved in 9055 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 17385ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 17388ms
Starting structural reductions in LTL mode, iteration 1 : 219/231 places, 221/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17583 ms. Remains : 219/231 places, 221/238 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-11
Product exploration explored 100000 steps with 9582 reset in 84 ms.
Product exploration explored 100000 steps with 9597 reset in 119 ms.
Computed a total of 42 stabilizing places and 42 stable transitions
Graph (complete) has 338 edges and 219 vertex of which 203 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Computed a total of 42 stabilizing places and 42 stable transitions
Detected a total of 42/219 stabilizing places and 42/221 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 37 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-05-31 23:25:24] [INFO ] Invariant cache hit.
[2024-05-31 23:25:24] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 4 ms returned sat
[2024-05-31 23:25:25] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-05-31 23:25:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:25:25] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-31 23:25:25] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-05-31 23:25:25] [INFO ] Computed and/alt/rep : 215/306/215 causal constraints (skipped 5 transitions) in 11 ms.
[2024-05-31 23:25:26] [INFO ] Added : 185 causal constraints over 38 iterations in 728 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 221/221 transitions.
Graph (trivial) has 179 edges and 219 vertex of which 6 / 219 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 332 edges and 214 vertex of which 198 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 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 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 99 place count 197 transition count 114
Reduce places removed 97 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 100 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 198 place count 99 transition count 113
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 198 place count 99 transition count 85
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 254 place count 71 transition count 85
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 265 place count 60 transition count 74
Iterating global reduction 3 with 11 rules applied. Total rules applied 276 place count 60 transition count 74
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 350 place count 23 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 351 place count 23 transition count 36
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 363 place count 11 transition count 13
Iterating global reduction 4 with 12 rules applied. Total rules applied 375 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 377 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 378 place count 9 transition count 11
Applied a total of 378 rules in 24 ms. Remains 9 /219 variables (removed 210) and now considering 11/221 (removed 210) transitions.
// Phase 1: matrix 11 rows 9 cols
[2024-05-31 23:25:26] [INFO ] Computed 0 invariants in 2 ms
[2024-05-31 23:25:26] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-31 23:25:26] [INFO ] Invariant cache hit.
[2024-05-31 23:25:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 23:25:26] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-31 23:25:26] [INFO ] Redundant transitions in 11 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-31 23:25:26] [INFO ] Invariant cache hit.
[2024-05-31 23:25:26] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/17 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/19 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/20 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 12 constraints, problems are : Problem set: 0 solved, 9 unsolved in 74 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/17 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/19 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/20 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/20 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 21 constraints, problems are : Problem set: 0 solved, 9 unsolved in 88 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 166ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 166ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/219 places, 11/221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 247 ms. Remains : 9/219 places, 11/221 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Detected a total of 7/9 stabilizing places and 7/11 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-12b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-11 finished in 19798 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 238/238 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 221 transition count 228
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 221 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 221 transition count 226
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 217 transition count 222
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 217 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 33 place count 217 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 216 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 216 transition count 218
Applied a total of 35 rules in 13 ms. Remains 216 /231 variables (removed 15) and now considering 218/238 (removed 20) transitions.
// Phase 1: matrix 218 rows 216 cols
[2024-05-31 23:25:26] [INFO ] Computed 13 invariants in 2 ms
[2024-05-31 23:25:26] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-31 23:25:26] [INFO ] Invariant cache hit.
[2024-05-31 23:25:26] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-31 23:25:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 1/434 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 229 constraints, problems are : Problem set: 0 solved, 217 unsolved in 7940 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 217/445 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 1/434 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 446 constraints, problems are : Problem set: 0 solved, 217 unsolved in 10081 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 18048ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 18050ms
Starting structural reductions in LTL mode, iteration 1 : 216/231 places, 218/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18273 ms. Remains : 216/231 places, 218/238 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 95 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-12 finished in 18382 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||G(p1)))))'
Support contains 2 out of 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 238/238 transitions.
Graph (trivial) has 195 edges and 231 vertex of which 6 / 231 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 349 edges and 226 vertex of which 210 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 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 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 109 place count 209 transition count 121
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 113 rules applied. Total rules applied 222 place count 102 transition count 115
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 224 place count 100 transition count 115
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 224 place count 100 transition count 89
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 276 place count 74 transition count 89
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 288 place count 62 transition count 77
Iterating global reduction 3 with 12 rules applied. Total rules applied 300 place count 62 transition count 77
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 300 place count 62 transition count 76
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 302 place count 61 transition count 76
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 376 place count 24 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 377 place count 24 transition count 38
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 387 place count 14 transition count 19
Iterating global reduction 4 with 10 rules applied. Total rules applied 397 place count 14 transition count 19
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 401 place count 12 transition count 18
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 402 place count 12 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 403 place count 11 transition count 17
Applied a total of 403 rules in 19 ms. Remains 11 /231 variables (removed 220) and now considering 17/238 (removed 221) transitions.
[2024-05-31 23:25:44] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
// Phase 1: matrix 16 rows 11 cols
[2024-05-31 23:25:44] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 23:25:44] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-31 23:25:44] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
[2024-05-31 23:25:44] [INFO ] Invariant cache hit.
[2024-05-31 23:25:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:25:44] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-31 23:25:44] [INFO ] Redundant transitions in 14 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-31 23:25:44] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
[2024-05-31 23:25:44] [INFO ] Invariant cache hit.
[2024-05-31 23:25:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 15/23 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/26 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/27 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 12 constraints, problems are : Problem set: 0 solved, 9 unsolved in 64 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 15/23 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/26 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/27 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/27 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 21 constraints, problems are : Problem set: 0 solved, 9 unsolved in 80 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 148ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 150ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/231 places, 17/238 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 232 ms. Remains : 11/231 places, 17/238 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-13
Stuttering criterion allowed to conclude after 726 steps with 65 reset in 6 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-13 finished in 327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 238/238 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 221 transition count 228
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 221 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 221 transition count 226
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 217 transition count 222
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 217 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 33 place count 217 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 216 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 216 transition count 218
Applied a total of 35 rules in 11 ms. Remains 216 /231 variables (removed 15) and now considering 218/238 (removed 20) transitions.
// Phase 1: matrix 218 rows 216 cols
[2024-05-31 23:25:45] [INFO ] Computed 13 invariants in 1 ms
[2024-05-31 23:25:45] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-31 23:25:45] [INFO ] Invariant cache hit.
[2024-05-31 23:25:45] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-31 23:25:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 1/434 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 229 constraints, problems are : Problem set: 0 solved, 217 unsolved in 8313 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 217/445 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 1/434 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 446 constraints, problems are : Problem set: 0 solved, 217 unsolved in 9880 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 18215ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 18217ms
Starting structural reductions in LTL mode, iteration 1 : 216/231 places, 218/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18431 ms. Remains : 216/231 places, 218/238 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 90 ms.
Product exploration explored 100000 steps with 50000 reset in 91 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 335 edges and 216 vertex of which 200 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-12b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-14 finished in 18721 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((F(p0)&&F((G(F(p1))||(!p1&&F(p1))))))))'
Support contains 2 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 238/238 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 222 transition count 229
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 222 transition count 229
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 222 transition count 227
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 219 transition count 224
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 219 transition count 224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 219 transition count 222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 218 transition count 221
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 218 transition count 221
Applied a total of 30 rules in 10 ms. Remains 218 /231 variables (removed 13) and now considering 221/238 (removed 17) transitions.
// Phase 1: matrix 221 rows 218 cols
[2024-05-31 23:26:03] [INFO ] Computed 13 invariants in 1 ms
[2024-05-31 23:26:03] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 23:26:03] [INFO ] Invariant cache hit.
[2024-05-31 23:26:03] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-05-31 23:26:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 221/438 variables, 217/230 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 1/439 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/439 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 231 constraints, problems are : Problem set: 0 solved, 220 unsolved in 8124 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 221/438 variables, 217/230 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 220/450 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 1/439 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/439 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/439 variables, and 451 constraints, problems are : Problem set: 0 solved, 220 unsolved in 8313 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 16464ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 16466ms
Starting structural reductions in LTL mode, iteration 1 : 218/231 places, 221/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16650 ms. Remains : 218/231 places, 221/238 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-15
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-15 finished in 16928 ms.
All properties solved by simple procedures.
Total runtime 245326 ms.
ITS solved all properties within timeout

BK_STOP 1717197980666

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-12b"
export BK_EXAMINATION="LTLFireability"
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-12b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640603600508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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