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.r005-oct2-167813593300564.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 itstools
Input is AutonomousCar-PT-03a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593300564
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K 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 42K 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-03a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678520405705

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-03a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 07:40:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 07:40:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:40:08] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2023-03-11 07:40:08] [INFO ] Transformed 41 places.
[2023-03-11 07:40:08] [INFO ] Transformed 121 transitions.
[2023-03-11 07:40:08] [INFO ] Found NUPN structural information;
[2023-03-11 07:40:08] [INFO ] Parsed PT model containing 41 places and 121 transitions and 745 arcs in 116 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA AutonomousCar-PT-03a-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 76/76 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 40 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 40 transition count 75
Applied a total of 2 rules in 36 ms. Remains 40 /41 variables (removed 1) and now considering 75/76 (removed 1) transitions.
// Phase 1: matrix 75 rows 40 cols
[2023-03-11 07:40:08] [INFO ] Computed 7 place invariants in 10 ms
[2023-03-11 07:40:08] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-11 07:40:08] [INFO ] Invariant cache hit.
[2023-03-11 07:40:08] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-11 07:40:08] [INFO ] Implicit Places using invariants and state equation in 146 ms returned [36, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 447 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 38/41 places, 75/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 486 ms. Remains : 38/41 places, 75/76 transitions.
Support contains 26 out of 38 places after structural reductions.
[2023-03-11 07:40:09] [INFO ] Flatten gal took : 46 ms
[2023-03-11 07:40:09] [INFO ] Flatten gal took : 13 ms
[2023-03-11 07:40:09] [INFO ] Input system was already deterministic with 75 transitions.
Incomplete random walk after 10000 steps, including 584 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 23) seen :21
Incomplete Best-First random walk after 10001 steps, including 148 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 75 rows 38 cols
[2023-03-11 07:40:09] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-11 07:40:09] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 07:40:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-11 07:40:09] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-11 07:40:09] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-11 07:40:09] [INFO ] After 12ms SMT Verify possible using 39 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-11 07:40:09] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-11 07:40:09] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 75/75 transitions.
Graph (complete) has 182 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 37 transition count 67
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 32 transition count 67
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 29 transition count 55
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 29 transition count 55
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 26 transition count 52
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 26 transition count 49
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 40 place count 23 transition count 40
Applied a total of 40 rules in 30 ms. Remains 23 /38 variables (removed 15) and now considering 40/75 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 23/38 places, 40/75 transitions.
Finished random walk after 3834 steps, including 131 resets, run visited all 1 properties in 10 ms. (steps per millisecond=383 )
FORMULA AutonomousCar-PT-03a-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 3 stabilizing places and 2 stable transitions
FORMULA AutonomousCar-PT-03a-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 36 transition count 70
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 32 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 31 transition count 69
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 31 transition count 68
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 13 place count 30 transition count 68
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 16 place count 27 transition count 56
Iterating global reduction 3 with 3 rules applied. Total rules applied 19 place count 27 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 25 transition count 54
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 25 place count 24 transition count 54
Applied a total of 25 rules in 19 ms. Remains 24 /38 variables (removed 14) and now considering 54/75 (removed 21) transitions.
// Phase 1: matrix 54 rows 24 cols
[2023-03-11 07:40:10] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-11 07:40:10] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-11 07:40:10] [INFO ] Invariant cache hit.
[2023-03-11 07:40:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 07:40:10] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-11 07:40:10] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-11 07:40:10] [INFO ] Invariant cache hit.
[2023-03-11 07:40:10] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/38 places, 54/75 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 340 ms. Remains : 24/38 places, 54/75 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 252 ms.
Product exploration explored 100000 steps with 50000 reset in 216 ms.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-03a-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-03a-LTLFireability-00 finished in 1237 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 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 38 transition count 71
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 34 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 33 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 33 transition count 69
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 32 transition count 69
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 15 place count 29 transition count 57
Iterating global reduction 3 with 3 rules applied. Total rules applied 18 place count 29 transition count 57
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 27 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 26 transition count 55
Applied a total of 24 rules in 21 ms. Remains 26 /38 variables (removed 12) and now considering 55/75 (removed 20) transitions.
// Phase 1: matrix 55 rows 26 cols
[2023-03-11 07:40:11] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-11 07:40:11] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-11 07:40:11] [INFO ] Invariant cache hit.
[2023-03-11 07:40:11] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-11 07:40:11] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-11 07:40:11] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-11 07:40:11] [INFO ] Invariant cache hit.
[2023-03-11 07:40:11] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/38 places, 55/75 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 281 ms. Remains : 26/38 places, 55/75 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-02 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 s5 1) (NEQ s14 1) (NEQ s22 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 1 reset in 122 ms.
Product exploration explored 100000 steps with 26 reset in 113 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 136 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 112 ms :[(NOT p0), (NOT p0)]
Finished random walk after 39 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 254 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 147 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 55/55 transitions.
Applied a total of 0 rules in 6 ms. Remains 26 /26 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2023-03-11 07:40:12] [INFO ] Invariant cache hit.
[2023-03-11 07:40:13] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-11 07:40:13] [INFO ] Invariant cache hit.
[2023-03-11 07:40:13] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-11 07:40:13] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-11 07:40:13] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-11 07:40:13] [INFO ] Invariant cache hit.
[2023-03-11 07:40:13] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 557 ms. Remains : 26/26 places, 55/55 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 180 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 160 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 252 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 131 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 18 reset in 82 ms.
Product exploration explored 100000 steps with 1 reset in 167 ms.
Built C files in :
/tmp/ltsmin10484385240125739403
[2023-03-11 07:40:14] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2023-03-11 07:40:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:40:14] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2023-03-11 07:40:14] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:40:14] [INFO ] Computing Do-Not-Accords matrix : 55 transitions.
[2023-03-11 07:40:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:40:14] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10484385240125739403
Running compilation step : cd /tmp/ltsmin10484385240125739403;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 432 ms.
Running link step : cd /tmp/ltsmin10484385240125739403;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin10484385240125739403;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased726620430746020745.hoa' '--buchi-type=spotba'
LTSmin run took 212 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-03a-LTLFireability-02 finished in 4126 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(F((!p1 U (p2||G(!p1))))))))'
Support contains 8 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 38 transition count 71
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 34 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 34 transition count 70
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 10 place count 33 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 32 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 32 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 31 transition count 65
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 30 transition count 65
Applied a total of 16 rules in 19 ms. Remains 30 /38 variables (removed 8) and now considering 65/75 (removed 10) transitions.
// Phase 1: matrix 65 rows 30 cols
[2023-03-11 07:40:15] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-11 07:40:15] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-11 07:40:15] [INFO ] Invariant cache hit.
[2023-03-11 07:40:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-11 07:40:15] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-03-11 07:40:15] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-11 07:40:15] [INFO ] Invariant cache hit.
[2023-03-11 07:40:15] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/38 places, 65/75 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 294 ms. Remains : 30/38 places, 65/75 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s1 1) (EQ s5 1) (EQ s22 1) (EQ s26 1))) (NOT (AND (EQ s1 1) (EQ s2 1) (EQ s16 1) (EQ s26 1)))), p1:(AND (EQ s1 1) (EQ s2 1) (EQ s16 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14 reset in 168 ms.
Product exploration explored 100000 steps with 0 reset in 125 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 p2 (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 730 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 808 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 157 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 159 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 07:40:17] [INFO ] Invariant cache hit.
[2023-03-11 07:40:17] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-11 07:40:17] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-11 07:40:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-11 07:40:17] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-11 07:40:17] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-11 07:40:17] [INFO ] After 59ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-11 07:40:17] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-11 07:40:17] [INFO ] After 187ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 65/65 transitions.
Graph (complete) has 174 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 29 transition count 62
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 29 transition count 60
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 27 transition count 54
Applied a total of 13 rules in 8 ms. Remains 27 /30 variables (removed 3) and now considering 54/65 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 27/30 places, 54/65 transitions.
Finished random walk after 3693 steps, including 185 resets, run visited all 1 properties in 41 ms. (steps per millisecond=90 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 10 factoid took 875 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 131 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 6 out of 30 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 : 30/30 places, 65/65 transitions.
Applied a total of 0 rules in 7 ms. Remains 30 /30 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-11 07:40:18] [INFO ] Invariant cache hit.
[2023-03-11 07:40:18] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-11 07:40:19] [INFO ] Invariant cache hit.
[2023-03-11 07:40:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-11 07:40:19] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2023-03-11 07:40:19] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-11 07:40:19] [INFO ] Invariant cache hit.
[2023-03-11 07:40:19] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 582 ms. Remains : 30/30 places, 65/65 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 327 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Finished random walk after 1507 steps, including 122 resets, run visited all 2 properties in 9 ms. (steps per millisecond=167 )
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 443 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 148 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 143 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 1 reset in 82 ms.
Product exploration explored 100000 steps with 18 reset in 125 ms.
Built C files in :
/tmp/ltsmin3270970705483536256
[2023-03-11 07:40:20] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2023-03-11 07:40:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:40:20] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2023-03-11 07:40:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:40:21] [INFO ] Computing Do-Not-Accords matrix : 65 transitions.
[2023-03-11 07:40:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:40:21] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3270970705483536256
Running compilation step : cd /tmp/ltsmin3270970705483536256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 234 ms.
Running link step : cd /tmp/ltsmin3270970705483536256;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin3270970705483536256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5186023191921051142.hoa' '--buchi-type=spotba'
LTSmin run took 130 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-03a-LTLFireability-04 finished in 5965 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)&&(X(F(p1))||G(p2))))'
Support contains 9 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 36 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 36 transition count 67
Applied a total of 4 rules in 2 ms. Remains 36 /38 variables (removed 2) and now considering 67/75 (removed 8) transitions.
// Phase 1: matrix 67 rows 36 cols
[2023-03-11 07:40:21] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-11 07:40:21] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-11 07:40:21] [INFO ] Invariant cache hit.
[2023-03-11 07:40:21] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-11 07:40:21] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2023-03-11 07:40:21] [INFO ] Invariant cache hit.
[2023-03-11 07:40:21] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/38 places, 67/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 36/38 places, 67/75 transitions.
Stuttering acceptance computed with spot in 350 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (OR (EQ s11 1) (AND (EQ s1 1) (EQ s4 1) (EQ s31 1) (EQ s34 1))) (EQ s1 1) (EQ s5 1) (EQ s15 1) (EQ s31 1)), p0:(AND (EQ s1 1) (EQ s6 1) (EQ s17 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-05 finished in 605 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 (F(G(!p0))||(X(!p1) U ((X(!p1)&&G(p2))||X(G(!p1)))))))'
Support contains 7 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 37 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 37 transition count 71
Applied a total of 2 rules in 1 ms. Remains 37 /38 variables (removed 1) and now considering 71/75 (removed 4) transitions.
// Phase 1: matrix 71 rows 37 cols
[2023-03-11 07:40:22] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-11 07:40:22] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-11 07:40:22] [INFO ] Invariant cache hit.
[2023-03-11 07:40:22] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-11 07:40:22] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2023-03-11 07:40:22] [INFO ] Invariant cache hit.
[2023-03-11 07:40:22] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 37/38 places, 71/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 407 ms. Remains : 37/38 places, 71/75 transitions.
Stuttering acceptance computed with spot in 645 ms :[(AND p1 p0), (AND p0 p1), (AND p1 p0 (NOT p2)), (AND p0 p1), (AND p0 p1), (AND p1 p0 (NOT p2)), p0, (AND p0 p1 (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1, 2} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={2} source=1 dest: 2}, { cond=(AND p0 p2 p1), acceptance={0, 2} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1, 2} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={2} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={0, 2} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 p1), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1, 2} source=3 dest: 4}, { cond=(AND p0 p2 p1), acceptance={0, 2} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 p2 p1), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1, 2} source=4 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 p2 p1), acceptance={0, 2} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1, 2} source=5 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p2 p1), acceptance={0, 2} source=5 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={1, 2} source=6 dest: 6}, { cond=p0, acceptance={0, 1, 2} source=6 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 6}, { cond=(AND p2 p1), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 8}]], initial=4, aps=[p1:(AND (EQ s1 1) (EQ s6 1) (EQ s11 1) (EQ s32 1)), p0:(AND (EQ s1 1) (EQ s5 1) (EQ s24 1) (EQ s32 1)), p2:(NEQ s22 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 32202 reset in 270 ms.
Product exploration explored 100000 steps with 33374 reset in 257 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) p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 32 factoid took 2324 ms. Reduced automaton from 9 states, 49 edges and 3 AP (stutter sensitive) to 7 states, 27 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 488 ms :[(AND p1 p0), (AND p0 p1), (AND p1 p0 (NOT p2)), (AND p1 p0 (NOT p2)), p0, (AND p0 p1 (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 587 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 07:40:26] [INFO ] Invariant cache hit.
[2023-03-11 07:40:26] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-11 07:40:26] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-11 07:40:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-11 07:40:26] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p1))), (G (NOT (AND p0 p2 p1))), (G (NOT (AND p0 (NOT p2) p1))), (G (NOT (AND p0 (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p2 p1)), (F (NOT p2)), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (AND p0 p2 (NOT p1))), (F (AND p2 p1)), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F p1), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p2) p1)), (F p0)]
Knowledge based reduction with 35 factoid took 3021 ms. Reduced automaton from 7 states, 27 edges and 3 AP (stutter sensitive) to 7 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 431 ms :[false, (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p2), false, false]
Stuttering acceptance computed with spot in 441 ms :[false, (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p2), false, false]
Support contains 7 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 71/71 transitions.
Applied a total of 0 rules in 0 ms. Remains 37 /37 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2023-03-11 07:40:30] [INFO ] Invariant cache hit.
[2023-03-11 07:40:30] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-11 07:40:30] [INFO ] Invariant cache hit.
[2023-03-11 07:40:30] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-11 07:40:30] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-03-11 07:40:30] [INFO ] Invariant cache hit.
[2023-03-11 07:40:31] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 236 ms. Remains : 37/37 places, 71/71 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p1 p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 1503 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter sensitive) to 7 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 484 ms :[false, (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p2), false, false]
Incomplete random walk after 10000 steps, including 583 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 10000 steps, including 135 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 07:40:33] [INFO ] Invariant cache hit.
[2023-03-11 07:40:33] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-11 07:40:33] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p1 p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (G (NOT (AND p0 p1))), (G (OR p2 (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (NOT p2)), (F (NOT (AND p2 (NOT p0) (NOT p1)))), (F (AND (NOT p2) p1)), (F (NOT (AND p2 (NOT p1)))), (F (AND p2 (NOT p0) p1)), (F (AND p2 p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p2) (NOT p1))), (F (AND p2 p0)), (F p0)]
Knowledge based reduction with 22 factoid took 2187 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter sensitive) to 7 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 485 ms :[(AND p1 p0), (AND p0 p1), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), p0, (AND p0 p1 (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 490 ms :[(AND p1 p0), (AND p0 p1), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), p0, (AND p0 p1 (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 486 ms :[(AND p1 p0), (AND p0 p1), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), p0, (AND p0 p1 (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 7374 reset in 160 ms.
Product exploration explored 100000 steps with 11086 reset in 197 ms.
Applying partial POR strategy [true, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 446 ms :[(AND p1 p0), (AND p0 p1), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), p0, (AND p0 p1 (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Support contains 7 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 71/71 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 37 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 37 transition count 73
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 37 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 37 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 36 transition count 72
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 36 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 36 transition count 75
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 11 rules in 6 ms. Remains 36 /37 variables (removed 1) and now considering 75/71 (removed -4) transitions.
[2023-03-11 07:40:38] [INFO ] Redundant transitions in 91 ms returned []
// Phase 1: matrix 75 rows 36 cols
[2023-03-11 07:40:38] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-11 07:40:38] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/37 places, 75/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 361 ms. Remains : 36/37 places, 75/71 transitions.
Built C files in :
/tmp/ltsmin4520224175976701004
[2023-03-11 07:40:38] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4520224175976701004
Running compilation step : cd /tmp/ltsmin4520224175976701004;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 199 ms.
Running link step : cd /tmp/ltsmin4520224175976701004;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin4520224175976701004;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10290206412153363612.hoa' '--buchi-type=spotba'
LTSmin run took 688 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-03a-LTLFireability-06 finished in 17361 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 !p1)||G(p2)) U G(p1))))'
Support contains 10 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 37 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 37 transition count 71
Applied a total of 2 rules in 1 ms. Remains 37 /38 variables (removed 1) and now considering 71/75 (removed 4) transitions.
// Phase 1: matrix 71 rows 37 cols
[2023-03-11 07:40:39] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-11 07:40:39] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-11 07:40:39] [INFO ] Invariant cache hit.
[2023-03-11 07:40:39] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-11 07:40:39] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-11 07:40:39] [INFO ] Invariant cache hit.
[2023-03-11 07:40:39] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 37/38 places, 71/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 37/38 places, 71/75 transitions.
Stuttering acceptance computed with spot in 387 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false, true, (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p1 p0) (AND p1 p2)), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 6}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s5 1) (EQ s16 1) (EQ s32 1)), p0:(AND (EQ s13 1) (EQ s20 1) (EQ s26 1) (EQ s33 1)), p2:(AND (EQ s1 1) (EQ s6 1) (EQ s9 1) (EQ s32 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-07 finished in 564 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(X(G(p0)))))'
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 35 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 35 transition count 63
Applied a total of 6 rules in 2 ms. Remains 35 /38 variables (removed 3) and now considering 63/75 (removed 12) transitions.
// Phase 1: matrix 63 rows 35 cols
[2023-03-11 07:40:39] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-11 07:40:40] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-11 07:40:40] [INFO ] Invariant cache hit.
[2023-03-11 07:40:40] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-11 07:40:40] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-03-11 07:40:40] [INFO ] Invariant cache hit.
[2023-03-11 07:40:40] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 35/38 places, 63/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 442 ms. Remains : 35/38 places, 63/75 transitions.
Stuttering acceptance computed with spot in 286 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s1 0) (EQ s5 0) (EQ s7 0) (EQ s30 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 30 steps with 1 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-09 finished in 753 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)))'
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 36 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 36 transition count 67
Applied a total of 4 rules in 2 ms. Remains 36 /38 variables (removed 2) and now considering 67/75 (removed 8) transitions.
// Phase 1: matrix 67 rows 36 cols
[2023-03-11 07:40:40] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-11 07:40:40] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-11 07:40:40] [INFO ] Invariant cache hit.
[2023-03-11 07:40:40] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-11 07:40:40] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-03-11 07:40:40] [INFO ] Invariant cache hit.
[2023-03-11 07:40:40] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/38 places, 67/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 236 ms. Remains : 36/38 places, 67/75 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s1 1) (NEQ s2 1) (NEQ s9 1) (NEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 12 reset in 131 ms.
Product exploration explored 100000 steps with 9 reset in 96 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 238 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 42 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 184 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 36 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 67/67 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2023-03-11 07:40:42] [INFO ] Invariant cache hit.
[2023-03-11 07:40:42] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-11 07:40:42] [INFO ] Invariant cache hit.
[2023-03-11 07:40:42] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-11 07:40:42] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-11 07:40:42] [INFO ] Invariant cache hit.
[2023-03-11 07:40:42] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 225 ms. Remains : 36/36 places, 67/67 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 245 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 341 steps, including 22 resets, run visited all 1 properties in 2 ms. (steps per millisecond=170 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 185 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 56 steps with 3 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-10 finished in 2667 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 U p1))))'
Support contains 5 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 36 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 36 transition count 67
Applied a total of 4 rules in 2 ms. Remains 36 /38 variables (removed 2) and now considering 67/75 (removed 8) transitions.
// Phase 1: matrix 67 rows 36 cols
[2023-03-11 07:40:43] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-11 07:40:43] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-11 07:40:43] [INFO ] Invariant cache hit.
[2023-03-11 07:40:43] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-11 07:40:43] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-11 07:40:43] [INFO ] Invariant cache hit.
[2023-03-11 07:40:43] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/38 places, 67/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 296 ms. Remains : 36/38 places, 67/75 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(AND (EQ s1 1) (EQ s5 1) (EQ s15 1) (EQ s31 1)), p0:(NEQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-12 finished in 562 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 5 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 38 transition count 72
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 35 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 34 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 34 transition count 70
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 10 place count 33 transition count 70
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 13 place count 30 transition count 58
Iterating global reduction 3 with 3 rules applied. Total rules applied 16 place count 30 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 28 transition count 56
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 22 place count 27 transition count 56
Applied a total of 22 rules in 18 ms. Remains 27 /38 variables (removed 11) and now considering 56/75 (removed 19) transitions.
// Phase 1: matrix 56 rows 27 cols
[2023-03-11 07:40:44] [INFO ] Computed 5 place invariants in 9 ms
[2023-03-11 07:40:44] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-11 07:40:44] [INFO ] Invariant cache hit.
[2023-03-11 07:40:44] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-11 07:40:44] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-11 07:40:44] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-11 07:40:44] [INFO ] Invariant cache hit.
[2023-03-11 07:40:44] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/38 places, 56/75 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 323 ms. Remains : 27/38 places, 56/75 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s4 1) (EQ s14 1) (EQ s23 1)), p1:(EQ s17 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-15 finished in 421 ms.
All properties solved by simple procedures.
Total runtime 36397 ms.

BK_STOP 1678520444797

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-03a"
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-5348"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-03a, 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 r005-oct2-167813593300564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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