Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.0K Feb 25 12:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 12:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 72K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678351548602

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-04a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 08:45:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 08:45:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:45:50] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2023-03-09 08:45:51] [INFO ] Transformed 49 places.
[2023-03-09 08:45:51] [INFO ] Transformed 193 transitions.
[2023-03-09 08:45:51] [INFO ] Found NUPN structural information;
[2023-03-09 08:45:51] [INFO ] Parsed PT model containing 49 places and 193 transitions and 1306 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 75 transitions
Reduce redundant transitions removed 75 transitions.
FORMULA AutonomousCar-PT-04a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 118/118 transitions.
Applied a total of 0 rules in 9 ms. Remains 49 /49 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2023-03-09 08:45:51] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
// Phase 1: matrix 117 rows 49 cols
[2023-03-09 08:45:51] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-09 08:45:51] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-09 08:45:51] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
[2023-03-09 08:45:51] [INFO ] Invariant cache hit.
[2023-03-09 08:45:51] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-09 08:45:51] [INFO ] Implicit Places using invariants and state equation in 310 ms returned [44, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 778 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/49 places, 118/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 790 ms. Remains : 47/49 places, 118/118 transitions.
Support contains 31 out of 47 places after structural reductions.
[2023-03-09 08:45:52] [INFO ] Flatten gal took : 41 ms
[2023-03-09 08:45:52] [INFO ] Flatten gal took : 19 ms
[2023-03-09 08:45:52] [INFO ] Input system was already deterministic with 118 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 10000 steps, including 93 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 08:45:52] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
// Phase 1: matrix 117 rows 47 cols
[2023-03-09 08:45:52] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-09 08:45:52] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-09 08:45:52] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 3 stabilizing places and 2 stable transitions
FORMULA AutonomousCar-PT-04a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 9 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 97
Applied a total of 10 rules in 18 ms. Remains 42 /47 variables (removed 5) and now considering 97/118 (removed 21) transitions.
// Phase 1: matrix 97 rows 42 cols
[2023-03-09 08:45:53] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-09 08:45:53] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-09 08:45:53] [INFO ] Invariant cache hit.
[2023-03-09 08:45:53] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-09 08:45:53] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2023-03-09 08:45:53] [INFO ] Invariant cache hit.
[2023-03-09 08:45:53] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/47 places, 97/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 688 ms. Remains : 42/47 places, 97/118 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (EQ s1 1) (EQ s5 1) (EQ s12 1) (EQ s37 1) (EQ s11 1) (EQ s19 1) (EQ s25 1) (EQ s29 1) (EQ s38 1)) (AND (EQ s11 1) (EQ s19 1) (EQ s25 1) (EQ s2...], 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]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-00 finished in 1039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 98
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 98
Applied a total of 8 rules in 4 ms. Remains 43 /47 variables (removed 4) and now considering 98/118 (removed 20) transitions.
[2023-03-09 08:45:54] [INFO ] Flow matrix only has 97 transitions (discarded 1 similar events)
// Phase 1: matrix 97 rows 43 cols
[2023-03-09 08:45:54] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-09 08:45:54] [INFO ] Implicit Places using invariants in 186 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 188 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/47 places, 98/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 194 ms. Remains : 42/47 places, 98/118 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s39 0), p0:(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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 341 ms.
Product exploration explored 100000 steps with 50000 reset in 189 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 : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 6 factoid took 128 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-04a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-04a-LTLFireability-01 finished in 1011 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 113
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 11 place count 42 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 41 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 41 transition count 111
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 14 place count 40 transition count 111
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 19 place count 35 transition count 90
Iterating global reduction 3 with 5 rules applied. Total rules applied 24 place count 35 transition count 90
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 28 place count 33 transition count 88
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 30 place count 32 transition count 88
Applied a total of 30 rules in 43 ms. Remains 32 /47 variables (removed 15) and now considering 88/118 (removed 30) transitions.
// Phase 1: matrix 88 rows 32 cols
[2023-03-09 08:45:55] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-09 08:45:55] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-09 08:45:55] [INFO ] Invariant cache hit.
[2023-03-09 08:45:55] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-09 08:45:55] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-09 08:45:55] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-09 08:45:55] [INFO ] Invariant cache hit.
[2023-03-09 08:45:55] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/47 places, 88/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 393 ms. Remains : 32/47 places, 88/118 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04a-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:(AND (EQ s1 1) (EQ s6 1) (EQ s15 1) (EQ s28 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 7 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-03 finished in 514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((F(p0) U G(p1))&&(p1 U p2)))))'
Support contains 6 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 44 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 44 transition count 107
Applied a total of 6 rules in 2 ms. Remains 44 /47 variables (removed 3) and now considering 107/118 (removed 11) transitions.
// Phase 1: matrix 107 rows 44 cols
[2023-03-09 08:45:55] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 08:45:55] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-09 08:45:55] [INFO ] Invariant cache hit.
[2023-03-09 08:45:55] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-09 08:45:55] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2023-03-09 08:45:55] [INFO ] Invariant cache hit.
[2023-03-09 08:45:56] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 44/47 places, 107/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 455 ms. Remains : 44/47 places, 107/118 transitions.
Stuttering acceptance computed with spot in 434 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s31 1), p2:(AND (EQ s1 1) (EQ s5 1) (EQ s24 1) (EQ s39 1)), p0:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-05 finished in 918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((X(p1)||p0))||G(p2)))))'
Support contains 7 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 44 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 44 transition count 107
Applied a total of 6 rules in 2 ms. Remains 44 /47 variables (removed 3) and now considering 107/118 (removed 11) transitions.
// Phase 1: matrix 107 rows 44 cols
[2023-03-09 08:45:56] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 08:45:56] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-09 08:45:56] [INFO ] Invariant cache hit.
[2023-03-09 08:45:56] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-09 08:45:56] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2023-03-09 08:45:56] [INFO ] Invariant cache hit.
[2023-03-09 08:45:58] [INFO ] Dead Transitions using invariants and state equation in 1175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 44/47 places, 107/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1590 ms. Remains : 44/47 places, 107/118 transitions.
Stuttering acceptance computed with spot in 376 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { 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: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=(NOT p2), acceptance={} source=7 dest: 0}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=5, aps=[p1:(OR (EQ s1 0) (EQ s7 0) (EQ s17 0) (EQ s39 0)), p0:(OR (EQ s1 0) (EQ s2 0) (EQ s10 0) (EQ s39 0)), p2:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16 reset in 149 ms.
Product exploration explored 100000 steps with 5 reset in 91 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 p1 p0 (NOT p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 463 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 588 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 10000 steps, including 95 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 08:45:59] [INFO ] Invariant cache hit.
[2023-03-09 08:45:59] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:45:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 15 ms returned sat
[2023-03-09 08:45:59] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (AND p1 p0 p2)), (F (NOT (AND p1 p0 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p1) p2)), (F (AND p0 p2)), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 7 factoid took 928 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 388 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 44 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 107/107 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2023-03-09 08:46:01] [INFO ] Invariant cache hit.
[2023-03-09 08:46:01] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-09 08:46:01] [INFO ] Invariant cache hit.
[2023-03-09 08:46:01] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-09 08:46:01] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2023-03-09 08:46:01] [INFO ] Invariant cache hit.
[2023-03-09 08:46:02] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 546 ms. Remains : 44/44 places, 107/107 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 172 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 282 steps, including 15 resets, run visited all 4 properties in 9 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 2 factoid took 348 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 341 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 315 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3 reset in 102 ms.
Product exploration explored 100000 steps with 32 reset in 227 ms.
Support contains 6 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 107/107 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2023-03-09 08:46:04] [INFO ] Invariant cache hit.
[2023-03-09 08:46:04] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-09 08:46:04] [INFO ] Invariant cache hit.
[2023-03-09 08:46:04] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-09 08:46:04] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-09 08:46:04] [INFO ] Invariant cache hit.
[2023-03-09 08:46:04] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 44/44 places, 107/107 transitions.
Treatment of property AutonomousCar-PT-04a-LTLFireability-07 finished in 8171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((X(p2)&&p1))))))'
Support contains 8 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 97
Applied a total of 10 rules in 2 ms. Remains 42 /47 variables (removed 5) and now considering 97/118 (removed 21) transitions.
// Phase 1: matrix 97 rows 42 cols
[2023-03-09 08:46:04] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 08:46:04] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-09 08:46:04] [INFO ] Invariant cache hit.
[2023-03-09 08:46:04] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-09 08:46:04] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-09 08:46:04] [INFO ] Invariant cache hit.
[2023-03-09 08:46:04] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/47 places, 97/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 208 ms. Remains : 42/47 places, 97/118 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1 1) (EQ s6 1) (EQ s12 1) (EQ s37 1)), p1:(AND (EQ s1 1) (EQ s5 1) (EQ s30 1) (EQ s37 1)), p2:(AND (EQ s1 1) (EQ s2 1) (EQ s20 1) (EQ s37 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-09 finished in 347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 45 transition count 113
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 41 transition count 111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 39 transition count 111
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 13 place count 39 transition count 110
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 15 place count 38 transition count 110
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 20 place count 33 transition count 89
Iterating global reduction 3 with 5 rules applied. Total rules applied 25 place count 33 transition count 89
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 29 place count 31 transition count 87
Applied a total of 29 rules in 26 ms. Remains 31 /47 variables (removed 16) and now considering 87/118 (removed 31) transitions.
// Phase 1: matrix 87 rows 31 cols
[2023-03-09 08:46:05] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 08:46:05] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-09 08:46:05] [INFO ] Invariant cache hit.
[2023-03-09 08:46:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:46:05] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-09 08:46:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 08:46:05] [INFO ] Invariant cache hit.
[2023-03-09 08:46:05] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/47 places, 87/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 332 ms. Remains : 31/47 places, 87/118 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s18 1), p1:(EQ s26 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1 reset in 135 ms.
Product exploration explored 100000 steps with 3 reset in 146 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 7 factoid took 531 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 7641 steps, including 651 resets, run visited all 4 properties in 53 ms. (steps per millisecond=144 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 684 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1))]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 87/87 transitions.
Applied a total of 0 rules in 7 ms. Remains 31 /31 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2023-03-09 08:46:07] [INFO ] Invariant cache hit.
[2023-03-09 08:46:07] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-09 08:46:07] [INFO ] Invariant cache hit.
[2023-03-09 08:46:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:46:07] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-09 08:46:07] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 08:46:07] [INFO ] Invariant cache hit.
[2023-03-09 08:46:07] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 349 ms. Remains : 31/31 places, 87/87 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 7 factoid took 378 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 6352 steps, including 508 resets, run visited all 4 properties in 35 ms. (steps per millisecond=181 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 504 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3 reset in 112 ms.
Product exploration explored 100000 steps with 16 reset in 96 ms.
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2023-03-09 08:46:09] [INFO ] Invariant cache hit.
[2023-03-09 08:46:09] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-09 08:46:09] [INFO ] Invariant cache hit.
[2023-03-09 08:46:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:46:09] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2023-03-09 08:46:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 08:46:09] [INFO ] Invariant cache hit.
[2023-03-09 08:46:09] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 550 ms. Remains : 31/31 places, 87/87 transitions.
Treatment of property AutonomousCar-PT-04a-LTLFireability-11 finished in 4527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U X(p1)))))'
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 118/118 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 45 transition count 112
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 40 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 40 transition count 111
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 39 transition count 111
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 17 place count 35 transition count 95
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 35 transition count 95
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 25 place count 33 transition count 93
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 27 place count 32 transition count 93
Applied a total of 27 rules in 7 ms. Remains 32 /47 variables (removed 15) and now considering 93/118 (removed 25) transitions.
// Phase 1: matrix 93 rows 32 cols
[2023-03-09 08:46:09] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 08:46:09] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-09 08:46:09] [INFO ] Invariant cache hit.
[2023-03-09 08:46:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:46:09] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2023-03-09 08:46:10] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-09 08:46:10] [INFO ] Invariant cache hit.
[2023-03-09 08:46:10] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/47 places, 93/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 548 ms. Remains : 32/47 places, 93/118 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s16 1), p1:(EQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 35 steps with 7 reset in 1 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-12 finished in 764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(!p0))||(G((p1&&F(!p2)))&&X(F(!p0)))))))'
Support contains 10 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 97
Applied a total of 10 rules in 1 ms. Remains 42 /47 variables (removed 5) and now considering 97/118 (removed 21) transitions.
// Phase 1: matrix 97 rows 42 cols
[2023-03-09 08:46:10] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-09 08:46:10] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-09 08:46:10] [INFO ] Invariant cache hit.
[2023-03-09 08:46:10] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-09 08:46:10] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2023-03-09 08:46:10] [INFO ] Invariant cache hit.
[2023-03-09 08:46:10] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/47 places, 97/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 42/47 places, 97/118 transitions.
Stuttering acceptance computed with spot in 255 ms :[p0, p0, p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 p2)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(OR p0 p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s9 1), p0:(AND (EQ s1 1) (EQ s7 1) (EQ s30 1) (EQ s37 1)), p2:(AND (EQ s13 1) (EQ s19 1) (EQ s23 1) (EQ s29 1) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 105 reset in 63 ms.
Product exploration explored 100000 steps with 4 reset in 74 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 p1 (NOT p0) (NOT p2)), (X p1), (X (OR p0 p1)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR p0 p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 491 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[p0, p0, p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 p2)]
Incomplete random walk after 10000 steps, including 571 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 08:46:11] [INFO ] Invariant cache hit.
[2023-03-09 08:46:12] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned sat
[2023-03-09 08:46:12] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X p1), (X (OR p0 p1)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR p0 p1))), (X (X (NOT p0))), (G (NOT (AND p1 p2 p0))), (G (NOT (AND p2 p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F p0), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 10 factoid took 791 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 271 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Support contains 5 out of 42 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-09 08:46:13] [INFO ] Invariant cache hit.
[2023-03-09 08:46:13] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-09 08:46:13] [INFO ] Invariant cache hit.
[2023-03-09 08:46:13] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-09 08:46:13] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2023-03-09 08:46:13] [INFO ] Invariant cache hit.
[2023-03-09 08:46:13] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 388 ms. Remains : 42/42 places, 97/97 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (OR p1 p0)), (X (X p1)), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 468 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Finished random walk after 542 steps, including 26 resets, run visited all 4 properties in 4 ms. (steps per millisecond=135 )
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (OR p1 p0)), (X (X p1)), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F p0), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 7 factoid took 607 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 291 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 290 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 5 reset in 86 ms.
Product exploration explored 100000 steps with 32 reset in 53 ms.
Applying partial POR strategy [false, false, true, false]
Stuttering acceptance computed with spot in 272 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Support contains 5 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 97/97 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 42 transition count 97
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 42 transition count 99
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 42 transition count 99
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 42 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 41 transition count 98
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 41 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 41 transition count 101
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 11 rules in 29 ms. Remains 41 /42 variables (removed 1) and now considering 101/97 (removed -4) transitions.
[2023-03-09 08:46:16] [INFO ] Redundant transitions in 75 ms returned []
// Phase 1: matrix 101 rows 41 cols
[2023-03-09 08:46:16] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 08:46:16] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/42 places, 101/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 213 ms. Remains : 41/42 places, 101/97 transitions.
Support contains 5 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 42 cols
[2023-03-09 08:46:16] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 08:46:16] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-09 08:46:16] [INFO ] Invariant cache hit.
[2023-03-09 08:46:17] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-09 08:46:17] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
[2023-03-09 08:46:17] [INFO ] Invariant cache hit.
[2023-03-09 08:46:17] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 743 ms. Remains : 42/42 places, 97/97 transitions.
Treatment of property AutonomousCar-PT-04a-LTLFireability-13 finished in 7168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 113
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 11 place count 42 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 41 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 41 transition count 111
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 14 place count 40 transition count 111
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 19 place count 35 transition count 90
Iterating global reduction 3 with 5 rules applied. Total rules applied 24 place count 35 transition count 90
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 28 place count 33 transition count 88
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 32 transition count 88
Applied a total of 30 rules in 17 ms. Remains 32 /47 variables (removed 15) and now considering 88/118 (removed 30) transitions.
// Phase 1: matrix 88 rows 32 cols
[2023-03-09 08:46:17] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 08:46:17] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-09 08:46:17] [INFO ] Invariant cache hit.
[2023-03-09 08:46:17] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-09 08:46:17] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2023-03-09 08:46:17] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-09 08:46:17] [INFO ] Invariant cache hit.
[2023-03-09 08:46:17] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/47 places, 88/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 407 ms. Remains : 32/47 places, 88/118 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04a-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 s6 0) (EQ s10 0) (EQ s28 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 18 reset in 86 ms.
Product exploration explored 100000 steps with 0 reset in 58 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 276 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 89 ms :[(NOT p0)]
Finished random walk after 25 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 324 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 74 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0)]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 88/88 transitions.
Applied a total of 0 rules in 6 ms. Remains 32 /32 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-09 08:46:19] [INFO ] Invariant cache hit.
[2023-03-09 08:46:19] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-09 08:46:19] [INFO ] Invariant cache hit.
[2023-03-09 08:46:19] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-09 08:46:19] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2023-03-09 08:46:19] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-09 08:46:19] [INFO ] Invariant cache hit.
[2023-03-09 08:46:20] [INFO ] Dead Transitions using invariants and state equation in 1321 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1596 ms. Remains : 32/32 places, 88/88 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Finished random walk after 56 steps, including 6 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 236 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 63 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5 reset in 189 ms.
Product exploration explored 100000 steps with 38 reset in 65 ms.
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-09 08:46:21] [INFO ] Invariant cache hit.
[2023-03-09 08:46:21] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-09 08:46:21] [INFO ] Invariant cache hit.
[2023-03-09 08:46:21] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-09 08:46:21] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-09 08:46:21] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-09 08:46:22] [INFO ] Invariant cache hit.
[2023-03-09 08:46:22] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 323 ms. Remains : 32/32 places, 88/88 transitions.
Treatment of property AutonomousCar-PT-04a-LTLFireability-14 finished in 4525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 118/118 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 47 transition count 112
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 41 transition count 112
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 41 transition count 111
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 40 transition count 111
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 36 transition count 95
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 36 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 35 transition count 94
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 26 place count 34 transition count 94
Applied a total of 26 rules in 30 ms. Remains 34 /47 variables (removed 13) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 34 cols
[2023-03-09 08:46:22] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-09 08:46:22] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-09 08:46:22] [INFO ] Invariant cache hit.
[2023-03-09 08:46:22] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-09 08:46:22] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-09 08:46:22] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-09 08:46:22] [INFO ] Invariant cache hit.
[2023-03-09 08:46:22] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/47 places, 94/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 585 ms. Remains : 34/47 places, 94/118 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-15 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 s1 1) (EQ s2 1) (EQ s19 1) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-15 finished in 662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((X(p1)||p0))||G(p2)))))'
Found a Lengthening insensitive property : AutonomousCar-PT-04a-LTLFireability-07
Stuttering acceptance computed with spot in 542 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2)]
Support contains 7 out of 47 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 113
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 11 place count 42 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 41 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 41 transition count 111
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 14 place count 40 transition count 111
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 17 place count 37 transition count 100
Iterating global reduction 3 with 3 rules applied. Total rules applied 20 place count 37 transition count 100
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 3 with 2 rules applied. Total rules applied 22 place count 36 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 35 transition count 99
Applied a total of 24 rules in 29 ms. Remains 35 /47 variables (removed 12) and now considering 99/118 (removed 19) transitions.
// Phase 1: matrix 99 rows 35 cols
[2023-03-09 08:46:23] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-09 08:46:23] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-09 08:46:23] [INFO ] Invariant cache hit.
[2023-03-09 08:46:23] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-09 08:46:23] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-09 08:46:23] [INFO ] Invariant cache hit.
[2023-03-09 08:46:24] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 35/47 places, 99/118 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 608 ms. Remains : 35/47 places, 99/118 transitions.
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { 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: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=(NOT p2), acceptance={} source=7 dest: 0}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=5, aps=[p1:(OR (EQ s1 0) (EQ s7 0) (EQ s15 0) (EQ s31 0)), p0:(OR (EQ s1 0) (EQ s2 0) (EQ s9 0) (EQ s31 0)), p2:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7 reset in 93 ms.
Product exploration explored 100000 steps with 1 reset in 75 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 (NOT p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 291 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 565 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 800 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 08:46:25] [INFO ] Invariant cache hit.
[2023-03-09 08:46:25] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:46:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 52 ms returned sat
[2023-03-09 08:46:25] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (AND p1 p0 p2)), (F (NOT (AND p1 p0 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p1) p2)), (F (AND p0 p2)), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 7 factoid took 736 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 281 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 35 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-09 08:46:26] [INFO ] Invariant cache hit.
[2023-03-09 08:46:26] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-09 08:46:26] [INFO ] Invariant cache hit.
[2023-03-09 08:46:27] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-09 08:46:27] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2023-03-09 08:46:27] [INFO ] Invariant cache hit.
[2023-03-09 08:46:27] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 463 ms. Remains : 35/35 places, 99/99 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 p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 359 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 120 steps, including 10 resets, run visited all 4 properties in 4 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 2 factoid took 245 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 262 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 262 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 5 reset in 96 ms.
Product exploration explored 100000 steps with 7 reset in 74 ms.
Support contains 6 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-09 08:46:29] [INFO ] Invariant cache hit.
[2023-03-09 08:46:29] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-09 08:46:29] [INFO ] Invariant cache hit.
[2023-03-09 08:46:29] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-09 08:46:29] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2023-03-09 08:46:29] [INFO ] Invariant cache hit.
[2023-03-09 08:46:29] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 306 ms. Remains : 35/35 places, 99/99 transitions.
Treatment of property AutonomousCar-PT-04a-LTLFireability-07 finished in 6694 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(!p0))||(G((p1&&F(!p2)))&&X(F(!p0)))))))'
Found a Shortening insensitive property : AutonomousCar-PT-04a-LTLFireability-13
Stuttering acceptance computed with spot in 254 ms :[p0, p0, p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 p2)]
Support contains 10 out of 47 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 116
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 45 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 44 transition count 115
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 44 transition count 113
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 10 place count 42 transition count 113
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 15 place count 37 transition count 92
Iterating global reduction 3 with 5 rules applied. Total rules applied 20 place count 37 transition count 92
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 3 with 2 rules applied. Total rules applied 22 place count 36 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 35 transition count 91
Applied a total of 24 rules in 6 ms. Remains 35 /47 variables (removed 12) and now considering 91/118 (removed 27) transitions.
// Phase 1: matrix 91 rows 35 cols
[2023-03-09 08:46:29] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 08:46:29] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-09 08:46:29] [INFO ] Invariant cache hit.
[2023-03-09 08:46:30] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-09 08:46:30] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-09 08:46:30] [INFO ] Invariant cache hit.
[2023-03-09 08:46:30] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 35/47 places, 91/118 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 352 ms. Remains : 35/47 places, 91/118 transitions.
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(OR p0 p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s8 1), p0:(AND (EQ s1 1) (EQ s6 1) (EQ s26 1) (EQ s31 1)), p2:(AND (EQ s12 1) (EQ s17 1) (EQ s20 1) (EQ s25 1) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 49 reset in 90 ms.
Product exploration explored 100000 steps with 4 reset in 84 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X p1), (X (OR p0 p1)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR p0 p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 470 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 389 ms :[p0, p0, p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 p2)]
Incomplete random walk after 10000 steps, including 683 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 08:46:31] [INFO ] Invariant cache hit.
[2023-03-09 08:46:31] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-09 08:46:31] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X p1), (X (OR p0 p1)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR p0 p1))), (X (X (NOT p0))), (G (NOT (AND p1 p2 p0))), (G (NOT (AND p2 p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F p0), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 10 factoid took 643 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 261 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Support contains 5 out of 35 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 91/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-09 08:46:32] [INFO ] Invariant cache hit.
[2023-03-09 08:46:32] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-09 08:46:32] [INFO ] Invariant cache hit.
[2023-03-09 08:46:32] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-09 08:46:32] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2023-03-09 08:46:32] [INFO ] Invariant cache hit.
[2023-03-09 08:46:33] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 390 ms. Remains : 35/35 places, 91/91 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (OR p1 p0)), (X (X p1)), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 552 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Finished random walk after 47 steps, including 4 resets, run visited all 4 properties in 3 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (OR p1 p0)), (X (X p1)), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F p0), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 7 factoid took 520 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 219 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 212 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 1 reset in 119 ms.
Product exploration explored 100000 steps with 31 reset in 60 ms.
Applying partial POR strategy [false, false, true, false]
Stuttering acceptance computed with spot in 311 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Support contains 5 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 91/91 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 91
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 8 ms. Remains 35 /35 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-09 08:46:35] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 91 rows 35 cols
[2023-03-09 08:46:35] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-09 08:46:36] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/35 places, 91/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 35/35 places, 91/91 transitions.
Support contains 5 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 91/91 transitions.
Applied a total of 0 rules in 0 ms. Remains 35 /35 variables (removed 0) and now considering 91/91 (removed 0) transitions.
// Phase 1: matrix 91 rows 35 cols
[2023-03-09 08:46:36] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-09 08:46:36] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-09 08:46:36] [INFO ] Invariant cache hit.
[2023-03-09 08:46:36] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-09 08:46:36] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-09 08:46:36] [INFO ] Invariant cache hit.
[2023-03-09 08:46:36] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 274 ms. Remains : 35/35 places, 91/91 transitions.
Treatment of property AutonomousCar-PT-04a-LTLFireability-13 finished in 6786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-09 08:46:36] [INFO ] Flatten gal took : 34 ms
[2023-03-09 08:46:36] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 15 ms.
[2023-03-09 08:46:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 47 places, 118 transitions and 765 arcs took 3 ms.
Total runtime 45700 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutonomousCar-PT-04a
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/378
LTLFireability

FORMULA AutonomousCar-PT-04a-LTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

BK_STOP 1678351599036

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/378/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/378/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/378/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 AutonomousCar-PT-04a-LTLFireability-07
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for AutonomousCar-PT-04a-LTLFireability-07
lola: result : true
lola: markings : 422267
lola: fired transitions : 2967296
lola: time used : 2.000000
lola: memory pages used : 3
lola: LAUNCH task # 7 (type EXCL) for 6 AutonomousCar-PT-04a-LTLFireability-13
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for AutonomousCar-PT-04a-LTLFireability-13
lola: result : false
lola: markings : 32536
lola: fired transitions : 144482
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 AutonomousCar-PT-04a-LTLFireability-11
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for AutonomousCar-PT-04a-LTLFireability-11
lola: result : false
lola: markings : 89
lola: fired transitions : 118
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 AutonomousCar-PT-04a-LTLFireability-14
lola: time limit : 3598 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for AutonomousCar-PT-04a-LTLFireability-14
lola: result : false
lola: markings : 5777
lola: fired transitions : 20562
lola: time used : 1.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-04a-LTLFireability-07: LTL true LTL model checker
AutonomousCar-PT-04a-LTLFireability-11: LTL false LTL model checker
AutonomousCar-PT-04a-LTLFireability-13: LTL false LTL model checker
AutonomousCar-PT-04a-LTLFireability-14: LTL false LTL model checker


Time elapsed: 3 secs. Pages in use: 3

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is AutonomousCar-PT-04a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-oct2-167813595700580"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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