Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 49K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716305993420

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-02b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 15:39:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 15:39:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:39:56] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-05-21 15:39:56] [INFO ] Transformed 155 places.
[2024-05-21 15:39:56] [INFO ] Transformed 194 transitions.
[2024-05-21 15:39:56] [INFO ] Found NUPN structural information;
[2024-05-21 15:39:56] [INFO ] Parsed PT model containing 155 places and 194 transitions and 620 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-02b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 194/194 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 136 transition count 175
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 136 transition count 175
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 54 place count 136 transition count 159
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 132 transition count 155
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 132 transition count 155
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 131 transition count 154
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 131 transition count 154
Applied a total of 64 rules in 53 ms. Remains 131 /155 variables (removed 24) and now considering 154/194 (removed 40) transitions.
// Phase 1: matrix 154 rows 131 cols
[2024-05-21 15:39:56] [INFO ] Computed 7 invariants in 20 ms
[2024-05-21 15:39:56] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-21 15:39:56] [INFO ] Invariant cache hit.
[2024-05-21 15:39:56] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2024-05-21 15:39:56] [INFO ] Invariant cache hit.
[2024-05-21 15:39:57] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/155 places, 154/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 739 ms. Remains : 131/155 places, 154/194 transitions.
Support contains 31 out of 131 places after structural reductions.
[2024-05-21 15:39:57] [INFO ] Flatten gal took : 51 ms
[2024-05-21 15:39:57] [INFO ] Flatten gal took : 20 ms
[2024-05-21 15:39:57] [INFO ] Input system was already deterministic with 154 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 676 ms. (steps per millisecond=14 ) properties (out of 28) seen :18
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-21 15:39:58] [INFO ] Invariant cache hit.
[2024-05-21 15:39:58] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 15:39:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-21 15:39:58] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA AutonomousCar-PT-02b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 32 stabilizing places and 33 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((F(p0) U p1) U (p2 U p3))))))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 154/154 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 126 transition count 149
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 126 transition count 149
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 125 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 125 transition count 148
Applied a total of 12 rules in 25 ms. Remains 125 /131 variables (removed 6) and now considering 148/154 (removed 6) transitions.
// Phase 1: matrix 148 rows 125 cols
[2024-05-21 15:39:58] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 15:39:59] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 15:39:59] [INFO ] Invariant cache hit.
[2024-05-21 15:39:59] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-05-21 15:39:59] [INFO ] Invariant cache hit.
[2024-05-21 15:39:59] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/131 places, 148/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 426 ms. Remains : 125/131 places, 148/154 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 507 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p0), (NOT p1), (NOT p3), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(NOT p3), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(NOT p3), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(EQ s55 1), p2:(EQ s61 1), p1:(OR (EQ s55 1) (AND (EQ s1 1) (EQ s56 1))), p0:(EQ s56 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, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 54 steps with 0 reset in 3 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-00 finished in 1023 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0||X((p1||X(p0)))))&&(G(p0) U G(p2)))))'
Support contains 6 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 154/154 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 126 transition count 149
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 126 transition count 149
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 125 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 125 transition count 148
Applied a total of 12 rules in 14 ms. Remains 125 /131 variables (removed 6) and now considering 148/154 (removed 6) transitions.
[2024-05-21 15:39:59] [INFO ] Invariant cache hit.
[2024-05-21 15:39:59] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 15:39:59] [INFO ] Invariant cache hit.
[2024-05-21 15:40:00] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-21 15:40:00] [INFO ] Invariant cache hit.
[2024-05-21 15:40:00] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/131 places, 148/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 331 ms. Remains : 125/131 places, 148/154 transitions.
Stuttering acceptance computed with spot in 645 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) p2 (NOT p1)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(OR p0 p2), acceptance={1, 2} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0, 2} source=0 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=0 dest: 4}, { cond=(AND p0 p2), acceptance={0, 2} source=0 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0, 1, 2} source=0 dest: 5}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=1 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1, 2} source=1 dest: 7}, { cond=(OR (AND p0 (NOT p1)) (AND p2 (NOT p1))), acceptance={1, 2} source=1 dest: 8}, { cond=(AND p2 (NOT p1)), acceptance={0, 2} source=1 dest: 9}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=1 dest: 9}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=2 dest: 1}, { cond=true, acceptance={1, 2} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1, 2} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0, 2} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=3 dest: 4}, { cond=(AND p0 p2), acceptance={0, 2} source=3 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0, 1, 2} source=3 dest: 5}, { cond=(AND p0 p2), acceptance={2} source=3 dest: 10}], [{ cond=(AND (NOT p0) p2), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={1, 2} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={1} source=4 dest: 11}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0, 2} source=5 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={0, 2} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0, 1, 2} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0, 1, 2} source=6 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={1, 2} source=6 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0, 2} source=6 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=7 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1, 2} source=7 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1, 2} source=7 dest: 8}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 2} source=7 dest: 9}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=8 dest: 1}, { cond=(NOT p0), acceptance={1, 2} source=8 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=9 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0, 2} source=9 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=10 dest: 1}, { cond=(NOT p2), acceptance={1, 2} source=10 dest: 2}, { cond=p2, acceptance={2} source=10 dest: 10}, { cond=(AND (NOT p0) p2), acceptance={0, 2} source=10 dest: 12}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=11 dest: 1}, { cond=(NOT p0), acceptance={1, 2} source=11 dest: 2}, { cond=p0, acceptance={1} source=11 dest: 11}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=12 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=12 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1, 2} source=12 dest: 8}, { cond=(AND p2 (NOT p1)), acceptance={0, 2} source=12 dest: 9}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=12 dest: 9}]], initial=0, aps=[p0:(EQ s42 1), p2:(AND (EQ s4 1) (EQ s6 1) (EQ s35 1) (EQ s91 1)), p1:(EQ s41 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, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 129 steps with 1 reset in 3 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-01 finished in 1011 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p1)&&G(p2))))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 154/154 transitions.
Graph (trivial) has 121 edges and 131 vertex of which 4 / 131 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 128 transition count 99
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 68 rules applied. Total rules applied 121 place count 76 transition count 83
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 131 place count 67 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 132 place count 66 transition count 82
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 132 place count 66 transition count 75
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 146 place count 59 transition count 75
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 148 place count 57 transition count 73
Iterating global reduction 4 with 2 rules applied. Total rules applied 150 place count 57 transition count 73
Performed 23 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 196 place count 34 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 197 place count 34 transition count 48
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 202 place count 29 transition count 37
Iterating global reduction 5 with 5 rules applied. Total rules applied 207 place count 29 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 209 place count 29 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 213 place count 27 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 217 place count 25 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 218 place count 24 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 219 place count 23 transition count 38
Applied a total of 219 rules in 38 ms. Remains 23 /131 variables (removed 108) and now considering 38/154 (removed 116) transitions.
// Phase 1: matrix 38 rows 23 cols
[2024-05-21 15:40:00] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 15:40:00] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 15:40:00] [INFO ] Invariant cache hit.
[2024-05-21 15:40:01] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-21 15:40:01] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 97 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/131 places, 38/154 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 137 ms. Remains : 22/131 places, 38/154 transitions.
Stuttering acceptance computed with spot in 229 ms :[true, (OR (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=4, aps=[p2:(EQ s17 0), p1:(AND (EQ s17 0) (EQ s16 0)), p0:(EQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 2 reset in 267 ms.
Product exploration explored 100000 steps with 0 reset in 113 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Detected a total of 3/22 stabilizing places and 4/38 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p1 p2))), (X (AND p0 p2)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), true, (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
Knowledge based reduction with 20 factoid took 1615 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p2)]
Finished random walk after 57 steps, including 6 resets, run visited all 1 properties in 1 ms. (steps per millisecond=57 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p1 p2))), (X (AND p0 p2)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), true, (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (NOT p2))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 20 factoid took 1589 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-02b-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-02b-LTLFireability-03 finished in 4047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U (p1||G(p0)))||(p2&&X(p3)))))'
Support contains 7 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 154/154 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 126 transition count 149
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 126 transition count 149
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 125 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 125 transition count 148
Applied a total of 12 rules in 8 ms. Remains 125 /131 variables (removed 6) and now considering 148/154 (removed 6) transitions.
// Phase 1: matrix 148 rows 125 cols
[2024-05-21 15:40:04] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 15:40:05] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 15:40:05] [INFO ] Invariant cache hit.
[2024-05-21 15:40:05] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-05-21 15:40:05] [INFO ] Invariant cache hit.
[2024-05-21 15:40:05] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/131 places, 148/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 377 ms. Remains : 125/131 places, 148/154 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p1) (NOT p0)) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p3), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0) p3), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1) p0 p3), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0) p3), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1) p0 p3), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p1) p0 (NOT p3))), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(EQ s106 0), p1:(AND (NOT (OR (AND (EQ s4 1) (EQ s6 1) (EQ s64 1) (EQ s91 1)) (EQ s79 1))) (NEQ s29 1)), p0:(NEQ s29 1), p3:(EQ s29 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 128 steps with 2 reset in 2 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-04 finished in 613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 154/154 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 127 transition count 150
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 127 transition count 150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 126 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 126 transition count 149
Applied a total of 10 rules in 12 ms. Remains 126 /131 variables (removed 5) and now considering 149/154 (removed 5) transitions.
// Phase 1: matrix 149 rows 126 cols
[2024-05-21 15:40:05] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 15:40:05] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 15:40:05] [INFO ] Invariant cache hit.
[2024-05-21 15:40:05] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2024-05-21 15:40:05] [INFO ] Invariant cache hit.
[2024-05-21 15:40:05] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/131 places, 149/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 358 ms. Remains : 126/131 places, 149/154 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s40 0), p0:(EQ s34 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 156 ms.
Product exploration explored 100000 steps with 5 reset in 175 ms.
Computed a total of 29 stabilizing places and 30 stable transitions
Computed a total of 29 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-21 15:40:07] [INFO ] Invariant cache hit.
[2024-05-21 15:40:07] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 15:40:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-21 15:40:07] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 322 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 149/149 transitions.
Graph (trivial) has 115 edges and 126 vertex of which 4 / 126 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 123 transition count 100
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 61 rules applied. Total rules applied 108 place count 77 transition count 85
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 117 place count 68 transition count 85
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 117 place count 68 transition count 77
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 133 place count 60 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 134 place count 59 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 59 transition count 76
Performed 25 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 185 place count 34 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 186 place count 34 transition count 49
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 190 place count 30 transition count 41
Iterating global reduction 4 with 4 rules applied. Total rules applied 194 place count 30 transition count 41
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 196 place count 30 transition count 39
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 200 place count 28 transition count 37
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 204 place count 26 transition count 46
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 206 place count 24 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 207 place count 23 transition count 44
Applied a total of 207 rules in 29 ms. Remains 23 /126 variables (removed 103) and now considering 44/149 (removed 105) transitions.
// Phase 1: matrix 44 rows 23 cols
[2024-05-21 15:40:07] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 15:40:07] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 15:40:07] [INFO ] Invariant cache hit.
[2024-05-21 15:40:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:40:07] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [18, 22]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 100 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/126 places, 44/149 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 43
Applied a total of 2 rules in 6 ms. Remains 20 /21 variables (removed 1) and now considering 43/44 (removed 1) transitions.
// Phase 1: matrix 43 rows 20 cols
[2024-05-21 15:40:07] [INFO ] Computed 3 invariants in 5 ms
[2024-05-21 15:40:07] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 15:40:07] [INFO ] Invariant cache hit.
[2024-05-21 15:40:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:40:07] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/126 places, 43/149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 249 ms. Remains : 20/126 places, 43/149 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 206 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 1172 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 262 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 15:40:08] [INFO ] Invariant cache hit.
[2024-05-21 15:40:08] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 15:40:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 15:40:08] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 9 factoid took 302 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Entered a terminal (fully accepting) state of product in 35 steps with 6 reset in 1 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-05 finished in 3385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 154/154 transitions.
Graph (trivial) has 120 edges and 131 vertex of which 4 / 131 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 128 transition count 102
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 65 rules applied. Total rules applied 115 place count 79 transition count 86
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 125 place count 70 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 126 place count 69 transition count 85
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 126 place count 69 transition count 76
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 144 place count 60 transition count 76
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 145 place count 59 transition count 75
Iterating global reduction 4 with 1 rules applied. Total rules applied 146 place count 59 transition count 75
Performed 23 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 192 place count 36 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 193 place count 36 transition count 50
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 198 place count 31 transition count 39
Iterating global reduction 5 with 5 rules applied. Total rules applied 203 place count 31 transition count 39
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 205 place count 31 transition count 37
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 209 place count 29 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 213 place count 27 transition count 41
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 215 place count 25 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 216 place count 24 transition count 39
Applied a total of 216 rules in 35 ms. Remains 24 /131 variables (removed 107) and now considering 39/154 (removed 115) transitions.
// Phase 1: matrix 39 rows 24 cols
[2024-05-21 15:40:08] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 15:40:09] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-21 15:40:09] [INFO ] Invariant cache hit.
[2024-05-21 15:40:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 15:40:09] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 92 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/131 places, 39/154 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 130 ms. Remains : 23/131 places, 39/154 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s18 1), p1:(EQ s12 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 18 reset in 125 ms.
Product exploration explored 100000 steps with 39 reset in 127 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Detected a total of 5/23 stabilizing places and 6/39 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 5 factoid took 313 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 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 11 steps, including 1 resets, run visited all 2 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 377 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 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 23 cols
[2024-05-21 15:40:10] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 15:40:10] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 15:40:10] [INFO ] Invariant cache hit.
[2024-05-21 15:40:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 15:40:10] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-21 15:40:10] [INFO ] Redundant transitions in 13 ms returned [13]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 38 rows 23 cols
[2024-05-21 15:40:10] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 15:40:10] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/23 places, 38/39 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 36
Applied a total of 4 rules in 3 ms. Remains 21 /23 variables (removed 2) and now considering 36/38 (removed 2) transitions.
// Phase 1: matrix 36 rows 21 cols
[2024-05-21 15:40:10] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 15:40:10] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 15:40:10] [INFO ] Invariant cache hit.
[2024-05-21 15:40:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 15:40:10] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/23 places, 36/39 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 241 ms. Remains : 21/23 places, 36/39 transitions.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Detected a total of 5/21 stabilizing places and 4/36 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 5 factoid took 294 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 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 386 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 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 60 ms.
Product exploration explored 100000 steps with 6 reset in 289 ms.
Built C files in :
/tmp/ltsmin10396760080940065331
[2024-05-21 15:40:11] [INFO ] Computing symmetric may disable matrix : 36 transitions.
[2024-05-21 15:40:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:40:11] [INFO ] Computing symmetric may enable matrix : 36 transitions.
[2024-05-21 15:40:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:40:11] [INFO ] Computing Do-Not-Accords matrix : 36 transitions.
[2024-05-21 15:40:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:40:11] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10396760080940065331
Running compilation step : cd /tmp/ltsmin10396760080940065331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 500 ms.
Running link step : cd /tmp/ltsmin10396760080940065331;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin10396760080940065331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15017112335825754517.hoa' '--buchi-type=spotba'
LTSmin run took 109 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-02b-LTLFireability-08 finished in 3741 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 154/154 transitions.
Graph (trivial) has 121 edges and 131 vertex of which 4 / 131 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 128 transition count 99
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 67 rules applied. Total rules applied 120 place count 76 transition count 84
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 128 place count 68 transition count 84
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 128 place count 68 transition count 76
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 144 place count 60 transition count 76
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 147 place count 57 transition count 73
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 57 transition count 73
Performed 23 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 196 place count 34 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 197 place count 34 transition count 48
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 202 place count 29 transition count 37
Iterating global reduction 4 with 5 rules applied. Total rules applied 207 place count 29 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 208 place count 29 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 212 place count 27 transition count 34
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 216 place count 25 transition count 43
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 218 place count 23 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 219 place count 22 transition count 41
Applied a total of 219 rules in 26 ms. Remains 22 /131 variables (removed 109) and now considering 41/154 (removed 113) transitions.
// Phase 1: matrix 41 rows 22 cols
[2024-05-21 15:40:12] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 15:40:12] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 15:40:12] [INFO ] Invariant cache hit.
[2024-05-21 15:40:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:40:12] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [17, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 97 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/131 places, 41/154 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 19 transition count 40
Applied a total of 2 rules in 3 ms. Remains 19 /20 variables (removed 1) and now considering 40/41 (removed 1) transitions.
// Phase 1: matrix 40 rows 19 cols
[2024-05-21 15:40:12] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 15:40:12] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-21 15:40:12] [INFO ] Invariant cache hit.
[2024-05-21 15:40:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:40:12] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/131 places, 40/154 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 210 ms. Remains : 19/131 places, 40/154 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s5 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4 reset in 57 ms.
Product exploration explored 100000 steps with 2 reset in 62 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 129 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 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2024-05-21 15:40:13] [INFO ] Invariant cache hit.
[2024-05-21 15:40:13] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 15:40:13] [INFO ] Invariant cache hit.
[2024-05-21 15:40:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:40:13] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-21 15:40:13] [INFO ] Redundant transitions in 14 ms returned [10]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 39 rows 19 cols
[2024-05-21 15:40:13] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 15:40:13] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/19 places, 39/40 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 17 transition count 37
Applied a total of 2 rules in 3 ms. Remains 17 /19 variables (removed 2) and now considering 37/39 (removed 2) transitions.
// Phase 1: matrix 37 rows 17 cols
[2024-05-21 15:40:13] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 15:40:13] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 15:40:13] [INFO ] Invariant cache hit.
[2024-05-21 15:40:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:40:13] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/19 places, 37/40 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 235 ms. Remains : 17/19 places, 37/40 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 142 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 45 ms.
Product exploration explored 100000 steps with 1 reset in 57 ms.
Built C files in :
/tmp/ltsmin3074814617491496749
[2024-05-21 15:40:14] [INFO ] Computing symmetric may disable matrix : 37 transitions.
[2024-05-21 15:40:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:40:14] [INFO ] Computing symmetric may enable matrix : 37 transitions.
[2024-05-21 15:40:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:40:14] [INFO ] Computing Do-Not-Accords matrix : 37 transitions.
[2024-05-21 15:40:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:40:14] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3074814617491496749
Running compilation step : cd /tmp/ltsmin3074814617491496749;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 165 ms.
Running link step : cd /tmp/ltsmin3074814617491496749;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin3074814617491496749;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18201925302131555421.hoa' '--buchi-type=spotba'
LTSmin run took 216 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-02b-LTLFireability-09 finished in 2284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 154/154 transitions.
Graph (trivial) has 118 edges and 131 vertex of which 4 / 131 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 128 transition count 98
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 69 rules applied. Total rules applied 123 place count 75 transition count 82
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 132 place count 66 transition count 82
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 132 place count 66 transition count 75
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 146 place count 59 transition count 75
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 149 place count 56 transition count 72
Iterating global reduction 3 with 3 rules applied. Total rules applied 152 place count 56 transition count 72
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 194 place count 35 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 195 place count 35 transition count 49
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 198 place count 32 transition count 44
Iterating global reduction 4 with 3 rules applied. Total rules applied 201 place count 32 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 203 place count 32 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 207 place count 30 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 211 place count 28 transition count 46
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 213 place count 26 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 214 place count 25 transition count 44
Applied a total of 214 rules in 15 ms. Remains 25 /131 variables (removed 106) and now considering 44/154 (removed 110) transitions.
// Phase 1: matrix 44 rows 25 cols
[2024-05-21 15:40:14] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 15:40:15] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 15:40:15] [INFO ] Invariant cache hit.
[2024-05-21 15:40:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:40:15] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [20, 24]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 99 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/131 places, 44/154 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 43
Applied a total of 2 rules in 2 ms. Remains 22 /23 variables (removed 1) and now considering 43/44 (removed 1) transitions.
// Phase 1: matrix 43 rows 22 cols
[2024-05-21 15:40:15] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 15:40:15] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-21 15:40:15] [INFO ] Invariant cache hit.
[2024-05-21 15:40:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:40:15] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/131 places, 43/154 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 195 ms. Remains : 22/131 places, 43/154 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s11 0) (OR (EQ s6 0) (EQ s12 0) (EQ s18 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2 reset in 86 ms.
Product exploration explored 100000 steps with 1 reset in 129 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 62 steps, including 8 resets, run visited all 1 properties in 1 ms. (steps per millisecond=62 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2024-05-21 15:40:15] [INFO ] Invariant cache hit.
[2024-05-21 15:40:15] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 15:40:15] [INFO ] Invariant cache hit.
[2024-05-21 15:40:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:40:15] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-21 15:40:15] [INFO ] Redundant transitions in 13 ms returned [13]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 42 rows 22 cols
[2024-05-21 15:40:15] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 15:40:15] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/22 places, 42/43 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 40
Applied a total of 2 rules in 2 ms. Remains 20 /22 variables (removed 2) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 20 cols
[2024-05-21 15:40:15] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 15:40:15] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-21 15:40:15] [INFO ] Invariant cache hit.
[2024-05-21 15:40:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:40:15] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/22 places, 40/43 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 217 ms. Remains : 20/22 places, 40/43 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 20 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 40 steps with 4 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-11 finished in 1345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U !p1))))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 154/154 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 127 transition count 150
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 127 transition count 150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 126 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 126 transition count 149
Applied a total of 10 rules in 6 ms. Remains 126 /131 variables (removed 5) and now considering 149/154 (removed 5) transitions.
// Phase 1: matrix 149 rows 126 cols
[2024-05-21 15:40:16] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 15:40:16] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 15:40:16] [INFO ] Invariant cache hit.
[2024-05-21 15:40:16] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-05-21 15:40:16] [INFO ] Invariant cache hit.
[2024-05-21 15:40:16] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/131 places, 149/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 347 ms. Remains : 126/131 places, 149/154 transitions.
Stuttering acceptance computed with spot in 165 ms :[p1, p1, p1, true, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s40 1) (EQ s66 1) (EQ s93 1)), p0:(EQ s47 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]]
Product exploration explored 100000 steps with 33333 reset in 239 ms.
Product exploration explored 100000 steps with 33333 reset in 208 ms.
Computed a total of 29 stabilizing places and 30 stable transitions
Computed a total of 29 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-02b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-02b-LTLFireability-12 finished in 1120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 154/154 transitions.
Graph (trivial) has 121 edges and 131 vertex of which 4 / 131 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 128 transition count 99
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 68 rules applied. Total rules applied 121 place count 76 transition count 83
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 131 place count 67 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 132 place count 66 transition count 82
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 132 place count 66 transition count 74
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 148 place count 58 transition count 74
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 151 place count 55 transition count 71
Iterating global reduction 4 with 3 rules applied. Total rules applied 154 place count 55 transition count 71
Performed 23 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 200 place count 32 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 201 place count 32 transition count 46
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 206 place count 27 transition count 35
Iterating global reduction 5 with 5 rules applied. Total rules applied 211 place count 27 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 213 place count 27 transition count 33
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 6 with 2 rules applied. Total rules applied 215 place count 26 transition count 32
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 219 place count 24 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 221 place count 22 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 222 place count 21 transition count 36
Applied a total of 222 rules in 12 ms. Remains 21 /131 variables (removed 110) and now considering 36/154 (removed 118) transitions.
// Phase 1: matrix 36 rows 21 cols
[2024-05-21 15:40:17] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 15:40:17] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 15:40:17] [INFO ] Invariant cache hit.
[2024-05-21 15:40:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:40:17] [INFO ] Implicit Places using invariants and state equation in 48 ms returned [16, 20]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 87 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/131 places, 36/154 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 19 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 18 transition count 35
Applied a total of 2 rules in 3 ms. Remains 18 /19 variables (removed 1) and now considering 35/36 (removed 1) transitions.
// Phase 1: matrix 35 rows 18 cols
[2024-05-21 15:40:17] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 15:40:17] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 15:40:17] [INFO ] Invariant cache hit.
[2024-05-21 15:40:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:40:17] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/131 places, 35/154 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 181 ms. Remains : 18/131 places, 35/154 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-13 finished in 230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 154/154 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 126 transition count 149
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 126 transition count 149
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 125 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 125 transition count 148
Applied a total of 12 rules in 5 ms. Remains 125 /131 variables (removed 6) and now considering 148/154 (removed 6) transitions.
// Phase 1: matrix 148 rows 125 cols
[2024-05-21 15:40:17] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 15:40:17] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 15:40:17] [INFO ] Invariant cache hit.
[2024-05-21 15:40:17] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-21 15:40:17] [INFO ] Invariant cache hit.
[2024-05-21 15:40:17] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/131 places, 148/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 292 ms. Remains : 125/131 places, 148/154 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s52 1), p0:(EQ s52 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2 reset in 68 ms.
Stuttering criterion allowed to conclude after 115 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-14 finished in 488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 154/154 transitions.
Graph (trivial) has 121 edges and 131 vertex of which 4 / 131 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 128 transition count 101
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 66 rules applied. Total rules applied 117 place count 78 transition count 85
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 127 place count 69 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 128 place count 68 transition count 84
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 128 place count 68 transition count 75
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 146 place count 59 transition count 75
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 149 place count 56 transition count 72
Iterating global reduction 4 with 3 rules applied. Total rules applied 152 place count 56 transition count 72
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 196 place count 34 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 197 place count 34 transition count 48
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 202 place count 29 transition count 37
Iterating global reduction 5 with 5 rules applied. Total rules applied 207 place count 29 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 209 place count 29 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 213 place count 27 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 217 place count 25 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 219 place count 23 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 220 place count 22 transition count 37
Applied a total of 220 rules in 24 ms. Remains 22 /131 variables (removed 109) and now considering 37/154 (removed 117) transitions.
// Phase 1: matrix 37 rows 22 cols
[2024-05-21 15:40:18] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 15:40:18] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 15:40:18] [INFO ] Invariant cache hit.
[2024-05-21 15:40:18] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-21 15:40:18] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [17, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 98 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/131 places, 37/154 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 19 transition count 36
Applied a total of 2 rules in 2 ms. Remains 19 /20 variables (removed 1) and now considering 36/37 (removed 1) transitions.
// Phase 1: matrix 36 rows 19 cols
[2024-05-21 15:40:18] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 15:40:18] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-21 15:40:18] [INFO ] Invariant cache hit.
[2024-05-21 15:40:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 15:40:18] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/131 places, 36/154 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 216 ms. Remains : 19/131 places, 36/154 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s4 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 40037 reset in 69 ms.
Product exploration explored 100000 steps with 40074 reset in 84 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Detected a total of 3/19 stabilizing places and 4/36 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 221 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-21 15:40:19] [INFO ] Invariant cache hit.
[2024-05-21 15:40:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 15:40:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:40:19] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-21 15:40:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:40:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 15:40:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:40:19] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-21 15:40:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 15:40:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-21 15:40:19] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 4 ms to minimize.
[2024-05-21 15:40:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-05-21 15:40:19] [INFO ] Computed and/alt/rep : 24/119/24 causal constraints (skipped 10 transitions) in 9 ms.
[2024-05-21 15:40:19] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 36/36 transitions.
Applied a total of 0 rules in 6 ms. Remains 19 /19 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2024-05-21 15:40:19] [INFO ] Invariant cache hit.
[2024-05-21 15:40:19] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 15:40:19] [INFO ] Invariant cache hit.
[2024-05-21 15:40:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 15:40:19] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-21 15:40:19] [INFO ] Redundant transitions in 15 ms returned [10]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 35 rows 19 cols
[2024-05-21 15:40:19] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 15:40:19] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/19 places, 35/36 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 17 transition count 33
Applied a total of 2 rules in 3 ms. Remains 17 /19 variables (removed 2) and now considering 33/35 (removed 2) transitions.
// Phase 1: matrix 33 rows 17 cols
[2024-05-21 15:40:19] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 15:40:19] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 15:40:19] [INFO ] Invariant cache hit.
[2024-05-21 15:40:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 15:40:19] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/19 places, 33/36 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 262 ms. Remains : 17/19 places, 33/36 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Detected a total of 4/17 stabilizing places and 5/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 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-02b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-02b-LTLFireability-15 finished in 1412 ms.
All properties solved by simple procedures.
Total runtime 23666 ms.

BK_STOP 1716306020692

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-02b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is AutonomousCar-PT-02b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-smll-171620180200153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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