Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r009-oct2-167813598100572.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is AutonomousCar-PT-03b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598100572
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 75K Mar 5 18:22 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-03b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678637063631

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-03b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:04:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:04:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:04:27] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-12 16:04:27] [INFO ] Transformed 190 places.
[2023-03-12 16:04:27] [INFO ] Transformed 273 transitions.
[2023-03-12 16:04:27] [INFO ] Found NUPN structural information;
[2023-03-12 16:04:27] [INFO ] Parsed PT model containing 190 places and 273 transitions and 1051 arcs in 166 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-03b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 273/273 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 166 transition count 249
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 166 transition count 249
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 84 place count 166 transition count 213
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 161 transition count 208
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 161 transition count 208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 160 transition count 207
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 160 transition count 207
Applied a total of 96 rules in 62 ms. Remains 160 /190 variables (removed 30) and now considering 207/273 (removed 66) transitions.
// Phase 1: matrix 207 rows 160 cols
[2023-03-12 16:04:27] [INFO ] Computed 8 place invariants in 20 ms
[2023-03-12 16:04:28] [INFO ] Implicit Places using invariants in 473 ms returned []
[2023-03-12 16:04:28] [INFO ] Invariant cache hit.
[2023-03-12 16:04:28] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
[2023-03-12 16:04:28] [INFO ] Invariant cache hit.
[2023-03-12 16:04:29] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 160/190 places, 207/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1507 ms. Remains : 160/190 places, 207/273 transitions.
Support contains 36 out of 160 places after structural reductions.
[2023-03-12 16:04:29] [INFO ] Flatten gal took : 49 ms
[2023-03-12 16:04:29] [INFO ] Flatten gal took : 16 ms
[2023-03-12 16:04:29] [INFO ] Input system was already deterministic with 207 transitions.
Support contains 34 out of 160 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 34) seen :20
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :10
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 16:04:29] [INFO ] Invariant cache hit.
[2023-03-12 16:04:30] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-12 16:04:30] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-12 16:04:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 64 ms returned sat
[2023-03-12 16:04:30] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 16:04:30] [INFO ] After 262ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-12 16:04:30] [INFO ] After 434ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 207/207 transitions.
Graph (trivial) has 149 edges and 160 vertex of which 4 / 160 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 387 edges and 158 vertex of which 156 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 156 transition count 136
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 88 rules applied. Total rules applied 157 place count 91 transition count 113
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 170 place count 78 transition count 113
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 170 place count 78 transition count 107
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 182 place count 72 transition count 107
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 185 place count 69 transition count 104
Iterating global reduction 3 with 3 rules applied. Total rules applied 188 place count 69 transition count 104
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 248 place count 39 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 249 place count 39 transition count 73
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 255 place count 33 transition count 54
Iterating global reduction 4 with 6 rules applied. Total rules applied 261 place count 33 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 263 place count 33 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 265 place count 32 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
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 269 place count 30 transition count 69
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 271 place count 30 transition count 67
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 273 place count 28 transition count 67
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 274 place count 28 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 275 place count 27 transition count 66
Applied a total of 275 rules in 74 ms. Remains 27 /160 variables (removed 133) and now considering 66/207 (removed 141) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 27/160 places, 66/207 transitions.
Finished random walk after 954 steps, including 63 resets, run visited all 1 properties in 3 ms. (steps per millisecond=318 )
FORMULA AutonomousCar-PT-03b-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-03b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 35 stabilizing places and 36 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G((G(p2)||p1))))'
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Graph (trivial) has 147 edges and 160 vertex of which 4 / 160 are part of one of the 2 SCC in 7 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 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 157 transition count 140
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 85 rules applied. Total rules applied 150 place count 93 transition count 119
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 162 place count 81 transition count 119
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 162 place count 81 transition count 113
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 174 place count 75 transition count 113
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 178 place count 71 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 182 place count 71 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 183 place count 70 transition count 106
Iterating global reduction 3 with 1 rules applied. Total rules applied 184 place count 70 transition count 106
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 186 place count 70 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 187 place count 69 transition count 104
Performed 28 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 243 place count 41 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 244 place count 41 transition count 74
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 248 place count 37 transition count 60
Iterating global reduction 6 with 4 rules applied. Total rules applied 252 place count 37 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 254 place count 37 transition count 58
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 256 place count 36 transition count 57
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 262 place count 33 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 264 place count 31 transition count 73
Applied a total of 264 rules in 56 ms. Remains 31 /160 variables (removed 129) and now considering 73/207 (removed 134) transitions.
// Phase 1: matrix 73 rows 31 cols
[2023-03-12 16:04:31] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:04:31] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-12 16:04:31] [INFO ] Invariant cache hit.
[2023-03-12 16:04:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:04:31] [INFO ] Implicit Places using invariants and state equation in 193 ms returned [24, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 338 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/160 places, 73/207 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 28 transition count 72
Applied a total of 2 rules in 7 ms. Remains 28 /29 variables (removed 1) and now considering 72/73 (removed 1) transitions.
// Phase 1: matrix 72 rows 28 cols
[2023-03-12 16:04:31] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 16:04:31] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-12 16:04:31] [INFO ] Invariant cache hit.
[2023-03-12 16:04:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:04:31] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/160 places, 72/207 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 597 ms. Remains : 28/160 places, 72/207 transitions.
Stuttering acceptance computed with spot in 391 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p2:(OR (EQ s1 0) (EQ s3 0) (EQ s22 0) (EQ s26 0)), p0:(AND (EQ s1 1) (EQ s3 1) (EQ s22 1) (EQ s26 1)), p1:(OR (EQ s1 0) (EQ s4 0) (EQ s15 0) (EQ s22 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 222 ms.
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-00 finished in 1301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(!p0&&G((!p1||G(p2))))))))'
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 155 transition count 202
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 155 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 154 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 154 transition count 201
Applied a total of 12 rules in 7 ms. Remains 154 /160 variables (removed 6) and now considering 201/207 (removed 6) transitions.
// Phase 1: matrix 201 rows 154 cols
[2023-03-12 16:04:32] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-12 16:04:32] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-12 16:04:32] [INFO ] Invariant cache hit.
[2023-03-12 16:04:33] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
[2023-03-12 16:04:33] [INFO ] Invariant cache hit.
[2023-03-12 16:04:33] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/160 places, 201/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 773 ms. Remains : 154/160 places, 201/207 transitions.
Stuttering acceptance computed with spot in 283 ms :[true, p0, p0, (AND p0 (NOT p2)), (NOT p2), (AND p0 p1 (NOT p2)), (AND (NOT p2) p1)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=5 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p2 p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND p1 p2), acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(AND (EQ s4 1) (EQ s6 1) (EQ s64 1) (EQ s120 1)), p1:(AND (EQ s4 1) (EQ s6 1) (EQ s55 1) (EQ s120 1)), p2:(NEQ s109 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 230 ms.
Product exploration explored 100000 steps with 8 reset in 252 ms.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 p2 (NOT p0)))), true, (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 910 ms. Reduced automaton from 7 states, 22 edges and 3 AP (stutter sensitive) to 7 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 347 ms :[true, p0, p0, (NOT p2), (AND p0 (NOT p2)), (AND (NOT p2) p1), (AND p0 p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 13) seen :5
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 16:04:35] [INFO ] Invariant cache hit.
[2023-03-12 16:04:35] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 16:04:35] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:1
[2023-03-12 16:04:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-12 16:04:35] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 p2 (NOT p0)))), true, (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (G (NOT (AND p1 (NOT p2)))), (G (NOT (AND p0 (NOT p2)))), (G (NOT (AND p1 (NOT p0) (NOT p2)))), (G (NOT (AND p1 p0 p2))), (G (NOT (AND p1 p0 (NOT p2))))]
False Knowledge obtained : [(F (AND p1 p2)), (F p1), (F (NOT p2)), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p0 p2)), (F (AND (NOT p1) p0)), (F p0), (F (AND p1 (NOT p0) p2))]
Knowledge based reduction with 20 factoid took 1365 ms. Reduced automaton from 7 states, 22 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 435 ms :[(OR (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), false, (AND p0 (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), false, (AND p0 (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 6 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 201/201 transitions.
Applied a total of 0 rules in 9 ms. Remains 154 /154 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2023-03-12 16:04:38] [INFO ] Invariant cache hit.
[2023-03-12 16:04:38] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-03-12 16:04:38] [INFO ] Invariant cache hit.
[2023-03-12 16:04:38] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2023-03-12 16:04:38] [INFO ] Invariant cache hit.
[2023-03-12 16:04:38] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 597 ms. Remains : 154/154 places, 201/201 transitions.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 430 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), false, false, false, (AND p0 (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-12 16:04:39] [INFO ] Invariant cache hit.
[2023-03-12 16:04:39] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 16:04:39] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 760 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[true, (NOT p2), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 260 ms :[true, (NOT p2), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 311 ms :[true, (NOT p2), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 2 reset in 133 ms.
Product exploration explored 100000 steps with 9 reset in 161 ms.
Applying partial POR strategy [true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 319 ms :[true, (NOT p2), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 (NOT p2))]
Support contains 6 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 201/201 transitions.
Graph (trivial) has 139 edges and 154 vertex of which 4 / 154 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 55 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 152 transition count 199
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 64 place count 152 transition count 191
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 64 place count 152 transition count 191
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 76 place count 152 transition count 191
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 121 place count 107 transition count 146
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 166 place count 107 transition count 146
Performed 38 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 204 place count 107 transition count 151
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 107 transition count 149
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 237 place count 76 transition count 105
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 3 with 31 rules applied. Total rules applied 268 place count 76 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 272 place count 76 transition count 101
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 275 place count 73 transition count 98
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 278 place count 73 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 279 place count 73 transition count 98
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 281 place count 71 transition count 96
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 283 place count 71 transition count 96
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 35 places in 1 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 286 place count 71 transition count 122
Deduced a syphon composed of 35 places in 0 ms
Applied a total of 286 rules in 67 ms. Remains 71 /154 variables (removed 83) and now considering 122/201 (removed 79) transitions.
[2023-03-12 16:04:42] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 122 rows 71 cols
[2023-03-12 16:04:42] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:04:42] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/154 places, 122/201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 576 ms. Remains : 71/154 places, 122/201 transitions.
Support contains 6 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 201/201 transitions.
Applied a total of 0 rules in 3 ms. Remains 154 /154 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 154 cols
[2023-03-12 16:04:42] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-12 16:04:42] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-12 16:04:42] [INFO ] Invariant cache hit.
[2023-03-12 16:04:42] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2023-03-12 16:04:42] [INFO ] Invariant cache hit.
[2023-03-12 16:04:43] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 453 ms. Remains : 154/154 places, 201/201 transitions.
Treatment of property AutonomousCar-PT-03b-LTLFireability-01 finished in 10731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Graph (trivial) has 148 edges and 160 vertex of which 4 / 160 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 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 157 transition count 141
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 84 rules applied. Total rules applied 148 place count 94 transition count 120
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 160 place count 82 transition count 120
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 160 place count 82 transition count 113
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 174 place count 75 transition count 113
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 178 place count 71 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 182 place count 71 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 183 place count 70 transition count 106
Iterating global reduction 3 with 1 rules applied. Total rules applied 184 place count 70 transition count 106
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 186 place count 70 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 187 place count 69 transition count 104
Performed 27 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 241 place count 42 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 242 place count 42 transition count 75
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 247 place count 37 transition count 59
Iterating global reduction 6 with 5 rules applied. Total rules applied 252 place count 37 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 253 place count 37 transition count 58
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 257 place count 35 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
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 261 place count 33 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 262 place count 32 transition count 73
Applied a total of 262 rules in 16 ms. Remains 32 /160 variables (removed 128) and now considering 73/207 (removed 134) transitions.
// Phase 1: matrix 73 rows 32 cols
[2023-03-12 16:04:43] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-12 16:04:43] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-12 16:04:43] [INFO ] Invariant cache hit.
[2023-03-12 16:04:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:04:43] [INFO ] Implicit Places using invariants and state equation in 90 ms returned [27, 31]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 129 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/160 places, 73/207 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 29 transition count 72
Applied a total of 2 rules in 8 ms. Remains 29 /30 variables (removed 1) and now considering 72/73 (removed 1) transitions.
// Phase 1: matrix 72 rows 29 cols
[2023-03-12 16:04:43] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 16:04:43] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-12 16:04:43] [INFO ] Invariant cache hit.
[2023-03-12 16:04:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:04:43] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 29/160 places, 72/207 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 403 ms. Remains : 29/160 places, 72/207 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s3 0) (EQ s13 0) (EQ s25 0))], nbAcceptance=1, 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 5 reset in 179 ms.
Product exploration explored 100000 steps with 3 reset in 98 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 58 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=58 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 72/72 transitions.
Applied a total of 0 rules in 16 ms. Remains 29 /29 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-12 16:04:44] [INFO ] Invariant cache hit.
[2023-03-12 16:04:44] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-12 16:04:44] [INFO ] Invariant cache hit.
[2023-03-12 16:04:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:04:44] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2023-03-12 16:04:44] [INFO ] Redundant transitions in 13 ms returned [18]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 71 rows 29 cols
[2023-03-12 16:04:44] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 16:04:44] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/29 places, 71/72 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 27 transition count 69
Applied a total of 2 rules in 4 ms. Remains 27 /29 variables (removed 2) and now considering 69/71 (removed 2) transitions.
// Phase 1: matrix 69 rows 27 cols
[2023-03-12 16:04:44] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 16:04:44] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-12 16:04:44] [INFO ] Invariant cache hit.
[2023-03-12 16:04:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:04:44] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/29 places, 69/72 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 658 ms. Remains : 27/29 places, 69/72 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 37 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=37 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8 reset in 91 ms.
Product exploration explored 100000 steps with 9 reset in 53 ms.
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 69/69 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-12 16:04:45] [INFO ] Invariant cache hit.
[2023-03-12 16:04:45] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-12 16:04:45] [INFO ] Invariant cache hit.
[2023-03-12 16:04:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:04:46] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
[2023-03-12 16:04:46] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-12 16:04:46] [INFO ] Invariant cache hit.
[2023-03-12 16:04:46] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 677 ms. Remains : 27/27 places, 69/69 transitions.
Treatment of property AutonomousCar-PT-03b-LTLFireability-03 finished in 3139 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(!p0&&(!p1||(p2&&F(!p1))))))))'
Support contains 9 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 155 transition count 202
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 155 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 154 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 154 transition count 201
Applied a total of 12 rules in 5 ms. Remains 154 /160 variables (removed 6) and now considering 201/207 (removed 6) transitions.
// Phase 1: matrix 201 rows 154 cols
[2023-03-12 16:04:46] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-12 16:04:46] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-12 16:04:46] [INFO ] Invariant cache hit.
[2023-03-12 16:04:46] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-12 16:04:46] [INFO ] Invariant cache hit.
[2023-03-12 16:04:46] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/160 places, 201/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 366 ms. Remains : 154/160 places, 201/207 transitions.
Stuttering acceptance computed with spot in 234 ms :[true, p1, p0, p0, (AND p1 p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s49 1) (EQ s69 1) (EQ s99 1) (EQ s121 1)), p0:(AND (EQ s4 1) (EQ s6 1) (EQ s39 1) (EQ s120 1)), p2:(NEQ s48 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 265 ms.
Product exploration explored 100000 steps with 50000 reset in 249 ms.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 p2 (NOT p0))))
Knowledge based reduction with 10 factoid took 355 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-03b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-03b-LTLFireability-04 finished in 1526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 155 transition count 202
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 155 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 154 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 154 transition count 201
Applied a total of 12 rules in 9 ms. Remains 154 /160 variables (removed 6) and now considering 201/207 (removed 6) transitions.
[2023-03-12 16:04:47] [INFO ] Invariant cache hit.
[2023-03-12 16:04:48] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-12 16:04:48] [INFO ] Invariant cache hit.
[2023-03-12 16:04:48] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2023-03-12 16:04:48] [INFO ] Invariant cache hit.
[2023-03-12 16:04:48] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/160 places, 201/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 646 ms. Remains : 154/160 places, 201/207 transitions.
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (EQ s4 1) (EQ s11 1) (EQ s70 1) (EQ s120 1)), p0:(OR (EQ s4 0) (EQ s12 0) (EQ s55 0) (EQ s120 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6 reset in 133 ms.
Product exploration explored 100000 steps with 3 reset in 81 ms.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 202 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2577063 steps, run timeout after 3001 ms. (steps per millisecond=858 ) properties seen :{}
Probabilistic random walk after 2577063 steps, saw 395196 distinct states, run finished after 3003 ms. (steps per millisecond=858 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 16:04:52] [INFO ] Invariant cache hit.
[2023-03-12 16:04:52] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:04:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 16:04:52] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:04:52] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 4 ms to minimize.
[2023-03-12 16:04:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-12 16:04:52] [INFO ] After 234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-12 16:04:52] [INFO ] After 374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 201/201 transitions.
Graph (trivial) has 143 edges and 154 vertex of which 4 / 154 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 381 edges and 152 vertex of which 150 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 150 transition count 137
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 82 rules applied. Total rules applied 144 place count 92 transition count 113
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 158 place count 78 transition count 113
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 158 place count 78 transition count 107
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 170 place count 72 transition count 107
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 236 place count 39 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 237 place count 39 transition count 73
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 243 place count 33 transition count 54
Iterating global reduction 4 with 6 rules applied. Total rules applied 249 place count 33 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 251 place count 33 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 253 place count 32 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
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 257 place count 30 transition count 69
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 259 place count 30 transition count 67
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 261 place count 28 transition count 67
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 262 place count 28 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 263 place count 27 transition count 66
Applied a total of 263 rules in 16 ms. Remains 27 /154 variables (removed 127) and now considering 66/201 (removed 135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 27/154 places, 66/201 transitions.
Finished random walk after 169 steps, including 16 resets, run visited all 1 properties in 1 ms. (steps per millisecond=169 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 4 out of 154 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 : 154/154 places, 201/201 transitions.
Graph (trivial) has 141 edges and 154 vertex of which 4 / 154 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 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 151 transition count 142
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 78 rules applied. Total rules applied 135 place count 95 transition count 120
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 148 place count 82 transition count 120
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 148 place count 82 transition count 114
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 160 place count 76 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 161 place count 75 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 75 transition count 113
Performed 32 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 226 place count 43 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 227 place count 43 transition count 79
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 232 place count 38 transition count 64
Iterating global reduction 4 with 5 rules applied. Total rules applied 237 place count 38 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 239 place count 38 transition count 62
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 243 place count 36 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
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 247 place count 34 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 249 place count 32 transition count 76
Applied a total of 249 rules in 11 ms. Remains 32 /154 variables (removed 122) and now considering 76/201 (removed 125) transitions.
// Phase 1: matrix 76 rows 32 cols
[2023-03-12 16:04:53] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:04:53] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-12 16:04:53] [INFO ] Invariant cache hit.
[2023-03-12 16:04:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:04:53] [INFO ] Implicit Places using invariants and state equation in 856 ms returned [27, 31]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 938 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/154 places, 76/201 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 29 transition count 75
Applied a total of 2 rules in 4 ms. Remains 29 /30 variables (removed 1) and now considering 75/76 (removed 1) transitions.
// Phase 1: matrix 75 rows 29 cols
[2023-03-12 16:04:53] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 16:04:54] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-12 16:04:54] [INFO ] Invariant cache hit.
[2023-03-12 16:04:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:04:54] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 29/154 places, 75/201 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1679 ms. Remains : 29/154 places, 75/201 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22 reset in 47 ms.
Product exploration explored 100000 steps with 11 reset in 86 ms.
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 75/75 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 0 with 1 rules applied. Total rules applied 1 place count 29 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 28 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 27 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 27 transition count 70
Applied a total of 4 rules in 3 ms. Remains 27 /29 variables (removed 2) and now considering 70/75 (removed 5) transitions.
// Phase 1: matrix 70 rows 27 cols
[2023-03-12 16:04:55] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 16:04:55] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-12 16:04:55] [INFO ] Invariant cache hit.
[2023-03-12 16:04:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:04:55] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2023-03-12 16:04:55] [INFO ] Redundant transitions in 39 ms returned [16]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 69 rows 27 cols
[2023-03-12 16:04:55] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 16:04:55] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/29 places, 69/75 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 25 transition count 67
Applied a total of 2 rules in 2 ms. Remains 25 /27 variables (removed 2) and now considering 67/69 (removed 2) transitions.
// Phase 1: matrix 67 rows 25 cols
[2023-03-12 16:04:55] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 16:04:56] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-12 16:04:56] [INFO ] Invariant cache hit.
[2023-03-12 16:04:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:04:56] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/29 places, 67/75 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 761 ms. Remains : 25/29 places, 67/75 transitions.
Treatment of property AutonomousCar-PT-03b-LTLFireability-05 finished in 8284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 155 transition count 202
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 155 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 154 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 154 transition count 201
Applied a total of 12 rules in 3 ms. Remains 154 /160 variables (removed 6) and now considering 201/207 (removed 6) transitions.
// Phase 1: matrix 201 rows 154 cols
[2023-03-12 16:04:56] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 16:04:56] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-12 16:04:56] [INFO ] Invariant cache hit.
[2023-03-12 16:04:56] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2023-03-12 16:04:56] [INFO ] Invariant cache hit.
[2023-03-12 16:04:56] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/160 places, 201/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 496 ms. Remains : 154/160 places, 201/207 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-07 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=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s151 0)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 26 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-07 finished in 652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Graph (trivial) has 149 edges and 160 vertex of which 4 / 160 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 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 157 transition count 141
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 83 rules applied. Total rules applied 147 place count 94 transition count 121
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 158 place count 83 transition count 121
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 158 place count 83 transition count 114
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 172 place count 76 transition count 114
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 176 place count 72 transition count 110
Iterating global reduction 3 with 4 rules applied. Total rules applied 180 place count 72 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 71 transition count 107
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 71 transition count 107
Performed 30 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 242 place count 41 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 243 place count 41 transition count 75
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 249 place count 35 transition count 56
Iterating global reduction 4 with 6 rules applied. Total rules applied 255 place count 35 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 257 place count 35 transition count 54
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 261 place count 33 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
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 265 place count 31 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 267 place count 29 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 268 place count 28 transition count 68
Applied a total of 268 rules in 12 ms. Remains 28 /160 variables (removed 132) and now considering 68/207 (removed 139) transitions.
// Phase 1: matrix 68 rows 28 cols
[2023-03-12 16:04:56] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-12 16:04:56] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-12 16:04:56] [INFO ] Invariant cache hit.
[2023-03-12 16:04:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:04:56] [INFO ] Implicit Places using invariants and state equation in 50 ms returned [23, 27]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 124 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/160 places, 68/207 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 25 transition count 67
Applied a total of 2 rules in 4 ms. Remains 25 /26 variables (removed 1) and now considering 67/68 (removed 1) transitions.
// Phase 1: matrix 67 rows 25 cols
[2023-03-12 16:04:56] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-12 16:04:56] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-12 16:04:56] [INFO ] Invariant cache hit.
[2023-03-12 16:04:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:04:56] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/160 places, 67/207 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 233 ms. Remains : 25/160 places, 67/207 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-08 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 s14 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]]
Product exploration explored 100000 steps with 0 reset in 78 ms.
Product exploration explored 100000 steps with 4 reset in 85 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 204 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Finished random walk after 72 steps, including 6 resets, run visited all 1 properties in 1 ms. (steps per millisecond=72 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 67/67 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2023-03-12 16:04:58] [INFO ] Invariant cache hit.
[2023-03-12 16:04:58] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-12 16:04:58] [INFO ] Invariant cache hit.
[2023-03-12 16:04:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:04:58] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-12 16:04:58] [INFO ] Redundant transitions in 11 ms returned [16]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 66 rows 25 cols
[2023-03-12 16:04:58] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 16:04:58] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/25 places, 66/67 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 23 transition count 64
Applied a total of 2 rules in 2 ms. Remains 23 /25 variables (removed 2) and now considering 64/66 (removed 2) transitions.
// Phase 1: matrix 64 rows 23 cols
[2023-03-12 16:04:58] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-12 16:04:58] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-12 16:04:58] [INFO ] Invariant cache hit.
[2023-03-12 16:04:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:04:58] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/25 places, 64/67 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 586 ms. Remains : 23/25 places, 64/67 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0)]
Finished random walk after 56 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 237 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4 reset in 52 ms.
Product exploration explored 100000 steps with 27 reset in 73 ms.
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-12 16:04:59] [INFO ] Invariant cache hit.
[2023-03-12 16:04:59] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-12 16:04:59] [INFO ] Invariant cache hit.
[2023-03-12 16:04:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:05:00] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2023-03-12 16:05:00] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-12 16:05:00] [INFO ] Invariant cache hit.
[2023-03-12 16:05:00] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 721 ms. Remains : 23/23 places, 64/64 transitions.
Treatment of property AutonomousCar-PT-03b-LTLFireability-08 finished in 3658 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((G(p1)||G(p2))))))'
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 157 transition count 204
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 157 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 156 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 156 transition count 203
Applied a total of 8 rules in 5 ms. Remains 156 /160 variables (removed 4) and now considering 203/207 (removed 4) transitions.
// Phase 1: matrix 203 rows 156 cols
[2023-03-12 16:05:00] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 16:05:00] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-12 16:05:00] [INFO ] Invariant cache hit.
[2023-03-12 16:05:00] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2023-03-12 16:05:00] [INFO ] Invariant cache hit.
[2023-03-12 16:05:00] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 156/160 places, 203/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 306 ms. Remains : 156/160 places, 203/207 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(EQ s129 1), p1:(EQ s88 0), p2:(OR (EQ s4 0) (EQ s12 0) (EQ s43 0) (EQ s121 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8 reset in 129 ms.
Product exploration explored 100000 steps with 10 reset in 93 ms.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 353 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 16:05:01] [INFO ] Invariant cache hit.
[2023-03-12 16:05:01] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:05:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 16:05:01] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:05:01] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-12 16:05:01] [INFO ] After 231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 203/203 transitions.
Graph (trivial) has 143 edges and 156 vertex of which 4 / 156 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 383 edges and 154 vertex of which 152 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 152 transition count 137
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 81 rules applied. Total rules applied 145 place count 92 transition count 116
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 157 place count 80 transition count 116
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 157 place count 80 transition count 109
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 171 place count 73 transition count 109
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 237 place count 40 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 238 place count 40 transition count 75
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 244 place count 34 transition count 57
Iterating global reduction 4 with 6 rules applied. Total rules applied 250 place count 34 transition count 57
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 253 place count 34 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 255 place count 33 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
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 259 place count 31 transition count 71
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 260 place count 31 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 261 place count 30 transition count 70
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 262 place count 30 transition count 69
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 263 place count 30 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 264 place count 29 transition count 68
Applied a total of 264 rules in 12 ms. Remains 29 /156 variables (removed 127) and now considering 68/203 (removed 135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 29/156 places, 68/203 transitions.
Finished random walk after 910 steps, including 62 resets, run visited all 1 properties in 3 ms. (steps per millisecond=303 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 6 factoid took 444 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p1) (NOT p2))]
Support contains 5 out of 156 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 : 156/156 places, 203/203 transitions.
Graph (trivial) has 141 edges and 156 vertex of which 4 / 156 are part of one of the 2 SCC in 13 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 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 153 transition count 142
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 76 rules applied. Total rules applied 135 place count 95 transition count 124
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 146 place count 84 transition count 124
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 146 place count 84 transition count 118
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 158 place count 78 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 159 place count 77 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 160 place count 77 transition count 117
Performed 32 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 224 place count 45 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 225 place count 45 transition count 83
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 231 place count 39 transition count 65
Iterating global reduction 4 with 6 rules applied. Total rules applied 237 place count 39 transition count 65
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 240 place count 39 transition count 62
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 244 place count 37 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
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 248 place count 35 transition count 78
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 249 place count 35 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 251 place count 33 transition count 76
Applied a total of 251 rules in 26 ms. Remains 33 /156 variables (removed 123) and now considering 76/203 (removed 127) transitions.
// Phase 1: matrix 76 rows 33 cols
[2023-03-12 16:05:02] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:05:02] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-12 16:05:02] [INFO ] Invariant cache hit.
[2023-03-12 16:05:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:05:02] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [27, 32]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 458 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/156 places, 76/203 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 30 transition count 75
Applied a total of 2 rules in 2 ms. Remains 30 /31 variables (removed 1) and now considering 75/76 (removed 1) transitions.
// Phase 1: matrix 75 rows 30 cols
[2023-03-12 16:05:02] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 16:05:02] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-12 16:05:02] [INFO ] Invariant cache hit.
[2023-03-12 16:05:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:05:03] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/156 places, 75/203 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 631 ms. Remains : 30/156 places, 75/203 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (AND p1 p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 456 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p1) (NOT p2))]
Finished random walk after 1189 steps, including 75 resets, run visited all 4 properties in 3 ms. (steps per millisecond=396 )
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (AND p1 p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 479 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 5 reset in 76 ms.
Product exploration explored 100000 steps with 1 reset in 127 ms.
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 75/75 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 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 29 transition count 74
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 2 with 2 rules applied. Total rules applied 4 place count 28 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 28 transition count 72
Applied a total of 5 rules in 15 ms. Remains 28 /30 variables (removed 2) and now considering 72/75 (removed 3) transitions.
// Phase 1: matrix 72 rows 28 cols
[2023-03-12 16:05:04] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 16:05:04] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-12 16:05:04] [INFO ] Invariant cache hit.
[2023-03-12 16:05:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:05:04] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-03-12 16:05:04] [INFO ] Redundant transitions in 11 ms returned [18]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 71 rows 28 cols
[2023-03-12 16:05:04] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 16:05:04] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/30 places, 71/75 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 26 transition count 69
Applied a total of 2 rules in 2 ms. Remains 26 /28 variables (removed 2) and now considering 69/71 (removed 2) transitions.
// Phase 1: matrix 69 rows 26 cols
[2023-03-12 16:05:04] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 16:05:04] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-12 16:05:04] [INFO ] Invariant cache hit.
[2023-03-12 16:05:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:05:04] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/30 places, 69/75 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 429 ms. Remains : 26/30 places, 69/75 transitions.
Treatment of property AutonomousCar-PT-03b-LTLFireability-09 finished in 4437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G((p1||X(F(p2)))))))'
Support contains 7 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 156 transition count 203
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 156 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 155 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 155 transition count 202
Applied a total of 10 rules in 5 ms. Remains 155 /160 variables (removed 5) and now considering 202/207 (removed 5) transitions.
// Phase 1: matrix 202 rows 155 cols
[2023-03-12 16:05:04] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 16:05:04] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-12 16:05:04] [INFO ] Invariant cache hit.
[2023-03-12 16:05:05] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-12 16:05:05] [INFO ] Invariant cache hit.
[2023-03-12 16:05:05] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 155/160 places, 202/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 155/160 places, 202/207 transitions.
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s11 1) (EQ s90 1) (EQ s121 1)), p1:(AND (EQ s4 1) (EQ s12 1) (EQ s70 1) (EQ s121 1)), p2:(EQ s88 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 54 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-11 finished in 575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U X(G(p1)))&&X(p2)) U X(p0)))'
Support contains 3 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 155 transition count 202
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 155 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 154 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 154 transition count 201
Applied a total of 12 rules in 11 ms. Remains 154 /160 variables (removed 6) and now considering 201/207 (removed 6) transitions.
// Phase 1: matrix 201 rows 154 cols
[2023-03-12 16:05:05] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 16:05:05] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-12 16:05:05] [INFO ] Invariant cache hit.
[2023-03-12 16:05:05] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-12 16:05:05] [INFO ] Invariant cache hit.
[2023-03-12 16:05:05] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/160 places, 201/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 436 ms. Remains : 154/160 places, 201/207 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=4 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}]], initial=3, aps=[p1:(EQ s93 1), p0:(EQ s98 1), p2:(NEQ s147 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, 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-03b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-12 finished in 707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(p1 U p2))))'
Support contains 3 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 157 transition count 204
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 157 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 156 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 156 transition count 203
Applied a total of 8 rules in 2 ms. Remains 156 /160 variables (removed 4) and now considering 203/207 (removed 4) transitions.
// Phase 1: matrix 203 rows 156 cols
[2023-03-12 16:05:06] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-12 16:05:06] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-12 16:05:06] [INFO ] Invariant cache hit.
[2023-03-12 16:05:06] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2023-03-12 16:05:06] [INFO ] Invariant cache hit.
[2023-03-12 16:05:06] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 156/160 places, 203/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 480 ms. Remains : 156/160 places, 203/207 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(EQ s93 1), p1:(EQ s100 1), p0:(AND (EQ s89 0) (EQ s100 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, 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-03b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-13 finished in 682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Graph (trivial) has 149 edges and 160 vertex of which 4 / 160 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 157 transition count 142
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 83 rules applied. Total rules applied 146 place count 95 transition count 121
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 158 place count 83 transition count 121
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 158 place count 83 transition count 113
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 174 place count 75 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 177 place count 72 transition count 110
Iterating global reduction 3 with 3 rules applied. Total rules applied 180 place count 72 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 71 transition count 107
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 71 transition count 107
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 184 place count 71 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 185 place count 70 transition count 105
Performed 29 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 243 place count 41 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 244 place count 41 transition count 74
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 250 place count 35 transition count 55
Iterating global reduction 6 with 6 rules applied. Total rules applied 256 place count 35 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 258 place count 35 transition count 53
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 262 place count 33 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
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 266 place count 31 transition count 69
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 268 place count 29 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 269 place count 28 transition count 67
Applied a total of 269 rules in 13 ms. Remains 28 /160 variables (removed 132) and now considering 67/207 (removed 140) transitions.
// Phase 1: matrix 67 rows 28 cols
[2023-03-12 16:05:06] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-12 16:05:06] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-12 16:05:06] [INFO ] Invariant cache hit.
[2023-03-12 16:05:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:05:07] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [23, 27]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 190 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/160 places, 67/207 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 25 transition count 66
Applied a total of 2 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 66/67 (removed 1) transitions.
// Phase 1: matrix 66 rows 25 cols
[2023-03-12 16:05:07] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 16:05:07] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-12 16:05:07] [INFO ] Invariant cache hit.
[2023-03-12 16:05:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:05:07] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/160 places, 66/207 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 421 ms. Remains : 25/160 places, 66/207 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-14 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 s18 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12 reset in 31 ms.
Product exploration explored 100000 steps with 16 reset in 46 ms.
Computed a total of 3 stabilizing places and 6 stable transitions
Computed a total of 3 stabilizing places and 6 stable transitions
Detected a total of 3/25 stabilizing places and 6/66 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [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 237 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 66/66 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2023-03-12 16:05:08] [INFO ] Invariant cache hit.
[2023-03-12 16:05:08] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-12 16:05:08] [INFO ] Invariant cache hit.
[2023-03-12 16:05:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:05:08] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-12 16:05:08] [INFO ] Redundant transitions in 13 ms returned [15]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 65 rows 25 cols
[2023-03-12 16:05:08] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-12 16:05:08] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/25 places, 65/66 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 23 transition count 63
Applied a total of 2 rules in 2 ms. Remains 23 /25 variables (removed 2) and now considering 63/65 (removed 2) transitions.
// Phase 1: matrix 63 rows 23 cols
[2023-03-12 16:05:08] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-12 16:05:08] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-12 16:05:08] [INFO ] Invariant cache hit.
[2023-03-12 16:05:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:05:08] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/25 places, 63/66 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 436 ms. Remains : 23/25 places, 63/66 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Detected a total of 4/23 stabilizing places and 5/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 238 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 210 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20 reset in 80 ms.
Product exploration explored 100000 steps with 4 reset in 82 ms.
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-12 16:05:09] [INFO ] Invariant cache hit.
[2023-03-12 16:05:09] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-12 16:05:09] [INFO ] Invariant cache hit.
[2023-03-12 16:05:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:05:09] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-03-12 16:05:09] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-12 16:05:09] [INFO ] Invariant cache hit.
[2023-03-12 16:05:09] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 280 ms. Remains : 23/23 places, 63/63 transitions.
Treatment of property AutonomousCar-PT-03b-LTLFireability-14 finished in 3122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((G(p0) U p1)))||G((F(p0)&&p2))))'
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Graph (trivial) has 144 edges and 160 vertex of which 4 / 160 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 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 157 transition count 143
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 80 rules applied. Total rules applied 142 place count 96 transition count 124
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 13 rules applied. Total rules applied 155 place count 85 transition count 122
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 159 place count 83 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 160 place count 82 transition count 120
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 160 place count 82 transition count 115
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 170 place count 77 transition count 115
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 174 place count 73 transition count 111
Iterating global reduction 5 with 4 rules applied. Total rules applied 178 place count 73 transition count 111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 179 place count 72 transition count 108
Iterating global reduction 5 with 1 rules applied. Total rules applied 180 place count 72 transition count 108
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 182 place count 72 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 183 place count 71 transition count 106
Performed 30 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 243 place count 41 transition count 74
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 248 place count 36 transition count 58
Iterating global reduction 7 with 5 rules applied. Total rules applied 253 place count 36 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 254 place count 36 transition count 57
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 256 place count 35 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
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 260 place count 33 transition count 74
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 262 place count 31 transition count 72
Applied a total of 262 rules in 13 ms. Remains 31 /160 variables (removed 129) and now considering 72/207 (removed 135) transitions.
// Phase 1: matrix 72 rows 31 cols
[2023-03-12 16:05:09] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:05:10] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-12 16:05:10] [INFO ] Invariant cache hit.
[2023-03-12 16:05:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:05:10] [INFO ] Implicit Places using invariants and state equation in 94 ms returned [26, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 388 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/160 places, 72/207 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 28 transition count 71
Applied a total of 2 rules in 2 ms. Remains 28 /29 variables (removed 1) and now considering 71/72 (removed 1) transitions.
// Phase 1: matrix 71 rows 28 cols
[2023-03-12 16:05:10] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 16:05:10] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-12 16:05:10] [INFO ] Invariant cache hit.
[2023-03-12 16:05:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:05:10] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/160 places, 71/207 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 500 ms. Remains : 28/160 places, 71/207 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(OR p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s5 1) (EQ s10 1) (EQ s24 1)), p0:(EQ s23 1), p1:(EQ s15 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-15 finished in 783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(!p0&&G((!p1||G(p2))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Found a Lengthening insensitive property : AutonomousCar-PT-03b-LTLFireability-05
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Graph (trivial) has 147 edges and 160 vertex of which 4 / 160 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 157 transition count 142
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 83 rules applied. Total rules applied 146 place count 95 transition count 121
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 158 place count 83 transition count 121
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 158 place count 83 transition count 115
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 170 place count 77 transition count 115
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 174 place count 73 transition count 111
Iterating global reduction 3 with 4 rules applied. Total rules applied 178 place count 73 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 179 place count 72 transition count 108
Iterating global reduction 3 with 1 rules applied. Total rules applied 180 place count 72 transition count 108
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 182 place count 72 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 183 place count 71 transition count 106
Performed 29 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 241 place count 42 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 242 place count 42 transition count 75
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 246 place count 38 transition count 63
Iterating global reduction 6 with 4 rules applied. Total rules applied 250 place count 38 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 251 place count 38 transition count 62
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 255 place count 36 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
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 259 place count 34 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 261 place count 32 transition count 76
Applied a total of 261 rules in 28 ms. Remains 32 /160 variables (removed 128) and now considering 76/207 (removed 131) transitions.
// Phase 1: matrix 76 rows 32 cols
[2023-03-12 16:05:11] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:05:11] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-12 16:05:11] [INFO ] Invariant cache hit.
[2023-03-12 16:05:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:05:11] [INFO ] Implicit Places using invariants and state equation in 81 ms returned [27, 31]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 261 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 30/160 places, 76/207 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 29 transition count 75
Applied a total of 2 rules in 14 ms. Remains 29 /30 variables (removed 1) and now considering 75/76 (removed 1) transitions.
// Phase 1: matrix 75 rows 29 cols
[2023-03-12 16:05:11] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 16:05:11] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-12 16:05:11] [INFO ] Invariant cache hit.
[2023-03-12 16:05:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:05:11] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 29/160 places, 75/207 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 445 ms. Remains : 29/160 places, 75/207 transitions.
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (EQ s1 1) (EQ s4 1) (EQ s15 1) (EQ s25 1)), p0:(OR (EQ s1 0) (EQ s5 0) (EQ s10 0) (EQ s25 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 11 reset in 48 ms.
Product exploration explored 100000 steps with 19 reset in 48 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0)]
Finished random walk after 474 steps, including 42 resets, run visited all 1 properties in 2 ms. (steps per millisecond=237 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Support contains 4 out of 29 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 : 29/29 places, 75/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2023-03-12 16:05:12] [INFO ] Invariant cache hit.
[2023-03-12 16:05:12] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-12 16:05:12] [INFO ] Invariant cache hit.
[2023-03-12 16:05:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:05:12] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-12 16:05:12] [INFO ] Redundant transitions in 25 ms returned [18]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 74 rows 29 cols
[2023-03-12 16:05:12] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 16:05:12] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/29 places, 74/75 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 27 transition count 72
Applied a total of 2 rules in 1 ms. Remains 27 /29 variables (removed 2) and now considering 72/74 (removed 2) transitions.
// Phase 1: matrix 72 rows 27 cols
[2023-03-12 16:05:12] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 16:05:12] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-12 16:05:12] [INFO ] Invariant cache hit.
[2023-03-12 16:05:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:05:12] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/29 places, 72/75 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 378 ms. Remains : 27/29 places, 72/75 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 56 steps, including 7 resets, run visited all 1 properties in 1 ms. (steps per millisecond=56 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15 reset in 44 ms.
Product exploration explored 100000 steps with 16 reset in 48 ms.
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 72/72 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 0 with 1 rules applied. Total rules applied 1 place count 27 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 26 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 25 transition count 67
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 25 transition count 67
Applied a total of 4 rules in 2 ms. Remains 25 /27 variables (removed 2) and now considering 67/72 (removed 5) transitions.
// Phase 1: matrix 67 rows 25 cols
[2023-03-12 16:05:13] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 16:05:13] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-12 16:05:13] [INFO ] Invariant cache hit.
[2023-03-12 16:05:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:05:13] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-12 16:05:13] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-12 16:05:13] [INFO ] Invariant cache hit.
[2023-03-12 16:05:13] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/27 places, 67/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 280 ms. Remains : 25/27 places, 67/72 transitions.
Treatment of property AutonomousCar-PT-03b-LTLFireability-05 finished in 2555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((G(p1)||G(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-12 16:05:13] [INFO ] Flatten gal took : 33 ms
[2023-03-12 16:05:13] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 16:05:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 160 places, 207 transitions and 703 arcs took 2 ms.
Total runtime 46771 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2231/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2231/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2231/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2231/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2231/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2231/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutonomousCar-PT-03b-LTLFireability-01
Could not compute solution for formula : AutonomousCar-PT-03b-LTLFireability-03
Could not compute solution for formula : AutonomousCar-PT-03b-LTLFireability-05
Could not compute solution for formula : AutonomousCar-PT-03b-LTLFireability-08
Could not compute solution for formula : AutonomousCar-PT-03b-LTLFireability-09
Could not compute solution for formula : AutonomousCar-PT-03b-LTLFireability-14

BK_STOP 1678637115245

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name AutonomousCar-PT-03b-LTLFireability-01
ltl formula formula --ltl=/tmp/2231/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 160 places, 207 transitions and 703 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2231/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2231/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2231/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2231/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name AutonomousCar-PT-03b-LTLFireability-03
ltl formula formula --ltl=/tmp/2231/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 160 places, 207 transitions and 703 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2231/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2231/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2231/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2231/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name AutonomousCar-PT-03b-LTLFireability-05
ltl formula formula --ltl=/tmp/2231/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 160 places, 207 transitions and 703 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2231/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2231/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2231/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2231/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
ltl formula name AutonomousCar-PT-03b-LTLFireability-08
ltl formula formula --ltl=/tmp/2231/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 160 places, 207 transitions and 703 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.000 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2231/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2231/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2231/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2231/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x563ffc7b43f4]
1: pnml2lts-mc(+0xa2496) [0x563ffc7b4496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fe18a2bf140]
3: pnml2lts-mc(+0x405be5) [0x563ffcb17be5]
4: pnml2lts-mc(+0x16b3f9) [0x563ffc87d3f9]
5: pnml2lts-mc(+0x164ac4) [0x563ffc876ac4]
6: pnml2lts-mc(+0x272e0a) [0x563ffc984e0a]
7: pnml2lts-mc(+0xb61f0) [0x563ffc7c81f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fe18a1124d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fe18a11267a]
10: pnml2lts-mc(+0xa1581) [0x563ffc7b3581]
11: pnml2lts-mc(+0xa1910) [0x563ffc7b3910]
12: pnml2lts-mc(+0xa32a2) [0x563ffc7b52a2]
13: pnml2lts-mc(+0xa50f4) [0x563ffc7b70f4]
14: pnml2lts-mc(+0xa516b) [0x563ffc7b716b]
15: pnml2lts-mc(+0x3f34b3) [0x563ffcb054b3]
16: pnml2lts-mc(+0x7c63d) [0x563ffc78e63d]
17: pnml2lts-mc(+0x67d86) [0x563ffc779d86]
18: pnml2lts-mc(+0x60a8a) [0x563ffc772a8a]
19: pnml2lts-mc(+0x5eb15) [0x563ffc770b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fe18a0fad0a]
21: pnml2lts-mc(+0x6075e) [0x563ffc77275e]
ltl formula name AutonomousCar-PT-03b-LTLFireability-09
ltl formula formula --ltl=/tmp/2231/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 160 places, 207 transitions and 703 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2231/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2231/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2231/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2231/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
ltl formula name AutonomousCar-PT-03b-LTLFireability-14
ltl formula formula --ltl=/tmp/2231/ltl_5_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 160 places, 207 transitions and 703 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2231/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2231/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2231/ltl_5_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.000 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2231/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55e5513303f4]
1: pnml2lts-mc(+0xa2496) [0x55e551330496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f4907949140]
3: pnml2lts-mc(+0x405be5) [0x55e551693be5]
4: pnml2lts-mc(+0x16b3f9) [0x55e5513f93f9]
5: pnml2lts-mc(+0x164ac4) [0x55e5513f2ac4]
6: pnml2lts-mc(+0x272e0a) [0x55e551500e0a]
7: pnml2lts-mc(+0xb61f0) [0x55e5513441f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f490779c4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f490779c67a]
10: pnml2lts-mc(+0xa1581) [0x55e55132f581]
11: pnml2lts-mc(+0xa1910) [0x55e55132f910]
12: pnml2lts-mc(+0xa32a2) [0x55e5513312a2]
13: pnml2lts-mc(+0xa50f4) [0x55e5513330f4]
14: pnml2lts-mc(+0xa516b) [0x55e55133316b]
15: pnml2lts-mc(+0x3f34b3) [0x55e5516814b3]
16: pnml2lts-mc(+0x7c63d) [0x55e55130a63d]
17: pnml2lts-mc(+0x67d86) [0x55e5512f5d86]
18: pnml2lts-mc(+0x60a8a) [0x55e5512eea8a]
19: pnml2lts-mc(+0x5eb15) [0x55e5512ecb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f4907784d0a]
21: pnml2lts-mc(+0x6075e) [0x55e5512ee75e]

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-03b, 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 r009-oct2-167813598100572"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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