Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 12:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 12:54 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.3K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 12:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 23K 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-02a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678636496719

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-02a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 15:54:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 15:54:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 15:54:59] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2023-03-12 15:54:59] [INFO ] Transformed 33 places.
[2023-03-12 15:54:59] [INFO ] Transformed 69 transitions.
[2023-03-12 15:54:59] [INFO ] Found NUPN structural information;
[2023-03-12 15:54:59] [INFO ] Parsed PT model containing 33 places and 69 transitions and 368 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 23 transitions
Reduce redundant transitions removed 23 transitions.
FORMULA AutonomousCar-PT-02a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02a-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 46/46 transitions.
Applied a total of 0 rules in 38 ms. Remains 33 /33 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2023-03-12 15:55:00] [INFO ] Flow matrix only has 45 transitions (discarded 1 similar events)
// Phase 1: matrix 45 rows 33 cols
[2023-03-12 15:55:00] [INFO ] Computed 7 place invariants in 16 ms
[2023-03-12 15:55:00] [INFO ] Implicit Places using invariants in 499 ms returned []
[2023-03-12 15:55:00] [INFO ] Flow matrix only has 45 transitions (discarded 1 similar events)
[2023-03-12 15:55:00] [INFO ] Invariant cache hit.
[2023-03-12 15:55:01] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-12 15:55:01] [INFO ] Implicit Places using invariants and state equation in 166 ms returned [31]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 741 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 46/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 780 ms. Remains : 32/33 places, 46/46 transitions.
Support contains 26 out of 32 places after structural reductions.
[2023-03-12 15:55:01] [INFO ] Flatten gal took : 44 ms
[2023-03-12 15:55:01] [INFO ] Flatten gal took : 7 ms
[2023-03-12 15:55:01] [INFO ] Input system was already deterministic with 46 transitions.
Incomplete random walk after 10000 steps, including 635 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 27) seen :25
Incomplete Best-First random walk after 10001 steps, including 193 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 210 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 15:55:01] [INFO ] Flow matrix only has 45 transitions (discarded 1 similar events)
// Phase 1: matrix 45 rows 32 cols
[2023-03-12 15:55:01] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-12 15:55:02] [INFO ] After 57ms 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 1 ms.
FORMULA AutonomousCar-PT-02a-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutonomousCar-PT-02a-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U G(p1)))'
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 46/46 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 32 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 30 transition count 44
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 27 transition count 37
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 37
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 25 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 24 transition count 35
Applied a total of 16 rules in 52 ms. Remains 24 /32 variables (removed 8) and now considering 35/46 (removed 11) transitions.
// Phase 1: matrix 35 rows 24 cols
[2023-03-12 15:55:02] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 15:55:02] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-12 15:55:02] [INFO ] Invariant cache hit.
[2023-03-12 15:55:02] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-12 15:55:02] [INFO ] Implicit Places using invariants and state equation in 81 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 169 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/32 places, 35/46 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 34
Applied a total of 2 rules in 3 ms. Remains 22 /23 variables (removed 1) and now considering 34/35 (removed 1) transitions.
// Phase 1: matrix 34 rows 22 cols
[2023-03-12 15:55:02] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 15:55:02] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-12 15:55:02] [INFO ] Invariant cache hit.
[2023-03-12 15:55:02] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-12 15:55:02] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/32 places, 34/46 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 399 ms. Remains : 22/32 places, 34/46 transitions.
Stuttering acceptance computed with spot in 291 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s2 1) (EQ s11 1) (EQ s18 1)), p0:(AND (EQ s1 1) (EQ s2 1) (EQ s15 1) (EQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 17 steps with 4 reset in 2 ms.
FORMULA AutonomousCar-PT-02a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLFireability-00 finished in 802 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X((G(X(p2))||p1))&&X(p2))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 46/46 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 30 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 30 transition count 42
Applied a total of 4 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 30 cols
[2023-03-12 15:55:03] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 15:55:03] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-12 15:55:03] [INFO ] Invariant cache hit.
[2023-03-12 15:55:03] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-12 15:55:03] [INFO ] Implicit Places using invariants and state equation in 157 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 258 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 42/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 260 ms. Remains : 29/32 places, 42/46 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s10 1), p2:(AND (EQ s1 1) (EQ s2 1) (EQ s17 1) (EQ s24 1)), p1:(OR (EQ s10 1) (EQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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-02a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLFireability-01 finished in 545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)&&p1) U X((X(p2) U !p1))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 46/46 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 30 transition count 40
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 30 transition count 40
Applied a total of 4 rules in 3 ms. Remains 30 /32 variables (removed 2) and now considering 40/46 (removed 6) transitions.
[2023-03-12 15:55:03] [INFO ] Flow matrix only has 39 transitions (discarded 1 similar events)
// Phase 1: matrix 39 rows 30 cols
[2023-03-12 15:55:03] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 15:55:04] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-12 15:55:04] [INFO ] Flow matrix only has 39 transitions (discarded 1 similar events)
[2023-03-12 15:55:04] [INFO ] Invariant cache hit.
[2023-03-12 15:55:04] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 15:55:04] [INFO ] Implicit Places using invariants and state equation in 387 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 598 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 40/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 602 ms. Remains : 29/32 places, 40/46 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, p1, p1, p1, (OR (NOT p2) p1)]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p1:(EQ s20 1), p0:(OR (EQ s26 1) (AND (EQ s1 1) (EQ s5 1) (EQ s16 1) (EQ s23 1))), p2:(EQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 368 ms.
Product exploration explored 100000 steps with 50000 reset in 279 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p0))))
Knowledge based reduction with 8 factoid took 238 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-02a-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-02a-LTLFireability-04 finished in 1737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 46/46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 29 transition count 39
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 29 transition count 39
Applied a total of 6 rules in 2 ms. Remains 29 /32 variables (removed 3) and now considering 39/46 (removed 7) transitions.
// Phase 1: matrix 39 rows 29 cols
[2023-03-12 15:55:05] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 15:55:05] [INFO ] Implicit Places using invariants in 146 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 148 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/32 places, 39/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 151 ms. Remains : 28/32 places, 39/46 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s8 1) (EQ s16 1) (EQ s23 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]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLFireability-05 finished in 348 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 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 46/46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 29 transition count 39
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 29 transition count 39
Applied a total of 6 rules in 16 ms. Remains 29 /32 variables (removed 3) and now considering 39/46 (removed 7) transitions.
[2023-03-12 15:55:05] [INFO ] Invariant cache hit.
[2023-03-12 15:55:06] [INFO ] Implicit Places using invariants in 128 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 130 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/32 places, 39/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147 ms. Remains : 28/32 places, 39/46 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-06 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 s20 1), p0:(EQ s0 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 14581 reset in 213 ms.
Product exploration explored 100000 steps with 14532 reset in 219 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/28 stabilizing places and 2/39 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 484 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 6 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 579 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 310 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 39 rows 28 cols
[2023-03-12 15:55:08] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-12 15:55:08] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:08] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2023-03-12 15:55:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:55:08] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-12 15:55:08] [INFO ] Computed and/alt/rep : 26/92/26 causal constraints (skipped 12 transitions) in 4 ms.
[2023-03-12 15:55:08] [INFO ] Added : 0 causal constraints over 0 iterations in 37 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 2 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2023-03-12 15:55:08] [INFO ] Invariant cache hit.
[2023-03-12 15:55:09] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-12 15:55:09] [INFO ] Invariant cache hit.
[2023-03-12 15:55:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:55:09] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 120 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/28 places, 39/39 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 27/28 places, 39/39 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/27 stabilizing places and 2/39 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 510 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 8 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 736 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 39 rows 27 cols
[2023-03-12 15:55:10] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-12 15:55:10] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-12 15:55:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:10] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-12 15:55:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:55:10] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-12 15:55:10] [INFO ] Computed and/alt/rep : 26/90/26 causal constraints (skipped 12 transitions) in 5 ms.
[2023-03-12 15:55:11] [INFO ] Added : 0 causal constraints over 0 iterations in 33 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 14557 reset in 118 ms.
Product exploration explored 100000 steps with 14514 reset in 105 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 247 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 39/39 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 27 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 27 transition count 41
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 27 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 27 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 27 transition count 44
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 6 rules in 31 ms. Remains 27 /27 variables (removed 0) and now considering 44/39 (removed -5) transitions.
[2023-03-12 15:55:11] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 44 rows 27 cols
[2023-03-12 15:55:11] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-12 15:55:12] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/27 places, 44/39 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 235 ms. Remains : 27/27 places, 44/39 transitions.
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 39/39 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 27 cols
[2023-03-12 15:55:12] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 15:55:12] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-12 15:55:12] [INFO ] Invariant cache hit.
[2023-03-12 15:55:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:55:12] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-12 15:55:12] [INFO ] Invariant cache hit.
[2023-03-12 15:55:12] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 27/27 places, 39/39 transitions.
Treatment of property AutonomousCar-PT-02a-LTLFireability-06 finished in 6383 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&&(X(G(p1))||F(p2))))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 46/46 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 32 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 30 transition count 44
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 28 transition count 40
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 28 transition count 40
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 12 place count 26 transition count 38
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 14 place count 25 transition count 38
Applied a total of 14 rules in 4 ms. Remains 25 /32 variables (removed 7) and now considering 38/46 (removed 8) transitions.
// Phase 1: matrix 38 rows 25 cols
[2023-03-12 15:55:12] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 15:55:12] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-12 15:55:12] [INFO ] Invariant cache hit.
[2023-03-12 15:55:12] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-12 15:55:12] [INFO ] Implicit Places using invariants and state equation in 284 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 371 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/32 places, 38/46 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 37
Applied a total of 2 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 37/38 (removed 1) transitions.
// Phase 1: matrix 37 rows 23 cols
[2023-03-12 15:55:12] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 15:55:12] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-12 15:55:12] [INFO ] Invariant cache hit.
[2023-03-12 15:55:12] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-12 15:55:12] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/32 places, 37/46 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 497 ms. Remains : 23/32 places, 37/46 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s7 0), p2:(OR (EQ s1 0) (EQ s2 0) (EQ s15 0) (EQ s19 0)), p1:(AND (EQ s1 1) (EQ s2 1) (EQ s6 1) (EQ s19 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 130 ms.
Product exploration explored 100000 steps with 0 reset in 101 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 p0 p2 (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 916 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Finished random walk after 463 steps, including 39 resets, run visited all 6 properties in 28 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 12 factoid took 1199 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 37/37 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2023-03-12 15:55:16] [INFO ] Invariant cache hit.
[2023-03-12 15:55:16] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-12 15:55:16] [INFO ] Invariant cache hit.
[2023-03-12 15:55:16] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-12 15:55:16] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-12 15:55:16] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-12 15:55:16] [INFO ] Invariant cache hit.
[2023-03-12 15:55:16] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 335 ms. Remains : 23/23 places, 37/37 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 905 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Finished random walk after 552 steps, including 45 resets, run visited all 6 properties in 9 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p1) p0)), (F (AND (NOT p2) (NOT p0))), (F (NOT p0)), (F (AND (NOT p2) p1)), (F (AND (NOT p2) p0))]
Knowledge based reduction with 12 factoid took 888 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 2 reset in 95 ms.
Stuttering criterion allowed to conclude after 108 steps with 12 reset in 0 ms.
FORMULA AutonomousCar-PT-02a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLFireability-08 finished in 7016 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 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 46/46 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 32 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 30 transition count 44
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 27 transition count 37
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 37
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 24 transition count 34
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 2 with 2 rules applied. Total rules applied 18 place count 23 transition count 34
Applied a total of 18 rules in 7 ms. Remains 23 /32 variables (removed 9) and now considering 34/46 (removed 12) transitions.
// Phase 1: matrix 34 rows 23 cols
[2023-03-12 15:55:19] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 15:55:19] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-12 15:55:19] [INFO ] Invariant cache hit.
[2023-03-12 15:55:19] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-12 15:55:19] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 141 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/32 places, 34/46 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 33
Applied a total of 2 rules in 1 ms. Remains 21 /22 variables (removed 1) and now considering 33/34 (removed 1) transitions.
// Phase 1: matrix 33 rows 21 cols
[2023-03-12 15:55:19] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 15:55:19] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-12 15:55:19] [INFO ] Invariant cache hit.
[2023-03-12 15:55:19] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-12 15:55:19] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/32 places, 33/46 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 241 ms. Remains : 21/32 places, 33/46 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s1 1) (NEQ s4 1) (NEQ s10 1) (NEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7 reset in 53 ms.
Product exploration explored 100000 steps with 0 reset in 37 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 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Finished random walk after 672 steps, including 59 resets, run visited all 1 properties in 3 ms. (steps per millisecond=224 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 306 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-12 15:55:20] [INFO ] Invariant cache hit.
[2023-03-12 15:55:20] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-12 15:55:20] [INFO ] Invariant cache hit.
[2023-03-12 15:55:20] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-12 15:55:20] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-03-12 15:55:20] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-12 15:55:20] [INFO ] Invariant cache hit.
[2023-03-12 15:55:20] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 194 ms. Remains : 21/21 places, 33/33 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 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Finished random walk after 58 steps, including 5 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 95 ms.
Product exploration explored 100000 steps with 5 reset in 41 ms.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-12 15:55:21] [INFO ] Invariant cache hit.
[2023-03-12 15:55:21] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-12 15:55:21] [INFO ] Invariant cache hit.
[2023-03-12 15:55:21] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-12 15:55:21] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-12 15:55:21] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-12 15:55:21] [INFO ] Invariant cache hit.
[2023-03-12 15:55:21] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 329 ms. Remains : 21/21 places, 33/33 transitions.
Treatment of property AutonomousCar-PT-02a-LTLFireability-09 finished in 2621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(G((p1||F(p2))))))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 46/46 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 31 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 45
Applied a total of 2 rules in 3 ms. Remains 31 /32 variables (removed 1) and now considering 45/46 (removed 1) transitions.
// Phase 1: matrix 45 rows 31 cols
[2023-03-12 15:55:21] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-12 15:55:22] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-12 15:55:22] [INFO ] Invariant cache hit.
[2023-03-12 15:55:22] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-12 15:55:22] [INFO ] Implicit Places using invariants and state equation in 94 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 154 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 45/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 158 ms. Remains : 30/32 places, 45/46 transitions.
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (EQ s1 1) (EQ s2 1) (EQ s15 1) (EQ s25 1)), p1:(EQ s24 1), p2:(AND (EQ s1 1) (EQ s2 1) (EQ s10 1) (EQ s25 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]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-02a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLFireability-10 finished in 431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(p1))))'
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 46/46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 29 transition count 39
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 29 transition count 39
Applied a total of 6 rules in 2 ms. Remains 29 /32 variables (removed 3) and now considering 39/46 (removed 7) transitions.
// Phase 1: matrix 39 rows 29 cols
[2023-03-12 15:55:22] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 15:55:22] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-12 15:55:22] [INFO ] Invariant cache hit.
[2023-03-12 15:55:22] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 15:55:22] [INFO ] Implicit Places using invariants and state equation in 143 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 307 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/32 places, 39/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 310 ms. Remains : 28/32 places, 39/46 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s26 1), p0:(AND (EQ s1 1) (EQ s5 1) (EQ s10 1) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLFireability-11 finished in 536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X((p0 U (F(!X(X(!p1)))||p2))) U !p1))'
Support contains 8 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 46/46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 29 transition count 39
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 29 transition count 39
Applied a total of 6 rules in 0 ms. Remains 29 /32 variables (removed 3) and now considering 39/46 (removed 7) transitions.
[2023-03-12 15:55:22] [INFO ] Invariant cache hit.
[2023-03-12 15:55:22] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-12 15:55:22] [INFO ] Invariant cache hit.
[2023-03-12 15:55:23] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 15:55:23] [INFO ] Implicit Places using invariants and state equation in 94 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 124 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/32 places, 39/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 125 ms. Remains : 28/32 places, 39/46 transitions.
Stuttering acceptance computed with spot in 338 ms :[p1, (OR p1 p2), true, p1, (OR p1 p2), p1]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 2}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=p2, acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 2}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (NEQ s1 1) (NEQ s5 1) (NEQ s12 1) (NEQ s23 1)), p2:(AND (EQ s1 1) (EQ s5 1) (EQ s10 1) (EQ s23 1)), p0:(AND (EQ s9 1) (EQ s15 1) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLFireability-12 finished in 482 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 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 46/46 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 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 3 rules applied. Total rules applied 3 place count 30 transition count 43
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 28 transition count 43
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 7 place count 26 transition count 37
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 26 transition count 37
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 16 place count 22 transition count 34
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 22 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 21 transition count 33
Applied a total of 18 rules in 7 ms. Remains 21 /32 variables (removed 11) and now considering 33/46 (removed 13) transitions.
[2023-03-12 15:55:23] [INFO ] Flow matrix only has 32 transitions (discarded 1 similar events)
// Phase 1: matrix 32 rows 21 cols
[2023-03-12 15:55:23] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-12 15:55:23] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-12 15:55:23] [INFO ] Flow matrix only has 32 transitions (discarded 1 similar events)
[2023-03-12 15:55:23] [INFO ] Invariant cache hit.
[2023-03-12 15:55:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:55:23] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-12 15:55:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 15:55:23] [INFO ] Flow matrix only has 32 transitions (discarded 1 similar events)
[2023-03-12 15:55:23] [INFO ] Invariant cache hit.
[2023-03-12 15:55:23] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/32 places, 33/46 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 224 ms. Remains : 21/32 places, 33/46 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s14 0), p0:(EQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 38 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-02a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLFireability-13 finished in 341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G((p1 U p2))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 46/46 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 30 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 30 transition count 42
Applied a total of 4 rules in 0 ms. Remains 30 /32 variables (removed 2) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 30 cols
[2023-03-12 15:55:23] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 15:55:23] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-12 15:55:23] [INFO ] Invariant cache hit.
[2023-03-12 15:55:23] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-12 15:55:23] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 223 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 42/46 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 223 ms. Remains : 29/32 places, 42/46 transitions.
Stuttering acceptance computed with spot in 400 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(OR p2 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s5 1) (EQ s10 1) (EQ s24 1)), p1:(EQ s22 1), p0:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLFireability-15 finished in 639 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))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-12 15:55:24] [INFO ] Flatten gal took : 12 ms
[2023-03-12 15:55:24] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-12 15:55:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 46 transitions and 222 arcs took 1 ms.
Total runtime 25169 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1478/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1478/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutonomousCar-PT-02a-LTLFireability-06
Could not compute solution for formula : AutonomousCar-PT-02a-LTLFireability-09

BK_STOP 1678636525452

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

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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