Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 5.7K Jun 7 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 7 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Jun 7 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 7 15:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 3 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 3 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 3 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 5.0K Jun 7 15:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 41K Jun 7 15:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 7 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 7 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 159K Jun 3 16:02 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654900741786

Running Version 202205111006
[2022-06-10 22:39:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 22:39:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 22:39:04] [INFO ] Load time of PNML (sax parser for PT used): 260 ms
[2022-06-10 22:39:04] [INFO ] Transformed 255 places.
[2022-06-10 22:39:04] [INFO ] Transformed 490 transitions.
[2022-06-10 22:39:04] [INFO ] Found NUPN structural information;
[2022-06-10 22:39:04] [INFO ] Parsed PT model containing 255 places and 490 transitions in 505 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 131 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA AutonomousCar-PT-05b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 490/490 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 219 transition count 454
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 219 transition count 454
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 172 place count 219 transition count 354
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 179 place count 212 transition count 347
Iterating global reduction 1 with 7 rules applied. Total rules applied 186 place count 212 transition count 347
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 187 place count 211 transition count 346
Iterating global reduction 1 with 1 rules applied. Total rules applied 188 place count 211 transition count 346
Applied a total of 188 rules in 134 ms. Remains 211 /255 variables (removed 44) and now considering 346/490 (removed 144) transitions.
// Phase 1: matrix 346 rows 211 cols
[2022-06-10 22:39:05] [INFO ] Computed 10 place invariants in 40 ms
[2022-06-10 22:39:05] [INFO ] Implicit Places using invariants in 422 ms returned []
// Phase 1: matrix 346 rows 211 cols
[2022-06-10 22:39:05] [INFO ] Computed 10 place invariants in 8 ms
[2022-06-10 22:39:06] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 936 ms to find 0 implicit places.
// Phase 1: matrix 346 rows 211 cols
[2022-06-10 22:39:06] [INFO ] Computed 10 place invariants in 6 ms
[2022-06-10 22:39:06] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 211/255 places, 346/490 transitions.
Finished structural reductions, in 1 iterations. Remains : 211/255 places, 346/490 transitions.
Support contains 33 out of 211 places after structural reductions.
[2022-06-10 22:39:07] [INFO ] Flatten gal took : 148 ms
[2022-06-10 22:39:07] [INFO ] Flatten gal took : 68 ms
[2022-06-10 22:39:07] [INFO ] Input system was already deterministic with 346 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 1224 ms. (steps per millisecond=8 ) properties (out of 25) seen :11
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 346 rows 211 cols
[2022-06-10 22:39:09] [INFO ] Computed 10 place invariants in 4 ms
[2022-06-10 22:39:10] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-06-10 22:39:10] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-10 22:39:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-06-10 22:39:11] [INFO ] After 531ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-06-10 22:39:11] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 7 ms to minimize.
[2022-06-10 22:39:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2022-06-10 22:39:11] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 2 ms to minimize.
[2022-06-10 22:39:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2022-06-10 22:39:11] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 1 ms to minimize.
[2022-06-10 22:39:12] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 3 ms to minimize.
[2022-06-10 22:39:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 376 ms
[2022-06-10 22:39:12] [INFO ] After 1686ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 239 ms.
[2022-06-10 22:39:12] [INFO ] After 2139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 173 ms.
Support contains 12 out of 211 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 211/211 places, 346/346 transitions.
Graph (trivial) has 186 edges and 211 vertex of which 4 / 211 are part of one of the 2 SCC in 7 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 686 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 207 transition count 267
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 103 rules applied. Total rules applied 180 place count 134 transition count 237
Reduce places removed 17 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 19 rules applied. Total rules applied 199 place count 117 transition count 235
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 201 place count 115 transition count 235
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 201 place count 115 transition count 230
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 211 place count 110 transition count 230
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 212 place count 109 transition count 229
Iterating global reduction 4 with 1 rules applied. Total rules applied 213 place count 109 transition count 229
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 299 place count 66 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 300 place count 66 transition count 185
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 307 place count 59 transition count 150
Iterating global reduction 5 with 7 rules applied. Total rules applied 314 place count 59 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 316 place count 59 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 318 place count 58 transition count 147
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 319 place count 58 transition count 146
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 328 place count 58 transition count 137
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 337 place count 49 transition count 137
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 338 place count 49 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 339 place count 48 transition count 136
Applied a total of 339 rules in 178 ms. Remains 48 /211 variables (removed 163) and now considering 136/346 (removed 210) transitions.
Finished structural reductions, in 1 iterations. Remains : 48/211 places, 136/346 transitions.
Incomplete random walk after 10000 steps, including 355 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 136 rows 48 cols
[2022-06-10 22:39:13] [INFO ] Computed 10 place invariants in 1 ms
[2022-06-10 22:39:13] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-06-10 22:39:13] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 22:39:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-10 22:39:13] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 22:39:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:39:13] [INFO ] After 19ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 22:39:13] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-06-10 22:39:13] [INFO ] After 196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 48/48 places, 136/136 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 48 transition count 132
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 44 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 44 transition count 131
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 43 transition count 131
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 42 transition count 125
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 42 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 41 transition count 124
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 41 transition count 122
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 28 place count 39 transition count 112
Applied a total of 28 rules in 23 ms. Remains 39 /48 variables (removed 9) and now considering 112/136 (removed 24) transitions.
Finished structural reductions, in 1 iterations. Remains : 39/48 places, 112/136 transitions.
Incomplete random walk after 10000 steps, including 219 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 48494 steps, run visited all 1 properties in 146 ms. (steps per millisecond=332 )
Probabilistic random walk after 48494 steps, saw 10258 distinct states, run finished after 146 ms. (steps per millisecond=332 ) properties seen :1
Computed a total of 38 stabilizing places and 39 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||F(X(G(p1)))||G(p2)))'
Support contains 5 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 346/346 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 209 transition count 344
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 209 transition count 344
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 208 transition count 343
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 208 transition count 343
Applied a total of 6 rules in 16 ms. Remains 208 /211 variables (removed 3) and now considering 343/346 (removed 3) transitions.
// Phase 1: matrix 343 rows 208 cols
[2022-06-10 22:39:14] [INFO ] Computed 10 place invariants in 4 ms
[2022-06-10 22:39:14] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 343 rows 208 cols
[2022-06-10 22:39:14] [INFO ] Computed 10 place invariants in 4 ms
[2022-06-10 22:39:14] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
// Phase 1: matrix 343 rows 208 cols
[2022-06-10 22:39:14] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-10 22:39:15] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 208/211 places, 343/346 transitions.
Finished structural reductions, in 1 iterations. Remains : 208/211 places, 343/346 transitions.
Stuttering acceptance computed with spot in 390 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s30 0), p0:(EQ s30 1), p1:(AND (EQ s4 1) (EQ s14 1) (EQ s118 1) (EQ s174 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 14 reset in 527 ms.
Product exploration explored 100000 steps with 10 reset in 292 ms.
Computed a total of 36 stabilizing places and 37 stable transitions
Computed a total of 36 stabilizing places and 37 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 505 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 343 rows 208 cols
[2022-06-10 22:39:17] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-10 22:39:17] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 22:39:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-06-10 22:39:17] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p0)))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p2) (NOT p0))))
Knowledge based reduction with 10 factoid took 460 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-05b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-05b-LTLFireability-00 finished in 4085 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(p0))&&(X((G(!p0)&&p1))||p2)) U G(p3)))'
Support contains 6 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 346/346 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 209 transition count 344
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 209 transition count 344
Applied a total of 4 rules in 25 ms. Remains 209 /211 variables (removed 2) and now considering 344/346 (removed 2) transitions.
// Phase 1: matrix 344 rows 209 cols
[2022-06-10 22:39:18] [INFO ] Computed 10 place invariants in 4 ms
[2022-06-10 22:39:18] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 344 rows 209 cols
[2022-06-10 22:39:18] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-10 22:39:18] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
// Phase 1: matrix 344 rows 209 cols
[2022-06-10 22:39:18] [INFO ] Computed 10 place invariants in 4 ms
[2022-06-10 22:39:19] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 209/211 places, 344/346 transitions.
Finished structural reductions, in 1 iterations. Remains : 209/211 places, 344/346 transitions.
Stuttering acceptance computed with spot in 346 ms :[(NOT p3), (NOT p0), p0, (AND (NOT p0) (NOT p3)), (AND p0 (NOT p3)), true]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p3, acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(AND p3 p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND p3 p2 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(AND p3 p2 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(AND (EQ s4 1) (EQ s12 1) (EQ s94 1) (EQ s175 1)), p2:(EQ s95 1), p0:(NEQ s53 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 3 reset in 1 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-04 finished in 1403 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X(X(p0)) U G(p0)))'
Support contains 4 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 346/346 transitions.
Graph (trivial) has 198 edges and 211 vertex of which 4 / 211 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 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 208 transition count 264
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 111 rules applied. Total rules applied 191 place count 129 transition count 232
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 210 place count 110 transition count 232
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 210 place count 110 transition count 226
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 222 place count 104 transition count 226
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 224 place count 102 transition count 224
Iterating global reduction 3 with 2 rules applied. Total rules applied 226 place count 102 transition count 224
Performed 44 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 314 place count 58 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 315 place count 58 transition count 178
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 325 place count 48 transition count 127
Iterating global reduction 4 with 10 rules applied. Total rules applied 335 place count 48 transition count 127
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 339 place count 48 transition count 123
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 5 with 4 rules applied. Total rules applied 343 place count 46 transition count 121
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 344 place count 46 transition count 121
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 346 place count 44 transition count 119
Applied a total of 346 rules in 83 ms. Remains 44 /211 variables (removed 167) and now considering 119/346 (removed 227) transitions.
// Phase 1: matrix 119 rows 44 cols
[2022-06-10 22:39:19] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:39:19] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 119 rows 44 cols
[2022-06-10 22:39:19] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:39:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 22:39:20] [INFO ] Implicit Places using invariants and state equation in 156 ms returned [39, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 248 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/211 places, 119/346 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 41 transition count 118
Applied a total of 2 rules in 10 ms. Remains 41 /42 variables (removed 1) and now considering 118/119 (removed 1) transitions.
// Phase 1: matrix 118 rows 41 cols
[2022-06-10 22:39:20] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:39:20] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 118 rows 41 cols
[2022-06-10 22:39:20] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:39:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:39:20] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/211 places, 118/346 transitions.
Finished structural reductions, in 2 iterations. Remains : 41/211 places, 118/346 transitions.
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s1 1) (EQ s7 1) (EQ s19 1) (EQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-06 finished in 606 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(p1)&&p0))))'
Support contains 5 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 346/346 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 208 transition count 343
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 208 transition count 343
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 207 transition count 342
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 207 transition count 342
Applied a total of 8 rules in 18 ms. Remains 207 /211 variables (removed 4) and now considering 342/346 (removed 4) transitions.
// Phase 1: matrix 342 rows 207 cols
[2022-06-10 22:39:20] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-10 22:39:20] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 342 rows 207 cols
[2022-06-10 22:39:20] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-10 22:39:20] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
// Phase 1: matrix 342 rows 207 cols
[2022-06-10 22:39:20] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-10 22:39:21] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/211 places, 342/346 transitions.
Finished structural reductions, in 1 iterations. Remains : 207/211 places, 342/346 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s4 1) (EQ s12 1) (EQ s146 1) (EQ s173 1)), p1:(EQ s164 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-07 finished in 891 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(F(((F(p1) U p1)&&p0)))) U G((!p2 U p3))))'
Support contains 12 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 346/346 transitions.
Graph (trivial) has 184 edges and 211 vertex of which 4 / 211 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 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 208 transition count 266
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 109 rules applied. Total rules applied 187 place count 131 transition count 234
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 206 place count 112 transition count 234
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 206 place count 112 transition count 228
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 218 place count 106 transition count 228
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 220 place count 104 transition count 226
Iterating global reduction 3 with 2 rules applied. Total rules applied 222 place count 104 transition count 226
Performed 39 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 300 place count 65 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 301 place count 65 transition count 185
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 309 place count 57 transition count 146
Iterating global reduction 4 with 8 rules applied. Total rules applied 317 place count 57 transition count 146
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 321 place count 57 transition count 142
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 5 with 4 rules applied. Total rules applied 325 place count 55 transition count 140
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 326 place count 55 transition count 140
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 328 place count 53 transition count 138
Applied a total of 328 rules in 49 ms. Remains 53 /211 variables (removed 158) and now considering 138/346 (removed 208) transitions.
// Phase 1: matrix 138 rows 53 cols
[2022-06-10 22:39:21] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:39:21] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 138 rows 53 cols
[2022-06-10 22:39:21] [INFO ] Computed 9 place invariants in 0 ms
[2022-06-10 22:39:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 22:39:21] [INFO ] Implicit Places using invariants and state equation in 100 ms returned [48, 52]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 160 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/211 places, 138/346 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 50 transition count 137
Applied a total of 2 rules in 7 ms. Remains 50 /51 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 50 cols
[2022-06-10 22:39:21] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:39:21] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 137 rows 50 cols
[2022-06-10 22:39:21] [INFO ] Computed 7 place invariants in 0 ms
[2022-06-10 22:39:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:39:21] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/211 places, 137/346 transitions.
Finished structural reductions, in 2 iterations. Remains : 50/211 places, 137/346 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p3), (NOT p1), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) p3) (AND (NOT p0) p3)), (NOT p3)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR p3 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p3 (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 1}, { cond=(OR (AND p3 (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=3 dest: 2}, { cond=(OR p3 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (EQ s15 1) (EQ s21 1) (EQ s25 1) (EQ s36 1) (EQ s42 1) (EQ s46 1)), p2:(AND (EQ s1 1) (EQ s4 1) (EQ s33 1) (EQ s45 1)), p1:(AND (EQ s1 1) (EQ s5 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-08 finished in 632 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F((G(F(p0))&&F(G(p0))))))))'
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 346/346 transitions.
Graph (trivial) has 198 edges and 211 vertex of which 4 / 211 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 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 208 transition count 266
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 106 rules applied. Total rules applied 184 place count 131 transition count 237
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 201 place count 114 transition count 237
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 201 place count 114 transition count 229
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 217 place count 106 transition count 229
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 219 place count 104 transition count 227
Iterating global reduction 3 with 2 rules applied. Total rules applied 221 place count 104 transition count 227
Performed 46 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 313 place count 58 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 314 place count 58 transition count 179
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 325 place count 47 transition count 123
Iterating global reduction 4 with 11 rules applied. Total rules applied 336 place count 47 transition count 123
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 341 place count 47 transition count 118
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 5 with 4 rules applied. Total rules applied 345 place count 45 transition count 116
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 347 place count 43 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 348 place count 42 transition count 114
Applied a total of 348 rules in 32 ms. Remains 42 /211 variables (removed 169) and now considering 114/346 (removed 232) transitions.
// Phase 1: matrix 114 rows 42 cols
[2022-06-10 22:39:21] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:39:21] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 114 rows 42 cols
[2022-06-10 22:39:21] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:39:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 22:39:22] [INFO ] Implicit Places using invariants and state equation in 120 ms returned [37, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 196 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/211 places, 114/346 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 39 transition count 113
Applied a total of 2 rules in 10 ms. Remains 39 /40 variables (removed 1) and now considering 113/114 (removed 1) transitions.
// Phase 1: matrix 113 rows 39 cols
[2022-06-10 22:39:22] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:39:22] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 113 rows 39 cols
[2022-06-10 22:39:22] [INFO ] Computed 6 place invariants in 7 ms
[2022-06-10 22:39:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:39:22] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/211 places, 113/346 transitions.
Finished structural reductions, in 2 iterations. Remains : 39/211 places, 113/346 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s27 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 11 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-09 finished in 484 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&((p0 U p1)||p1)))))'
Support contains 5 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 346/346 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 208 transition count 343
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 208 transition count 343
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 207 transition count 342
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 207 transition count 342
Applied a total of 8 rules in 10 ms. Remains 207 /211 variables (removed 4) and now considering 342/346 (removed 4) transitions.
// Phase 1: matrix 342 rows 207 cols
[2022-06-10 22:39:22] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-10 22:39:22] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 342 rows 207 cols
[2022-06-10 22:39:22] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-10 22:39:22] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
// Phase 1: matrix 342 rows 207 cols
[2022-06-10 22:39:22] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-10 22:39:22] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/211 places, 342/346 transitions.
Finished structural reductions, in 1 iterations. Remains : 207/211 places, 342/346 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s159 1), p1:(AND (EQ s4 1) (EQ s12 1) (EQ s67 1) (EQ s173 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 96 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-11 finished in 764 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((F(p0)||p1)) U p2))))'
Support contains 1 out of 211 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 346/346 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 208 transition count 343
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 208 transition count 343
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 207 transition count 342
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 207 transition count 342
Applied a total of 8 rules in 9 ms. Remains 207 /211 variables (removed 4) and now considering 342/346 (removed 4) transitions.
// Phase 1: matrix 342 rows 207 cols
[2022-06-10 22:39:23] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-10 22:39:23] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 342 rows 207 cols
[2022-06-10 22:39:23] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-10 22:39:23] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
// Phase 1: matrix 342 rows 207 cols
[2022-06-10 22:39:23] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-10 22:39:23] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/211 places, 342/346 transitions.
Finished structural reductions, in 1 iterations. Remains : 207/211 places, 342/346 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(EQ s119 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 81 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-12 finished in 750 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(X(G(X(F((G(G(p0))&&p1)))))))))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 346/346 transitions.
Graph (trivial) has 196 edges and 211 vertex of which 4 / 211 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 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 208 transition count 268
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 106 rules applied. Total rules applied 182 place count 133 transition count 237
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 19 rules applied. Total rules applied 201 place count 115 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 202 place count 114 transition count 236
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 202 place count 114 transition count 229
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 216 place count 107 transition count 229
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 218 place count 105 transition count 227
Iterating global reduction 4 with 2 rules applied. Total rules applied 220 place count 105 transition count 227
Performed 45 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 310 place count 60 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 311 place count 60 transition count 180
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 322 place count 49 transition count 124
Iterating global reduction 5 with 11 rules applied. Total rules applied 333 place count 49 transition count 124
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 337 place count 49 transition count 120
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 341 place count 47 transition count 118
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 343 place count 45 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 344 place count 44 transition count 116
Applied a total of 344 rules in 36 ms. Remains 44 /211 variables (removed 167) and now considering 116/346 (removed 230) transitions.
// Phase 1: matrix 116 rows 44 cols
[2022-06-10 22:39:23] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:39:23] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 116 rows 44 cols
[2022-06-10 22:39:23] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:39:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 22:39:24] [INFO ] Implicit Places using invariants and state equation in 116 ms returned [37, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 197 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/211 places, 116/346 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 41 transition count 115
Applied a total of 2 rules in 4 ms. Remains 41 /42 variables (removed 1) and now considering 115/116 (removed 1) transitions.
// Phase 1: matrix 115 rows 41 cols
[2022-06-10 22:39:24] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:39:24] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 115 rows 41 cols
[2022-06-10 22:39:24] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:39:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:39:24] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/211 places, 115/346 transitions.
Finished structural reductions, in 2 iterations. Remains : 41/211 places, 115/346 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s40 0), p0:(EQ s23 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 14 reset in 96 ms.
Product exploration explored 100000 steps with 187 reset in 119 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 257 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : [(F (OR (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 6 factoid took 377 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 115/115 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 115/115 (removed 0) transitions.
// Phase 1: matrix 115 rows 41 cols
[2022-06-10 22:39:25] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:39:25] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 115 rows 41 cols
[2022-06-10 22:39:25] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-10 22:39:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:39:25] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2022-06-10 22:39:25] [INFO ] Redundant transitions in 15 ms returned [62]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 114 rows 41 cols
[2022-06-10 22:39:25] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-10 22:39:25] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/41 places, 114/115 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 39 transition count 112
Applied a total of 2 rules in 5 ms. Remains 39 /41 variables (removed 2) and now considering 112/114 (removed 2) transitions.
// Phase 1: matrix 112 rows 39 cols
[2022-06-10 22:39:25] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-10 22:39:25] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 112 rows 39 cols
[2022-06-10 22:39:25] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-10 22:39:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:39:26] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/41 places, 112/115 transitions.
Finished structural reductions, in 2 iterations. Remains : 39/41 places, 112/115 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 229 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 168 steps, including 8 resets, run visited all 3 properties in 5 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : [(F (OR (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 6 factoid took 289 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 22 reset in 63 ms.
Product exploration explored 100000 steps with 0 reset in 81 ms.
Built C files in :
/tmp/ltsmin15943588518913319859
[2022-06-10 22:39:27] [INFO ] Computing symmetric may disable matrix : 112 transitions.
[2022-06-10 22:39:27] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:39:27] [INFO ] Computing symmetric may enable matrix : 112 transitions.
[2022-06-10 22:39:27] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:39:27] [INFO ] Computing Do-Not-Accords matrix : 112 transitions.
[2022-06-10 22:39:27] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:39:27] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15943588518913319859
Running compilation step : cd /tmp/ltsmin15943588518913319859;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 653 ms.
Running link step : cd /tmp/ltsmin15943588518913319859;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin15943588518913319859;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased346066788322015097.hoa' '--buchi-type=spotba'
LTSmin run took 143 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-05b-LTLFireability-13 finished in 4327 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(F((X(p0)||p1)))))'
Support contains 6 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 346/346 transitions.
Graph (trivial) has 195 edges and 211 vertex of which 4 / 211 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 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 208 transition count 267
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 106 rules applied. Total rules applied 183 place count 132 transition count 237
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 19 rules applied. Total rules applied 202 place count 114 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 203 place count 113 transition count 236
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 203 place count 113 transition count 230
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 215 place count 107 transition count 230
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 217 place count 105 transition count 228
Iterating global reduction 4 with 2 rules applied. Total rules applied 219 place count 105 transition count 228
Performed 43 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 305 place count 62 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 306 place count 62 transition count 183
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 316 place count 52 transition count 132
Iterating global reduction 5 with 10 rules applied. Total rules applied 326 place count 52 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 330 place count 52 transition count 128
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 334 place count 50 transition count 126
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 336 place count 50 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 338 place count 48 transition count 124
Applied a total of 338 rules in 51 ms. Remains 48 /211 variables (removed 163) and now considering 124/346 (removed 222) transitions.
// Phase 1: matrix 124 rows 48 cols
[2022-06-10 22:39:28] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:39:28] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 124 rows 48 cols
[2022-06-10 22:39:28] [INFO ] Computed 9 place invariants in 0 ms
[2022-06-10 22:39:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 22:39:28] [INFO ] Implicit Places using invariants and state equation in 117 ms returned [41, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 190 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/211 places, 124/346 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 45 transition count 123
Applied a total of 2 rules in 7 ms. Remains 45 /46 variables (removed 1) and now considering 123/124 (removed 1) transitions.
// Phase 1: matrix 123 rows 45 cols
[2022-06-10 22:39:28] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:39:28] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 123 rows 45 cols
[2022-06-10 22:39:28] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:39:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:39:28] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/211 places, 123/346 transitions.
Finished structural reductions, in 2 iterations. Remains : 45/211 places, 123/346 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s4 1) (EQ s9 1) (EQ s37 1) (EQ s40 1)), p0:(AND (EQ s42 0) (EQ s40 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2 reset in 136 ms.
Product exploration explored 100000 steps with 433 reset in 163 ms.
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 (NOT p1) p0)]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 212 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 123/123 transitions.
Applied a total of 0 rules in 6 ms. Remains 45 /45 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 45 cols
[2022-06-10 22:39:29] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:39:29] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 123 rows 45 cols
[2022-06-10 22:39:29] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:39:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:39:29] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2022-06-10 22:39:29] [INFO ] Redundant transitions in 21 ms returned [63]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 122 rows 45 cols
[2022-06-10 22:39:29] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:39:30] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/45 places, 122/123 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 44 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 43 transition count 122
Applied a total of 4 rules in 21 ms. Remains 43 /45 variables (removed 2) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 43 cols
[2022-06-10 22:39:30] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:39:30] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 122 rows 43 cols
[2022-06-10 22:39:30] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:39:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 22:39:30] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/45 places, 122/123 transitions.
Finished structural reductions, in 2 iterations. Remains : 43/45 places, 122/123 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 183 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 222 reset in 105 ms.
Product exploration explored 100000 steps with 346 reset in 128 ms.
Built C files in :
/tmp/ltsmin17063058705749303916
[2022-06-10 22:39:31] [INFO ] Computing symmetric may disable matrix : 122 transitions.
[2022-06-10 22:39:31] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:39:31] [INFO ] Computing symmetric may enable matrix : 122 transitions.
[2022-06-10 22:39:31] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:39:31] [INFO ] Computing Do-Not-Accords matrix : 122 transitions.
[2022-06-10 22:39:31] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:39:31] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17063058705749303916
Running compilation step : cd /tmp/ltsmin17063058705749303916;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 665 ms.
Running link step : cd /tmp/ltsmin17063058705749303916;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin17063058705749303916;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13167830244098194617.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 43 /43 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 43 cols
[2022-06-10 22:39:46] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:39:46] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 122 rows 43 cols
[2022-06-10 22:39:46] [INFO ] Computed 7 place invariants in 0 ms
[2022-06-10 22:39:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 22:39:46] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2022-06-10 22:39:46] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 122 rows 43 cols
[2022-06-10 22:39:46] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:39:47] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 43/43 places, 122/122 transitions.
Built C files in :
/tmp/ltsmin2671671351051408694
[2022-06-10 22:39:47] [INFO ] Computing symmetric may disable matrix : 122 transitions.
[2022-06-10 22:39:47] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:39:47] [INFO ] Computing symmetric may enable matrix : 122 transitions.
[2022-06-10 22:39:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:39:47] [INFO ] Computing Do-Not-Accords matrix : 122 transitions.
[2022-06-10 22:39:47] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:39:47] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2671671351051408694
Running compilation step : cd /tmp/ltsmin2671671351051408694;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 727 ms.
Running link step : cd /tmp/ltsmin2671671351051408694;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2671671351051408694;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9954537673498608886.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 22:40:02] [INFO ] Flatten gal took : 28 ms
[2022-06-10 22:40:02] [INFO ] Flatten gal took : 32 ms
[2022-06-10 22:40:02] [INFO ] Time to serialize gal into /tmp/LTL11801177544384018734.gal : 7 ms
[2022-06-10 22:40:02] [INFO ] Time to serialize properties into /tmp/LTL4902723323884640383.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11801177544384018734.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4902723323884640383.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1180117...267
Read 1 LTL properties
Checking formula 0 : !((G(F(F((X("((p232==0)&&(p226==0))"))||("((((p6==1)&&(p14==1))&&((p48==1)&&(p212==1)))&&(p226==1))"))))))
Formula 0 simplified : !GF("((((p6==1)&&(p14==1))&&((p48==1)&&(p212==1)))&&(p226==1))" | X"((p232==0)&&(p226==0))")
Reverse transition relation is NOT exact ! Due to transitions t64, t68, t91, t95, t117, t121, t143, t147, t170, t174, t52.t306, t52.t307, t52.t308, t52.t30...725
Computing Next relation with stutter on 4128 deadlock states
119 unique states visited
0 strongly connected components in search stack
120 transitions explored
61 items max in DFS search stack
1054 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.6344,208872,1,0,3893,467039,278,2130,4498,1.1696e+06,9896
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutonomousCar-PT-05b-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutonomousCar-PT-05b-LTLFireability-14 finished in 46216 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(F(p1)))))'
Support contains 5 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 346/346 transitions.
Graph (trivial) has 195 edges and 211 vertex of which 4 / 211 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 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 208 transition count 266
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 109 rules applied. Total rules applied 187 place count 131 transition count 234
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 207 place count 112 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 208 place count 111 transition count 233
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 208 place count 111 transition count 227
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 220 place count 105 transition count 227
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 222 place count 103 transition count 225
Iterating global reduction 4 with 2 rules applied. Total rules applied 224 place count 103 transition count 225
Performed 45 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 314 place count 58 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 315 place count 58 transition count 178
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 325 place count 48 transition count 127
Iterating global reduction 5 with 10 rules applied. Total rules applied 335 place count 48 transition count 127
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 339 place count 48 transition count 123
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 343 place count 46 transition count 121
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 345 place count 44 transition count 119
Applied a total of 345 rules in 27 ms. Remains 44 /211 variables (removed 167) and now considering 119/346 (removed 227) transitions.
// Phase 1: matrix 119 rows 44 cols
[2022-06-10 22:40:14] [INFO ] Computed 9 place invariants in 0 ms
[2022-06-10 22:40:14] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 119 rows 44 cols
[2022-06-10 22:40:14] [INFO ] Computed 9 place invariants in 0 ms
[2022-06-10 22:40:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 22:40:14] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [39, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 180 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/211 places, 119/346 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 41 transition count 118
Applied a total of 2 rules in 4 ms. Remains 41 /42 variables (removed 1) and now considering 118/119 (removed 1) transitions.
// Phase 1: matrix 118 rows 41 cols
[2022-06-10 22:40:14] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:40:14] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 118 rows 41 cols
[2022-06-10 22:40:14] [INFO ] Computed 7 place invariants in 0 ms
[2022-06-10 22:40:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:40:14] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/211 places, 118/346 transitions.
Finished structural reductions, in 2 iterations. Remains : 41/211 places, 118/346 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s28 1), p1:(AND (EQ s1 1) (EQ s7 1) (EQ s18 1) (EQ s37 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 11 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-15 finished in 531 ms.
All properties solved by simple procedures.
Total runtime 70585 ms.

BK_STOP 1654900815082

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-05b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-05b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r294-smll-165463873000484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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