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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 11 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 22:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 11 22:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 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 27K 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-04b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716474397071

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 14:26:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 14:26:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:26:38] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2024-05-23 14:26:38] [INFO ] Transformed 112 places.
[2024-05-23 14:26:38] [INFO ] Transformed 117 transitions.
[2024-05-23 14:26:38] [INFO ] Found NUPN structural information;
[2024-05-23 14:26:38] [INFO ] Parsed PT model containing 112 places and 117 transitions and 277 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 117
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 101 transition count 107
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 101 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 98 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 98 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 98 transition count 103
Applied a total of 28 rules in 33 ms. Remains 98 /112 variables (removed 14) and now considering 103/117 (removed 14) transitions.
// Phase 1: matrix 103 rows 98 cols
[2024-05-23 14:26:38] [INFO ] Computed 5 invariants in 7 ms
[2024-05-23 14:26:38] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-23 14:26:38] [INFO ] Invariant cache hit.
[2024-05-23 14:26:39] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-23 14:26:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 103/200 variables, 97/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 1/201 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 103 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3106 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 103/200 variables, 97/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 102/204 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 1/201 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 205 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2154 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 5304ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 5323ms
Starting structural reductions in LTL mode, iteration 1 : 98/112 places, 103/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5687 ms. Remains : 98/112 places, 103/117 transitions.
Support contains 27 out of 98 places after structural reductions.
[2024-05-23 14:26:44] [INFO ] Flatten gal took : 28 ms
[2024-05-23 14:26:44] [INFO ] Flatten gal took : 10 ms
[2024-05-23 14:26:44] [INFO ] Input system was already deterministic with 103 transitions.
Support contains 25 out of 98 places (down from 27) after GAL structural reductions.
RANDOM walk for 40000 steps (859 resets) in 728 ms. (54 steps per ms) remains 1/22 properties
BEST_FIRST walk for 40002 steps (199 resets) in 196 ms. (203 steps per ms) remains 1/1 properties
[2024-05-23 14:26:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 103/200 variables, 97/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/201 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 103/200 variables, 97/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp21 is UNSAT
After SMT solving in domain Int declared 201/201 variables, and 104 constraints, problems are : Problem set: 1 solved, 0 unsolved in 59 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 150ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 148 edges and 98 vertex of which 90 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.6 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(F(p1))))))'
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 103/103 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 91 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 91 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 91 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 88 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 88 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 88 transition count 90
Applied a total of 23 rules in 10 ms. Remains 88 /98 variables (removed 10) and now considering 90/103 (removed 13) transitions.
// Phase 1: matrix 90 rows 88 cols
[2024-05-23 14:26:45] [INFO ] Computed 5 invariants in 6 ms
[2024-05-23 14:26:45] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-23 14:26:45] [INFO ] Invariant cache hit.
[2024-05-23 14:26:45] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-23 14:26:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 90/177 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 1/178 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 0/178 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 93 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1610 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 90/177 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 89/181 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/178 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 0/178 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 182 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1686 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
After SMT, in 3313ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 3315ms
Starting structural reductions in LTL mode, iteration 1 : 88/98 places, 90/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3436 ms. Remains : 88/98 places, 90/103 transitions.
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-01
Stuttering criterion allowed to conclude after 101 steps with 1 reset in 3 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-01 finished in 3739 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 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 103/103 transitions.
Graph (trivial) has 86 edges and 98 vertex of which 6 / 98 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 142 edges and 93 vertex of which 85 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 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 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 84 transition count 53
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 85 place count 44 transition count 50
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 43 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 42 transition count 49
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 88 place count 42 transition count 38
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 110 place count 31 transition count 38
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 115 place count 26 transition count 33
Iterating global reduction 4 with 5 rules applied. Total rules applied 120 place count 26 transition count 33
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 144 place count 14 transition count 21
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 146 place count 12 transition count 17
Iterating global reduction 4 with 2 rules applied. Total rules applied 148 place count 12 transition count 17
Performed 3 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 154 place count 9 transition count 14
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 156 place count 9 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 157 place count 8 transition count 13
Applied a total of 157 rules in 33 ms. Remains 8 /98 variables (removed 90) and now considering 13/103 (removed 90) transitions.
[2024-05-23 14:26:49] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 8 cols
[2024-05-23 14:26:49] [INFO ] Computed 0 invariants in 1 ms
[2024-05-23 14:26:49] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-23 14:26:49] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2024-05-23 14:26:49] [INFO ] Invariant cache hit.
[2024-05-23 14:26:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 14:26:49] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-23 14:26:49] [INFO ] Redundant transitions in 13 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-23 14:26:49] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2024-05-23 14:26:49] [INFO ] Invariant cache hit.
[2024-05-23 14:26:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/19 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/20 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 9 constraints, problems are : Problem set: 0 solved, 7 unsolved in 65 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/19 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/20 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 64 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 139ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 139ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/98 places, 13/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 235 ms. Remains : 8/98 places, 13/103 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-02
Stuttering criterion allowed to conclude after 28 steps with 3 reset in 1 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-02 finished in 331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(X(p2)&&(!p0 U (p1||G(!p0)))))))'
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 103/103 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 93 transition count 98
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 93 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 93 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 92 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 92 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 92 transition count 95
Applied a total of 14 rules in 11 ms. Remains 92 /98 variables (removed 6) and now considering 95/103 (removed 8) transitions.
// Phase 1: matrix 95 rows 92 cols
[2024-05-23 14:26:49] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 14:26:49] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-23 14:26:49] [INFO ] Invariant cache hit.
[2024-05-23 14:26:49] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2024-05-23 14:26:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 95/186 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 1/187 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 0/187 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 97 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1755 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 95/186 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 94/190 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 1/187 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 191 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1773 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
After SMT, in 3552ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 3553ms
Starting structural reductions in LTL mode, iteration 1 : 92/98 places, 95/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3672 ms. Remains : 92/98 places, 95/103 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND p0 (NOT p1)), true, (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 200 ms.
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Graph (complete) has 140 edges and 92 vertex of which 84 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 17 stable transitions
Detected a total of 17/92 stabilizing places and 17/95 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X 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 18 factoid took 22 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-04b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-03 finished in 4241 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(X(G(p1)))))'
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 103/103 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 91 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 91 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 91 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 88 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 88 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 88 transition count 90
Applied a total of 23 rules in 11 ms. Remains 88 /98 variables (removed 10) and now considering 90/103 (removed 13) transitions.
// Phase 1: matrix 90 rows 88 cols
[2024-05-23 14:26:53] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 14:26:53] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-23 14:26:53] [INFO ] Invariant cache hit.
[2024-05-23 14:26:53] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-23 14:26:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 90/177 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 1/178 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 0/178 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 93 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1513 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 90/177 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 89/181 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/178 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 0/178 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 182 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1589 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
After SMT, in 3116ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 3117ms
Starting structural reductions in LTL mode, iteration 1 : 88/98 places, 90/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3232 ms. Remains : 88/98 places, 90/103 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-04 finished in 3406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 103/103 transitions.
Graph (trivial) has 85 edges and 98 vertex of which 6 / 98 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 142 edges and 93 vertex of which 85 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 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 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 84 transition count 53
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 86 place count 44 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 43 transition count 49
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 87 place count 43 transition count 37
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 111 place count 31 transition count 37
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 27 transition count 33
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 27 transition count 33
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 145 place count 14 transition count 20
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 148 place count 11 transition count 14
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 11 transition count 14
Performed 2 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 155 place count 9 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 8 transition count 10
Applied a total of 156 rules in 13 ms. Remains 8 /98 variables (removed 90) and now considering 10/103 (removed 93) transitions.
// Phase 1: matrix 10 rows 8 cols
[2024-05-23 14:26:57] [INFO ] Computed 0 invariants in 1 ms
[2024-05-23 14:26:57] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-23 14:26:57] [INFO ] Invariant cache hit.
[2024-05-23 14:26:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 14:26:57] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-23 14:26:57] [INFO ] Redundant transitions in 14 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 14:26:57] [INFO ] Invariant cache hit.
[2024-05-23 14:26:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/17 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/18 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 9 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/17 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/18 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 56 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 111ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/98 places, 10/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 197 ms. Remains : 8/98 places, 10/103 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-05
Stuttering criterion allowed to conclude after 18 steps with 2 reset in 0 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-05 finished in 258 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&&F((p1&&F(p2)))) U X(p3)))'
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 103/103 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 92 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 92 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 89 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 89 transition count 94
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 89 transition count 92
Applied a total of 20 rules in 10 ms. Remains 89 /98 variables (removed 9) and now considering 92/103 (removed 11) transitions.
// Phase 1: matrix 92 rows 89 cols
[2024-05-23 14:26:57] [INFO ] Computed 5 invariants in 3 ms
[2024-05-23 14:26:57] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-23 14:26:57] [INFO ] Invariant cache hit.
[2024-05-23 14:26:57] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-23 14:26:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 92/180 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 1/181 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 0/181 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 94 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1562 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 92/180 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 91/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 1/181 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 185 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1567 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
After SMT, in 3139ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 3141ms
Starting structural reductions in LTL mode, iteration 1 : 89/98 places, 92/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3256 ms. Remains : 89/98 places, 92/103 transitions.
Stuttering acceptance computed with spot in 331 ms :[(NOT p3), (NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3)), true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-06 finished in 3617 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(F((p0 U (p1||G(p0)))))||(p2&&F((p0 U (p1||G(p0))))))))))'
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 103/103 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 92 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 92 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 92 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 90 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 90 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 90 transition count 92
Applied a total of 19 rules in 7 ms. Remains 90 /98 variables (removed 8) and now considering 92/103 (removed 11) transitions.
// Phase 1: matrix 92 rows 90 cols
[2024-05-23 14:27:01] [INFO ] Computed 5 invariants in 2 ms
[2024-05-23 14:27:01] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-23 14:27:01] [INFO ] Invariant cache hit.
[2024-05-23 14:27:01] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-23 14:27:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 92/181 variables, 89/94 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 1/182 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 95 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1582 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 92/181 variables, 89/94 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 91/185 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 1/182 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 186 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1775 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
After SMT, in 3371ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 3372ms
Starting structural reductions in LTL mode, iteration 1 : 90/98 places, 92/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3475 ms. Remains : 90/98 places, 92/103 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-10
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-10 finished in 3670 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||(F(p1) U G(!p2))) U (p3&&(p0||(F(p1) U G(!p2)))))))'
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 103/103 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 91 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 91 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 91 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 88 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 88 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 88 transition count 90
Applied a total of 23 rules in 9 ms. Remains 88 /98 variables (removed 10) and now considering 90/103 (removed 13) transitions.
// Phase 1: matrix 90 rows 88 cols
[2024-05-23 14:27:04] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 14:27:04] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-23 14:27:04] [INFO ] Invariant cache hit.
[2024-05-23 14:27:04] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-23 14:27:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 90/177 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 1/178 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 0/178 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 93 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1618 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 90/177 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 89/181 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/178 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 0/178 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 182 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1647 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
After SMT, in 3274ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 3274ms
Starting structural reductions in LTL mode, iteration 1 : 88/98 places, 90/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3383 ms. Remains : 88/98 places, 90/103 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p3) (AND (NOT p0) p2)), (OR (NOT p3) (AND (NOT p0) p2)), (NOT p1), p2]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-11
Product exploration explored 100000 steps with 3618 reset in 80 ms.
Stack based approach found an accepted trace after 10330 steps with 366 reset with depth 58 and stack size 58 in 16 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-11 finished in 3692 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 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 103/103 transitions.
Graph (trivial) has 82 edges and 98 vertex of which 6 / 98 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 142 edges and 93 vertex of which 85 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 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 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 84 transition count 54
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 84 place count 45 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 44 transition count 50
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 85 place count 44 transition count 38
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 109 place count 32 transition count 38
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 115 place count 26 transition count 32
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 26 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 26 transition count 31
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 150 place count 12 transition count 17
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 152 place count 10 transition count 13
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 10 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 155 place count 9 transition count 12
Applied a total of 155 rules in 14 ms. Remains 9 /98 variables (removed 89) and now considering 12/103 (removed 91) transitions.
// Phase 1: matrix 12 rows 9 cols
[2024-05-23 14:27:08] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 14:27:08] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-23 14:27:08] [INFO ] Invariant cache hit.
[2024-05-23 14:27:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 14:27:08] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-23 14:27:08] [INFO ] Redundant transitions in 16 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-23 14:27:08] [INFO ] Invariant cache hit.
[2024-05-23 14:27:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/20 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/21 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 10 constraints, problems are : Problem set: 0 solved, 9 unsolved in 71 ms.
Refiners :[State Equation: 9/9 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/20 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/21 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 19 constraints, problems are : Problem set: 0 solved, 9 unsolved in 71 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 146ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 146ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/98 places, 12/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 223 ms. Remains : 9/98 places, 12/103 transitions.
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-13
Product exploration explored 100000 steps with 12397 reset in 75 ms.
Product exploration explored 100000 steps with 12345 reset in 125 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 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 :[p0, p0]
RANDOM walk for 37 steps (5 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 95 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 76 ms :[p0, p0]
Stuttering acceptance computed with spot in 79 ms :[p0, p0]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-23 14:27:09] [INFO ] Invariant cache hit.
[2024-05-23 14:27:09] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-23 14:27:09] [INFO ] Invariant cache hit.
[2024-05-23 14:27:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 14:27:09] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-23 14:27:09] [INFO ] Redundant transitions in 11 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-23 14:27:09] [INFO ] Invariant cache hit.
[2024-05-23 14:27:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/20 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/21 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 10 constraints, problems are : Problem set: 0 solved, 9 unsolved in 69 ms.
Refiners :[State Equation: 9/9 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/20 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/21 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 19 constraints, problems are : Problem set: 0 solved, 9 unsolved in 80 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 153ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 154ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 221 ms. Remains : 9/9 places, 12/12 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 71 ms :[p0, p0]
RANDOM walk for 32 steps (4 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 106 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 67 ms :[p0, p0]
Stuttering acceptance computed with spot in 92 ms :[p0, p0]
Stuttering acceptance computed with spot in 239 ms :[p0, p0]
Product exploration explored 100000 steps with 12318 reset in 73 ms.
Product exploration explored 100000 steps with 12425 reset in 141 ms.
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-23 14:27:10] [INFO ] Invariant cache hit.
[2024-05-23 14:27:10] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-23 14:27:10] [INFO ] Invariant cache hit.
[2024-05-23 14:27:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 14:27:10] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-23 14:27:10] [INFO ] Redundant transitions in 13 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-23 14:27:10] [INFO ] Invariant cache hit.
[2024-05-23 14:27:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/20 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/21 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 10 constraints, problems are : Problem set: 0 solved, 9 unsolved in 68 ms.
Refiners :[State Equation: 9/9 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/20 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/21 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 19 constraints, problems are : Problem set: 0 solved, 9 unsolved in 84 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 159ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 160ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 228 ms. Remains : 9/9 places, 12/12 transitions.
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-13 finished in 2335 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&&F(p1)))||G(p1)))'
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 103/103 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 91 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 91 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 91 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 88 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 88 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 88 transition count 90
Applied a total of 23 rules in 3 ms. Remains 88 /98 variables (removed 10) and now considering 90/103 (removed 13) transitions.
// Phase 1: matrix 90 rows 88 cols
[2024-05-23 14:27:10] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 14:27:10] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-23 14:27:10] [INFO ] Invariant cache hit.
[2024-05-23 14:27:10] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-23 14:27:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 90/177 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 1/178 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 0/178 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 93 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1515 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 90/177 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 89/181 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/178 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 0/178 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 182 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1681 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
After SMT, in 3205ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 3206ms
Starting structural reductions in LTL mode, iteration 1 : 88/98 places, 90/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3317 ms. Remains : 88/98 places, 90/103 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-14 finished in 3544 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||X(p0)))))'
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 103/103 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 91 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 91 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 91 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 88 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 88 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 88 transition count 90
Applied a total of 23 rules in 7 ms. Remains 88 /98 variables (removed 10) and now considering 90/103 (removed 13) transitions.
[2024-05-23 14:27:14] [INFO ] Invariant cache hit.
[2024-05-23 14:27:14] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-23 14:27:14] [INFO ] Invariant cache hit.
[2024-05-23 14:27:14] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-23 14:27:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 90/177 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 1/178 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 0/178 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 93 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1587 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 90/177 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 89/181 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/178 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 0/178 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 182 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1639 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
After SMT, in 3241ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 3243ms
Starting structural reductions in LTL mode, iteration 1 : 88/98 places, 90/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3348 ms. Remains : 88/98 places, 90/103 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-15 finished in 3502 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)))'
[2024-05-23 14:27:17] [INFO ] Flatten gal took : 11 ms
[2024-05-23 14:27:17] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-23 14:27:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 98 places, 103 transitions and 247 arcs took 2 ms.
Total runtime 39757 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running GPUForwardProgress-PT-04b

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1045
MODEL NAME: /home/mcc/execution/403/model
98 places, 103 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA GPUForwardProgress-PT-04b-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716474438723

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-04b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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