Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 12:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 12:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 228K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678638001795

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:20:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:20:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:20:04] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2023-03-12 16:20:04] [INFO ] Transformed 289 places.
[2023-03-12 16:20:04] [INFO ] Transformed 644 transitions.
[2023-03-12 16:20:04] [INFO ] Found NUPN structural information;
[2023-03-12 16:20:04] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 219 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-06b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 644/644 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 250 transition count 605
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 250 transition count 605
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 222 place count 250 transition count 461
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 230 place count 242 transition count 453
Iterating global reduction 1 with 8 rules applied. Total rules applied 238 place count 242 transition count 453
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 239 place count 241 transition count 452
Iterating global reduction 1 with 1 rules applied. Total rules applied 240 place count 241 transition count 452
Applied a total of 240 rules in 66 ms. Remains 241 /289 variables (removed 48) and now considering 452/644 (removed 192) transitions.
// Phase 1: matrix 452 rows 241 cols
[2023-03-12 16:20:04] [INFO ] Computed 11 place invariants in 14 ms
[2023-03-12 16:20:05] [INFO ] Implicit Places using invariants in 318 ms returned []
[2023-03-12 16:20:05] [INFO ] Invariant cache hit.
[2023-03-12 16:20:05] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
[2023-03-12 16:20:05] [INFO ] Invariant cache hit.
[2023-03-12 16:20:06] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/289 places, 452/644 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1372 ms. Remains : 241/289 places, 452/644 transitions.
Support contains 45 out of 241 places after structural reductions.
[2023-03-12 16:20:06] [INFO ] Flatten gal took : 119 ms
[2023-03-12 16:20:06] [INFO ] Flatten gal took : 31 ms
[2023-03-12 16:20:06] [INFO ] Input system was already deterministic with 452 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 465 ms. (steps per millisecond=21 ) properties (out of 33) seen :18
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-12 16:20:07] [INFO ] Invariant cache hit.
[2023-03-12 16:20:07] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 16:20:07] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-12 16:20:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 16:20:08] [INFO ] After 882ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-12 16:20:08] [INFO ] Deduced a trap composed of 32 places in 278 ms of which 37 ms to minimize.
[2023-03-12 16:20:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2023-03-12 16:20:09] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 2 ms to minimize.
[2023-03-12 16:20:09] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 0 ms to minimize.
[2023-03-12 16:20:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 289 ms
[2023-03-12 16:20:09] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 1 ms to minimize.
[2023-03-12 16:20:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-03-12 16:20:10] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 1 ms to minimize.
[2023-03-12 16:20:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-12 16:20:10] [INFO ] After 2665ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 650 ms.
[2023-03-12 16:20:11] [INFO ] After 3541ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 163 ms.
Support contains 26 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 452/452 transitions.
Graph (trivial) has 200 edges and 241 vertex of which 4 / 241 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 876 edges and 239 vertex of which 237 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 83 rules applied. Total rules applied 85 place count 237 transition count 365
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 118 rules applied. Total rules applied 203 place count 156 transition count 328
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 225 place count 134 transition count 328
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 225 place count 134 transition count 320
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 241 place count 126 transition count 320
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 245 place count 122 transition count 316
Iterating global reduction 3 with 4 rules applied. Total rules applied 249 place count 122 transition count 316
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 333 place count 80 transition count 274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 334 place count 80 transition count 273
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 336 place count 78 transition count 266
Iterating global reduction 4 with 2 rules applied. Total rules applied 338 place count 78 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 339 place count 78 transition count 265
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 5 with 2 rules applied. Total rules applied 341 place count 77 transition count 264
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 342 place count 77 transition count 263
Free-agglomeration rule applied 16 times.
Iterating global reduction 5 with 16 rules applied. Total rules applied 358 place count 77 transition count 247
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 374 place count 61 transition count 247
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 378 place count 61 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 379 place count 60 transition count 246
Applied a total of 379 rules in 119 ms. Remains 60 /241 variables (removed 181) and now considering 246/452 (removed 206) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 60/241 places, 246/452 transitions.
Incomplete random walk after 10000 steps, including 430 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 246 rows 60 cols
[2023-03-12 16:20:11] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 16:20:11] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:20:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 16:20:11] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:20:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:20:12] [INFO ] After 26ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:20:12] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-12 16:20:12] [INFO ] After 311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 246/246 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 60 transition count 245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 59 transition count 245
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 59 transition count 244
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 58 transition count 244
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 56 transition count 231
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 56 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 56 transition count 230
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 19 place count 51 transition count 225
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 50 transition count 218
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 50 transition count 218
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 48 transition count 216
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 30 place count 48 transition count 211
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 59 place count 43 transition count 187
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 42 transition count 186
Applied a total of 60 rules in 48 ms. Remains 42 /60 variables (removed 18) and now considering 186/246 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 42/60 places, 186/246 transitions.
Finished random walk after 3403 steps, including 33 resets, run visited all 1 properties in 12 ms. (steps per millisecond=283 )
Computed a total of 41 stabilizing places and 42 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 8 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 235 transition count 446
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 235 transition count 446
Applied a total of 12 rules in 8 ms. Remains 235 /241 variables (removed 6) and now considering 446/452 (removed 6) transitions.
// Phase 1: matrix 446 rows 235 cols
[2023-03-12 16:20:12] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-12 16:20:13] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-12 16:20:13] [INFO ] Invariant cache hit.
[2023-03-12 16:20:13] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2023-03-12 16:20:13] [INFO ] Invariant cache hit.
[2023-03-12 16:20:13] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 446/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 854 ms. Remains : 235/241 places, 446/452 transitions.
Stuttering acceptance computed with spot in 331 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(NEQ s144 1), p0:(AND (EQ s55 1) (EQ s80 1) (EQ s100 1) (EQ s125 1) (EQ s150 1) (EQ s180 1) (EQ s202 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 4 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-00 finished in 1328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Graph (trivial) has 226 edges and 241 vertex of which 4 / 241 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 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 238 transition count 362
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 124 rules applied. Total rules applied 212 place count 151 transition count 325
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 234 place count 129 transition count 325
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 234 place count 129 transition count 318
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 248 place count 122 transition count 318
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 253 place count 117 transition count 313
Iterating global reduction 3 with 5 rules applied. Total rules applied 258 place count 117 transition count 313
Performed 51 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 360 place count 66 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 361 place count 66 transition count 260
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 373 place count 54 transition count 188
Iterating global reduction 4 with 12 rules applied. Total rules applied 385 place count 54 transition count 188
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 391 place count 54 transition count 182
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 395 place count 52 transition count 180
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 397 place count 50 transition count 178
Applied a total of 397 rules in 73 ms. Remains 50 /241 variables (removed 191) and now considering 178/452 (removed 274) transitions.
// Phase 1: matrix 178 rows 50 cols
[2023-03-12 16:20:14] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-12 16:20:14] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-12 16:20:14] [INFO ] Invariant cache hit.
[2023-03-12 16:20:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:20:14] [INFO ] Implicit Places using invariants and state equation in 145 ms returned [45, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 214 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/241 places, 178/452 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 47 transition count 177
Applied a total of 2 rules in 15 ms. Remains 47 /48 variables (removed 1) and now considering 177/178 (removed 1) transitions.
// Phase 1: matrix 177 rows 47 cols
[2023-03-12 16:20:14] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 16:20:14] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-12 16:20:14] [INFO ] Invariant cache hit.
[2023-03-12 16:20:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:20:14] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/241 places, 177/452 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 526 ms. Remains : 47/241 places, 177/452 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s6 1) (EQ s32 1) (EQ s43 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 16 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-01 finished in 663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0&&G(F(p1))&&(X(!p0)||(p2&&X(p3)))))'
Support contains 7 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 237 transition count 448
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 237 transition count 448
Applied a total of 8 rules in 15 ms. Remains 237 /241 variables (removed 4) and now considering 448/452 (removed 4) transitions.
// Phase 1: matrix 448 rows 237 cols
[2023-03-12 16:20:14] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-12 16:20:15] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-12 16:20:15] [INFO ] Invariant cache hit.
[2023-03-12 16:20:15] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2023-03-12 16:20:15] [INFO ] Invariant cache hit.
[2023-03-12 16:20:15] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/241 places, 448/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 973 ms. Remains : 237/241 places, 448/452 transitions.
Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p1) p0), true, p0, (NOT p1), (NOT p1), (AND p0 (NOT p3))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(NOT p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 1}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s14 1) (EQ s51 1) (EQ s203 1)), p2:(NEQ s177 1), p1:(NEQ s57 1), p3:(NEQ s41 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19 reset in 268 ms.
Product exploration explored 100000 steps with 5 reset in 223 ms.
Computed a total of 39 stabilizing places and 40 stable transitions
Computed a total of 39 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1 p3), (X p1), (X (NOT (AND p0 (NOT p3)))), (X (NOT p0)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 296 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1)]
Finished random walk after 356 steps, including 3 resets, run visited all 1 properties in 3 ms. (steps per millisecond=118 )
Knowledge obtained : [(AND (NOT p0) p2 p1 p3), (X p1), (X (NOT (AND p0 (NOT p3)))), (X (NOT p0)), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 495 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 237 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 448/448 transitions.
Graph (trivial) has 214 edges and 237 vertex of which 4 / 237 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 234 transition count 363
Reduce places removed 82 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 114 rules applied. Total rules applied 197 place count 152 transition count 331
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 217 place count 133 transition count 330
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 220 place count 132 transition count 328
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 221 place count 131 transition count 328
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 221 place count 131 transition count 321
Deduced a syphon composed of 7 places in 17 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 235 place count 124 transition count 321
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 236 place count 123 transition count 320
Iterating global reduction 5 with 1 rules applied. Total rules applied 237 place count 123 transition count 320
Performed 51 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 339 place count 72 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 340 place count 72 transition count 267
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 351 place count 61 transition count 202
Iterating global reduction 6 with 11 rules applied. Total rules applied 362 place count 61 transition count 202
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 367 place count 61 transition count 197
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 371 place count 59 transition count 195
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 372 place count 59 transition count 195
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 374 place count 57 transition count 193
Applied a total of 374 rules in 137 ms. Remains 57 /237 variables (removed 180) and now considering 193/448 (removed 255) transitions.
// Phase 1: matrix 193 rows 57 cols
[2023-03-12 16:20:18] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-12 16:20:18] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-12 16:20:18] [INFO ] Invariant cache hit.
[2023-03-12 16:20:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:20:18] [INFO ] Implicit Places using invariants and state equation in 170 ms returned [52, 56]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 312 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/237 places, 193/448 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 54 transition count 192
Applied a total of 2 rules in 20 ms. Remains 54 /55 variables (removed 1) and now considering 192/193 (removed 1) transitions.
// Phase 1: matrix 192 rows 54 cols
[2023-03-12 16:20:18] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-12 16:20:18] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-12 16:20:18] [INFO ] Invariant cache hit.
[2023-03-12 16:20:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:20:18] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/237 places, 192/448 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 831 ms. Remains : 54/237 places, 192/448 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 221 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1)]
Finished random walk after 23 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 246 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 54 reset in 114 ms.
Product exploration explored 100000 steps with 97 reset in 87 ms.
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 192/192 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 54 transition count 189
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 51 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 51 transition count 187
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 49 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 48 transition count 180
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 48 transition count 180
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 2 with 4 rules applied. Total rules applied 16 place count 46 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 45 transition count 171
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 45 transition count 171
Applied a total of 18 rules in 12 ms. Remains 45 /54 variables (removed 9) and now considering 171/192 (removed 21) transitions.
// Phase 1: matrix 171 rows 45 cols
[2023-03-12 16:20:19] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-12 16:20:20] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-12 16:20:20] [INFO ] Invariant cache hit.
[2023-03-12 16:20:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:20:20] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2023-03-12 16:20:20] [INFO ] Redundant transitions in 44 ms returned [95]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 170 rows 45 cols
[2023-03-12 16:20:20] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-12 16:20:20] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/54 places, 170/192 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 43 transition count 168
Applied a total of 2 rules in 8 ms. Remains 43 /45 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 43 cols
[2023-03-12 16:20:20] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-12 16:20:20] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-12 16:20:20] [INFO ] Invariant cache hit.
[2023-03-12 16:20:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:20:21] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/54 places, 168/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1098 ms. Remains : 43/54 places, 168/192 transitions.
Treatment of property AutonomousCar-PT-06b-LTLFireability-02 finished in 6349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)||p0)))'
Support contains 6 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 235 transition count 446
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 235 transition count 446
Applied a total of 12 rules in 9 ms. Remains 235 /241 variables (removed 6) and now considering 446/452 (removed 6) transitions.
// Phase 1: matrix 446 rows 235 cols
[2023-03-12 16:20:21] [INFO ] Computed 11 place invariants in 7 ms
[2023-03-12 16:20:21] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-12 16:20:21] [INFO ] Invariant cache hit.
[2023-03-12 16:20:21] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2023-03-12 16:20:21] [INFO ] Invariant cache hit.
[2023-03-12 16:20:21] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 446/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 658 ms. Remains : 235/241 places, 446/452 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(AND (EQ s4 1) (EQ s14 1) (EQ s151 1) (EQ s201 1)), p0:(OR (EQ s4 0) (EQ s11 0) (EQ s61 0) (EQ s201 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 258 ms.
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Computed a total of 39 stabilizing places and 40 stable transitions
Computed a total of 39 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-06b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-06b-LTLFireability-04 finished in 1448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 1 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 236 transition count 447
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 236 transition count 447
Applied a total of 10 rules in 7 ms. Remains 236 /241 variables (removed 5) and now considering 447/452 (removed 5) transitions.
// Phase 1: matrix 447 rows 236 cols
[2023-03-12 16:20:22] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 16:20:22] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-12 16:20:22] [INFO ] Invariant cache hit.
[2023-03-12 16:20:22] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2023-03-12 16:20:22] [INFO ] Invariant cache hit.
[2023-03-12 16:20:23] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/241 places, 447/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 731 ms. Remains : 236/241 places, 447/452 transitions.
Stuttering acceptance computed with spot in 317 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(EQ s216 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3773 reset in 160 ms.
Product exploration explored 100000 steps with 3796 reset in 197 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/236 stabilizing places and 41/447 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 197 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 258 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 408 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 324 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-12 16:20:25] [INFO ] Invariant cache hit.
[2023-03-12 16:20:25] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 16:20:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:20:25] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2023-03-12 16:20:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:20:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 16:20:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:20:26] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2023-03-12 16:20:26] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 1 ms to minimize.
[2023-03-12 16:20:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-03-12 16:20:26] [INFO ] Computed and/alt/rep : 209/384/209 causal constraints (skipped 237 transitions) in 82 ms.
[2023-03-12 16:20:27] [INFO ] Added : 170 causal constraints over 34 iterations in 1413 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 447/447 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 447/447 (removed 0) transitions.
[2023-03-12 16:20:27] [INFO ] Invariant cache hit.
[2023-03-12 16:20:28] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-12 16:20:28] [INFO ] Invariant cache hit.
[2023-03-12 16:20:28] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2023-03-12 16:20:28] [INFO ] Invariant cache hit.
[2023-03-12 16:20:28] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 987 ms. Remains : 236/236 places, 447/447 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/236 stabilizing places and 41/447 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 196 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 401 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-12 16:20:30] [INFO ] Invariant cache hit.
[2023-03-12 16:20:30] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-12 16:20:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:20:30] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2023-03-12 16:20:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:20:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 16:20:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:20:31] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2023-03-12 16:20:31] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 1 ms to minimize.
[2023-03-12 16:20:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-03-12 16:20:31] [INFO ] Computed and/alt/rep : 209/384/209 causal constraints (skipped 237 transitions) in 64 ms.
[2023-03-12 16:20:32] [INFO ] Added : 170 causal constraints over 34 iterations in 1534 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 385 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3791 reset in 218 ms.
Product exploration explored 100000 steps with 3807 reset in 195 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 355 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 447/447 transitions.
Graph (trivial) has 222 edges and 236 vertex of which 4 / 236 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.
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 234 transition count 445
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 99 place count 234 transition count 430
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 99 place count 234 transition count 430
Deduced a syphon composed of 101 places in 1 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 117 place count 234 transition count 430
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 189 place count 162 transition count 358
Deduced a syphon composed of 30 places in 16 ms
Iterating global reduction 2 with 72 rules applied. Total rules applied 261 place count 162 transition count 358
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 261 place count 162 transition count 359
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 162 transition count 359
Performed 66 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 2 with 66 rules applied. Total rules applied 328 place count 162 transition count 368
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 330 place count 162 transition count 366
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 384 place count 108 transition count 246
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 3 with 54 rules applied. Total rules applied 438 place count 108 transition count 246
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 450 place count 108 transition count 234
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 457 place count 101 transition count 227
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 464 place count 101 transition count 227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 465 place count 101 transition count 227
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 467 place count 99 transition count 225
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 469 place count 99 transition count 225
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 470 place count 99 transition count 227
Deduced a syphon composed of 49 places in 1 ms
Applied a total of 470 rules in 95 ms. Remains 99 /236 variables (removed 137) and now considering 227/447 (removed 220) transitions.
[2023-03-12 16:20:34] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 227 rows 99 cols
[2023-03-12 16:20:34] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-12 16:20:34] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/236 places, 227/447 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 353 ms. Remains : 99/236 places, 227/447 transitions.
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 447/447 transitions.
Applied a total of 0 rules in 5 ms. Remains 236 /236 variables (removed 0) and now considering 447/447 (removed 0) transitions.
// Phase 1: matrix 447 rows 236 cols
[2023-03-12 16:20:34] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 16:20:34] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-12 16:20:34] [INFO ] Invariant cache hit.
[2023-03-12 16:20:35] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2023-03-12 16:20:35] [INFO ] Invariant cache hit.
[2023-03-12 16:20:35] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 630 ms. Remains : 236/236 places, 447/447 transitions.
Treatment of property AutonomousCar-PT-06b-LTLFireability-05 finished in 12869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 235 transition count 446
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 235 transition count 446
Applied a total of 12 rules in 7 ms. Remains 235 /241 variables (removed 6) and now considering 446/452 (removed 6) transitions.
// Phase 1: matrix 446 rows 235 cols
[2023-03-12 16:20:35] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 16:20:35] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-12 16:20:35] [INFO ] Invariant cache hit.
[2023-03-12 16:20:35] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2023-03-12 16:20:35] [INFO ] Invariant cache hit.
[2023-03-12 16:20:36] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 446/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 610 ms. Remains : 235/241 places, 446/452 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s79 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1787 reset in 164 ms.
Product exploration explored 100000 steps with 1787 reset in 155 ms.
Computed a total of 39 stabilizing places and 40 stable transitions
Computed a total of 39 stabilizing places and 40 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 55 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=55 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
[2023-03-12 16:20:37] [INFO ] Invariant cache hit.
[2023-03-12 16:20:37] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 16:20:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:20:37] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2023-03-12 16:20:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:20:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 16:20:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:20:37] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2023-03-12 16:20:37] [INFO ] Computed and/alt/rep : 208/383/208 causal constraints (skipped 237 transitions) in 47 ms.
[2023-03-12 16:20:39] [INFO ] Added : 180 causal constraints over 37 iterations in 1520 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 446/446 transitions.
Graph (trivial) has 220 edges and 235 vertex of which 4 / 235 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 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 232 transition count 359
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 121 rules applied. Total rules applied 206 place count 148 transition count 322
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 229 place count 126 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 230 place count 125 transition count 321
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 230 place count 125 transition count 314
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 244 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 245 place count 117 transition count 313
Iterating global reduction 4 with 1 rules applied. Total rules applied 246 place count 117 transition count 313
Performed 53 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 352 place count 64 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 353 place count 64 transition count 258
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 366 place count 51 transition count 179
Iterating global reduction 5 with 13 rules applied. Total rules applied 379 place count 51 transition count 179
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 385 place count 51 transition count 173
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 389 place count 49 transition count 171
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 391 place count 47 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 392 place count 46 transition count 169
Applied a total of 392 rules in 44 ms. Remains 46 /235 variables (removed 189) and now considering 169/446 (removed 277) transitions.
// Phase 1: matrix 169 rows 46 cols
[2023-03-12 16:20:39] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-12 16:20:39] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-12 16:20:39] [INFO ] Invariant cache hit.
[2023-03-12 16:20:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:20:39] [INFO ] Implicit Places using invariants and state equation in 119 ms returned [41, 45]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 283 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/235 places, 169/446 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 43 transition count 168
Applied a total of 2 rules in 11 ms. Remains 43 /44 variables (removed 1) and now considering 168/169 (removed 1) transitions.
// Phase 1: matrix 168 rows 43 cols
[2023-03-12 16:20:39] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:20:39] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-12 16:20:39] [INFO ] Invariant cache hit.
[2023-03-12 16:20:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:20:40] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/235 places, 168/446 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 758 ms. Remains : 43/235 places, 168/446 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 183 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 272 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
[2023-03-12 16:20:40] [INFO ] Invariant cache hit.
[2023-03-12 16:20:40] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 16:20:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:20:40] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-12 16:20:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:20:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 16:20:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:20:41] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-03-12 16:20:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:20:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-12 16:20:41] [INFO ] Computed and/alt/rep : 11/48/11 causal constraints (skipped 155 transitions) in 28 ms.
[2023-03-12 16:20:41] [INFO ] Added : 0 causal constraints over 0 iterations in 85 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 40043 reset in 168 ms.
Product exploration explored 100000 steps with 40000 reset in 166 ms.
Support contains 1 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 168/168 transitions.
Applied a total of 0 rules in 13 ms. Remains 43 /43 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2023-03-12 16:20:41] [INFO ] Invariant cache hit.
[2023-03-12 16:20:41] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-12 16:20:41] [INFO ] Invariant cache hit.
[2023-03-12 16:20:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:20:41] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-12 16:20:41] [INFO ] Redundant transitions in 63 ms returned [93]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 167 rows 43 cols
[2023-03-12 16:20:41] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-12 16:20:42] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/43 places, 167/168 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 41 transition count 165
Applied a total of 2 rules in 5 ms. Remains 41 /43 variables (removed 2) and now considering 165/167 (removed 2) transitions.
// Phase 1: matrix 165 rows 41 cols
[2023-03-12 16:20:42] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:20:42] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-12 16:20:42] [INFO ] Invariant cache hit.
[2023-03-12 16:20:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:20:42] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/43 places, 165/168 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 803 ms. Remains : 41/43 places, 165/168 transitions.
Treatment of property AutonomousCar-PT-06b-LTLFireability-06 finished in 7046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(p0)||F(p1)))||((G(p1)&&F(p2)) U p2))))'
Support contains 12 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 235 transition count 446
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 235 transition count 446
Applied a total of 12 rules in 5 ms. Remains 235 /241 variables (removed 6) and now considering 446/452 (removed 6) transitions.
// Phase 1: matrix 446 rows 235 cols
[2023-03-12 16:20:42] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 16:20:42] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-12 16:20:42] [INFO ] Invariant cache hit.
[2023-03-12 16:20:43] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2023-03-12 16:20:43] [INFO ] Invariant cache hit.
[2023-03-12 16:20:43] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 446/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 815 ms. Remains : 235/241 places, 446/452 transitions.
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s50 1) (EQ s75 1) (EQ s100 1) (EQ s130 1) (EQ s155 1) (EQ s180 1) (EQ s202 1)), p1:(EQ s151 1), p0:(AND (EQ s4 1) (EQ s12 1) (EQ s36 1) (EQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 247 steps with 2 reset in 2 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-07 finished in 1154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p1)||p0))||G(p2))))'
Support contains 13 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Graph (trivial) has 211 edges and 241 vertex of which 4 / 241 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 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 238 transition count 362
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 124 rules applied. Total rules applied 212 place count 151 transition count 325
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 234 place count 129 transition count 325
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 234 place count 129 transition count 318
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 248 place count 122 transition count 318
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 253 place count 117 transition count 313
Iterating global reduction 3 with 5 rules applied. Total rules applied 258 place count 117 transition count 313
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 3 with 86 rules applied. Total rules applied 344 place count 74 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 345 place count 74 transition count 268
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 352 place count 67 transition count 230
Iterating global reduction 4 with 7 rules applied. Total rules applied 359 place count 67 transition count 230
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 364 place count 67 transition count 225
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 368 place count 65 transition count 223
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 369 place count 65 transition count 223
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 370 place count 64 transition count 222
Applied a total of 370 rules in 55 ms. Remains 64 /241 variables (removed 177) and now considering 222/452 (removed 230) transitions.
// Phase 1: matrix 222 rows 64 cols
[2023-03-12 16:20:43] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-12 16:20:43] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-12 16:20:43] [INFO ] Invariant cache hit.
[2023-03-12 16:20:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:20:43] [INFO ] Implicit Places using invariants and state equation in 145 ms returned [59, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 199 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/241 places, 222/452 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 61 transition count 221
Applied a total of 2 rules in 5 ms. Remains 61 /62 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 61 cols
[2023-03-12 16:20:43] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 16:20:43] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-12 16:20:43] [INFO ] Invariant cache hit.
[2023-03-12 16:20:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:20:44] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/241 places, 221/452 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 384 ms. Remains : 61/241 places, 221/452 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s3 0) (EQ s46 0) (EQ s56 0)), p1:(OR (EQ s17 0) (EQ s21 0) (EQ s28 0) (EQ s37 0) (EQ s41 0) (EQ s50 0) (EQ s57 0)), p2:(OR (EQ s2 0) ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9 reset in 95 ms.
Product exploration explored 100000 steps with 118 reset in 77 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 606 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 426 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 52 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 16:20:45] [INFO ] Invariant cache hit.
[2023-03-12 16:20:45] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 16:20:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 16:20:45] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p2))]
Property proved to be true thanks to knowledge :(G (NOT (AND p0 (NOT p1) (NOT p2))))
Knowledge based reduction with 13 factoid took 399 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-06b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-06b-LTLFireability-09 finished in 2187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Graph (trivial) has 226 edges and 241 vertex of which 4 / 241 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 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 238 transition count 362
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 124 rules applied. Total rules applied 212 place count 151 transition count 325
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 234 place count 129 transition count 325
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 234 place count 129 transition count 317
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 250 place count 121 transition count 317
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 255 place count 116 transition count 312
Iterating global reduction 3 with 5 rules applied. Total rules applied 260 place count 116 transition count 312
Performed 50 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 360 place count 66 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 361 place count 66 transition count 260
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 373 place count 54 transition count 188
Iterating global reduction 4 with 12 rules applied. Total rules applied 385 place count 54 transition count 188
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 391 place count 54 transition count 182
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 395 place count 52 transition count 180
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 396 place count 51 transition count 179
Applied a total of 396 rules in 37 ms. Remains 51 /241 variables (removed 190) and now considering 179/452 (removed 273) transitions.
// Phase 1: matrix 179 rows 51 cols
[2023-03-12 16:20:45] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-12 16:20:45] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-12 16:20:45] [INFO ] Invariant cache hit.
[2023-03-12 16:20:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:20:46] [INFO ] Implicit Places using invariants and state equation in 131 ms returned [46, 50]
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 : 49/241 places, 179/452 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 48 transition count 178
Applied a total of 2 rules in 6 ms. Remains 48 /49 variables (removed 1) and now considering 178/179 (removed 1) transitions.
// Phase 1: matrix 178 rows 48 cols
[2023-03-12 16:20:46] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-12 16:20:46] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-12 16:20:46] [INFO ] Invariant cache hit.
[2023-03-12 16:20:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:20:46] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/241 places, 178/452 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 446 ms. Remains : 48/241 places, 178/452 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s3 1) (EQ s17 1) (EQ s44 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 14 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-10 finished in 515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X(X(G((p1||(p2&&X(p3))))))))))'
Support contains 7 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 235 transition count 446
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 235 transition count 446
Applied a total of 12 rules in 8 ms. Remains 235 /241 variables (removed 6) and now considering 446/452 (removed 6) transitions.
// Phase 1: matrix 446 rows 235 cols
[2023-03-12 16:20:46] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-12 16:20:46] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-12 16:20:46] [INFO ] Invariant cache hit.
[2023-03-12 16:20:46] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2023-03-12 16:20:46] [INFO ] Invariant cache hit.
[2023-03-12 16:20:46] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 446/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 620 ms. Remains : 235/241 places, 446/452 transitions.
Stuttering acceptance computed with spot in 505 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) p1 p3), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s6 1) (EQ s99 1) (EQ s201 1)), p1:(AND (EQ s4 1) (EQ s13 1) (EQ s120 1) (EQ s201 1)), p2:(OR (EQ s4 0) (EQ s6 0) (EQ s136 0) (EQ s20...], 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, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-11 finished in 1152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(p1&&X(X(p2))&&G(p3)))))'
Support contains 7 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 237 transition count 448
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 237 transition count 448
Applied a total of 8 rules in 5 ms. Remains 237 /241 variables (removed 4) and now considering 448/452 (removed 4) transitions.
// Phase 1: matrix 448 rows 237 cols
[2023-03-12 16:20:47] [INFO ] Computed 11 place invariants in 6 ms
[2023-03-12 16:20:47] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-12 16:20:47] [INFO ] Invariant cache hit.
[2023-03-12 16:20:48] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2023-03-12 16:20:48] [INFO ] Invariant cache hit.
[2023-03-12 16:20:48] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/241 places, 448/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 771 ms. Remains : 237/241 places, 448/452 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p3), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR p0 (AND p1 p3)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={} source=3 dest: 1}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}]], initial=0, aps=[p0:(AND (EQ s107 0) (EQ s4 1) (EQ s15 1) (EQ s95 1) (EQ s203 1)), p1:(EQ s107 0), p3:(EQ s72 0), p2:(EQ s124 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1111 steps with 27 reset in 6 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-12 finished in 1043 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0&&X(!p0)) U (G((!p0&&X(!p0)))||(!p0&&X((!p0&&X(p1))))))))'
Support contains 8 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 235 transition count 446
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 235 transition count 446
Applied a total of 12 rules in 19 ms. Remains 235 /241 variables (removed 6) and now considering 446/452 (removed 6) transitions.
// Phase 1: matrix 446 rows 235 cols
[2023-03-12 16:20:48] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-12 16:20:48] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-12 16:20:48] [INFO ] Invariant cache hit.
[2023-03-12 16:20:48] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2023-03-12 16:20:48] [INFO ] Invariant cache hit.
[2023-03-12 16:20:49] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 446/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 693 ms. Remains : 235/241 places, 446/452 transitions.
Stuttering acceptance computed with spot in 290 ms :[p0, p0, false, (AND p0 (NOT p1)), false]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s55 1) (EQ s80 1) (EQ s105 1) (EQ s130 1) (EQ s155 1) (EQ s180 1) (EQ s202 1)), p1:(NEQ s179 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 39988 reset in 228 ms.
Product exploration explored 100000 steps with 40038 reset in 197 ms.
Computed a total of 39 stabilizing places and 40 stable transitions
Computed a total of 39 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1)
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-06b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-06b-LTLFireability-13 finished in 1622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(p1)))||X((p1||X(p2)))))'
Support contains 6 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 236 transition count 447
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 236 transition count 447
Applied a total of 10 rules in 5 ms. Remains 236 /241 variables (removed 5) and now considering 447/452 (removed 5) transitions.
// Phase 1: matrix 447 rows 236 cols
[2023-03-12 16:20:50] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 16:20:50] [INFO ] Implicit Places using invariants in 458 ms returned []
[2023-03-12 16:20:50] [INFO ] Invariant cache hit.
[2023-03-12 16:20:50] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
[2023-03-12 16:20:50] [INFO ] Invariant cache hit.
[2023-03-12 16:20:51] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/241 places, 447/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 988 ms. Remains : 236/241 places, 447/452 transitions.
Stuttering acceptance computed with spot in 412 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 8}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 0}, { cond=(AND p0 p1), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 8}]], initial=4, aps=[p1:(EQ s130 1), p2:(OR (EQ s4 0) (EQ s12 0) (EQ s127 0) (EQ s202 0)), p0:(EQ s60 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 181 ms.
Product exploration explored 100000 steps with 33333 reset in 240 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 10 factoid took 368 ms. Reduced automaton from 9 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-06b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-06b-LTLFireability-14 finished in 2211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(p1&&G(F(p1))))))'
Support contains 5 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Graph (trivial) has 222 edges and 241 vertex of which 4 / 241 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 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 238 transition count 363
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 123 rules applied. Total rules applied 210 place count 152 transition count 326
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 232 place count 130 transition count 326
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 232 place count 130 transition count 318
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 248 place count 122 transition count 318
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 252 place count 118 transition count 314
Iterating global reduction 3 with 4 rules applied. Total rules applied 256 place count 118 transition count 314
Performed 49 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 354 place count 69 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 355 place count 69 transition count 263
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 366 place count 58 transition count 198
Iterating global reduction 4 with 11 rules applied. Total rules applied 377 place count 58 transition count 198
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 383 place count 58 transition count 192
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 387 place count 56 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 388 place count 55 transition count 189
Applied a total of 388 rules in 59 ms. Remains 55 /241 variables (removed 186) and now considering 189/452 (removed 263) transitions.
// Phase 1: matrix 189 rows 55 cols
[2023-03-12 16:20:52] [INFO ] Computed 10 place invariants in 14 ms
[2023-03-12 16:20:52] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-12 16:20:52] [INFO ] Invariant cache hit.
[2023-03-12 16:20:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:20:52] [INFO ] Implicit Places using invariants and state equation in 229 ms returned [50, 54]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 361 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/241 places, 189/452 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 52 transition count 188
Applied a total of 2 rules in 12 ms. Remains 52 /53 variables (removed 1) and now considering 188/189 (removed 1) transitions.
// Phase 1: matrix 188 rows 52 cols
[2023-03-12 16:20:52] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 16:20:52] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-12 16:20:52] [INFO ] Invariant cache hit.
[2023-03-12 16:20:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:20:53] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/241 places, 188/452 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 889 ms. Remains : 52/241 places, 188/452 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s42 0), p1:(OR (EQ s2 0) (EQ s3 0) (EQ s29 0) (EQ s48 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 139 reset in 74 ms.
Product exploration explored 100000 steps with 0 reset in 42 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 262 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2328 steps, including 116 resets, run visited all 2 properties in 10 ms. (steps per millisecond=232 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 410 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 188/188 transitions.
Applied a total of 0 rules in 5 ms. Remains 52 /52 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2023-03-12 16:20:54] [INFO ] Invariant cache hit.
[2023-03-12 16:20:54] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-12 16:20:54] [INFO ] Invariant cache hit.
[2023-03-12 16:20:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:20:54] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-12 16:20:54] [INFO ] Redundant transitions in 16 ms returned [101]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 187 rows 52 cols
[2023-03-12 16:20:54] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 16:20:54] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/52 places, 187/188 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 50 transition count 185
Applied a total of 2 rules in 5 ms. Remains 50 /52 variables (removed 2) and now considering 185/187 (removed 2) transitions.
// Phase 1: matrix 185 rows 50 cols
[2023-03-12 16:20:54] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-12 16:20:55] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-12 16:20:55] [INFO ] Invariant cache hit.
[2023-03-12 16:20:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:20:55] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/52 places, 185/188 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 795 ms. Remains : 50/52 places, 185/188 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 303 steps, including 19 resets, run visited all 2 properties in 3 ms. (steps per millisecond=101 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 40 reset in 88 ms.
Product exploration explored 100000 steps with 48 reset in 43 ms.
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 185/185 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2023-03-12 16:20:56] [INFO ] Invariant cache hit.
[2023-03-12 16:20:56] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-12 16:20:56] [INFO ] Invariant cache hit.
[2023-03-12 16:20:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:20:56] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2023-03-12 16:20:56] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-12 16:20:56] [INFO ] Invariant cache hit.
[2023-03-12 16:20:57] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 633 ms. Remains : 50/50 places, 185/185 transitions.
Treatment of property AutonomousCar-PT-06b-LTLFireability-15 finished in 4805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0&&G(F(p1))&&(X(!p0)||(p2&&X(p3)))))'
Found a Shortening insensitive property : AutonomousCar-PT-06b-LTLFireability-02
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p1) p0), true, p0, (NOT p1), (NOT p1), (AND p0 (NOT p3))]
Support contains 7 out of 241 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Graph (trivial) has 218 edges and 241 vertex of which 4 / 241 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 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 238 transition count 365
Reduce places removed 84 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 116 rules applied. Total rules applied 201 place count 154 transition count 333
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 221 place count 135 transition count 332
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 224 place count 134 transition count 330
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 225 place count 133 transition count 330
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 225 place count 133 transition count 322
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 241 place count 125 transition count 322
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 245 place count 121 transition count 318
Iterating global reduction 5 with 4 rules applied. Total rules applied 249 place count 121 transition count 318
Performed 49 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 347 place count 72 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 348 place count 72 transition count 267
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 359 place count 61 transition count 202
Iterating global reduction 6 with 11 rules applied. Total rules applied 370 place count 61 transition count 202
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 375 place count 61 transition count 197
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 379 place count 59 transition count 195
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 380 place count 59 transition count 195
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 382 place count 57 transition count 193
Applied a total of 382 rules in 58 ms. Remains 57 /241 variables (removed 184) and now considering 193/452 (removed 259) transitions.
// Phase 1: matrix 193 rows 57 cols
[2023-03-12 16:20:57] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-12 16:20:57] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-12 16:20:57] [INFO ] Invariant cache hit.
[2023-03-12 16:20:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:20:57] [INFO ] Implicit Places using invariants and state equation in 174 ms returned [52, 56]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 293 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 55/241 places, 193/452 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 54 transition count 192
Applied a total of 2 rules in 6 ms. Remains 54 /55 variables (removed 1) and now considering 192/193 (removed 1) transitions.
// Phase 1: matrix 192 rows 54 cols
[2023-03-12 16:20:58] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-12 16:20:58] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-12 16:20:58] [INFO ] Invariant cache hit.
[2023-03-12 16:20:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:20:58] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 54/241 places, 192/452 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 648 ms. Remains : 54/241 places, 192/452 transitions.
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(NOT p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s7 1) (EQ s14 1) (EQ s50 1)), p2:(NEQ s44 1), p1:(NEQ s18 1), p3:(NEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 87 reset in 41 ms.
Product exploration explored 100000 steps with 105 reset in 45 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1 p3), (X p1), (X (NOT (AND p0 (NOT p3)))), (X (NOT p0)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 376 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1)]
Finished random walk after 63 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=63 )
Knowledge obtained : [(AND (NOT p0) p2 p1 p3), (X p1), (X (NOT (AND p0 (NOT p3)))), (X (NOT p0)), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 310 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 54 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 192/192 transitions.
Applied a total of 0 rules in 9 ms. Remains 54 /54 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-12 16:20:59] [INFO ] Invariant cache hit.
[2023-03-12 16:20:59] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-12 16:20:59] [INFO ] Invariant cache hit.
[2023-03-12 16:20:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:20:59] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2023-03-12 16:20:59] [INFO ] Redundant transitions in 23 ms returned [104]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 191 rows 54 cols
[2023-03-12 16:20:59] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-12 16:21:00] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/54 places, 191/192 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 189
Applied a total of 2 rules in 7 ms. Remains 52 /54 variables (removed 2) and now considering 189/191 (removed 2) transitions.
// Phase 1: matrix 189 rows 52 cols
[2023-03-12 16:21:00] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 16:21:00] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-12 16:21:00] [INFO ] Invariant cache hit.
[2023-03-12 16:21:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:21:00] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/54 places, 189/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 868 ms. Remains : 52/54 places, 189/192 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Finished random walk after 66 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=66 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 187 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 16 reset in 55 ms.
Product exploration explored 100000 steps with 49 reset in 40 ms.
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 189/189 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 186
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 49 transition count 185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 49 transition count 184
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 47 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 46 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 46 transition count 177
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 2 with 4 rules applied. Total rules applied 16 place count 44 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 43 transition count 168
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 43 transition count 168
Applied a total of 18 rules in 8 ms. Remains 43 /52 variables (removed 9) and now considering 168/189 (removed 21) transitions.
// Phase 1: matrix 168 rows 43 cols
[2023-03-12 16:21:01] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-12 16:21:01] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-12 16:21:01] [INFO ] Invariant cache hit.
[2023-03-12 16:21:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:21:01] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-12 16:21:01] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-12 16:21:01] [INFO ] Invariant cache hit.
[2023-03-12 16:21:01] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/52 places, 168/189 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 399 ms. Remains : 43/52 places, 168/189 transitions.
Treatment of property AutonomousCar-PT-06b-LTLFireability-02 finished in 4536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Found a Shortening insensitive property : AutonomousCar-PT-06b-LTLFireability-05
Stuttering acceptance computed with spot in 343 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 241 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Graph (trivial) has 227 edges and 241 vertex of which 4 / 241 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 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 238 transition count 363
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 123 rules applied. Total rules applied 210 place count 152 transition count 326
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 232 place count 130 transition count 326
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 232 place count 130 transition count 318
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 248 place count 122 transition count 318
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 252 place count 118 transition count 314
Iterating global reduction 3 with 4 rules applied. Total rules applied 256 place count 118 transition count 314
Performed 52 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 360 place count 66 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 361 place count 66 transition count 260
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 374 place count 53 transition count 181
Iterating global reduction 4 with 13 rules applied. Total rules applied 387 place count 53 transition count 181
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 393 place count 53 transition count 175
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 397 place count 51 transition count 173
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 399 place count 49 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 400 place count 48 transition count 171
Applied a total of 400 rules in 55 ms. Remains 48 /241 variables (removed 193) and now considering 171/452 (removed 281) transitions.
// Phase 1: matrix 171 rows 48 cols
[2023-03-12 16:21:02] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-12 16:21:02] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-12 16:21:02] [INFO ] Invariant cache hit.
[2023-03-12 16:21:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:21:02] [INFO ] Implicit Places using invariants and state equation in 190 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 349 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 47/241 places, 171/452 transitions.
Applied a total of 0 rules in 4 ms. Remains 47 /47 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 408 ms. Remains : 47/241 places, 171/452 transitions.
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(EQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 39 steps with 2 reset in 0 ms.
Treatment of property AutonomousCar-PT-06b-LTLFireability-05 finished in 884 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : AutonomousCar-PT-06b-LTLFireability-06
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 241 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Graph (trivial) has 226 edges and 241 vertex of which 4 / 241 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 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 238 transition count 362
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 124 rules applied. Total rules applied 212 place count 151 transition count 325
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 235 place count 129 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 236 place count 128 transition count 324
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 236 place count 128 transition count 316
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 252 place count 120 transition count 316
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 257 place count 115 transition count 311
Iterating global reduction 4 with 5 rules applied. Total rules applied 262 place count 115 transition count 311
Performed 51 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 364 place count 64 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 365 place count 64 transition count 258
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 378 place count 51 transition count 179
Iterating global reduction 5 with 13 rules applied. Total rules applied 391 place count 51 transition count 179
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 397 place count 51 transition count 173
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 401 place count 49 transition count 171
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 403 place count 47 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 404 place count 46 transition count 169
Applied a total of 404 rules in 35 ms. Remains 46 /241 variables (removed 195) and now considering 169/452 (removed 283) transitions.
// Phase 1: matrix 169 rows 46 cols
[2023-03-12 16:21:02] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-12 16:21:03] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-12 16:21:03] [INFO ] Invariant cache hit.
[2023-03-12 16:21:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:21:03] [INFO ] Implicit Places using invariants and state equation in 280 ms returned [41, 45]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 433 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 44/241 places, 169/452 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 43 transition count 168
Applied a total of 2 rules in 2 ms. Remains 43 /44 variables (removed 1) and now considering 168/169 (removed 1) transitions.
// Phase 1: matrix 168 rows 43 cols
[2023-03-12 16:21:03] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:21:03] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-12 16:21:03] [INFO ] Invariant cache hit.
[2023-03-12 16:21:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:21:03] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 43/241 places, 168/452 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 651 ms. Remains : 43/241 places, 168/452 transitions.
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 40037 reset in 179 ms.
Product exploration explored 100000 steps with 39994 reset in 205 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 243 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 204 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2023-03-12 16:21:04] [INFO ] Invariant cache hit.
[2023-03-12 16:21:04] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 16:21:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:21:04] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-12 16:21:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:21:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 19 ms returned sat
[2023-03-12 16:21:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:21:04] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-12 16:21:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:21:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-12 16:21:05] [INFO ] Computed and/alt/rep : 11/48/11 causal constraints (skipped 155 transitions) in 16 ms.
[2023-03-12 16:21:05] [INFO ] Added : 0 causal constraints over 0 iterations in 39 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 168/168 transitions.
Applied a total of 0 rules in 5 ms. Remains 43 /43 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2023-03-12 16:21:05] [INFO ] Invariant cache hit.
[2023-03-12 16:21:05] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-12 16:21:05] [INFO ] Invariant cache hit.
[2023-03-12 16:21:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:21:05] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2023-03-12 16:21:05] [INFO ] Redundant transitions in 14 ms returned [93]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 167 rows 43 cols
[2023-03-12 16:21:05] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:21:05] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/43 places, 167/168 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 41 transition count 165
Applied a total of 2 rules in 3 ms. Remains 41 /43 variables (removed 2) and now considering 165/167 (removed 2) transitions.
// Phase 1: matrix 165 rows 41 cols
[2023-03-12 16:21:05] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-12 16:21:05] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-12 16:21:05] [INFO ] Invariant cache hit.
[2023-03-12 16:21:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:21:05] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/43 places, 165/168 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 830 ms. Remains : 41/43 places, 165/168 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
Treatment of property AutonomousCar-PT-06b-LTLFireability-06 finished in 3402 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-06 TRUE TECHNIQUES SHORTENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(p1&&G(F(p1))))))'
[2023-03-12 16:21:06] [INFO ] Flatten gal took : 34 ms
[2023-03-12 16:21:06] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-12 16:21:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 241 places, 452 transitions and 2564 arcs took 6 ms.
Total runtime 61900 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2113/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2113/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2113/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2113/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutonomousCar-PT-06b-LTLFireability-02
Could not compute solution for formula : AutonomousCar-PT-06b-LTLFireability-05
Could not compute solution for formula : AutonomousCar-PT-06b-LTLFireability-06
Could not compute solution for formula : AutonomousCar-PT-06b-LTLFireability-15

BK_STOP 1678638067317

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
ltl formula name AutonomousCar-PT-06b-LTLFireability-05
ltl formula formula --ltl=/tmp/2113/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 241 places, 452 transitions and 2564 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2113/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2113/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2113/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.040 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2113/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55d83cd143f4]
1: pnml2lts-mc(+0xa2496) [0x55d83cd14496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f8480ce7140]
3: pnml2lts-mc(+0x405be5) [0x55d83d077be5]
4: pnml2lts-mc(+0x16b3f9) [0x55d83cddd3f9]
5: pnml2lts-mc(+0x164ac4) [0x55d83cdd6ac4]
6: pnml2lts-mc(+0x272e0a) [0x55d83cee4e0a]
7: pnml2lts-mc(+0xb61f0) [0x55d83cd281f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f8480b3a4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f8480b3a67a]
10: pnml2lts-mc(+0xa1581) [0x55d83cd13581]
11: pnml2lts-mc(+0xa1910) [0x55d83cd13910]
12: pnml2lts-mc(+0xa32a2) [0x55d83cd152a2]
13: pnml2lts-mc(+0xa50f4) [0x55d83cd170f4]
14: pnml2lts-mc(+0xa516b) [0x55d83cd1716b]
15: pnml2lts-mc(+0x3f34b3) [0x55d83d0654b3]
16: pnml2lts-mc(+0x7c63d) [0x55d83ccee63d]
17: pnml2lts-mc(+0x67d86) [0x55d83ccd9d86]
18: pnml2lts-mc(+0x60a8a) [0x55d83ccd2a8a]
19: pnml2lts-mc(+0x5eb15) [0x55d83ccd0b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f8480b22d0a]
21: pnml2lts-mc(+0x6075e) [0x55d83ccd275e]
ltl formula name AutonomousCar-PT-06b-LTLFireability-06
ltl formula formula --ltl=/tmp/2113/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 241 places, 452 transitions and 2564 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.030 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2113/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2113/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2113/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2113/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x555897c683f4]
1: pnml2lts-mc(+0xa2496) [0x555897c68496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f68f685a140]
3: pnml2lts-mc(+0x405be5) [0x555897fcbbe5]
4: pnml2lts-mc(+0x16b3f9) [0x555897d313f9]
5: pnml2lts-mc(+0x164ac4) [0x555897d2aac4]
6: pnml2lts-mc(+0x272e0a) [0x555897e38e0a]
7: pnml2lts-mc(+0xb61f0) [0x555897c7c1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f68f66ad4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f68f66ad67a]
10: pnml2lts-mc(+0xa1581) [0x555897c67581]
11: pnml2lts-mc(+0xa1910) [0x555897c67910]
12: pnml2lts-mc(+0xa32a2) [0x555897c692a2]
13: pnml2lts-mc(+0xa50f4) [0x555897c6b0f4]
14: pnml2lts-mc(+0x3f34b3) [0x555897fb94b3]
15: pnml2lts-mc(+0x7c63d) [0x555897c4263d]
16: pnml2lts-mc(+0x67d86) [0x555897c2dd86]
17: pnml2lts-mc(+0x60a8a) [0x555897c26a8a]
18: pnml2lts-mc(+0x5eb15) [0x555897c24b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f68f6695d0a]
20: pnml2lts-mc(+0x6075e) [0x555897c2675e]
ltl formula name AutonomousCar-PT-06b-LTLFireability-15
ltl formula formula --ltl=/tmp/2113/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 241 places, 452 transitions and 2564 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.050 user 0.060 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2113/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2113/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2113/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2113/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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