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-171620180300178.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-05a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180300178
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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 16K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 18:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 12 18:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 18:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 18:07 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 114K 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-05a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716306551422

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-05a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 15:49:13] [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:49:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:49:14] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-05-21 15:49:14] [INFO ] Transformed 57 places.
[2024-05-21 15:49:14] [INFO ] Transformed 289 transitions.
[2024-05-21 15:49:14] [INFO ] Found NUPN structural information;
[2024-05-21 15:49:14] [INFO ] Parsed PT model containing 57 places and 289 transitions and 2123 arcs in 221 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 1 formulas.
Ensure Unique test removed 113 transitions
Reduce redundant transitions removed 113 transitions.
FORMULA AutonomousCar-PT-05a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 176/176 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 56 transition count 175
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 56 transition count 175
Applied a total of 2 rules in 23 ms. Remains 56 /57 variables (removed 1) and now considering 175/176 (removed 1) transitions.
// Phase 1: matrix 175 rows 56 cols
[2024-05-21 15:49:14] [INFO ] Computed 9 invariants in 16 ms
[2024-05-21 15:49:14] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-21 15:49:14] [INFO ] Invariant cache hit.
[2024-05-21 15:49:14] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-05-21 15:49:14] [INFO ] Implicit Places using invariants and state equation in 186 ms returned [52, 54]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 431 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/57 places, 175/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 54 /54 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 463 ms. Remains : 54/57 places, 175/176 transitions.
Support contains 39 out of 54 places after structural reductions.
[2024-05-21 15:49:15] [INFO ] Flatten gal took : 73 ms
[2024-05-21 15:49:15] [INFO ] Flatten gal took : 35 ms
[2024-05-21 15:49:15] [INFO ] Input system was already deterministic with 175 transitions.
Support contains 37 out of 54 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 573 resets, run finished after 630 ms. (steps per millisecond=15 ) properties (out of 29) seen :24
Incomplete Best-First random walk after 10000 steps, including 79 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 147 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 175 rows 54 cols
[2024-05-21 15:49:16] [INFO ] Computed 7 invariants in 11 ms
[2024-05-21 15:49:16] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 15:49:16] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 15:49:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 15:49:16] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-21 15:49:16] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-05-21 15:49:16] [INFO ] After 66ms SMT Verify possible using 103 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2024-05-21 15:49:16] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2024-05-21 15:49:16] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 7 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 175/175 transitions.
Graph (complete) has 386 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 53 transition count 167
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 48 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 47 transition count 166
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 20 place count 42 transition count 136
Iterating global reduction 3 with 5 rules applied. Total rules applied 25 place count 42 transition count 136
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 31 place count 39 transition count 133
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 35 place count 39 transition count 129
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 35 transition count 114
Applied a total of 54 rules in 69 ms. Remains 35 /54 variables (removed 19) and now considering 114/175 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 35/54 places, 114/175 transitions.
Incomplete random walk after 10000 steps, including 313 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 114 rows 35 cols
[2024-05-21 15:49:16] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 15:49:17] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 15:49:17] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 15:49:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-21 15:49:17] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 15:49:17] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 15:49:17] [INFO ] After 23ms SMT Verify possible using 62 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 15:49:17] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-21 15:49:17] [INFO ] After 172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 114/114 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 35 transition count 113
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 34 transition count 108
Applied a total of 7 rules in 32 ms. Remains 34 /35 variables (removed 1) and now considering 108/114 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 34/35 places, 108/114 transitions.
Incomplete random walk after 10000 steps, including 226 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 39642 steps, run visited all 1 properties in 84 ms. (steps per millisecond=471 )
Probabilistic random walk after 39642 steps, saw 7646 distinct states, run finished after 84 ms. (steps per millisecond=471 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA AutonomousCar-PT-05a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 2 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((p0 U p1))||G(p2)))'
Support contains 7 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 151
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 151
Applied a total of 8 rules in 4 ms. Remains 50 /54 variables (removed 4) and now considering 151/175 (removed 24) transitions.
// Phase 1: matrix 151 rows 50 cols
[2024-05-21 15:49:17] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 15:49:17] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 15:49:17] [INFO ] Invariant cache hit.
[2024-05-21 15:49:18] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-21 15:49:18] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-05-21 15:49:18] [INFO ] Invariant cache hit.
[2024-05-21 15:49:18] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/54 places, 151/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 362 ms. Remains : 50/54 places, 151/175 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 341 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s1 1) (EQ s8 1) (EQ s13 1) (EQ s45 1) (EQ s48 1)), p0:(OR (AND (EQ s1 1) (EQ s2 1) (EQ s23 1) (EQ s45 1)) (EQ s48 1)), p2:(AND (EQ s1 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-00 finished in 774 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)))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 151
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 151
Applied a total of 8 rules in 3 ms. Remains 50 /54 variables (removed 4) and now considering 151/175 (removed 24) transitions.
// Phase 1: matrix 151 rows 50 cols
[2024-05-21 15:49:18] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 15:49:18] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 15:49:18] [INFO ] Invariant cache hit.
[2024-05-21 15:49:18] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-21 15:49:18] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-21 15:49:18] [INFO ] Invariant cache hit.
[2024-05-21 15:49:18] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/54 places, 151/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 351 ms. Remains : 50/54 places, 151/175 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1 1) (EQ s7 1) (EQ s31 1) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-01 finished in 456 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 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 52 transition count 169
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 47 transition count 167
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 45 transition count 167
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 45 transition count 166
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 44 transition count 166
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 22 place count 39 transition count 136
Iterating global reduction 3 with 5 rules applied. Total rules applied 27 place count 39 transition count 136
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 3 with 4 rules applied. Total rules applied 31 place count 37 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 36 transition count 134
Applied a total of 33 rules in 28 ms. Remains 36 /54 variables (removed 18) and now considering 134/175 (removed 41) transitions.
// Phase 1: matrix 134 rows 36 cols
[2024-05-21 15:49:19] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 15:49:19] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 15:49:19] [INFO ] Invariant cache hit.
[2024-05-21 15:49:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:49:19] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-21 15:49:19] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-21 15:49:19] [INFO ] Invariant cache hit.
[2024-05-21 15:49:19] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/54 places, 134/175 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 318 ms. Remains : 36/54 places, 134/175 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s9 1) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15 steps with 4 reset in 1 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-03 finished in 408 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(p0) U ((!p1&&X(p0))||X(G(p0)))))'
Support contains 12 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 151
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 151
Applied a total of 8 rules in 3 ms. Remains 50 /54 variables (removed 4) and now considering 151/175 (removed 24) transitions.
// Phase 1: matrix 151 rows 50 cols
[2024-05-21 15:49:19] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 15:49:19] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 15:49:19] [INFO ] Invariant cache hit.
[2024-05-21 15:49:19] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-21 15:49:19] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-21 15:49:19] [INFO ] Invariant cache hit.
[2024-05-21 15:49:19] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/54 places, 151/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 50/54 places, 151/175 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s14 1) (EQ s20 1) (EQ s26 1) (EQ s32 1) (EQ s39 1) (EQ s46 1)), p1:(OR (AND (EQ s1 1) (EQ s2 1) (EQ s27 1) (EQ s45 1)) (AND (EQ s1 1) (EQ s5 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 740 ms.
Product exploration explored 100000 steps with 50000 reset in 554 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 19 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-05a-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-05a-LTLFireability-04 finished in 1687 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(F(p0))))'
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 49 transition count 145
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 49 transition count 145
Applied a total of 10 rules in 3 ms. Remains 49 /54 variables (removed 5) and now considering 145/175 (removed 30) transitions.
// Phase 1: matrix 145 rows 49 cols
[2024-05-21 15:49:21] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 15:49:21] [INFO ] Implicit Places using invariants in 108 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 110 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/54 places, 145/175 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 48/54 places, 145/175 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (NEQ s11 1) (NEQ s19 1) (NEQ s23 1) (NEQ s29 1) (NEQ s37 1) (NEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 357 ms.
Product exploration explored 100000 steps with 33333 reset in 365 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-05a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-05a-LTLFireability-06 finished in 989 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((F(p0)&&!p0))) U p1))'
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 54 transition count 169
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 48 transition count 169
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 48 transition count 168
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 47 transition count 168
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 43 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 43 transition count 144
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 2 with 4 rules applied. Total rules applied 26 place count 41 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 40 transition count 142
Applied a total of 28 rules in 21 ms. Remains 40 /54 variables (removed 14) and now considering 142/175 (removed 33) transitions.
// Phase 1: matrix 142 rows 40 cols
[2024-05-21 15:49:22] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 15:49:22] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 15:49:22] [INFO ] Invariant cache hit.
[2024-05-21 15:49:22] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-21 15:49:22] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-21 15:49:22] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-21 15:49:22] [INFO ] Invariant cache hit.
[2024-05-21 15:49:22] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/54 places, 142/175 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 329 ms. Remains : 40/54 places, 142/175 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p1), true, true]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(NEQ s12 1), p1:(OR (AND (EQ s1 1) (EQ s6 1) (EQ s8 1) (EQ s36 1)) (AND (EQ s1 1) (EQ s6 1) (EQ s17 1) (EQ s36 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-07 finished in 501 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)&&p1)) U p2)||!F(p0)) U p0))'
Support contains 7 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 151
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 151
Applied a total of 8 rules in 3 ms. Remains 50 /54 variables (removed 4) and now considering 151/175 (removed 24) transitions.
// Phase 1: matrix 151 rows 50 cols
[2024-05-21 15:49:22] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 15:49:22] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 15:49:22] [INFO ] Invariant cache hit.
[2024-05-21 15:49:22] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-21 15:49:22] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-21 15:49:22] [INFO ] Invariant cache hit.
[2024-05-21 15:49:22] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/54 places, 151/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 311 ms. Remains : 50/54 places, 151/175 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), true, (OR (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p2 p1), acceptance={0} source=3 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s1 1) (EQ s8 1) (EQ s13 1) (EQ s45 1)), p2:(AND (EQ s1 1) (EQ s4 1) (EQ s45 1) (EQ s49 1)), p1:(EQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-10 finished in 473 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)))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 151
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 151
Applied a total of 8 rules in 3 ms. Remains 50 /54 variables (removed 4) and now considering 151/175 (removed 24) transitions.
// Phase 1: matrix 151 rows 50 cols
[2024-05-21 15:49:23] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 15:49:23] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 15:49:23] [INFO ] Invariant cache hit.
[2024-05-21 15:49:23] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-21 15:49:23] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-05-21 15:49:23] [INFO ] Invariant cache hit.
[2024-05-21 15:49:23] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/54 places, 151/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 291 ms. Remains : 50/54 places, 151/175 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s2 1) (EQ s31 1) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-11 finished in 381 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 U (p1||G(p0))))))'
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 54 transition count 169
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 48 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 47 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 47 transition count 167
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 46 transition count 167
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 20 place count 42 transition count 143
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 42 transition count 143
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 3 with 4 rules applied. Total rules applied 28 place count 40 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 39 transition count 141
Applied a total of 30 rules in 23 ms. Remains 39 /54 variables (removed 15) and now considering 141/175 (removed 34) transitions.
// Phase 1: matrix 141 rows 39 cols
[2024-05-21 15:49:23] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 15:49:23] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 15:49:23] [INFO ] Invariant cache hit.
[2024-05-21 15:49:23] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-21 15:49:23] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-21 15:49:23] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-21 15:49:23] [INFO ] Invariant cache hit.
[2024-05-21 15:49:23] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/54 places, 141/175 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 313 ms. Remains : 39/54 places, 141/175 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s11 1) (NOT (AND (EQ s1 1) (EQ s7 1) (EQ s21 1) (EQ s35 1)))), p0:(NEQ s11 1)], 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 172 reset in 146 ms.
Product exploration explored 100000 steps with 350 reset in 149 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 103 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 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 502 steps, including 41 resets, run visited all 2 properties in 6 ms. (steps per millisecond=83 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 147 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 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 141/141 transitions.
Applied a total of 0 rules in 7 ms. Remains 39 /39 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2024-05-21 15:49:24] [INFO ] Invariant cache hit.
[2024-05-21 15:49:24] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-21 15:49:24] [INFO ] Invariant cache hit.
[2024-05-21 15:49:24] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-21 15:49:25] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-05-21 15:49:25] [INFO ] Redundant transitions in 33 ms returned []
[2024-05-21 15:49:25] [INFO ] Invariant cache hit.
[2024-05-21 15:49:25] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 522 ms. Remains : 39/39 places, 141/141 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 223 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 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 535 steps, including 44 resets, run visited all 2 properties in 3 ms. (steps per millisecond=178 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 144 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 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 35 reset in 62 ms.
Product exploration explored 100000 steps with 117 reset in 260 ms.
Built C files in :
/tmp/ltsmin15298383866500536048
[2024-05-21 15:49:26] [INFO ] Computing symmetric may disable matrix : 141 transitions.
[2024-05-21 15:49:26] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:49:26] [INFO ] Computing symmetric may enable matrix : 141 transitions.
[2024-05-21 15:49:26] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:49:26] [INFO ] Computing Do-Not-Accords matrix : 141 transitions.
[2024-05-21 15:49:26] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:49:26] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15298383866500536048
Running compilation step : cd /tmp/ltsmin15298383866500536048;'/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 696 ms.
Running link step : cd /tmp/ltsmin15298383866500536048;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin15298383866500536048;'/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/stateBased12662655571238412411.hoa' '--buchi-type=spotba'
LTSmin run took 3228 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-05a-LTLFireability-12 finished in 6929 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||G(p1)))||(F(p2)&&X(p3))))'
Support contains 9 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 151
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 151
Applied a total of 8 rules in 4 ms. Remains 50 /54 variables (removed 4) and now considering 151/175 (removed 24) transitions.
// Phase 1: matrix 151 rows 50 cols
[2024-05-21 15:49:30] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 15:49:30] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 15:49:30] [INFO ] Invariant cache hit.
[2024-05-21 15:49:30] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-21 15:49:30] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-05-21 15:49:30] [INFO ] Invariant cache hit.
[2024-05-21 15:49:30] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/54 places, 151/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 356 ms. Remains : 50/54 places, 151/175 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s6 1) (EQ s27 1) (EQ s45 1)), p2:(OR (EQ s1 0) (EQ s5 0) (EQ s25 0) (EQ s45 0)), p1:(OR (EQ s1 0) (EQ s8 0) (EQ s31 0) (EQ s45 0)), ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 43 reset in 119 ms.
Product exploration explored 100000 steps with 86 reset in 107 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1 (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 99 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 561 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 15:49:31] [INFO ] Invariant cache hit.
[2024-05-21 15:49:31] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 15:49:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 15:49:31] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-21 15:49:31] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-21 15:49:31] [INFO ] After 26ms SMT Verify possible using 83 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-21 15:49:31] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-21 15:49:31] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 151/151 transitions.
Graph (complete) has 358 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 49 transition count 141
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 43 transition count 141
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 43 transition count 140
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 42 transition count 140
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 41 transition count 139
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 41 transition count 139
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 38 transition count 136
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 31 place count 38 transition count 131
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 56 place count 33 transition count 111
Applied a total of 56 rules in 31 ms. Remains 33 /50 variables (removed 17) and now considering 111/151 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 33/50 places, 111/151 transitions.
Finished random walk after 44 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=44 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1 (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F (AND p0 p1))]
Knowledge based reduction with 9 factoid took 192 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), false]
Support contains 6 out of 50 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 151/151 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 50 transition count 147
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 46 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 45 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 45 transition count 145
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 44 transition count 145
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 42 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 41 transition count 143
Applied a total of 18 rules in 19 ms. Remains 41 /50 variables (removed 9) and now considering 143/151 (removed 8) transitions.
// Phase 1: matrix 143 rows 41 cols
[2024-05-21 15:49:32] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 15:49:32] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 15:49:32] [INFO ] Invariant cache hit.
[2024-05-21 15:49:32] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-21 15:49:32] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-21 15:49:32] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-21 15:49:32] [INFO ] Invariant cache hit.
[2024-05-21 15:49:32] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/50 places, 143/151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 306 ms. Remains : 41/50 places, 143/151 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 95 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 111 ms :[(NOT p1), (NOT p1), false]
Incomplete random walk after 10000 steps, including 723 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :2
Finished Best-First random walk after 1733 steps, including 11 resets, run visited all 1 properties in 2 ms. (steps per millisecond=866 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 182 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 122 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), false]
Product exploration explored 100000 steps with 4 reset in 79 ms.
Product exploration explored 100000 steps with 129 reset in 99 ms.
Built C files in :
/tmp/ltsmin6966318951901221455
[2024-05-21 15:49:33] [INFO ] Computing symmetric may disable matrix : 143 transitions.
[2024-05-21 15:49:33] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:49:33] [INFO ] Computing symmetric may enable matrix : 143 transitions.
[2024-05-21 15:49:33] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:49:33] [INFO ] Computing Do-Not-Accords matrix : 143 transitions.
[2024-05-21 15:49:33] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:49:33] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6966318951901221455
Running compilation step : cd /tmp/ltsmin6966318951901221455;'/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 519 ms.
Running link step : cd /tmp/ltsmin6966318951901221455;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6966318951901221455;'/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/stateBased9298632853174673072.hoa' '--buchi-type=spotba'
LTSmin run took 1426 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-05a-LTLFireability-13 finished in 5322 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 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 54 transition count 168
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 47 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 47 transition count 167
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 46 transition count 167
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 42 transition count 143
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 42 transition count 143
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 2 with 4 rules applied. Total rules applied 28 place count 40 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 39 transition count 141
Applied a total of 30 rules in 18 ms. Remains 39 /54 variables (removed 15) and now considering 141/175 (removed 34) transitions.
// Phase 1: matrix 141 rows 39 cols
[2024-05-21 15:49:35] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 15:49:35] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 15:49:35] [INFO ] Invariant cache hit.
[2024-05-21 15:49:35] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-21 15:49:35] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-21 15:49:35] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-21 15:49:35] [INFO ] Invariant cache hit.
[2024-05-21 15:49:36] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/54 places, 141/175 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 337 ms. Remains : 39/54 places, 141/175 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s4 0) (EQ s19 0) (EQ s35 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 0 reset in 69 ms.
Stuttering criterion allowed to conclude after 217 steps with 14 reset in 1 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-14 finished in 460 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(F(!p0))||(F(!p0)&&G(p1)))))'
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 54 transition count 169
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 48 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 47 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 47 transition count 167
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 46 transition count 167
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 20 place count 42 transition count 143
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 42 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 41 transition count 143
Applied a total of 26 rules in 27 ms. Remains 41 /54 variables (removed 13) and now considering 143/175 (removed 32) transitions.
// Phase 1: matrix 143 rows 41 cols
[2024-05-21 15:49:36] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 15:49:36] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 15:49:36] [INFO ] Invariant cache hit.
[2024-05-21 15:49:36] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-21 15:49:36] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-21 15:49:36] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-21 15:49:36] [INFO ] Invariant cache hit.
[2024-05-21 15:49:36] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/54 places, 143/175 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 342 ms. Remains : 41/54 places, 143/175 transitions.
Stuttering acceptance computed with spot in 118 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s36 1), p0:(AND (EQ s1 1) (EQ s2 1) (EQ s32 1) (EQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 113 reset in 71 ms.
Product exploration explored 100000 steps with 82 reset in 78 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 122 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[p0, (AND (NOT p1) p0), p0]
Finished random walk after 46 steps, including 3 resets, run visited all 3 properties in 2 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1))), (F p0)]
Knowledge based reduction with 7 factoid took 176 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 114 ms :[p0, (AND (NOT p1) p0), p0]
Support contains 5 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 143/143 transitions.
Applied a total of 0 rules in 6 ms. Remains 41 /41 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2024-05-21 15:49:37] [INFO ] Invariant cache hit.
[2024-05-21 15:49:37] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 15:49:37] [INFO ] Invariant cache hit.
[2024-05-21 15:49:37] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-21 15:49:37] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-21 15:49:37] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-21 15:49:37] [INFO ] Invariant cache hit.
[2024-05-21 15:49:37] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 300 ms. Remains : 41/41 places, 143/143 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 102 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[p0, (AND (NOT p1) p0), p0]
Finished random walk after 4 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1))), (F p0)]
Knowledge based reduction with 7 factoid took 190 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 117 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 111 ms :[p0, (AND (NOT p1) p0), p0]
Product exploration explored 100000 steps with 80 reset in 66 ms.
Product exploration explored 100000 steps with 27 reset in 77 ms.
Built C files in :
/tmp/ltsmin16211424100845066127
[2024-05-21 15:49:38] [INFO ] Computing symmetric may disable matrix : 143 transitions.
[2024-05-21 15:49:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:49:38] [INFO ] Computing symmetric may enable matrix : 143 transitions.
[2024-05-21 15:49:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:49:38] [INFO ] Computing Do-Not-Accords matrix : 143 transitions.
[2024-05-21 15:49:38] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:49:38] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16211424100845066127
Running compilation step : cd /tmp/ltsmin16211424100845066127;'/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 517 ms.
Running link step : cd /tmp/ltsmin16211424100845066127;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16211424100845066127;'/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/stateBased6201854283793094514.hoa' '--buchi-type=spotba'
LTSmin run took 1950 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-05a-LTLFireability-15 finished in 5074 ms.
All properties solved by simple procedures.
Total runtime 27296 ms.

BK_STOP 1716306582369

--------------------
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-05a"
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-05a, 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-171620180300178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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