Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872900412.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutonomousCar-PT-01a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872900412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.6K Jun 7 15:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 7 15:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 7 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 7 15:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 3 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Jun 3 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 3 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 3 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 9.6K Jun 7 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Jun 7 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Jun 7 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Jun 7 15:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 11K Jun 3 16:02 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-01a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654897806748

Running Version 202205111006
[2022-06-10 21:50:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 21:50:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 21:50:08] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2022-06-10 21:50:08] [INFO ] Transformed 25 places.
[2022-06-10 21:50:08] [INFO ] Transformed 35 transitions.
[2022-06-10 21:50:08] [INFO ] Found NUPN structural information;
[2022-06-10 21:50:08] [INFO ] Parsed PT model containing 25 places and 35 transitions in 279 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
FORMULA AutonomousCar-PT-01a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01a-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 26/26 transitions.
Applied a total of 0 rules in 21 ms. Remains 25 /25 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2022-06-10 21:50:09] [INFO ] Flow matrix only has 25 transitions (discarded 1 similar events)
// Phase 1: matrix 25 rows 25 cols
[2022-06-10 21:50:09] [INFO ] Computed 6 place invariants in 10 ms
[2022-06-10 21:50:09] [INFO ] Implicit Places using invariants in 212 ms returned []
[2022-06-10 21:50:09] [INFO ] Flow matrix only has 25 transitions (discarded 1 similar events)
// Phase 1: matrix 25 rows 25 cols
[2022-06-10 21:50:09] [INFO ] Computed 6 place invariants in 3 ms
[2022-06-10 21:50:09] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-06-10 21:50:09] [INFO ] Implicit Places using invariants and state equation in 106 ms returned [20, 23]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 394 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 23/25 places, 26/26 transitions.
Support contains 18 out of 23 places after structural reductions.
[2022-06-10 21:50:09] [INFO ] Flatten gal took : 46 ms
[2022-06-10 21:50:10] [INFO ] Flatten gal took : 15 ms
[2022-06-10 21:50:10] [INFO ] Input system was already deterministic with 26 transitions.
Support contains 17 out of 23 places (down from 18) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 843 resets, run finished after 628 ms. (steps per millisecond=15 ) properties (out of 21) seen :19
Incomplete Best-First random walk after 10001 steps, including 342 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 215 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-10 21:50:10] [INFO ] Flow matrix only has 25 transitions (discarded 1 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-06-10 21:50:10] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 21:50:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-06-10 21:50:11] [INFO ] After 99ms 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.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA AutonomousCar-PT-01a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 26/26 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 23 transition count 24
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 21 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 20 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 20 transition count 22
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 8 place count 19 transition count 22
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 9 place count 18 transition count 21
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 18 transition count 21
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 12 place count 17 transition count 20
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 14 place count 16 transition count 20
Applied a total of 14 rules in 27 ms. Remains 16 /23 variables (removed 7) and now considering 20/26 (removed 6) transitions.
// Phase 1: matrix 20 rows 16 cols
[2022-06-10 21:50:11] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:50:11] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 20 rows 16 cols
[2022-06-10 21:50:11] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 21:50:11] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-10 21:50:11] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2022-06-10 21:50:11] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 20 rows 16 cols
[2022-06-10 21:50:11] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-10 21:50:11] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/23 places, 20/26 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/23 places, 20/26 transitions.
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s1 0) (EQ s2 0) (EQ s6 0) (EQ s12 0)), p0:(OR (EQ s1 0) (EQ s2 0) (EQ s9 0) (EQ s12 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1 reset in 423 ms.
Product exploration explored 100000 steps with 1 reset in 174 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 269 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1197 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 601 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 20 rows 16 cols
[2022-06-10 21:50:13] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-10 21:50:13] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 21:50:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 21:50:13] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 205 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-01a-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-01a-LTLFireability-00 finished in 1933 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X(p0))||G(p1))))'
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 26/26 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 21 transition count 23
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 21 transition count 23
Applied a total of 4 rules in 2 ms. Remains 21 /23 variables (removed 2) and now considering 23/26 (removed 3) transitions.
// Phase 1: matrix 23 rows 21 cols
[2022-06-10 21:50:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:50:13] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 23 rows 21 cols
[2022-06-10 21:50:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 21:50:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-06-10 21:50:13] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 21 cols
[2022-06-10 21:50:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:50:13] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 23/26 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/23 places, 23/26 transitions.
Stuttering acceptance computed with spot in 287 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=3, aps=[p0:(AND (EQ s1 1) (EQ s4 1) (EQ s16 1) (EQ s20 1)), p1:(AND (EQ s1 1) (EQ s2 1) (EQ s9 1) (EQ s16 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][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-01a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01a-LTLFireability-01 finished in 452 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 26/26 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 21 transition count 23
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 21 transition count 23
Applied a total of 4 rules in 1 ms. Remains 21 /23 variables (removed 2) and now considering 23/26 (removed 3) transitions.
// Phase 1: matrix 23 rows 21 cols
[2022-06-10 21:50:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:50:13] [INFO ] Implicit Places using invariants in 41 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 23/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 23/23 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/23 places, 23/26 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01a-LTLFireability-02 finished in 143 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(F(G(p0)))&&p1))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2022-06-10 21:50:14] [INFO ] Flow matrix only has 25 transitions (discarded 1 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-06-10 21:50:14] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 21:50:14] [INFO ] Implicit Places using invariants in 52 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 22/23 places, 26/26 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s13 1) (EQ s6 1)), p0:(EQ s19 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, 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-01a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01a-LTLFireability-04 finished in 235 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 26/26 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 20 transition count 24
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 20 transition count 23
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 5 place count 19 transition count 23
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 7 place count 17 transition count 20
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 17 transition count 20
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 11 place count 16 transition count 19
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 13 place count 15 transition count 19
Applied a total of 13 rules in 10 ms. Remains 15 /23 variables (removed 8) and now considering 19/26 (removed 7) transitions.
// Phase 1: matrix 19 rows 15 cols
[2022-06-10 21:50:14] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 21:50:14] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 19 rows 15 cols
[2022-06-10 21:50:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 21:50:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 21:50:14] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2022-06-10 21:50:14] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 19 rows 15 cols
[2022-06-10 21:50:14] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 21:50:14] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/23 places, 19/26 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/23 places, 19/26 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s3 0), p0:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01a-LTLFireability-05 finished in 239 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(X(F(X((G(p0)&&!p1)))))||F(p2)) U G(p0)))'
Support contains 7 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 26/26 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 22 transition count 25
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 22 transition count 25
Applied a total of 2 rules in 2 ms. Remains 22 /23 variables (removed 1) and now considering 25/26 (removed 1) transitions.
// Phase 1: matrix 25 rows 22 cols
[2022-06-10 21:50:14] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 21:50:14] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 25 rows 22 cols
[2022-06-10 21:50:14] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:50:14] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-06-10 21:50:14] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 22 cols
[2022-06-10 21:50:14] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 21:50:14] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 25/26 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/23 places, 25/26 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s3 1), p2:(AND (EQ s11 1) (EQ s18 1)), p1:(AND (EQ s1 1) (EQ s2 1) (EQ s7 1) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 26 steps with 9 reset in 1 ms.
FORMULA AutonomousCar-PT-01a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01a-LTLFireability-06 finished in 416 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(((X(G(F(p0)))&&p1)||p2))||X(p2))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 26/26 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 21 transition count 23
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 21 transition count 23
Applied a total of 4 rules in 2 ms. Remains 21 /23 variables (removed 2) and now considering 23/26 (removed 3) transitions.
// Phase 1: matrix 23 rows 21 cols
[2022-06-10 21:50:14] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:50:14] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 23 rows 21 cols
[2022-06-10 21:50:14] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 21:50:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-06-10 21:50:15] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 21 cols
[2022-06-10 21:50:15] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:50:15] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 23/26 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/23 places, 23/26 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s9 0), p2:(EQ s9 1), p0:(OR (EQ s1 0) (EQ s2 0) (EQ s5 0) (EQ s16 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 218 ms.
Product exploration explored 100000 steps with 33333 reset in 216 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 p2) p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 365 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 867 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 384 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 23 rows 21 cols
[2022-06-10 21:50:16] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 21:50:16] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 21:50:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-06-10 21:50:16] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F (AND p1 (NOT p0) (NOT p2)))]
Property proved to be true thanks to knowledge :(X (X (NOT (AND p1 (NOT p2)))))
Knowledge based reduction with 10 factoid took 429 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-01a-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-01a-LTLFireability-07 finished in 1907 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(F(p0))))))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 26/26 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 21 transition count 23
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 21 transition count 23
Applied a total of 4 rules in 2 ms. Remains 21 /23 variables (removed 2) and now considering 23/26 (removed 3) transitions.
// Phase 1: matrix 23 rows 21 cols
[2022-06-10 21:50:16] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:50:16] [INFO ] Implicit Places using invariants in 34 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 23/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 23/23 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/23 places, 23/26 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 19 steps with 2 reset in 0 ms.
FORMULA AutonomousCar-PT-01a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01a-LTLFireability-08 finished in 226 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 26/26 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 21 transition count 23
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 21 transition count 23
Applied a total of 4 rules in 1 ms. Remains 21 /23 variables (removed 2) and now considering 23/26 (removed 3) transitions.
// Phase 1: matrix 23 rows 21 cols
[2022-06-10 21:50:17] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:50:17] [INFO ] Implicit Places using invariants in 40 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 23/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 23/23 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/23 places, 23/26 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 33333 reset in 86 ms.
Product exploration explored 100000 steps with 33333 reset in 446 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 : [(NOT p0), (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-01a-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-01a-LTLFireability-09 finished in 776 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((p0 U p1))||X(X(X(p2)))))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 26/26 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 21 transition count 23
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 21 transition count 23
Applied a total of 4 rules in 1 ms. Remains 21 /23 variables (removed 2) and now considering 23/26 (removed 3) transitions.
// Phase 1: matrix 23 rows 21 cols
[2022-06-10 21:50:17] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 21:50:17] [INFO ] Implicit Places using invariants in 47 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 23/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 23/23 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/23 places, 23/26 transitions.
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}]], initial=1, aps=[p1:(EQ s14 1), p2:(AND (EQ s12 0) (EQ s14 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22215 reset in 119 ms.
Product exploration explored 100000 steps with 22237 reset in 134 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 (NOT p1) p2), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 21 steps, including 3 resets, run visited all 2 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p1) p2), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 20 cols
[2022-06-10 21:50:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 21:50:19] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 23 rows 20 cols
[2022-06-10 21:50:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 21:50:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:50:19] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 20 cols
[2022-06-10 21:50:19] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 21:50:19] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 23/23 transitions.
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 (NOT p1) p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 18 steps, including 2 resets, run visited all 2 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p1) p2), true]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 22247 reset in 85 ms.
Product exploration explored 100000 steps with 22188 reset in 100 ms.
Applying partial POR strategy [false, true, false, false, false]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 23/23 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 20 transition count 23
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 20 transition count 25
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 20 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 20 transition count 25
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 5 rules in 9 ms. Remains 20 /20 variables (removed 0) and now considering 25/23 (removed -2) transitions.
[2022-06-10 21:50:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 20 cols
[2022-06-10 21:50:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 21:50:21] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/20 places, 25/23 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 25/23 transitions.
Product exploration explored 100000 steps with 22221 reset in 195 ms.
Product exploration explored 100000 steps with 22210 reset in 226 ms.
Built C files in :
/tmp/ltsmin2542833225143676321
[2022-06-10 21:50:21] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2542833225143676321
Running compilation step : cd /tmp/ltsmin2542833225143676321;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 367 ms.
Running link step : cd /tmp/ltsmin2542833225143676321;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin2542833225143676321;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18141405240275411361.hoa' '--buchi-type=spotba'
LTSmin run took 432 ms.
FORMULA AutonomousCar-PT-01a-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-01a-LTLFireability-11 finished in 4769 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(!(p0 U !(!p1 U p2)))) U p0)))'
Support contains 1 out of 23 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 26/26 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 23 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 21 transition count 24
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 21 transition count 23
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 6 place count 20 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 19 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 19 transition count 22
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 10 place count 18 transition count 21
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 12 place count 17 transition count 21
Applied a total of 12 rules in 7 ms. Remains 17 /23 variables (removed 6) and now considering 21/26 (removed 5) transitions.
// Phase 1: matrix 21 rows 17 cols
[2022-06-10 21:50:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 21:50:22] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 21 rows 17 cols
[2022-06-10 21:50:22] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:50:22] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-10 21:50:22] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2022-06-10 21:50:22] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 21 rows 17 cols
[2022-06-10 21:50:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 21:50:22] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/23 places, 21/26 transitions.
Finished structural reductions, in 1 iterations. Remains : 17/23 places, 21/26 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-01a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01a-LTLFireability-12 finished in 241 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(X((!p0 U !G(p0)))))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 26/26 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 23 transition count 24
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 21 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 20 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 20 transition count 22
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 8 place count 19 transition count 22
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 10 place count 17 transition count 19
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 17 transition count 19
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 14 place count 16 transition count 18
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 16 place count 15 transition count 18
Applied a total of 16 rules in 33 ms. Remains 15 /23 variables (removed 8) and now considering 18/26 (removed 8) transitions.
// Phase 1: matrix 18 rows 15 cols
[2022-06-10 21:50:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 21:50:22] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 18 rows 15 cols
[2022-06-10 21:50:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 21:50:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-06-10 21:50:22] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2022-06-10 21:50:22] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 18 rows 15 cols
[2022-06-10 21:50:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 21:50:23] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/23 places, 18/26 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/23 places, 18/26 transitions.
Stuttering acceptance computed with spot in 88 ms :[p0, p0]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s2 1) (EQ s8 1) (EQ s11 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 6 reset in 69 ms.
Product exploration explored 100000 steps with 3 reset in 67 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 : [(NOT p0), (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 80 ms :[p0, p0]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 77 ms :[p0, p0]
Stuttering acceptance computed with spot in 79 ms :[p0, p0]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 15 cols
[2022-06-10 21:50:23] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 21:50:23] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 18 rows 15 cols
[2022-06-10 21:50:23] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:50:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-06-10 21:50:23] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2022-06-10 21:50:23] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 18 rows 15 cols
[2022-06-10 21:50:23] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:50:23] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 18/18 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 : [(NOT p0), (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 89 ms :[p0, p0]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 97 ms :[p0, p0]
Stuttering acceptance computed with spot in 90 ms :[p0, p0]
Stuttering acceptance computed with spot in 92 ms :[p0, p0]
Product exploration explored 100000 steps with 1 reset in 66 ms.
Product exploration explored 100000 steps with 2 reset in 72 ms.
Built C files in :
/tmp/ltsmin15988302227757034078
[2022-06-10 21:50:24] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2022-06-10 21:50:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 21:50:24] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2022-06-10 21:50:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 21:50:24] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2022-06-10 21:50:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 21:50:24] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15988302227757034078
Running compilation step : cd /tmp/ltsmin15988302227757034078;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 130 ms.
Running link step : cd /tmp/ltsmin15988302227757034078;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15988302227757034078;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3352635873827444856.hoa' '--buchi-type=spotba'
LTSmin run took 62 ms.
FORMULA AutonomousCar-PT-01a-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-01a-LTLFireability-13 finished in 2213 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)&&(G(X(p1))||p2)))||F(p3)))'
Support contains 8 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 26/26 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 22 transition count 25
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 22 transition count 25
Applied a total of 2 rules in 2 ms. Remains 22 /23 variables (removed 1) and now considering 25/26 (removed 1) transitions.
// Phase 1: matrix 25 rows 22 cols
[2022-06-10 21:50:25] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 21:50:25] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 25 rows 22 cols
[2022-06-10 21:50:25] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 21:50:25] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-06-10 21:50:25] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 22 cols
[2022-06-10 21:50:25] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:50:25] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 25/26 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/23 places, 25/26 transitions.
Stuttering acceptance computed with spot in 350 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p1)), (NOT p3)]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s6 1), p0:(EQ s10 0), p2:(AND (EQ s1 1) (EQ s2 1) (EQ s9 1) (EQ s17 1)), p1:(AND (EQ s11 1) (EQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-01a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01a-LTLFireability-15 finished in 524 ms.
All properties solved by simple procedures.
Total runtime 16934 ms.

BK_STOP 1654897825686

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-01a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-01a, 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 r294-smll-165463872900412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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