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.r007-oct2-167813595700564.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 lolaxred
Input is AutonomousCar-PT-03a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595700564
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 12K Feb 25 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K 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 42K 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-03a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678351436956

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-03a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 08:43:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 08:43:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:43:59] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2023-03-09 08:43:59] [INFO ] Transformed 41 places.
[2023-03-09 08:43:59] [INFO ] Transformed 121 transitions.
[2023-03-09 08:43:59] [INFO ] Found NUPN structural information;
[2023-03-09 08:43:59] [INFO ] Parsed PT model containing 41 places and 121 transitions and 745 arcs in 103 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA AutonomousCar-PT-03a-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 76/76 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 40 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 40 transition count 75
Applied a total of 2 rules in 43 ms. Remains 40 /41 variables (removed 1) and now considering 75/76 (removed 1) transitions.
// Phase 1: matrix 75 rows 40 cols
[2023-03-09 08:43:59] [INFO ] Computed 7 place invariants in 6 ms
[2023-03-09 08:43:59] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-09 08:43:59] [INFO ] Invariant cache hit.
[2023-03-09 08:44:00] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-09 08:44:00] [INFO ] Implicit Places using invariants and state equation in 259 ms returned [36, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 521 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 38/41 places, 75/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 568 ms. Remains : 38/41 places, 75/76 transitions.
Support contains 26 out of 38 places after structural reductions.
[2023-03-09 08:44:00] [INFO ] Flatten gal took : 37 ms
[2023-03-09 08:44:00] [INFO ] Flatten gal took : 14 ms
[2023-03-09 08:44:00] [INFO ] Input system was already deterministic with 75 transitions.
Incomplete random walk after 10000 steps, including 567 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 23) seen :21
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 75 rows 38 cols
[2023-03-09 08:44:00] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 08:44:00] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:44:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-09 08:44:00] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-09 08:44:00] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-09 08:44:00] [INFO ] After 9ms SMT Verify possible using 39 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-09 08:44:00] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 08:44:00] [INFO ] After 103ms 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 2 ms.
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 75/75 transitions.
Graph (complete) has 182 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 37 transition count 67
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 32 transition count 67
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 29 transition count 55
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 29 transition count 55
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 26 transition count 52
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 26 transition count 49
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 40 place count 23 transition count 40
Applied a total of 40 rules in 16 ms. Remains 23 /38 variables (removed 15) and now considering 40/75 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 23/38 places, 40/75 transitions.
Incomplete random walk after 10000 steps, including 350 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 299 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 332 steps, run visited all 1 properties in 16 ms. (steps per millisecond=20 )
Probabilistic random walk after 332 steps, saw 157 distinct states, run finished after 17 ms. (steps per millisecond=19 ) properties seen :1
FORMULA AutonomousCar-PT-03a-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 3 stabilizing places and 2 stable transitions
FORMULA AutonomousCar-PT-03a-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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))'
Support contains 1 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 36 transition count 70
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 32 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 31 transition count 69
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 31 transition count 68
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 30 transition count 68
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 16 place count 27 transition count 56
Iterating global reduction 3 with 3 rules applied. Total rules applied 19 place count 27 transition count 56
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 3 with 4 rules applied. Total rules applied 23 place count 25 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 24 transition count 54
Applied a total of 25 rules in 22 ms. Remains 24 /38 variables (removed 14) and now considering 54/75 (removed 21) transitions.
// Phase 1: matrix 54 rows 24 cols
[2023-03-09 08:44:01] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-09 08:44:01] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-09 08:44:01] [INFO ] Invariant cache hit.
[2023-03-09 08:44:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:44:01] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2023-03-09 08:44:01] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-09 08:44:01] [INFO ] Invariant cache hit.
[2023-03-09 08:44:01] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/38 places, 54/75 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 377 ms. Remains : 24/38 places, 54/75 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 262 ms.
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-03a-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-03a-LTLFireability-00 finished in 1218 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 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 38 transition count 71
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 34 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 33 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 33 transition count 69
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 32 transition count 69
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 15 place count 29 transition count 57
Iterating global reduction 3 with 3 rules applied. Total rules applied 18 place count 29 transition count 57
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 3 with 4 rules applied. Total rules applied 22 place count 27 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 26 transition count 55
Applied a total of 24 rules in 12 ms. Remains 26 /38 variables (removed 12) and now considering 55/75 (removed 20) transitions.
// Phase 1: matrix 55 rows 26 cols
[2023-03-09 08:44:02] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 08:44:02] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-09 08:44:02] [INFO ] Invariant cache hit.
[2023-03-09 08:44:02] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-09 08:44:02] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-03-09 08:44:02] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-09 08:44:02] [INFO ] Invariant cache hit.
[2023-03-09 08:44:02] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/38 places, 55/75 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 313 ms. Remains : 26/38 places, 55/75 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-02 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:(OR (NEQ s1 1) (NEQ s5 1) (NEQ s14 1) (NEQ s22 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 138 ms.
Product exploration explored 100000 steps with 10 reset in 103 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 191 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 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 271 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 165 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 55/55 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2023-03-09 08:44:04] [INFO ] Invariant cache hit.
[2023-03-09 08:44:04] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-09 08:44:04] [INFO ] Invariant cache hit.
[2023-03-09 08:44:04] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-09 08:44:04] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2023-03-09 08:44:04] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-09 08:44:04] [INFO ] Invariant cache hit.
[2023-03-09 08:44:04] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 527 ms. Remains : 26/26 places, 55/55 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 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 84 ms :[(NOT p0), (NOT p0)]
Finished random walk after 69 steps, including 7 resets, run visited all 1 properties in 2 ms. (steps per millisecond=34 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 179 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 130 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 148 ms.
Product exploration explored 100000 steps with 13 reset in 67 ms.
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 55/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2023-03-09 08:44:05] [INFO ] Invariant cache hit.
[2023-03-09 08:44:05] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-09 08:44:05] [INFO ] Invariant cache hit.
[2023-03-09 08:44:05] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-09 08:44:05] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-09 08:44:05] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-09 08:44:05] [INFO ] Invariant cache hit.
[2023-03-09 08:44:06] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 363 ms. Remains : 26/26 places, 55/55 transitions.
Treatment of property AutonomousCar-PT-03a-LTLFireability-02 finished in 3574 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)||G(F((!p1 U (p2||G(!p1))))))))'
Support contains 8 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 38 transition count 71
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 34 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 34 transition count 70
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 10 place count 33 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 32 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 32 transition count 66
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 14 place count 31 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 16 place count 30 transition count 65
Applied a total of 16 rules in 8 ms. Remains 30 /38 variables (removed 8) and now considering 65/75 (removed 10) transitions.
// Phase 1: matrix 65 rows 30 cols
[2023-03-09 08:44:06] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 08:44:06] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-09 08:44:06] [INFO ] Invariant cache hit.
[2023-03-09 08:44:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:44:06] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-09 08:44:06] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-09 08:44:06] [INFO ] Invariant cache hit.
[2023-03-09 08:44:06] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/38 places, 65/75 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 194 ms. Remains : 30/38 places, 65/75 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s1 1) (EQ s5 1) (EQ s22 1) (EQ s26 1))) (NOT (AND (EQ s1 1) (EQ s2 1) (EQ s16 1) (EQ s26 1)))), p1:(AND (EQ s1 1) (EQ s2 1) (EQ s16 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4 reset in 185 ms.
Product exploration explored 100000 steps with 22 reset in 106 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 424 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 772 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 147 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 08:44:07] [INFO ] Invariant cache hit.
[2023-03-09 08:44:07] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 08:44:07] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-09 08:44:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 08:44:07] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-09 08:44:07] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:44:07] [INFO ] After 20ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-09 08:44:07] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 08:44:07] [INFO ] After 141ms 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 1 ms.
Support contains 8 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 65/65 transitions.
Graph (complete) has 174 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 29 transition count 62
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 29 transition count 60
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 27 transition count 54
Applied a total of 13 rules in 19 ms. Remains 27 /30 variables (removed 3) and now considering 54/65 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 27/30 places, 54/65 transitions.
Finished random walk after 9133 steps, including 443 resets, run visited all 1 properties in 26 ms. (steps per millisecond=351 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 10 factoid took 682 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 95 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 6 out of 30 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 : 30/30 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-09 08:44:08] [INFO ] Invariant cache hit.
[2023-03-09 08:44:08] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-09 08:44:08] [INFO ] Invariant cache hit.
[2023-03-09 08:44:08] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:44:08] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-09 08:44:08] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-09 08:44:08] [INFO ] Invariant cache hit.
[2023-03-09 08:44:08] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 250 ms. Remains : 30/30 places, 65/65 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 222 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Finished random walk after 781 steps, including 61 resets, run visited all 2 properties in 15 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 356 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 100 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 69 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 6 reset in 43 ms.
Product exploration explored 100000 steps with 0 reset in 49 ms.
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 65/65 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 64
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 64
Applied a total of 2 rules in 3 ms. Remains 29 /30 variables (removed 1) and now considering 64/65 (removed 1) transitions.
// Phase 1: matrix 64 rows 29 cols
[2023-03-09 08:44:09] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 08:44:10] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-09 08:44:10] [INFO ] Invariant cache hit.
[2023-03-09 08:44:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:44:10] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2023-03-09 08:44:10] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-09 08:44:10] [INFO ] Invariant cache hit.
[2023-03-09 08:44:10] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/30 places, 64/65 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 330 ms. Remains : 29/30 places, 64/65 transitions.
Treatment of property AutonomousCar-PT-03a-LTLFireability-04 finished in 4244 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)&&(X(F(p1))||G(p2))))'
Support contains 9 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 36 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 36 transition count 67
Applied a total of 4 rules in 1 ms. Remains 36 /38 variables (removed 2) and now considering 67/75 (removed 8) transitions.
// Phase 1: matrix 67 rows 36 cols
[2023-03-09 08:44:10] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 08:44:10] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-09 08:44:10] [INFO ] Invariant cache hit.
[2023-03-09 08:44:10] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-09 08:44:10] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-09 08:44:10] [INFO ] Invariant cache hit.
[2023-03-09 08:44:10] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/38 places, 67/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 36/38 places, 67/75 transitions.
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (OR (EQ s11 1) (AND (EQ s1 1) (EQ s4 1) (EQ s31 1) (EQ s34 1))) (EQ s1 1) (EQ s5 1) (EQ s15 1) (EQ s31 1)), p0:(AND (EQ s1 1) (EQ s6 1) (EQ s17 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][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-03a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-05 finished in 536 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 (F(G(!p0))||(X(!p1) U ((X(!p1)&&G(p2))||X(G(!p1)))))))'
Support contains 7 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 37 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 37 transition count 71
Applied a total of 2 rules in 1 ms. Remains 37 /38 variables (removed 1) and now considering 71/75 (removed 4) transitions.
// Phase 1: matrix 71 rows 37 cols
[2023-03-09 08:44:10] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 08:44:10] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-09 08:44:10] [INFO ] Invariant cache hit.
[2023-03-09 08:44:11] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 08:44:11] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-03-09 08:44:11] [INFO ] Invariant cache hit.
[2023-03-09 08:44:11] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 37/38 places, 71/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 252 ms. Remains : 37/38 places, 71/75 transitions.
Stuttering acceptance computed with spot in 339 ms :[(AND p1 p0), (AND p0 p1), (AND p1 p0 (NOT p2)), (AND p0 p1), (AND p0 p1), (AND p1 p0 (NOT p2)), p0, (AND p0 p1 (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1, 2} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={2} source=1 dest: 2}, { cond=(AND p0 p2 p1), acceptance={0, 2} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1, 2} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={2} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={0, 2} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 p1), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1, 2} source=3 dest: 4}, { cond=(AND p0 p2 p1), acceptance={0, 2} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 p2 p1), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1, 2} source=4 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 p2 p1), acceptance={0, 2} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1, 2} source=5 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p2 p1), acceptance={0, 2} source=5 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={1, 2} source=6 dest: 6}, { cond=p0, acceptance={0, 1, 2} source=6 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 6}, { cond=(AND p2 p1), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 8}]], initial=4, aps=[p1:(AND (EQ s1 1) (EQ s6 1) (EQ s11 1) (EQ s32 1)), p0:(AND (EQ s1 1) (EQ s5 1) (EQ s24 1) (EQ s32 1)), p2:(NEQ s22 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7464 reset in 119 ms.
Product exploration explored 100000 steps with 33483 reset in 246 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 32 factoid took 2397 ms. Reduced automaton from 9 states, 49 edges and 3 AP (stutter sensitive) to 7 states, 27 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 440 ms :[(AND p1 p0), (AND p0 p1), (AND p1 p0 (NOT p2)), (AND p1 p0 (NOT p2)), p0, (AND p0 p1 (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 554 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 08:44:14] [INFO ] Invariant cache hit.
[2023-03-09 08:44:14] [INFO ] [Real]Absence check using 5 positive place invariants in 0 ms returned sat
[2023-03-09 08:44:14] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-09 08:44:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 19 ms returned sat
[2023-03-09 08:44:15] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p1))), (G (NOT (AND p0 p2 p1))), (G (NOT (AND p0 (NOT p2) p1))), (G (NOT (AND p0 (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p2 p1)), (F (NOT p2)), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (AND p0 p2 (NOT p1))), (F (AND p2 p1)), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F p1), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p2) p1)), (F p0)]
Knowledge based reduction with 35 factoid took 2480 ms. Reduced automaton from 7 states, 27 edges and 3 AP (stutter sensitive) to 7 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 505 ms :[false, (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p2), false, false]
Stuttering acceptance computed with spot in 520 ms :[false, (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p2), false, false]
Support contains 7 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 71/71 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2023-03-09 08:44:18] [INFO ] Invariant cache hit.
[2023-03-09 08:44:18] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-09 08:44:18] [INFO ] Invariant cache hit.
[2023-03-09 08:44:18] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 08:44:18] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-09 08:44:18] [INFO ] Invariant cache hit.
[2023-03-09 08:44:18] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 358 ms. Remains : 37/37 places, 71/71 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p1 p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 1667 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter sensitive) to 7 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 470 ms :[false, (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p2), false, false]
Incomplete random walk after 10000 steps, including 577 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 08:44:21] [INFO ] Invariant cache hit.
[2023-03-09 08:44:21] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 08:44:21] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p1 p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (G (NOT (AND p0 p1))), (G (OR p2 (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (NOT p2)), (F (NOT (AND p2 (NOT p0) (NOT p1)))), (F (AND (NOT p2) p1)), (F (NOT (AND p2 (NOT p1)))), (F (AND p2 (NOT p0) p1)), (F (AND p2 p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p2) (NOT p1))), (F (AND p2 p0)), (F p0)]
Knowledge based reduction with 22 factoid took 1981 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter sensitive) to 7 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 462 ms :[(AND p1 p0), (AND p0 p1), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), p0, (AND p0 p1 (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 561 ms :[(AND p1 p0), (AND p0 p1), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), p0, (AND p0 p1 (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 523 ms :[(AND p1 p0), (AND p0 p1), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), p0, (AND p0 p1 (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 14291 reset in 220 ms.
Product exploration explored 100000 steps with 25060 reset in 242 ms.
Applying partial POR strategy [true, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 602 ms :[(AND p1 p0), (AND p0 p1), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), p0, (AND p0 p1 (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Support contains 7 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 71/71 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 37 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 37 transition count 73
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 37 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 37 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 36 transition count 72
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 36 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 36 transition count 75
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 11 rules in 26 ms. Remains 36 /37 variables (removed 1) and now considering 75/71 (removed -4) transitions.
[2023-03-09 08:44:26] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 75 rows 36 cols
[2023-03-09 08:44:26] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 08:44:26] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/37 places, 75/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 36/37 places, 75/71 transitions.
Support contains 7 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 71/71 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 71/71 (removed 0) transitions.
// Phase 1: matrix 71 rows 37 cols
[2023-03-09 08:44:26] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 08:44:26] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-09 08:44:26] [INFO ] Invariant cache hit.
[2023-03-09 08:44:26] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 08:44:26] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2023-03-09 08:44:26] [INFO ] Invariant cache hit.
[2023-03-09 08:44:26] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 387 ms. Remains : 37/37 places, 71/71 transitions.
Treatment of property AutonomousCar-PT-03a-LTLFireability-06 finished in 15886 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 !p1)||G(p2)) U G(p1))))'
Support contains 10 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 37 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 37 transition count 71
Applied a total of 2 rules in 1 ms. Remains 37 /38 variables (removed 1) and now considering 71/75 (removed 4) transitions.
// Phase 1: matrix 71 rows 37 cols
[2023-03-09 08:44:26] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 08:44:26] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-09 08:44:26] [INFO ] Invariant cache hit.
[2023-03-09 08:44:27] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 08:44:27] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2023-03-09 08:44:27] [INFO ] Invariant cache hit.
[2023-03-09 08:44:27] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 37/38 places, 71/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 323 ms. Remains : 37/38 places, 71/75 transitions.
Stuttering acceptance computed with spot in 286 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false, true, (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p1 p0) (AND p1 p2)), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 6}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s5 1) (EQ s16 1) (EQ s32 1)), p0:(AND (EQ s13 1) (EQ s20 1) (EQ s26 1) (EQ s33 1)), p2:(AND (EQ s1 1) (EQ s6 1) (EQ s9 1) (EQ s32 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-07 finished in 644 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(X(G(p0)))))'
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 35 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 35 transition count 63
Applied a total of 6 rules in 2 ms. Remains 35 /38 variables (removed 3) and now considering 63/75 (removed 12) transitions.
// Phase 1: matrix 63 rows 35 cols
[2023-03-09 08:44:27] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 08:44:27] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-09 08:44:27] [INFO ] Invariant cache hit.
[2023-03-09 08:44:27] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-09 08:44:27] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-09 08:44:27] [INFO ] Invariant cache hit.
[2023-03-09 08:44:27] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 35/38 places, 63/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 214 ms. Remains : 35/38 places, 63/75 transitions.
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-09 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s1 0) (EQ s5 0) (EQ s7 0) (EQ s30 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 19 reset in 94 ms.
Product exploration explored 100000 steps with 1 reset in 159 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 218 steps, including 8 resets, run visited all 1 properties in 2 ms. (steps per millisecond=109 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 208 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 292 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-09 08:44:29] [INFO ] Invariant cache hit.
[2023-03-09 08:44:29] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-09 08:44:29] [INFO ] Invariant cache hit.
[2023-03-09 08:44:29] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-09 08:44:29] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-09 08:44:29] [INFO ] Invariant cache hit.
[2023-03-09 08:44:29] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 373 ms. Remains : 35/35 places, 63/63 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 806 steps, including 36 resets, run visited all 1 properties in 3 ms. (steps per millisecond=268 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 334 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 284 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 94 steps with 6 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-09 finished in 3807 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(G(p0)))'
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 36 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 36 transition count 67
Applied a total of 4 rules in 2 ms. Remains 36 /38 variables (removed 2) and now considering 67/75 (removed 8) transitions.
// Phase 1: matrix 67 rows 36 cols
[2023-03-09 08:44:31] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-09 08:44:31] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-09 08:44:31] [INFO ] Invariant cache hit.
[2023-03-09 08:44:31] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-09 08:44:31] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-09 08:44:31] [INFO ] Invariant cache hit.
[2023-03-09 08:44:31] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/38 places, 67/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 300 ms. Remains : 36/38 places, 67/75 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s1 1) (NEQ s2 1) (NEQ s9 1) (NEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8 reset in 71 ms.
Product exploration explored 100000 steps with 0 reset in 67 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 261 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 172 steps, including 9 resets, run visited all 1 properties in 2 ms. (steps per millisecond=86 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 227 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 36 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 67/67 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2023-03-09 08:44:32] [INFO ] Invariant cache hit.
[2023-03-09 08:44:32] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-09 08:44:32] [INFO ] Invariant cache hit.
[2023-03-09 08:44:32] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-09 08:44:32] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-09 08:44:32] [INFO ] Invariant cache hit.
[2023-03-09 08:44:32] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 277 ms. Remains : 36/36 places, 67/67 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 317 steps, including 19 resets, run visited all 1 properties in 2 ms. (steps per millisecond=158 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 275 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3 reset in 100 ms.
Product exploration explored 100000 steps with 3 reset in 58 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 67/67 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 36 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 36 transition count 69
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 36 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 36 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 35 transition count 68
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 35 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 7 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 35 transition count 71
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 10 rules in 27 ms. Remains 35 /36 variables (removed 1) and now considering 71/67 (removed -4) transitions.
[2023-03-09 08:44:34] [INFO ] Redundant transitions in 59 ms returned []
// Phase 1: matrix 71 rows 35 cols
[2023-03-09 08:44:34] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 08:44:34] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/36 places, 71/67 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 235 ms. Remains : 35/36 places, 71/67 transitions.
Support contains 4 out of 36 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 67/67 transitions.
Applied a total of 0 rules in 0 ms. Remains 36 /36 variables (removed 0) and now considering 67/67 (removed 0) transitions.
// Phase 1: matrix 67 rows 36 cols
[2023-03-09 08:44:34] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 08:44:34] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-09 08:44:34] [INFO ] Invariant cache hit.
[2023-03-09 08:44:34] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-09 08:44:34] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-09 08:44:34] [INFO ] Invariant cache hit.
[2023-03-09 08:44:34] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 36/36 places, 67/67 transitions.
Treatment of property AutonomousCar-PT-03a-LTLFireability-10 finished in 3796 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((p0 U p1))))'
Support contains 5 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 36 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 36 transition count 67
Applied a total of 4 rules in 1 ms. Remains 36 /38 variables (removed 2) and now considering 67/75 (removed 8) transitions.
// Phase 1: matrix 67 rows 36 cols
[2023-03-09 08:44:34] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 08:44:35] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-09 08:44:35] [INFO ] Invariant cache hit.
[2023-03-09 08:44:35] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-09 08:44:35] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-09 08:44:35] [INFO ] Invariant cache hit.
[2023-03-09 08:44:35] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/38 places, 67/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 36/38 places, 67/75 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(AND (EQ s1 1) (EQ s5 1) (EQ s15 1) (EQ s31 1)), p0:(NEQ s30 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 4 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-12 finished in 314 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)||G(p1))))'
Support contains 5 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 38 transition count 72
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 35 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 34 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 34 transition count 70
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 33 transition count 70
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 13 place count 30 transition count 58
Iterating global reduction 3 with 3 rules applied. Total rules applied 16 place count 30 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 3 with 4 rules applied. Total rules applied 20 place count 28 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 27 transition count 56
Applied a total of 22 rules in 29 ms. Remains 27 /38 variables (removed 11) and now considering 56/75 (removed 19) transitions.
// Phase 1: matrix 56 rows 27 cols
[2023-03-09 08:44:35] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 08:44:35] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-09 08:44:35] [INFO ] Invariant cache hit.
[2023-03-09 08:44:35] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-09 08:44:35] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-09 08:44:35] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-09 08:44:35] [INFO ] Invariant cache hit.
[2023-03-09 08:44:35] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/38 places, 56/75 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 365 ms. Remains : 27/38 places, 56/75 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s4 1) (EQ s14 1) (EQ s23 1)), p1:(EQ s17 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-15 finished in 477 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' '!(F((G(p0)||G(F((!p1 U (p2||G(!p1))))))))'
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 (F(G(!p0))||(X(!p1) U ((X(!p1)&&G(p2))||X(G(!p1)))))))'
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(G(p0)))'
Found a Lengthening insensitive property : AutonomousCar-PT-03a-LTLFireability-10
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 38 transition count 70
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 33 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 33 transition count 69
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 12 place count 32 transition count 69
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 30 transition count 61
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 30 transition count 61
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 18 place count 29 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 20 place count 28 transition count 60
Applied a total of 20 rules in 11 ms. Remains 28 /38 variables (removed 10) and now considering 60/75 (removed 15) transitions.
// Phase 1: matrix 60 rows 28 cols
[2023-03-09 08:44:36] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 08:44:36] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-09 08:44:36] [INFO ] Invariant cache hit.
[2023-03-09 08:44:36] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-09 08:44:36] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-09 08:44:36] [INFO ] Invariant cache hit.
[2023-03-09 08:44:36] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 28/38 places, 60/75 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 268 ms. Remains : 28/38 places, 60/75 transitions.
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s1 1) (NEQ s2 1) (NEQ s8 1) (NEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1 reset in 123 ms.
Product exploration explored 100000 steps with 11 reset in 58 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 265 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 209 steps, including 16 resets, run visited all 1 properties in 2 ms. (steps per millisecond=104 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 262 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-09 08:44:37] [INFO ] Invariant cache hit.
[2023-03-09 08:44:37] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-09 08:44:37] [INFO ] Invariant cache hit.
[2023-03-09 08:44:38] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-09 08:44:38] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2023-03-09 08:44:38] [INFO ] Invariant cache hit.
[2023-03-09 08:44:38] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 274 ms. Remains : 28/28 places, 60/60 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 194 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 183 steps, including 14 resets, run visited all 1 properties in 2 ms. (steps per millisecond=91 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 213 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3 reset in 112 ms.
Entered a terminal (fully accepting) state of product in 47 steps with 3 reset in 1 ms.
Treatment of property AutonomousCar-PT-03a-LTLFireability-10 finished in 3058 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-10 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-09 08:44:39] [INFO ] Flatten gal took : 20 ms
[2023-03-09 08:44:39] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2023-03-09 08:44:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 38 places, 75 transitions and 430 arcs took 3 ms.
Total runtime 39945 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutonomousCar-PT-03a
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
LTLFireability

FORMULA AutonomousCar-PT-03a-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-03a-LTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-03a-LTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-03a-LTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678351481068

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 10 (type EXCL) for 9 AutonomousCar-PT-03a-LTLFireability-10
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for AutonomousCar-PT-03a-LTLFireability-10
lola: result : false
lola: markings : 192
lola: fired transitions : 464
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 AutonomousCar-PT-03a-LTLFireability-06
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for AutonomousCar-PT-03a-LTLFireability-06
lola: result : true
lola: markings : 223799
lola: fired transitions : 1534671
lola: time used : 1.000000
lola: memory pages used : 2
lola: LAUNCH task # 1 (type EXCL) for 0 AutonomousCar-PT-03a-LTLFireability-02
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for AutonomousCar-PT-03a-LTLFireability-02
lola: result : false
lola: markings : 2442
lola: fired transitions : 7418
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 AutonomousCar-PT-03a-LTLFireability-04
lola: time limit : 3598 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for AutonomousCar-PT-03a-LTLFireability-04
lola: result : false
lola: markings : 4000
lola: fired transitions : 12555
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-03a-LTLFireability-02: LTL false LTL model checker
AutonomousCar-PT-03a-LTLFireability-04: LTL false LTL model checker
AutonomousCar-PT-03a-LTLFireability-06: LTL true LTL model checker
AutonomousCar-PT-03a-LTLFireability-10: LTL false LTL model checker


Time elapsed: 2 secs. Pages in use: 2

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-03a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is AutonomousCar-PT-03a, 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 r007-oct2-167813595700564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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