fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r009-oct2-167813598100556
Last Updated
May 14, 2023

About the Execution of LTSMin+red for AutonomousCar-PT-02b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
417.915 37960.00 75824.00 80.90 TFF?F?FFFTFFF?TF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 12:57 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 49K 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-02b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678636625564

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-02b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 15:57:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 15:57:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 15:57:08] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2023-03-12 15:57:08] [INFO ] Transformed 155 places.
[2023-03-12 15:57:08] [INFO ] Transformed 194 transitions.
[2023-03-12 15:57:08] [INFO ] Found NUPN structural information;
[2023-03-12 15:57:08] [INFO ] Parsed PT model containing 155 places and 194 transitions and 620 arcs in 256 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-02b-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 194/194 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 135 transition count 174
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 135 transition count 174
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 132 transition count 171
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 132 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 131 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 131 transition count 170
Applied a total of 48 rules in 28 ms. Remains 131 /155 variables (removed 24) and now considering 170/194 (removed 24) transitions.
// Phase 1: matrix 170 rows 131 cols
[2023-03-12 15:57:09] [INFO ] Computed 7 place invariants in 14 ms
[2023-03-12 15:57:09] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-12 15:57:09] [INFO ] Invariant cache hit.
[2023-03-12 15:57:09] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
[2023-03-12 15:57:09] [INFO ] Invariant cache hit.
[2023-03-12 15:57:09] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/155 places, 170/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 942 ms. Remains : 131/155 places, 170/194 transitions.
Support contains 26 out of 131 places after structural reductions.
[2023-03-12 15:57:10] [INFO ] Flatten gal took : 41 ms
[2023-03-12 15:57:10] [INFO ] Flatten gal took : 13 ms
[2023-03-12 15:57:10] [INFO ] Input system was already deterministic with 170 transitions.
Support contains 25 out of 131 places (down from 26) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 615 ms. (steps per millisecond=16 ) properties (out of 24) seen :13
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-12 15:57:11] [INFO ] Invariant cache hit.
[2023-03-12 15:57:11] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned sat
[2023-03-12 15:57:11] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA AutonomousCar-PT-02b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 31 stabilizing places and 32 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (p1||G(!p0)))))'
Support contains 5 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 170/170 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 126 transition count 165
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 126 transition count 165
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 26 place count 126 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 125 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 125 transition count 148
Applied a total of 28 rules in 50 ms. Remains 125 /131 variables (removed 6) and now considering 148/170 (removed 22) transitions.
// Phase 1: matrix 148 rows 125 cols
[2023-03-12 15:57:12] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 15:57:12] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-12 15:57:12] [INFO ] Invariant cache hit.
[2023-03-12 15:57:12] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2023-03-12 15:57:12] [INFO ] Invariant cache hit.
[2023-03-12 15:57:13] [INFO ] Dead Transitions using invariants and state equation in 1044 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/131 places, 148/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1295 ms. Remains : 125/131 places, 148/170 transitions.
Stuttering acceptance computed with spot in 467 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NEQ s44 1) (NOT (AND (EQ s4 1) (EQ s6 1) (EQ s35 1) (EQ s91 1)))), p0:(AND (EQ s4 1) (EQ s6 1) (EQ s35 1) (EQ s91 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 305 ms.
Product exploration explored 100000 steps with 50000 reset in 230 ms.
Computed a total of 29 stabilizing places and 30 stable transitions
Computed a total of 29 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 (NOT p0))
Knowledge based reduction with 6 factoid took 372 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-02b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-02b-LTLFireability-00 finished in 2841 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(p1)))))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 170/170 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 127 transition count 166
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 127 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 126 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 126 transition count 165
Applied a total of 10 rules in 29 ms. Remains 126 /131 variables (removed 5) and now considering 165/170 (removed 5) transitions.
// Phase 1: matrix 165 rows 126 cols
[2023-03-12 15:57:14] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-12 15:57:14] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-12 15:57:14] [INFO ] Invariant cache hit.
[2023-03-12 15:57:15] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2023-03-12 15:57:15] [INFO ] Invariant cache hit.
[2023-03-12 15:57:15] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/131 places, 165/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 446 ms. Remains : 126/131 places, 165/170 transitions.
Stuttering acceptance computed with spot in 303 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(EQ s4 1), p0:(EQ s28 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-01 finished in 766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0))) U (p1||X(p0))))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 170/170 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 127 transition count 166
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 127 transition count 166
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 24 place count 127 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 126 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 126 transition count 149
Applied a total of 26 rules in 5 ms. Remains 126 /131 variables (removed 5) and now considering 149/170 (removed 21) transitions.
// Phase 1: matrix 149 rows 126 cols
[2023-03-12 15:57:15] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 15:57:15] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-12 15:57:15] [INFO ] Invariant cache hit.
[2023-03-12 15:57:15] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2023-03-12 15:57:15] [INFO ] Invariant cache hit.
[2023-03-12 15:57:16] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/131 places, 149/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 585 ms. Remains : 126/131 places, 149/170 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s108 1), p0:(EQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 4 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-02 finished in 703 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&&F(p1)&&F(G(p0))))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 170/170 transitions.
Graph (trivial) has 119 edges and 131 vertex of which 4 / 131 are part of one of the 2 SCC in 2 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 128 transition count 117
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 65 rules applied. Total rules applied 116 place count 78 transition count 102
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 125 place count 69 transition count 102
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 125 place count 69 transition count 95
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 139 place count 62 transition count 95
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 143 place count 58 transition count 91
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 58 transition count 91
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 163 place count 58 transition count 75
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 163 place count 58 transition count 74
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 57 transition count 74
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 166 place count 56 transition count 72
Iterating global reduction 4 with 1 rules applied. Total rules applied 167 place count 56 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 169 place count 56 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 170 place count 55 transition count 70
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 212 place count 34 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 213 place count 34 transition count 47
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 216 place count 31 transition count 41
Iterating global reduction 7 with 3 rules applied. Total rules applied 219 place count 31 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 220 place count 31 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 224 place count 29 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 228 place count 27 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 230 place count 25 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 231 place count 24 transition count 42
Applied a total of 231 rules in 41 ms. Remains 24 /131 variables (removed 107) and now considering 42/170 (removed 128) transitions.
// Phase 1: matrix 42 rows 24 cols
[2023-03-12 15:57:16] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 15:57:16] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-12 15:57:16] [INFO ] Invariant cache hit.
[2023-03-12 15:57:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 15:57:16] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [19, 23]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 97 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/131 places, 42/170 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 41
Applied a total of 2 rules in 4 ms. Remains 21 /22 variables (removed 1) and now considering 41/42 (removed 1) transitions.
// Phase 1: matrix 41 rows 21 cols
[2023-03-12 15:57:16] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-12 15:57:16] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-12 15:57:16] [INFO ] Invariant cache hit.
[2023-03-12 15:57:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:57:16] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/131 places, 41/170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 233 ms. Remains : 21/131 places, 41/170 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s12 1), p1:(EQ s7 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 2 reset in 164 ms.
Product exploration explored 100000 steps with 1 reset in 72 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 391 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Finished random walk after 6 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 553 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Support contains 1 out of 21 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 : 21/21 places, 41/41 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-12 15:57:18] [INFO ] Invariant cache hit.
[2023-03-12 15:57:18] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-12 15:57:18] [INFO ] Invariant cache hit.
[2023-03-12 15:57:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:57:18] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2023-03-12 15:57:18] [INFO ] Redundant transitions in 33 ms returned [13]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 40 rows 21 cols
[2023-03-12 15:57:18] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 15:57:18] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/21 places, 40/41 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 19 transition count 38
Applied a total of 2 rules in 3 ms. Remains 19 /21 variables (removed 2) and now considering 38/40 (removed 2) transitions.
// Phase 1: matrix 38 rows 19 cols
[2023-03-12 15:57:18] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 15:57:18] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-12 15:57:18] [INFO ] Invariant cache hit.
[2023-03-12 15:57:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:57:19] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/21 places, 38/41 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1026 ms. Remains : 19/21 places, 38/41 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 223 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 71 ms.
Product exploration explored 100000 steps with 3 reset in 107 ms.
Support contains 1 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 38/38 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 19 transition count 37
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 18 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 18 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 17 transition count 35
Applied a total of 5 rules in 2 ms. Remains 17 /19 variables (removed 2) and now considering 35/38 (removed 3) transitions.
// Phase 1: matrix 35 rows 17 cols
[2023-03-12 15:57:20] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 15:57:20] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-12 15:57:20] [INFO ] Invariant cache hit.
[2023-03-12 15:57:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:57:20] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-12 15:57:20] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-12 15:57:20] [INFO ] Invariant cache hit.
[2023-03-12 15:57:20] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/19 places, 35/38 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 310 ms. Remains : 17/19 places, 35/38 transitions.
Treatment of property AutonomousCar-PT-02b-LTLFireability-03 finished in 4281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 170/170 transitions.
Graph (trivial) has 119 edges and 131 vertex of which 4 / 131 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 128 transition count 116
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 68 rules applied. Total rules applied 120 place count 77 transition count 99
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 130 place count 67 transition count 99
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 130 place count 67 transition count 93
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 142 place count 61 transition count 93
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 146 place count 57 transition count 89
Iterating global reduction 3 with 4 rules applied. Total rules applied 150 place count 57 transition count 89
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 166 place count 57 transition count 73
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 167 place count 56 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 168 place count 56 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 170 place count 56 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 171 place count 55 transition count 69
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 215 place count 33 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 216 place count 33 transition count 45
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 219 place count 30 transition count 39
Iterating global reduction 7 with 3 rules applied. Total rules applied 222 place count 30 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 223 place count 30 transition count 38
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 8 with 4 rules applied. Total rules applied 227 place count 28 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 231 place count 26 transition count 42
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 233 place count 24 transition count 40
Applied a total of 233 rules in 56 ms. Remains 24 /131 variables (removed 107) and now considering 40/170 (removed 130) transitions.
// Phase 1: matrix 40 rows 24 cols
[2023-03-12 15:57:20] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-12 15:57:20] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-12 15:57:20] [INFO ] Invariant cache hit.
[2023-03-12 15:57:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 15:57:20] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [19, 23]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 158 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/131 places, 40/170 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 39
Applied a total of 2 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 39/40 (removed 1) transitions.
// Phase 1: matrix 39 rows 21 cols
[2023-03-12 15:57:20] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-12 15:57:20] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-12 15:57:20] [INFO ] Invariant cache hit.
[2023-03-12 15:57:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:57:20] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/131 places, 39/170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 368 ms. Remains : 21/131 places, 39/170 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s1 1) (NEQ s4 1) (NEQ s8 1) (NEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3 reset in 111 ms.
Product exploration explored 100000 steps with 4 reset in 44 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 240 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
Finished random walk after 111 steps, including 12 resets, run visited all 1 properties in 3 ms. (steps per millisecond=37 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 277 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 39/39 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2023-03-12 15:57:21] [INFO ] Invariant cache hit.
[2023-03-12 15:57:22] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-12 15:57:22] [INFO ] Invariant cache hit.
[2023-03-12 15:57:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:57:22] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-12 15:57:22] [INFO ] Redundant transitions in 32 ms returned [11]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 38 rows 21 cols
[2023-03-12 15:57:22] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-12 15:57:22] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/21 places, 38/39 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 19 transition count 36
Applied a total of 2 rules in 3 ms. Remains 19 /21 variables (removed 2) and now considering 36/38 (removed 2) transitions.
// Phase 1: matrix 36 rows 19 cols
[2023-03-12 15:57:22] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-12 15:57:22] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-12 15:57:22] [INFO ] Invariant cache hit.
[2023-03-12 15:57:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:57:22] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/21 places, 36/39 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 502 ms. Remains : 19/21 places, 36/39 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 201 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0)]
Finished random walk after 21 steps, including 2 resets, run visited all 1 properties in 15 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 144 ms.
Product exploration explored 100000 steps with 5 reset in 60 ms.
Support contains 4 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 36/36 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2023-03-12 15:57:23] [INFO ] Invariant cache hit.
[2023-03-12 15:57:23] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-12 15:57:23] [INFO ] Invariant cache hit.
[2023-03-12 15:57:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:57:23] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2023-03-12 15:57:23] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-12 15:57:23] [INFO ] Invariant cache hit.
[2023-03-12 15:57:23] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 568 ms. Remains : 19/19 places, 36/36 transitions.
Treatment of property AutonomousCar-PT-02b-LTLFireability-05 finished in 3447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 170/170 transitions.
Graph (trivial) has 120 edges and 131 vertex of which 4 / 131 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 128 transition count 115
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 69 rules applied. Total rules applied 122 place count 76 transition count 98
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 132 place count 66 transition count 98
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 132 place count 66 transition count 92
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 144 place count 60 transition count 92
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 148 place count 56 transition count 88
Iterating global reduction 3 with 4 rules applied. Total rules applied 152 place count 56 transition count 88
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 168 place count 56 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 169 place count 55 transition count 70
Iterating global reduction 4 with 1 rules applied. Total rules applied 170 place count 55 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 172 place count 55 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 173 place count 54 transition count 68
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 217 place count 32 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 218 place count 32 transition count 44
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 221 place count 29 transition count 38
Iterating global reduction 7 with 3 rules applied. Total rules applied 224 place count 29 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 225 place count 29 transition count 37
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 229 place count 27 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 233 place count 25 transition count 41
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 235 place count 23 transition count 39
Applied a total of 235 rules in 17 ms. Remains 23 /131 variables (removed 108) and now considering 39/170 (removed 131) transitions.
// Phase 1: matrix 39 rows 23 cols
[2023-03-12 15:57:24] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 15:57:24] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-12 15:57:24] [INFO ] Invariant cache hit.
[2023-03-12 15:57:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 15:57:25] [INFO ] Implicit Places using invariants and state equation in 854 ms returned [18, 22]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1004 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/131 places, 39/170 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 20 transition count 38
Applied a total of 2 rules in 4 ms. Remains 20 /21 variables (removed 1) and now considering 38/39 (removed 1) transitions.
// Phase 1: matrix 38 rows 20 cols
[2023-03-12 15:57:25] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 15:57:25] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-12 15:57:25] [INFO ] Invariant cache hit.
[2023-03-12 15:57:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:57:25] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/131 places, 38/170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1342 ms. Remains : 20/131 places, 38/170 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s4 1) (EQ s6 1) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-07 finished in 1424 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 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 170/170 transitions.
Graph (trivial) has 119 edges and 131 vertex of which 4 / 131 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 128 transition count 117
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 67 rules applied. Total rules applied 118 place count 78 transition count 100
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 128 place count 68 transition count 100
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 128 place count 68 transition count 93
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 142 place count 61 transition count 93
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 146 place count 57 transition count 89
Iterating global reduction 3 with 4 rules applied. Total rules applied 150 place count 57 transition count 89
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 166 place count 57 transition count 73
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 167 place count 56 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 168 place count 56 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 170 place count 56 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 171 place count 55 transition count 69
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 213 place count 34 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 214 place count 34 transition count 46
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 217 place count 31 transition count 39
Iterating global reduction 7 with 3 rules applied. Total rules applied 220 place count 31 transition count 39
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 7 with 4 rules applied. Total rules applied 224 place count 29 transition count 37
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 228 place count 27 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 229 place count 26 transition count 45
Applied a total of 229 rules in 40 ms. Remains 26 /131 variables (removed 105) and now considering 45/170 (removed 125) transitions.
// Phase 1: matrix 45 rows 26 cols
[2023-03-12 15:57:25] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-12 15:57:25] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-12 15:57:25] [INFO ] Invariant cache hit.
[2023-03-12 15:57:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 15:57:25] [INFO ] Implicit Places using invariants and state equation in 112 ms returned [21, 25]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 207 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/131 places, 45/170 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 44
Applied a total of 2 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 23 cols
[2023-03-12 15:57:25] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-12 15:57:25] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-12 15:57:25] [INFO ] Invariant cache hit.
[2023-03-12 15:57:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:57:26] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/131 places, 44/170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 814 ms. Remains : 23/131 places, 44/170 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s3 1) (EQ s11 1) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-08 finished in 994 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)&&F(G(p1)))))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 170/170 transitions.
Graph (trivial) has 119 edges and 131 vertex of which 4 / 131 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 128 transition count 115
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 69 rules applied. Total rules applied 122 place count 76 transition count 98
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 132 place count 66 transition count 98
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 132 place count 66 transition count 92
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 144 place count 60 transition count 92
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 147 place count 57 transition count 89
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 57 transition count 89
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 166 place count 57 transition count 73
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 166 place count 57 transition count 72
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 168 place count 56 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 169 place count 55 transition count 70
Iterating global reduction 4 with 1 rules applied. Total rules applied 170 place count 55 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 172 place count 55 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 173 place count 54 transition count 68
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 215 place count 33 transition count 47
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 217 place count 33 transition count 45
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 220 place count 30 transition count 38
Iterating global reduction 7 with 3 rules applied. Total rules applied 223 place count 30 transition count 38
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 7 with 4 rules applied. Total rules applied 227 place count 28 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 231 place count 26 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 233 place count 24 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 234 place count 23 transition count 43
Applied a total of 234 rules in 31 ms. Remains 23 /131 variables (removed 108) and now considering 43/170 (removed 127) transitions.
// Phase 1: matrix 43 rows 23 cols
[2023-03-12 15:57:26] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 15:57:26] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-12 15:57:26] [INFO ] Invariant cache hit.
[2023-03-12 15:57:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:57:27] [INFO ] Implicit Places using invariants and state equation in 709 ms returned [17, 22]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 806 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/131 places, 43/170 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 20 transition count 42
Applied a total of 2 rules in 4 ms. Remains 20 /21 variables (removed 1) and now considering 42/43 (removed 1) transitions.
// Phase 1: matrix 42 rows 20 cols
[2023-03-12 15:57:27] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 15:57:27] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-12 15:57:27] [INFO ] Invariant cache hit.
[2023-03-12 15:57:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:57:27] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/131 places, 42/170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1113 ms. Remains : 20/131 places, 42/170 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s7 1), p1:(EQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-10 finished in 1304 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(G((p0||G(p1))))) U (X(G((p0||G(p1))))&&p2))))'
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 170/170 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 128 transition count 167
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 128 transition count 167
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 22 place count 128 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 127 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 127 transition count 150
Applied a total of 24 rules in 5 ms. Remains 127 /131 variables (removed 4) and now considering 150/170 (removed 20) transitions.
// Phase 1: matrix 150 rows 127 cols
[2023-03-12 15:57:27] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 15:57:27] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-12 15:57:27] [INFO ] Invariant cache hit.
[2023-03-12 15:57:28] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2023-03-12 15:57:28] [INFO ] Invariant cache hit.
[2023-03-12 15:57:28] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 127/131 places, 150/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 594 ms. Remains : 127/131 places, 150/170 transitions.
Stuttering acceptance computed with spot in 366 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR p2 p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (NEQ s48 1) (EQ s22 1)), p0:(NEQ s48 1), p1:(NEQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 150 ms.
Product exploration explored 100000 steps with 3 reset in 81 ms.
Computed a total of 29 stabilizing places and 30 stable transitions
Computed a total of 29 stabilizing places and 30 stable transitions
Detected a total of 29/127 stabilizing places and 30/150 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (OR p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X (X (OR p2 p0))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 916 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 404 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 15:57:30] [INFO ] Invariant cache hit.
[2023-03-12 15:57:30] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2023-03-12 15:57:30] [INFO ] After 134ms 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 p2) p0 p1), (X (OR p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X (X (OR p2 p0))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p2 p1 (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0)))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p2) p0))), (F (AND p2 p0))]
Knowledge based reduction with 14 factoid took 1262 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p2)), true]
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p2)), true]
[2023-03-12 15:57:32] [INFO ] Invariant cache hit.
[2023-03-12 15:57:33] [INFO ] [Real]Absence check using 7 positive place invariants in 53 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (OR p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X (X (OR p2 p0))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p2 p1 (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0)))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p2) p0))), (F (AND p2 p0)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 14 factoid took 585 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-02b-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-02b-LTLFireability-11 finished in 6171 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) U X(p1))))'
Support contains 6 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 170/170 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 126 transition count 165
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 126 transition count 165
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 26 place count 126 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 125 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 125 transition count 148
Applied a total of 28 rules in 4 ms. Remains 125 /131 variables (removed 6) and now considering 148/170 (removed 22) transitions.
// Phase 1: matrix 148 rows 125 cols
[2023-03-12 15:57:33] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-12 15:57:34] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-12 15:57:34] [INFO ] Invariant cache hit.
[2023-03-12 15:57:34] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2023-03-12 15:57:34] [INFO ] Invariant cache hit.
[2023-03-12 15:57:34] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/131 places, 148/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 652 ms. Remains : 125/131 places, 148/170 transitions.
Stuttering acceptance computed with spot in 339 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s0 1) (AND (EQ s4 1) (EQ s6 1) (EQ s35 1) (EQ s91 1))), p1:(EQ s61 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-12 finished in 1016 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)||G(F((!p1 U (p2||G(!p1)))))))'
Support contains 5 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 170/170 transitions.
Graph (trivial) has 117 edges and 131 vertex of which 4 / 131 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 128 transition count 117
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 67 rules applied. Total rules applied 118 place count 78 transition count 100
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 128 place count 68 transition count 100
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 128 place count 68 transition count 93
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 142 place count 61 transition count 93
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 145 place count 58 transition count 90
Iterating global reduction 3 with 3 rules applied. Total rules applied 148 place count 58 transition count 90
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 164 place count 58 transition count 74
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 206 place count 37 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 207 place count 37 transition count 51
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 211 place count 33 transition count 42
Iterating global reduction 5 with 4 rules applied. Total rules applied 215 place count 33 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 216 place count 33 transition count 41
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 6 with 4 rules applied. Total rules applied 220 place count 31 transition count 39
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 224 place count 29 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 225 place count 28 transition count 44
Applied a total of 225 rules in 31 ms. Remains 28 /131 variables (removed 103) and now considering 44/170 (removed 126) transitions.
// Phase 1: matrix 44 rows 28 cols
[2023-03-12 15:57:34] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 15:57:35] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-12 15:57:35] [INFO ] Invariant cache hit.
[2023-03-12 15:57:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 15:57:35] [INFO ] Implicit Places using invariants and state equation in 268 ms returned [23, 27]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 332 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/131 places, 44/170 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 25 transition count 43
Applied a total of 2 rules in 9 ms. Remains 25 /26 variables (removed 1) and now considering 43/44 (removed 1) transitions.
// Phase 1: matrix 43 rows 25 cols
[2023-03-12 15:57:35] [INFO ] Computed 4 place invariants in 13 ms
[2023-03-12 15:57:35] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-12 15:57:35] [INFO ] Invariant cache hit.
[2023-03-12 15:57:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:57:35] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/131 places, 43/170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 542 ms. Remains : 25/131 places, 43/170 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s3 0) (EQ s10 0) (EQ s21 0)), p2:(AND (NOT (AND (EQ s2 1) (EQ s3 1) (EQ s10 1) (EQ s21 1))) (NEQ s7 1)), p1:(AND (EQ s2 1) (EQ s3 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 8 reset in 190 ms.
Product exploration explored 100000 steps with 3 reset in 137 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 640 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 176 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Finished random walk after 33 steps, including 3 resets, run visited all 4 properties in 1 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p2) (NOT p0)))]
Knowledge based reduction with 10 factoid took 1029 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 170 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 43/43 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-12 15:57:38] [INFO ] Invariant cache hit.
[2023-03-12 15:57:38] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-12 15:57:38] [INFO ] Invariant cache hit.
[2023-03-12 15:57:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:57:38] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2023-03-12 15:57:38] [INFO ] Redundant transitions in 15 ms returned [15]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 42 rows 25 cols
[2023-03-12 15:57:38] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 15:57:38] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/25 places, 42/43 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 23 transition count 40
Applied a total of 2 rules in 2 ms. Remains 23 /25 variables (removed 2) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 23 cols
[2023-03-12 15:57:38] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 15:57:38] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-12 15:57:38] [INFO ] Invariant cache hit.
[2023-03-12 15:57:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:57:38] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/25 places, 40/43 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 729 ms. Remains : 23/25 places, 40/43 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 626 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 159 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Finished random walk after 37 steps, including 3 resets, run visited all 4 properties in 3 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p2) (NOT p0)))]
Knowledge based reduction with 10 factoid took 840 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 158 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 78 ms.
Product exploration explored 100000 steps with 2 reset in 74 ms.
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 40/40 transitions.
Applied a total of 0 rules in 10 ms. Remains 23 /23 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2023-03-12 15:57:41] [INFO ] Invariant cache hit.
[2023-03-12 15:57:41] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-12 15:57:41] [INFO ] Invariant cache hit.
[2023-03-12 15:57:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:57:41] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-12 15:57:41] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-12 15:57:41] [INFO ] Invariant cache hit.
[2023-03-12 15:57:41] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 361 ms. Remains : 23/23 places, 40/40 transitions.
Treatment of property AutonomousCar-PT-02b-LTLFireability-13 finished in 6870 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 1 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 170/170 transitions.
Graph (trivial) has 121 edges and 131 vertex of which 4 / 131 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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 128 transition count 118
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 66 rules applied. Total rules applied 116 place count 79 transition count 101
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 127 place count 69 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 128 place count 68 transition count 100
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 128 place count 68 transition count 93
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 142 place count 61 transition count 93
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 146 place count 57 transition count 89
Iterating global reduction 4 with 4 rules applied. Total rules applied 150 place count 57 transition count 89
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 166 place count 57 transition count 73
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 166 place count 57 transition count 72
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 168 place count 56 transition count 72
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 169 place count 55 transition count 70
Iterating global reduction 5 with 1 rules applied. Total rules applied 170 place count 55 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 172 place count 55 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 173 place count 54 transition count 68
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 215 place count 33 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 216 place count 33 transition count 45
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 220 place count 29 transition count 36
Iterating global reduction 8 with 4 rules applied. Total rules applied 224 place count 29 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 225 place count 29 transition count 35
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 9 with 4 rules applied. Total rules applied 229 place count 27 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 233 place count 25 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 235 place count 23 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 236 place count 22 transition count 37
Applied a total of 236 rules in 11 ms. Remains 22 /131 variables (removed 109) and now considering 37/170 (removed 133) transitions.
// Phase 1: matrix 37 rows 22 cols
[2023-03-12 15:57:41] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 15:57:41] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-12 15:57:41] [INFO ] Invariant cache hit.
[2023-03-12 15:57:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 15:57:41] [INFO ] Implicit Places using invariants and state equation in 82 ms returned [17, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 115 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/131 places, 37/170 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 19 transition count 36
Applied a total of 2 rules in 4 ms. Remains 19 /20 variables (removed 1) and now considering 36/37 (removed 1) transitions.
// Phase 1: matrix 36 rows 19 cols
[2023-03-12 15:57:41] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 15:57:41] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-12 15:57:41] [INFO ] Invariant cache hit.
[2023-03-12 15:57:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:57:42] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/131 places, 36/170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 266 ms. Remains : 19/131 places, 36/170 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-15 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:(EQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-15 finished in 432 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&&F(p1)&&F(G(p0))))'
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)))'
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)||G(F((!p1 U (p2||G(!p1)))))))'
[2023-03-12 15:57:42] [INFO ] Flatten gal took : 17 ms
[2023-03-12 15:57:42] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-12 15:57:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 131 places, 170 transitions and 572 arcs took 12 ms.
Total runtime 34153 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1532/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1532/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1532/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutonomousCar-PT-02b-LTLFireability-03
Could not compute solution for formula : AutonomousCar-PT-02b-LTLFireability-05
Could not compute solution for formula : AutonomousCar-PT-02b-LTLFireability-13

BK_STOP 1678636663524

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name AutonomousCar-PT-02b-LTLFireability-03
ltl formula formula --ltl=/tmp/1532/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 131 places, 170 transitions and 572 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1532/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1532/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1532/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1532/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name AutonomousCar-PT-02b-LTLFireability-05
ltl formula formula --ltl=/tmp/1532/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 131 places, 170 transitions and 572 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1532/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1532/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1532/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.020 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1532/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name AutonomousCar-PT-02b-LTLFireability-13
ltl formula formula --ltl=/tmp/1532/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 131 places, 170 transitions and 572 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1532/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1532/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1532/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1532/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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