Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872900436.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutonomousCar-PT-02b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872900436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 7.2K Jun 7 15:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Jun 7 15:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 7 15:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 7 15:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 3 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 3 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 3 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 7 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Jun 7 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 7 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Jun 7 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 49K Jun 3 16:02 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 AutonomousCar-PT-02b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654898326569

Running Version 202205111006
[2022-06-10 21:58:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 21:58:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 21:58:49] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2022-06-10 21:58:49] [INFO ] Transformed 155 places.
[2022-06-10 21:58:49] [INFO ] Transformed 194 transitions.
[2022-06-10 21:58:49] [INFO ] Found NUPN structural information;
[2022-06-10 21:58:49] [INFO ] Parsed PT model containing 155 places and 194 transitions in 320 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-02b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 194/194 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 136 transition count 175
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 136 transition count 175
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 54 place count 136 transition count 159
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 133 transition count 156
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 133 transition count 156
Applied a total of 60 rules in 62 ms. Remains 133 /155 variables (removed 22) and now considering 156/194 (removed 38) transitions.
// Phase 1: matrix 156 rows 133 cols
[2022-06-10 21:58:49] [INFO ] Computed 7 place invariants in 27 ms
[2022-06-10 21:58:49] [INFO ] Implicit Places using invariants in 267 ms returned []
// Phase 1: matrix 156 rows 133 cols
[2022-06-10 21:58:49] [INFO ] Computed 7 place invariants in 4 ms
[2022-06-10 21:58:50] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
// Phase 1: matrix 156 rows 133 cols
[2022-06-10 21:58:50] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-10 21:58:50] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/155 places, 156/194 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/155 places, 156/194 transitions.
Support contains 34 out of 133 places after structural reductions.
[2022-06-10 21:58:50] [INFO ] Flatten gal took : 87 ms
[2022-06-10 21:58:50] [INFO ] Flatten gal took : 34 ms
[2022-06-10 21:58:50] [INFO ] Input system was already deterministic with 156 transitions.
Support contains 29 out of 133 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 990 ms. (steps per millisecond=10 ) properties (out of 25) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 17) seen :13
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 156 rows 133 cols
[2022-06-10 21:58:51] [INFO ] Computed 7 place invariants in 4 ms
[2022-06-10 21:58:52] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2022-06-10 21:58:52] [INFO ] After 91ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1
[2022-06-10 21:58:52] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 10 ms to minimize.
[2022-06-10 21:58:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-06-10 21:58:52] [INFO ] After 287ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:1
[2022-06-10 21:58:52] [INFO ] After 395ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-06-10 21:58:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-06-10 21:58:52] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2022-06-10 21:58:52] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 2 ms to minimize.
[2022-06-10 21:58:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2022-06-10 21:58:52] [INFO ] After 277ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-06-10 21:58:52] [INFO ] After 367ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 156/156 transitions.
Graph (trivial) has 123 edges and 133 vertex of which 4 / 133 are part of one of the 2 SCC in 7 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 274 edges and 131 vertex of which 127 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 127 transition count 96
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 68 rules applied. Total rules applied 124 place count 75 transition count 80
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 133 place count 66 transition count 80
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 133 place count 66 transition count 74
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 145 place count 60 transition count 74
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 148 place count 57 transition count 71
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 57 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 151 place count 57 transition count 70
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 56 transition count 70
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 154 place count 55 transition count 68
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 55 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 157 place count 55 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 158 place count 54 transition count 66
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 206 place count 30 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 207 place count 30 transition count 41
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 211 place count 26 transition count 32
Iterating global reduction 6 with 4 rules applied. Total rules applied 215 place count 26 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 216 place count 26 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 218 place count 25 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 222 place count 23 transition count 36
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 223 place count 23 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 224 place count 22 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 225 place count 21 transition count 35
Applied a total of 225 rules in 75 ms. Remains 21 /133 variables (removed 112) and now considering 35/156 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 21/133 places, 35/156 transitions.
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Computed a total of 30 stabilizing places and 31 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)&&p1))||(F(G(p2)) U F(X(p3)))))'
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 156/156 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 127 transition count 150
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 127 transition count 150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 126 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 126 transition count 149
Applied a total of 14 rules in 35 ms. Remains 126 /133 variables (removed 7) and now considering 149/156 (removed 7) transitions.
// Phase 1: matrix 149 rows 126 cols
[2022-06-10 21:58:53] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:58:53] [INFO ] Implicit Places using invariants in 105 ms returned []
// Phase 1: matrix 149 rows 126 cols
[2022-06-10 21:58:53] [INFO ] Computed 7 place invariants in 10 ms
[2022-06-10 21:58:53] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
// Phase 1: matrix 149 rows 126 cols
[2022-06-10 21:58:53] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 21:58:53] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/133 places, 149/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/133 places, 149/156 transitions.
Stuttering acceptance computed with spot in 455 ms :[(NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p1))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p3) p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p3:(EQ s102 1), p0:(EQ s16 0), p1:(EQ s56 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 55 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-00 finished in 1095 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U F(p1))&&G(p0))))'
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 156/156 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 127 transition count 150
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 127 transition count 150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 126 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 126 transition count 149
Applied a total of 14 rules in 25 ms. Remains 126 /133 variables (removed 7) and now considering 149/156 (removed 7) transitions.
// Phase 1: matrix 149 rows 126 cols
[2022-06-10 21:58:54] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 21:58:54] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 149 rows 126 cols
[2022-06-10 21:58:54] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 21:58:54] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
// Phase 1: matrix 149 rows 126 cols
[2022-06-10 21:58:54] [INFO ] Computed 7 place invariants in 5 ms
[2022-06-10 21:58:54] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/133 places, 149/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/133 places, 149/156 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s47 1), p1:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-01 finished in 519 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 156/156 transitions.
Graph (trivial) has 122 edges and 133 vertex of which 4 / 133 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 130 transition count 99
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 69 rules applied. Total rules applied 124 place count 76 transition count 84
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 132 place count 68 transition count 84
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 132 place count 68 transition count 77
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 146 place count 61 transition count 77
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 150 place count 57 transition count 73
Iterating global reduction 3 with 4 rules applied. Total rules applied 154 place count 57 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 56 transition count 71
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 56 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 158 place count 56 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 159 place count 55 transition count 69
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 203 place count 33 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 204 place count 33 transition count 45
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 207 place count 30 transition count 38
Iterating global reduction 6 with 3 rules applied. Total rules applied 210 place count 30 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 214 place count 28 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 218 place count 26 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 220 place count 24 transition count 43
Applied a total of 220 rules in 43 ms. Remains 24 /133 variables (removed 109) and now considering 43/156 (removed 113) transitions.
// Phase 1: matrix 43 rows 24 cols
[2022-06-10 21:58:54] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:58:54] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 43 rows 24 cols
[2022-06-10 21:58:54] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:58:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 21:58:55] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [19, 23]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 99 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/133 places, 43/156 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 42
Applied a total of 2 rules in 6 ms. Remains 21 /22 variables (removed 1) and now considering 42/43 (removed 1) transitions.
// Phase 1: matrix 42 rows 21 cols
[2022-06-10 21:58:55] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 21:58:55] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 42 rows 21 cols
[2022-06-10 21:58:55] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 21:58:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:58:55] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/133 places, 42/156 transitions.
Finished structural reductions, in 2 iterations. Remains : 21/133 places, 42/156 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s4 1) (EQ s9 1) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-02 finished in 412 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 156/156 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 126 transition count 149
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 126 transition count 149
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 125 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 125 transition count 148
Applied a total of 16 rules in 9 ms. Remains 125 /133 variables (removed 8) and now considering 148/156 (removed 8) transitions.
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:58:55] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:58:55] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:58:55] [INFO ] Computed 7 place invariants in 8 ms
[2022-06-10 21:58:55] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:58:55] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-10 21:58:55] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/133 places, 148/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/133 places, 148/156 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 12651 reset in 490 ms.
Product exploration explored 100000 steps with 12628 reset in 242 ms.
Computed a total of 29 stabilizing places and 30 stable transitions
Computed a total of 29 stabilizing places and 30 stable transitions
Detected a total of 29/125 stabilizing places and 30/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:58:57] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:58:57] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2022-06-10 21:58:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 21:58:57] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2022-06-10 21:58:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 21:58:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2022-06-10 21:58:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 21:58:57] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2022-06-10 21:58:57] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2022-06-10 21:58:57] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2022-06-10 21:58:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 115 ms
[2022-06-10 21:58:57] [INFO ] Computed and/alt/rep : 134/255/134 causal constraints (skipped 13 transitions) in 20 ms.
[2022-06-10 21:58:58] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2022-06-10 21:58:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2022-06-10 21:58:58] [INFO ] Added : 110 causal constraints over 22 iterations in 441 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 148/148 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:58:58] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 21:58:58] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:58:58] [INFO ] Computed 7 place invariants in 6 ms
[2022-06-10 21:58:58] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:58:58] [INFO ] Computed 7 place invariants in 8 ms
[2022-06-10 21:58:58] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 148/148 transitions.
Computed a total of 29 stabilizing places and 30 stable transitions
Computed a total of 29 stabilizing places and 30 stable transitions
Detected a total of 29/125 stabilizing places and 30/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:58:59] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:58:59] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2022-06-10 21:58:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 21:58:59] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2022-06-10 21:58:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 21:58:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2022-06-10 21:58:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 21:59:00] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2022-06-10 21:59:00] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2022-06-10 21:59:00] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2022-06-10 21:59:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2022-06-10 21:59:00] [INFO ] Computed and/alt/rep : 134/255/134 causal constraints (skipped 13 transitions) in 22 ms.
[2022-06-10 21:59:00] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2022-06-10 21:59:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2022-06-10 21:59:00] [INFO ] Added : 110 causal constraints over 22 iterations in 594 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12583 reset in 112 ms.
Product exploration explored 100000 steps with 12567 reset in 122 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 148/148 transitions.
Graph (trivial) has 115 edges and 125 vertex of which 4 / 125 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 123 transition count 146
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 54 place count 123 transition count 139
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 54 place count 123 transition count 139
Deduced a syphon composed of 55 places in 1 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 63 place count 123 transition count 139
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 101 place count 85 transition count 101
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 139 place count 85 transition count 101
Performed 34 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 2 with 34 rules applied. Total rules applied 173 place count 85 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 175 place count 85 transition count 104
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 202 place count 58 transition count 71
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 3 with 27 rules applied. Total rules applied 229 place count 58 transition count 71
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 233 place count 58 transition count 67
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 236 place count 55 transition count 64
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 239 place count 55 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 240 place count 55 transition count 64
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 242 place count 53 transition count 62
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 244 place count 53 transition count 62
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 247 place count 53 transition count 76
Deduced a syphon composed of 29 places in 0 ms
Applied a total of 247 rules in 64 ms. Remains 53 /125 variables (removed 72) and now considering 76/148 (removed 72) transitions.
[2022-06-10 21:59:01] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 76 rows 53 cols
[2022-06-10 21:59:01] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 21:59:01] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/125 places, 76/148 transitions.
Finished structural reductions, in 1 iterations. Remains : 53/125 places, 76/148 transitions.
Product exploration explored 100000 steps with 14923 reset in 516 ms.
Product exploration explored 100000 steps with 14933 reset in 437 ms.
Built C files in :
/tmp/ltsmin4302859623230298239
[2022-06-10 21:59:02] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4302859623230298239
Running compilation step : cd /tmp/ltsmin4302859623230298239;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 579 ms.
Running link step : cd /tmp/ltsmin4302859623230298239;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin4302859623230298239;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17021787862463899332.hoa' '--buchi-type=spotba'
LTSmin run took 3108 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-02b-LTLFireability-03 finished in 11296 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((true U p0))))'
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 156/156 transitions.
Graph (trivial) has 123 edges and 133 vertex of which 4 / 133 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 130 transition count 100
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 68 rules applied. Total rules applied 122 place count 77 transition count 85
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 131 place count 69 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 132 place count 68 transition count 84
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 132 place count 68 transition count 77
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 146 place count 61 transition count 77
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 150 place count 57 transition count 73
Iterating global reduction 4 with 4 rules applied. Total rules applied 154 place count 57 transition count 73
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 154 place count 57 transition count 72
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 156 place count 56 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 157 place count 55 transition count 70
Iterating global reduction 4 with 1 rules applied. Total rules applied 158 place count 55 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 160 place count 55 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 161 place count 54 transition count 68
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 203 place count 33 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 204 place count 33 transition count 45
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 208 place count 29 transition count 36
Iterating global reduction 7 with 4 rules applied. Total rules applied 212 place count 29 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 213 place count 29 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 217 place count 27 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 221 place count 25 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 223 place count 23 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 224 place count 22 transition count 37
Applied a total of 224 rules in 23 ms. Remains 22 /133 variables (removed 111) and now considering 37/156 (removed 119) transitions.
// Phase 1: matrix 37 rows 22 cols
[2022-06-10 21:59:06] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 21:59:06] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 37 rows 22 cols
[2022-06-10 21:59:06] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 21:59:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 21:59:06] [INFO ] Implicit Places using invariants and state equation in 55 ms returned [17, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 93 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/133 places, 37/156 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 19 transition count 36
Applied a total of 2 rules in 3 ms. Remains 19 /20 variables (removed 1) and now considering 36/37 (removed 1) transitions.
// Phase 1: matrix 36 rows 19 cols
[2022-06-10 21:59:06] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 21:59:06] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 36 rows 19 cols
[2022-06-10 21:59:06] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:59:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:59:06] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/133 places, 36/156 transitions.
Finished structural reductions, in 2 iterations. Remains : 19/133 places, 36/156 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-05 finished in 329 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0) U X(p0)))))'
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 156/156 transitions.
Graph (trivial) has 123 edges and 133 vertex of which 4 / 133 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 130 transition count 99
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 67 rules applied. Total rules applied 122 place count 76 transition count 86
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 129 place count 69 transition count 86
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 129 place count 69 transition count 78
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 145 place count 61 transition count 78
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 149 place count 57 transition count 74
Iterating global reduction 3 with 4 rules applied. Total rules applied 153 place count 57 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 153 place count 57 transition count 73
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 56 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 55 transition count 71
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 55 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 159 place count 55 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 160 place count 54 transition count 69
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 202 place count 33 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 203 place count 33 transition count 46
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 207 place count 29 transition count 37
Iterating global reduction 6 with 4 rules applied. Total rules applied 211 place count 29 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 212 place count 29 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 216 place count 27 transition count 34
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 220 place count 25 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 222 place count 23 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 223 place count 22 transition count 38
Applied a total of 223 rules in 34 ms. Remains 22 /133 variables (removed 111) and now considering 38/156 (removed 118) transitions.
// Phase 1: matrix 38 rows 22 cols
[2022-06-10 21:59:06] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 21:59:07] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 38 rows 22 cols
[2022-06-10 21:59:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 21:59:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 21:59:07] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [17, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 219 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/133 places, 38/156 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 19 transition count 37
Applied a total of 2 rules in 4 ms. Remains 19 /20 variables (removed 1) and now considering 37/38 (removed 1) transitions.
// Phase 1: matrix 37 rows 19 cols
[2022-06-10 21:59:07] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:59:07] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 37 rows 19 cols
[2022-06-10 21:59:07] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:59:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:59:07] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/133 places, 37/156 transitions.
Finished structural reductions, in 2 iterations. Remains : 19/133 places, 37/156 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-06 finished in 448 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&G(F(p2)))))'
Support contains 5 out of 133 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 156/156 transitions.
Graph (trivial) has 119 edges and 133 vertex of which 4 / 133 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 130 transition count 101
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 67 rules applied. Total rules applied 120 place count 78 transition count 86
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 128 place count 70 transition count 86
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 128 place count 70 transition count 77
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 146 place count 61 transition count 77
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 149 place count 58 transition count 74
Iterating global reduction 3 with 3 rules applied. Total rules applied 152 place count 58 transition count 74
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 194 place count 37 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 195 place count 37 transition count 51
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 198 place count 34 transition count 45
Iterating global reduction 4 with 3 rules applied. Total rules applied 201 place count 34 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 202 place count 34 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 206 place count 32 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 210 place count 30 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 29 transition count 50
Applied a total of 211 rules in 22 ms. Remains 29 /133 variables (removed 104) and now considering 50/156 (removed 106) transitions.
// Phase 1: matrix 50 rows 29 cols
[2022-06-10 21:59:07] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-10 21:59:07] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 50 rows 29 cols
[2022-06-10 21:59:07] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:59:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 21:59:07] [INFO ] Implicit Places using invariants and state equation in 84 ms returned [24, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 120 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/133 places, 50/156 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 49
Applied a total of 2 rules in 3 ms. Remains 26 /27 variables (removed 1) and now considering 49/50 (removed 1) transitions.
// Phase 1: matrix 49 rows 26 cols
[2022-06-10 21:59:07] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 21:59:07] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 49 rows 26 cols
[2022-06-10 21:59:07] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:59:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:59:07] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/133 places, 49/156 transitions.
Finished structural reductions, in 2 iterations. Remains : 26/133 places, 49/156 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(NEQ s8 1), p1:(AND (EQ s2 1) (EQ s3 1) (EQ s10 1) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-07 finished in 474 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(X(p1))))'
Support contains 5 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 156/156 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 127 transition count 150
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 127 transition count 150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 126 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 126 transition count 149
Applied a total of 14 rules in 7 ms. Remains 126 /133 variables (removed 7) and now considering 149/156 (removed 7) transitions.
// Phase 1: matrix 149 rows 126 cols
[2022-06-10 21:59:07] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:59:07] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 149 rows 126 cols
[2022-06-10 21:59:07] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:59:08] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
// Phase 1: matrix 149 rows 126 cols
[2022-06-10 21:59:08] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:59:08] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/133 places, 149/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/133 places, 149/156 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s5 1) (EQ s7 1) (EQ s36 1) (EQ s92 1)), p0:(EQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-08 finished in 609 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(X(X(p0)))||G(p1)))))'
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 156/156 transitions.
Graph (trivial) has 119 edges and 133 vertex of which 4 / 133 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 130 transition count 102
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 60 rules applied. Total rules applied 112 place count 79 transition count 93
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 118 place count 75 transition count 91
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 124 place count 73 transition count 87
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 126 place count 71 transition count 87
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 126 place count 71 transition count 80
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 140 place count 64 transition count 80
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 144 place count 60 transition count 76
Iterating global reduction 5 with 4 rules applied. Total rules applied 148 place count 60 transition count 76
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 148 place count 60 transition count 75
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 150 place count 59 transition count 75
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 151 place count 58 transition count 73
Iterating global reduction 5 with 1 rules applied. Total rules applied 152 place count 58 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 154 place count 58 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 155 place count 57 transition count 71
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 199 place count 35 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 200 place count 35 transition count 47
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 204 place count 31 transition count 38
Iterating global reduction 8 with 4 rules applied. Total rules applied 208 place count 31 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 212 place count 29 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 216 place count 27 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 218 place count 25 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 219 place count 24 transition count 43
Applied a total of 219 rules in 43 ms. Remains 24 /133 variables (removed 109) and now considering 43/156 (removed 113) transitions.
// Phase 1: matrix 43 rows 24 cols
[2022-06-10 21:59:08] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 21:59:08] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 43 rows 24 cols
[2022-06-10 21:59:08] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 21:59:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 21:59:08] [INFO ] Implicit Places using invariants and state equation in 75 ms returned [19, 23]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 143 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/133 places, 43/156 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 21 transition count 42
Applied a total of 2 rules in 6 ms. Remains 21 /22 variables (removed 1) and now considering 42/43 (removed 1) transitions.
// Phase 1: matrix 42 rows 21 cols
[2022-06-10 21:59:08] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:59:08] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 42 rows 21 cols
[2022-06-10 21:59:08] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:59:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:59:08] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/133 places, 42/156 transitions.
Finished structural reductions, in 2 iterations. Remains : 21/133 places, 42/156 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s14 1), p0:(EQ s8 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6 reset in 234 ms.
Product exploration explored 100000 steps with 2 reset in 189 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 7 factoid took 336 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 144 steps, including 16 resets, run visited all 4 properties in 8 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 451 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 21 cols
[2022-06-10 21:59:10] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 21:59:10] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 42 rows 21 cols
[2022-06-10 21:59:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:59:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:59:10] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2022-06-10 21:59:10] [INFO ] Redundant transitions in 17 ms returned [11]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 41 rows 21 cols
[2022-06-10 21:59:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:59:10] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/21 places, 41/42 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 19 transition count 39
Applied a total of 2 rules in 2 ms. Remains 19 /21 variables (removed 2) and now considering 39/41 (removed 2) transitions.
// Phase 1: matrix 39 rows 19 cols
[2022-06-10 21:59:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:59:10] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 39 rows 19 cols
[2022-06-10 21:59:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:59:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:59:10] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/21 places, 39/42 transitions.
Finished structural reductions, in 2 iterations. Remains : 19/21 places, 39/42 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 476 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 1489 steps, including 193 resets, run visited all 4 properties in 16 ms. (steps per millisecond=93 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 681 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 139 ms.
Product exploration explored 100000 steps with 2 reset in 394 ms.
Built C files in :
/tmp/ltsmin8960642863632897050
[2022-06-10 21:59:12] [INFO ] Computing symmetric may disable matrix : 39 transitions.
[2022-06-10 21:59:12] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 21:59:12] [INFO ] Computing symmetric may enable matrix : 39 transitions.
[2022-06-10 21:59:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 21:59:12] [INFO ] Computing Do-Not-Accords matrix : 39 transitions.
[2022-06-10 21:59:12] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 21:59:12] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8960642863632897050
Running compilation step : cd /tmp/ltsmin8960642863632897050;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 278 ms.
Running link step : cd /tmp/ltsmin8960642863632897050;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin8960642863632897050;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17164191296482298534.hoa' '--buchi-type=spotba'
LTSmin run took 78 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-02b-LTLFireability-09 finished in 4489 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p0 U X(p0)))||X(p1)||p1)))'
Support contains 5 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 156/156 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 126 transition count 149
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 126 transition count 149
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 125 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 125 transition count 148
Applied a total of 16 rules in 5 ms. Remains 125 /133 variables (removed 8) and now considering 148/156 (removed 8) transitions.
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:59:12] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:59:13] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:59:13] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:59:13] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:59:13] [INFO ] Computed 7 place invariants in 4 ms
[2022-06-10 21:59:13] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/133 places, 148/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/133 places, 148/156 transitions.
Stuttering acceptance computed with spot in 219 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 4}]], initial=2, aps=[p1:(AND (EQ s4 1) (EQ s11 1) (EQ s26 1) (EQ s91 1)), p0:(EQ s115 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-10 finished in 685 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 156/156 transitions.
Graph (trivial) has 123 edges and 133 vertex of which 4 / 133 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 130 transition count 99
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 68 rules applied. Total rules applied 123 place count 76 transition count 85
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 131 place count 69 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 132 place count 68 transition count 84
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 132 place count 68 transition count 77
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 146 place count 61 transition count 77
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 150 place count 57 transition count 73
Iterating global reduction 4 with 4 rules applied. Total rules applied 154 place count 57 transition count 73
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 154 place count 57 transition count 72
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 156 place count 56 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 157 place count 55 transition count 70
Iterating global reduction 4 with 1 rules applied. Total rules applied 158 place count 55 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 160 place count 55 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 161 place count 54 transition count 68
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 205 place count 32 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 206 place count 32 transition count 44
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 210 place count 28 transition count 35
Iterating global reduction 7 with 4 rules applied. Total rules applied 214 place count 28 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 215 place count 28 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 217 place count 27 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 221 place count 25 transition count 39
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 222 place count 25 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 224 place count 23 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 225 place count 22 transition count 37
Applied a total of 225 rules in 14 ms. Remains 22 /133 variables (removed 111) and now considering 37/156 (removed 119) transitions.
// Phase 1: matrix 37 rows 22 cols
[2022-06-10 21:59:13] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 21:59:13] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 37 rows 22 cols
[2022-06-10 21:59:13] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 21:59:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 21:59:13] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [17, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 98 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/133 places, 37/156 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19 transition count 36
Applied a total of 2 rules in 1 ms. Remains 19 /20 variables (removed 1) and now considering 36/37 (removed 1) transitions.
// Phase 1: matrix 36 rows 19 cols
[2022-06-10 21:59:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:59:13] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 36 rows 19 cols
[2022-06-10 21:59:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 21:59:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:59:13] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/133 places, 36/156 transitions.
Finished structural reductions, in 2 iterations. Remains : 19/133 places, 36/156 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-12 finished in 278 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0) U (F(p0)&&!p0))))'
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 156/156 transitions.
Graph (trivial) has 124 edges and 133 vertex of which 4 / 133 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 130 transition count 99
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 69 rules applied. Total rules applied 124 place count 76 transition count 84
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 133 place count 68 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 134 place count 67 transition count 83
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 134 place count 67 transition count 76
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 148 place count 60 transition count 76
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 152 place count 56 transition count 72
Iterating global reduction 4 with 4 rules applied. Total rules applied 156 place count 56 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 156 place count 56 transition count 71
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 55 transition count 71
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 159 place count 54 transition count 69
Iterating global reduction 4 with 1 rules applied. Total rules applied 160 place count 54 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 162 place count 54 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 163 place count 53 transition count 67
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 205 place count 32 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 206 place count 32 transition count 44
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 210 place count 28 transition count 35
Iterating global reduction 7 with 4 rules applied. Total rules applied 214 place count 28 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 215 place count 28 transition count 34
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 219 place count 26 transition count 32
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 223 place count 24 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 224 place count 23 transition count 37
Applied a total of 224 rules in 17 ms. Remains 23 /133 variables (removed 110) and now considering 37/156 (removed 119) transitions.
// Phase 1: matrix 37 rows 23 cols
[2022-06-10 21:59:13] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:59:13] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 37 rows 23 cols
[2022-06-10 21:59:13] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:59:13] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-06-10 21:59:14] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [18, 22]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 105 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/133 places, 37/156 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 36
Applied a total of 2 rules in 2 ms. Remains 20 /21 variables (removed 1) and now considering 36/37 (removed 1) transitions.
// Phase 1: matrix 36 rows 20 cols
[2022-06-10 21:59:14] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:59:14] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 36 rows 20 cols
[2022-06-10 21:59:14] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:59:14] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-06-10 21:59:14] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/133 places, 36/156 transitions.
Finished structural reductions, in 2 iterations. Remains : 20/133 places, 36/156 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 27125 reset in 263 ms.
Product exploration explored 100000 steps with 27076 reset in 221 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/20 stabilizing places and 4/36 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 218 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 250 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
// Phase 1: matrix 36 rows 20 cols
[2022-06-10 21:59:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:59:15] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-06-10 21:59:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 21:59:15] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-06-10 21:59:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 21:59:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-06-10 21:59:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 21:59:15] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-06-10 21:59:15] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-06-10 21:59:15] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2022-06-10 21:59:15] [INFO ] Computed and/alt/rep : 15/47/15 causal constraints (skipped 10 transitions) in 5 ms.
[2022-06-10 21:59:15] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 36/36 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 36/36 (removed 0) transitions.
// Phase 1: matrix 36 rows 20 cols
[2022-06-10 21:59:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:59:15] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 36 rows 20 cols
[2022-06-10 21:59:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:59:15] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-06-10 21:59:15] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2022-06-10 21:59:15] [INFO ] Redundant transitions in 15 ms returned [10]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 35 rows 20 cols
[2022-06-10 21:59:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:59:15] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/20 places, 35/36 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 18 transition count 33
Applied a total of 2 rules in 2 ms. Remains 18 /20 variables (removed 2) and now considering 33/35 (removed 2) transitions.
// Phase 1: matrix 33 rows 18 cols
[2022-06-10 21:59:15] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 21:59:15] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 33 rows 18 cols
[2022-06-10 21:59:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:59:15] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-06-10 21:59:15] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/20 places, 33/36 transitions.
Finished structural reductions, in 2 iterations. Remains : 18/20 places, 33/36 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Detected a total of 5/18 stabilizing places and 5/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 216 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 245 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
// Phase 1: matrix 33 rows 18 cols
[2022-06-10 21:59:16] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:59:16] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-06-10 21:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 21:59:16] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-06-10 21:59:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 21:59:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-06-10 21:59:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 21:59:16] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-06-10 21:59:16] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-06-10 21:59:16] [INFO ] [Nat]Added 13 Read/Feed constraints in 5 ms returned sat
[2022-06-10 21:59:16] [INFO ] Computed and/alt/rep : 11/43/11 causal constraints (skipped 12 transitions) in 7 ms.
[2022-06-10 21:59:16] [INFO ] Added : 5 causal constraints over 3 iterations in 33 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Product exploration explored 100000 steps with 31215 reset in 195 ms.
Product exploration explored 100000 steps with 31267 reset in 219 ms.
Built C files in :
/tmp/ltsmin16928741628593199879
[2022-06-10 21:59:17] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2022-06-10 21:59:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 21:59:17] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2022-06-10 21:59:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 21:59:17] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2022-06-10 21:59:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 21:59:17] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16928741628593199879
Running compilation step : cd /tmp/ltsmin16928741628593199879;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 241 ms.
Running link step : cd /tmp/ltsmin16928741628593199879;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16928741628593199879;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1383833536437900614.hoa' '--buchi-type=spotba'
LTSmin run took 397 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-02b-LTLFireability-13 finished in 3963 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 156/156 transitions.
Graph (trivial) has 123 edges and 133 vertex of which 4 / 133 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 130 transition count 100
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 68 rules applied. Total rules applied 122 place count 77 transition count 85
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 130 place count 69 transition count 85
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 130 place count 69 transition count 78
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 144 place count 62 transition count 78
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 148 place count 58 transition count 74
Iterating global reduction 3 with 4 rules applied. Total rules applied 152 place count 58 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 152 place count 58 transition count 73
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 57 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 56 transition count 71
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 56 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 158 place count 56 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 159 place count 55 transition count 69
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 203 place count 33 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 204 place count 33 transition count 45
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 208 place count 29 transition count 36
Iterating global reduction 6 with 4 rules applied. Total rules applied 212 place count 29 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 213 place count 29 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 217 place count 27 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 221 place count 25 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 223 place count 23 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 224 place count 22 transition count 37
Applied a total of 224 rules in 18 ms. Remains 22 /133 variables (removed 111) and now considering 37/156 (removed 119) transitions.
// Phase 1: matrix 37 rows 22 cols
[2022-06-10 21:59:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 21:59:17] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 37 rows 22 cols
[2022-06-10 21:59:17] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 21:59:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 21:59:17] [INFO ] Implicit Places using invariants and state equation in 72 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 127 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/133 places, 37/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/133 places, 37/156 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-14 finished in 211 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X((false U p0)))||G(p1))))'
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 156/156 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 127 transition count 150
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 127 transition count 150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 126 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 126 transition count 149
Applied a total of 14 rules in 5 ms. Remains 126 /133 variables (removed 7) and now considering 149/156 (removed 7) transitions.
// Phase 1: matrix 149 rows 126 cols
[2022-06-10 21:59:18] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:59:18] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 149 rows 126 cols
[2022-06-10 21:59:18] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 21:59:18] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
// Phase 1: matrix 149 rows 126 cols
[2022-06-10 21:59:18] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 21:59:18] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/133 places, 149/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/133 places, 149/156 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(EQ s47 1), p1:(EQ s81 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-15 finished in 771 ms.
All properties solved by simple procedures.
Total runtime 29954 ms.

BK_STOP 1654898359049

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="AutonomousCar-PT-02b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-02b, 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 r294-smll-165463872900436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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