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-167813593300540.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-01b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593300540
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.7K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 12:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 11K Feb 25 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 12:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 12:55 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 31K 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-01b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678520163967

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-01b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 07:36:06] [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:36:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:36:07] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-11 07:36:07] [INFO ] Transformed 119 places.
[2023-03-11 07:36:07] [INFO ] Transformed 132 transitions.
[2023-03-11 07:36:07] [INFO ] Found NUPN structural information;
[2023-03-11 07:36:07] [INFO ] Parsed PT model containing 119 places and 132 transitions and 339 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-01b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-01b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 132/132 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 106 transition count 119
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 106 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 105 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 105 transition count 118
Applied a total of 28 rules in 21 ms. Remains 105 /119 variables (removed 14) and now considering 118/132 (removed 14) transitions.
// Phase 1: matrix 118 rows 105 cols
[2023-03-11 07:36:07] [INFO ] Computed 6 place invariants in 13 ms
[2023-03-11 07:36:07] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-11 07:36:07] [INFO ] Invariant cache hit.
[2023-03-11 07:36:07] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2023-03-11 07:36:07] [INFO ] Invariant cache hit.
[2023-03-11 07:36:09] [INFO ] Dead Transitions using invariants and state equation in 1165 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/119 places, 118/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1702 ms. Remains : 105/119 places, 118/132 transitions.
Support contains 33 out of 105 places after structural reductions.
[2023-03-11 07:36:09] [INFO ] Flatten gal took : 84 ms
[2023-03-11 07:36:09] [INFO ] Flatten gal took : 10 ms
[2023-03-11 07:36:09] [INFO ] Input system was already deterministic with 118 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 34) seen :25
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 07:36:10] [INFO ] Invariant cache hit.
[2023-03-11 07:36:10] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-11 07:36:10] [INFO ] After 119ms 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.
FORMULA AutonomousCar-PT-01b-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-01b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 27 stabilizing places and 28 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&F(p1)))||G(F(p2))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 118/118 transitions.
Graph (trivial) has 93 edges and 105 vertex of which 4 / 105 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 103 transition count 74
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 50 rules applied. Total rules applied 93 place count 61 transition count 66
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 99 place count 57 transition count 64
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 105 place count 55 transition count 60
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 107 place count 53 transition count 60
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 107 place count 53 transition count 56
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 115 place count 49 transition count 56
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 119 place count 45 transition count 52
Iterating global reduction 5 with 4 rules applied. Total rules applied 123 place count 45 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 127 place count 45 transition count 48
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 127 place count 45 transition count 46
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 131 place count 43 transition count 46
Performed 19 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 169 place count 24 transition count 26
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 172 place count 21 transition count 22
Iterating global reduction 6 with 3 rules applied. Total rules applied 175 place count 21 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 6 with 2 rules applied. Total rules applied 177 place count 20 transition count 21
Applied a total of 177 rules in 70 ms. Remains 20 /105 variables (removed 85) and now considering 21/118 (removed 97) transitions.
// Phase 1: matrix 21 rows 20 cols
[2023-03-11 07:36:11] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-11 07:36:11] [INFO ] Implicit Places using invariants in 484 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 485 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/105 places, 21/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 557 ms. Remains : 19/105 places, 21/118 transitions.
Stuttering acceptance computed with spot in 578 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s4 0), p2:(EQ s0 1), p1:(EQ s15 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3 reset in 220 ms.
Product exploration explored 100000 steps with 0 reset in 95 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Detected a total of 2/19 stabilizing places and 3/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 409 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1))]
Finished random walk after 21 steps, including 2 resets, run visited all 2 properties in 1 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 6 factoid took 570 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 275 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 186 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1))]
Support contains 3 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 19 cols
[2023-03-11 07:36:14] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-11 07:36:14] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-11 07:36:14] [INFO ] Invariant cache hit.
[2023-03-11 07:36:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 07:36:14] [INFO ] Implicit Places using invariants and state equation in 118 ms returned [13, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 206 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/19 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 209 ms. Remains : 17/19 places, 21/21 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Detected a total of 2/17 stabilizing places and 3/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 453 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1))]
Finished random walk after 9 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 6 factoid took 601 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 200 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1))]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-00 finished in 5383 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(p0)||X(p1)))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 118/118 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 99 transition count 112
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 99 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 99 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 96 transition count 105
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 96 transition count 105
Applied a total of 22 rules in 38 ms. Remains 96 /105 variables (removed 9) and now considering 105/118 (removed 13) transitions.
// Phase 1: matrix 105 rows 96 cols
[2023-03-11 07:36:16] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 07:36:16] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-11 07:36:16] [INFO ] Invariant cache hit.
[2023-03-11 07:36:16] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2023-03-11 07:36:16] [INFO ] Invariant cache hit.
[2023-03-11 07:36:16] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/105 places, 105/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 569 ms. Remains : 96/105 places, 105/118 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(EQ s76 0), p0:(EQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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]]
Product exploration explored 100000 steps with 50000 reset in 265 ms.
Product exploration explored 100000 steps with 50000 reset in 241 ms.
Computed a total of 25 stabilizing places and 26 stable transitions
Computed a total of 25 stabilizing places and 26 stable transitions
Detected a total of 25/96 stabilizing places and 26/105 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 215 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-01b-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-01b-LTLFireability-01 finished in 1501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G(p1) U X(!p0)))))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 118/118 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 98 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 98 transition count 111
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 98 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 95 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 95 transition count 104
Applied a total of 24 rules in 37 ms. Remains 95 /105 variables (removed 10) and now considering 104/118 (removed 14) transitions.
// Phase 1: matrix 104 rows 95 cols
[2023-03-11 07:36:17] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-11 07:36:18] [INFO ] Implicit Places using invariants in 614 ms returned []
[2023-03-11 07:36:18] [INFO ] Invariant cache hit.
[2023-03-11 07:36:18] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
[2023-03-11 07:36:18] [INFO ] Invariant cache hit.
[2023-03-11 07:36:18] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/105 places, 104/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1105 ms. Remains : 95/105 places, 104/118 transitions.
Stuttering acceptance computed with spot in 326 ms :[true, true, true, p0, p0, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s1 1), p1:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-02 finished in 1455 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&&(p1||X(F((p1&&F(p2)))))))))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 118/118 transitions.
Graph (trivial) has 92 edges and 105 vertex of which 4 / 105 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 102 transition count 73
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 53 rules applied. Total rules applied 96 place count 60 transition count 62
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 103 place count 54 transition count 61
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 106 place count 53 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 107 place count 52 transition count 59
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 107 place count 52 transition count 54
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 117 place count 47 transition count 54
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 121 place count 43 transition count 50
Iterating global reduction 5 with 4 rules applied. Total rules applied 125 place count 43 transition count 50
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 129 place count 43 transition count 46
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 129 place count 43 transition count 44
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 133 place count 41 transition count 44
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 163 place count 26 transition count 28
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 166 place count 23 transition count 24
Iterating global reduction 6 with 3 rules applied. Total rules applied 169 place count 23 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 170 place count 23 transition count 23
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 7 with 2 rules applied. Total rules applied 172 place count 22 transition count 22
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 174 place count 22 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 176 place count 20 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 177 place count 19 transition count 20
Applied a total of 177 rules in 11 ms. Remains 19 /105 variables (removed 86) and now considering 20/118 (removed 98) transitions.
// Phase 1: matrix 20 rows 19 cols
[2023-03-11 07:36:19] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-11 07:36:19] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-11 07:36:19] [INFO ] Invariant cache hit.
[2023-03-11 07:36:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 07:36:19] [INFO ] Implicit Places using invariants and state equation in 35 ms returned [14, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 130 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/105 places, 20/118 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 16 transition count 19
Applied a total of 2 rules in 3 ms. Remains 16 /17 variables (removed 1) and now considering 19/20 (removed 1) transitions.
// Phase 1: matrix 19 rows 16 cols
[2023-03-11 07:36:19] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 07:36:19] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-11 07:36:19] [INFO ] Invariant cache hit.
[2023-03-11 07:36:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:36:19] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/105 places, 19/118 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 279 ms. Remains : 16/105 places, 19/118 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s10 0), p1:(NEQ s3 1), p2:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 9 reset in 57 ms.
Product exploration explored 100000 steps with 2 reset in 135 ms.
Computed a total of 3 stabilizing places and 6 stable transitions
Computed a total of 3 stabilizing places and 6 stable transitions
Detected a total of 3/16 stabilizing places and 6/19 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (AND p1 (NOT p2))), (X p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 8 factoid took 916 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Finished random walk after 9 steps, including 0 resets, run visited all 6 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (AND p1 (NOT p2))), (X p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT (AND (NOT p2) p1))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))), (F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 984 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 19/19 transitions.
Applied a total of 0 rules in 6 ms. Remains 16 /16 variables (removed 0) and now considering 19/19 (removed 0) transitions.
[2023-03-11 07:36:22] [INFO ] Invariant cache hit.
[2023-03-11 07:36:22] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-11 07:36:22] [INFO ] Invariant cache hit.
[2023-03-11 07:36:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:36:22] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-11 07:36:22] [INFO ] Redundant transitions in 16 ms returned [14]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 18 rows 16 cols
[2023-03-11 07:36:22] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 07:36:22] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/16 places, 18/19 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 16
Applied a total of 2 rules in 4 ms. Remains 14 /16 variables (removed 2) and now considering 16/18 (removed 2) transitions.
// Phase 1: matrix 16 rows 14 cols
[2023-03-11 07:36:22] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 07:36:22] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-11 07:36:22] [INFO ] Invariant cache hit.
[2023-03-11 07:36:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:36:22] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/16 places, 16/19 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 404 ms. Remains : 14/16 places, 16/19 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Detected a total of 4/14 stabilizing places and 5/16 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X p0), (X (AND (NOT p2) p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 8 factoid took 813 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Finished random walk after 19 steps, including 3 resets, run visited all 6 properties in 1 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X p0), (X (AND (NOT p2) p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT (AND (NOT p2) p1))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))), (F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 963 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 8 reset in 125 ms.
Product exploration explored 100000 steps with 12 reset in 64 ms.
Built C files in :
/tmp/ltsmin1560592238835022683
[2023-03-11 07:36:25] [INFO ] Computing symmetric may disable matrix : 16 transitions.
[2023-03-11 07:36:25] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:36:25] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2023-03-11 07:36:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:36:25] [INFO ] Computing Do-Not-Accords matrix : 16 transitions.
[2023-03-11 07:36:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:36:25] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1560592238835022683
Running compilation step : cd /tmp/ltsmin1560592238835022683;'/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 344 ms.
Running link step : cd /tmp/ltsmin1560592238835022683;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin1560592238835022683;'/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/stateBased3691614368350899655.hoa' '--buchi-type=spotba'
LTSmin run took 167 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-01b-LTLFireability-03 finished in 7122 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((G(F(p1))||(F(p1)&&X(p2)))))||(F(p0)&&F((G(F(p1))||(F(p1)&&X(p2))))))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 118/118 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 98 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 98 transition count 111
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 98 transition count 107
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 96 transition count 105
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 96 transition count 105
Applied a total of 22 rules in 12 ms. Remains 96 /105 variables (removed 9) and now considering 105/118 (removed 13) transitions.
// Phase 1: matrix 105 rows 96 cols
[2023-03-11 07:36:26] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-11 07:36:26] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-11 07:36:26] [INFO ] Invariant cache hit.
[2023-03-11 07:36:26] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-11 07:36:26] [INFO ] Invariant cache hit.
[2023-03-11 07:36:26] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/105 places, 105/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 96/105 places, 105/118 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s57 1), p0:(EQ s12 1), p2:(NEQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33529 reset in 124 ms.
Product exploration explored 100000 steps with 33702 reset in 104 ms.
Computed a total of 25 stabilizing places and 26 stable transitions
Computed a total of 25 stabilizing places and 26 stable transitions
Detected a total of 25/96 stabilizing places and 26/105 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 11 factoid took 752 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 38 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 11 factoid took 690 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 96 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 105/105 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2023-03-11 07:36:28] [INFO ] Invariant cache hit.
[2023-03-11 07:36:29] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-11 07:36:29] [INFO ] Invariant cache hit.
[2023-03-11 07:36:29] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-11 07:36:29] [INFO ] Invariant cache hit.
[2023-03-11 07:36:29] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 709 ms. Remains : 96/96 places, 105/105 transitions.
Computed a total of 25 stabilizing places and 26 stable transitions
Computed a total of 25 stabilizing places and 26 stable transitions
Detected a total of 25/96 stabilizing places and 26/105 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 315 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 39 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 327 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25376 reset in 89 ms.
Product exploration explored 100000 steps with 25383 reset in 115 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 105/105 transitions.
Graph (trivial) has 87 edges and 96 vertex of which 4 / 96 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 94 transition count 103
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 42 place count 94 transition count 98
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 42 place count 94 transition count 99
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 51 place count 94 transition count 99
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 79 place count 66 transition count 71
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 107 place count 66 transition count 71
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 129 place count 66 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 66 transition count 74
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 149 place count 47 transition count 54
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 19 rules applied. Total rules applied 168 place count 47 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 170 place count 47 transition count 52
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 172 place count 45 transition count 50
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 174 place count 45 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 176 place count 45 transition count 56
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 176 rules in 25 ms. Remains 45 /96 variables (removed 51) and now considering 56/105 (removed 49) transitions.
[2023-03-11 07:36:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 56 rows 45 cols
[2023-03-11 07:36:31] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-11 07:36:32] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/96 places, 56/105 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 240 ms. Remains : 45/96 places, 56/105 transitions.
Built C files in :
/tmp/ltsmin10528351521723869409
[2023-03-11 07:36:32] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10528351521723869409
Running compilation step : cd /tmp/ltsmin10528351521723869409;'/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 162 ms.
Running link step : cd /tmp/ltsmin10528351521723869409;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin10528351521723869409;'/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/stateBased5142065592280112068.hoa' '--buchi-type=spotba'
LTSmin run took 1209 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-01b-LTLFireability-04 finished in 7315 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(p0))&&G(p1))))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 118/118 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 98 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 98 transition count 111
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 98 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 95 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 95 transition count 104
Applied a total of 24 rules in 3 ms. Remains 95 /105 variables (removed 10) and now considering 104/118 (removed 14) transitions.
// Phase 1: matrix 104 rows 95 cols
[2023-03-11 07:36:33] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 07:36:33] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-11 07:36:33] [INFO ] Invariant cache hit.
[2023-03-11 07:36:33] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-11 07:36:33] [INFO ] Invariant cache hit.
[2023-03-11 07:36:33] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/105 places, 104/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 281 ms. Remains : 95/105 places, 104/118 transitions.
Stuttering acceptance computed with spot in 247 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 3}]], initial=1, aps=[p1:(EQ s77 1), p0:(EQ s51 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, 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-01b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-06 finished in 543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((p1 U p2))||G(p3))))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 118/118 transitions.
Graph (trivial) has 89 edges and 105 vertex of which 4 / 105 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 102 transition count 77
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 46 rules applied. Total rules applied 85 place count 64 transition count 69
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 92 place count 60 transition count 66
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 7 rules applied. Total rules applied 99 place count 57 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 101 place count 55 transition count 62
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 101 place count 55 transition count 57
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 111 place count 50 transition count 57
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 115 place count 46 transition count 53
Iterating global reduction 5 with 4 rules applied. Total rules applied 119 place count 46 transition count 53
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 123 place count 46 transition count 49
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 123 place count 46 transition count 47
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 127 place count 44 transition count 47
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 159 place count 28 transition count 31
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 161 place count 26 transition count 29
Iterating global reduction 6 with 2 rules applied. Total rules applied 163 place count 26 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 164 place count 26 transition count 28
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 7 with 2 rules applied. Total rules applied 166 place count 25 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 168 place count 23 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 169 place count 22 transition count 25
Applied a total of 169 rules in 12 ms. Remains 22 /105 variables (removed 83) and now considering 25/118 (removed 93) transitions.
// Phase 1: matrix 25 rows 22 cols
[2023-03-11 07:36:34] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-11 07:36:34] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-11 07:36:34] [INFO ] Invariant cache hit.
[2023-03-11 07:36:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 07:36:34] [INFO ] Implicit Places using invariants and state equation in 45 ms returned [15, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 132 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/105 places, 25/118 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19 transition count 24
Applied a total of 2 rules in 4 ms. Remains 19 /20 variables (removed 1) and now considering 24/25 (removed 1) transitions.
// Phase 1: matrix 24 rows 19 cols
[2023-03-11 07:36:34] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 07:36:34] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-11 07:36:34] [INFO ] Invariant cache hit.
[2023-03-11 07:36:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:36:34] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/105 places, 24/118 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 235 ms. Remains : 19/105 places, 24/118 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (AND p3 (NOT p0) p2) (AND p3 (NOT p0) p1)), acceptance={} source=0 dest: 0}, { cond=(AND p3 (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p0) p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p3 (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p3 (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p3 (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p3:(EQ s17 1), p0:(EQ s9 1), p2:(OR (EQ s12 1) (EQ s9 1)), p1:(EQ s5 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-07 finished in 372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 118/118 transitions.
Graph (trivial) has 94 edges and 105 vertex of which 4 / 105 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 102 transition count 74
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 53 rules applied. Total rules applied 95 place count 61 transition count 62
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 103 place count 55 transition count 60
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 105 place count 53 transition count 60
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 105 place count 53 transition count 55
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 115 place count 48 transition count 55
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 46 transition count 53
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 46 transition count 53
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 119 place count 46 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 121 place count 45 transition count 52
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 157 place count 27 transition count 33
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 160 place count 24 transition count 27
Iterating global reduction 4 with 3 rules applied. Total rules applied 163 place count 24 transition count 27
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 4 with 2 rules applied. Total rules applied 165 place count 23 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 167 place count 21 transition count 24
Applied a total of 167 rules in 10 ms. Remains 21 /105 variables (removed 84) and now considering 24/118 (removed 94) transitions.
// Phase 1: matrix 24 rows 21 cols
[2023-03-11 07:36:34] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-11 07:36:34] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-11 07:36:34] [INFO ] Invariant cache hit.
[2023-03-11 07:36:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 07:36:34] [INFO ] Implicit Places using invariants and state equation in 50 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 100 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/105 places, 24/118 transitions.
Applied a total of 0 rules in 13 ms. Remains 20 /20 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 123 ms. Remains : 20/105 places, 24/118 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s0 1), p1:(OR (EQ s15 1) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-08 finished in 250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 118/118 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 99 transition count 112
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 99 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 99 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 97 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 97 transition count 106
Applied a total of 20 rules in 4 ms. Remains 97 /105 variables (removed 8) and now considering 106/118 (removed 12) transitions.
// Phase 1: matrix 106 rows 97 cols
[2023-03-11 07:36:34] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 07:36:34] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-11 07:36:34] [INFO ] Invariant cache hit.
[2023-03-11 07:36:34] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-11 07:36:34] [INFO ] Invariant cache hit.
[2023-03-11 07:36:35] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/105 places, 106/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 338 ms. Remains : 97/105 places, 106/118 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s21 1), p1:(EQ s63 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-12 finished in 500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(F(p0)))||(p1&&F(p2))))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 118/118 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 99 transition count 112
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 99 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 99 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 96 transition count 105
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 96 transition count 105
Applied a total of 22 rules in 5 ms. Remains 96 /105 variables (removed 9) and now considering 105/118 (removed 13) transitions.
// Phase 1: matrix 105 rows 96 cols
[2023-03-11 07:36:35] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 07:36:35] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-11 07:36:35] [INFO ] Invariant cache hit.
[2023-03-11 07:36:35] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2023-03-11 07:36:35] [INFO ] Invariant cache hit.
[2023-03-11 07:36:35] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/105 places, 105/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 376 ms. Remains : 96/105 places, 105/118 transitions.
Stuttering acceptance computed with spot in 280 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(NOT p1), acceptance={} source=5 dest: 3}]], initial=0, aps=[p2:(NEQ s87 1), p0:(EQ s52 1), p1:(NEQ s56 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 141 ms.
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Computed a total of 24 stabilizing places and 25 stable transitions
Computed a total of 24 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 6 factoid took 214 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-01b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-01b-LTLFireability-14 finished in 1167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)&&X(!G(p1))&&p2)) U p0))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 118/118 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 99 transition count 112
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 99 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 99 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 97 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 97 transition count 106
Applied a total of 20 rules in 5 ms. Remains 97 /105 variables (removed 8) and now considering 106/118 (removed 12) transitions.
// Phase 1: matrix 106 rows 97 cols
[2023-03-11 07:36:36] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 07:36:36] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-11 07:36:36] [INFO ] Invariant cache hit.
[2023-03-11 07:36:36] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-11 07:36:36] [INFO ] Invariant cache hit.
[2023-03-11 07:36:36] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/105 places, 106/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 401 ms. Remains : 97/105 places, 106/118 transitions.
Stuttering acceptance computed with spot in 232 ms :[p1, (NOT p0), true, (OR (NOT p2) (NOT p0) p1)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=3 dest: 0}, { cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s62 1), p0:(EQ s90 1), p2:(NEQ s53 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 35 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-15 finished in 657 ms.
All properties solved by simple procedures.
Total runtime 30189 ms.

BK_STOP 1678520197365

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-01b"
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-01b, 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-167813593300540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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