Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 4.9K Jun 7 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Jun 7 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Jun 7 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Jun 7 15:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 3 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 3 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 3 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 3 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 9.6K Jun 7 15:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 7 15:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 7 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 228K Jun 3 16:02 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-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 1654902017520

Running Version 202205111006
[2022-06-10 23:00:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 23:00:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 23:00:20] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2022-06-10 23:00:20] [INFO ] Transformed 289 places.
[2022-06-10 23:00:20] [INFO ] Transformed 644 transitions.
[2022-06-10 23:00:20] [INFO ] Found NUPN structural information;
[2022-06-10 23:00:20] [INFO ] Parsed PT model containing 289 places and 644 transitions in 458 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA AutonomousCar-PT-06b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 644/644 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 248 transition count 603
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 248 transition count 603
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 226 place count 248 transition count 459
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 233 place count 241 transition count 452
Iterating global reduction 1 with 7 rules applied. Total rules applied 240 place count 241 transition count 452
Applied a total of 240 rules in 97 ms. Remains 241 /289 variables (removed 48) and now considering 452/644 (removed 192) transitions.
// Phase 1: matrix 452 rows 241 cols
[2022-06-10 23:00:20] [INFO ] Computed 11 place invariants in 43 ms
[2022-06-10 23:00:21] [INFO ] Implicit Places using invariants in 471 ms returned []
// Phase 1: matrix 452 rows 241 cols
[2022-06-10 23:00:21] [INFO ] Computed 11 place invariants in 5 ms
[2022-06-10 23:00:21] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
// Phase 1: matrix 452 rows 241 cols
[2022-06-10 23:00:21] [INFO ] Computed 11 place invariants in 8 ms
[2022-06-10 23:00:22] [INFO ] Dead Transitions using invariants and state equation in 534 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/289 places, 452/644 transitions.
Finished structural reductions, in 1 iterations. Remains : 241/289 places, 452/644 transitions.
Support contains 35 out of 241 places after structural reductions.
[2022-06-10 23:00:22] [INFO ] Flatten gal took : 192 ms
[2022-06-10 23:00:22] [INFO ] Flatten gal took : 89 ms
[2022-06-10 23:00:23] [INFO ] Input system was already deterministic with 452 transitions.
Incomplete random walk after 10000 steps, including 102 resets, run finished after 826 ms. (steps per millisecond=12 ) properties (out of 26) seen :11
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) 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 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 452 rows 241 cols
[2022-06-10 23:00:24] [INFO ] Computed 11 place invariants in 6 ms
[2022-06-10 23:00:24] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-06-10 23:00:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-06-10 23:00:25] [INFO ] After 755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-06-10 23:00:26] [INFO ] Deduced a trap composed of 14 places in 236 ms of which 11 ms to minimize.
[2022-06-10 23:00:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2022-06-10 23:00:26] [INFO ] After 1833ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 633 ms.
[2022-06-10 23:00:27] [INFO ] After 2863ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 265 ms.
Support contains 20 out of 241 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 241/241 places, 452/452 transitions.
Graph (trivial) has 212 edges and 241 vertex of which 2 / 241 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 878 edges and 240 vertex of which 239 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 82 rules applied. Total rules applied 84 place count 239 transition count 368
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 117 rules applied. Total rules applied 201 place count 158 transition count 332
Reduce places removed 21 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 23 rules applied. Total rules applied 224 place count 137 transition count 330
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 226 place count 135 transition count 330
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 226 place count 135 transition count 322
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 242 place count 127 transition count 322
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 244 place count 125 transition count 320
Iterating global reduction 4 with 2 rules applied. Total rules applied 246 place count 125 transition count 320
Performed 48 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 342 place count 77 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 343 place count 77 transition count 270
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 349 place count 71 transition count 230
Iterating global reduction 5 with 6 rules applied. Total rules applied 355 place count 71 transition count 230
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 357 place count 71 transition count 228
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 359 place count 70 transition count 227
Free-agglomeration rule applied 12 times.
Iterating global reduction 6 with 12 rules applied. Total rules applied 371 place count 70 transition count 215
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 383 place count 58 transition count 215
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 384 place count 58 transition count 215
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 385 place count 57 transition count 214
Applied a total of 385 rules in 142 ms. Remains 57 /241 variables (removed 184) and now considering 214/452 (removed 238) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/241 places, 214/452 transitions.
Incomplete random walk after 10000 steps, including 52 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 214 rows 57 cols
[2022-06-10 23:00:28] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 23:00:29] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-10 23:00:29] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 23:00:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-10 23:00:29] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 23:00:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 23:00:29] [INFO ] After 33ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 23:00:29] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-06-10 23:00:29] [INFO ] After 291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 57/57 places, 214/214 transitions.
Graph (trivial) has 30 edges and 57 vertex of which 2 / 57 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 498 edges and 56 vertex of which 55 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 55 transition count 210
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 53 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 53 transition count 208
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 51 transition count 208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 50 transition count 207
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 50 transition count 207
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 49 transition count 206
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 49 transition count 206
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 2 with 4 rules applied. Total rules applied 18 place count 47 transition count 204
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 47 transition count 200
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 50 place count 43 transition count 176
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 42 transition count 175
Applied a total of 51 rules in 45 ms. Remains 42 /57 variables (removed 15) and now considering 175/214 (removed 39) transitions.
Finished structural reductions, in 1 iterations. Remains : 42/57 places, 175/214 transitions.
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
FORMULA AutonomousCar-PT-06b-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 41 stabilizing places and 42 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--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 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
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 236 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 235 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 235 transition count 446
Applied a total of 12 rules in 29 ms. Remains 235 /241 variables (removed 6) and now considering 446/452 (removed 6) transitions.
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:29] [INFO ] Computed 11 place invariants in 3 ms
[2022-06-10 23:00:30] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:30] [INFO ] Computed 11 place invariants in 3 ms
[2022-06-10 23:00:30] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:30] [INFO ] Computed 11 place invariants in 4 ms
[2022-06-10 23:00:30] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 446/452 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/241 places, 446/452 transitions.
Stuttering acceptance computed with spot in 245 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: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s156 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 3266 reset in 440 ms.
Product exploration explored 100000 steps with 3278 reset in 275 ms.
Computed a total of 39 stabilizing places and 40 stable transitions
Computed a total of 39 stabilizing places and 40 stable transitions
Detected a total of 39/235 stabilizing places and 40/446 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 212 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 23 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 211 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:32] [INFO ] Computed 11 place invariants in 32 ms
[2022-06-10 23:00:32] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-10 23:00:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 23:00:32] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2022-06-10 23:00:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 23:00:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2022-06-10 23:00:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 23:00:33] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2022-06-10 23:00:33] [INFO ] Deduced a trap composed of 57 places in 229 ms of which 3 ms to minimize.
[2022-06-10 23:00:34] [INFO ] Deduced a trap composed of 31 places in 302 ms of which 2 ms to minimize.
[2022-06-10 23:00:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 622 ms
[2022-06-10 23:00:34] [INFO ] Computed and/alt/rep : 208/383/208 causal constraints (skipped 237 transitions) in 133 ms.
[2022-06-10 23:00:34] [INFO ] Added : 97 causal constraints over 20 iterations in 906 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 222 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.
Iterating post reduction 2 with 22 rules applied. Total rules applied 228 place count 126 transition count 322
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 228 place count 126 transition count 314
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 244 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 245 place count 117 transition count 313
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 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 348 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 349 place count 66 transition count 260
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 362 place count 53 transition count 181
Iterating global reduction 4 with 13 rules applied. Total rules applied 375 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 381 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 385 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 387 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 388 place count 48 transition count 171
Applied a total of 388 rules in 88 ms. Remains 48 /235 variables (removed 187) and now considering 171/446 (removed 275) transitions.
// Phase 1: matrix 171 rows 48 cols
[2022-06-10 23:00:35] [INFO ] Computed 9 place invariants in 4 ms
[2022-06-10 23:00:35] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 171 rows 48 cols
[2022-06-10 23:00:35] [INFO ] Computed 9 place invariants in 6 ms
[2022-06-10 23:00:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 23:00:35] [INFO ] Implicit Places using invariants and state equation in 158 ms returned [43, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 273 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/235 places, 171/446 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 45 transition count 170
Applied a total of 2 rules in 12 ms. Remains 45 /46 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 45 cols
[2022-06-10 23:00:35] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 23:00:35] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 170 rows 45 cols
[2022-06-10 23:00:35] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 23:00:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 23:00:35] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/235 places, 170/446 transitions.
Finished structural reductions, in 2 iterations. Remains : 45/235 places, 170/446 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Detected a total of 3/45 stabilizing places and 4/170 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 40 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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 170 rows 45 cols
[2022-06-10 23:00:36] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 23:00:36] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-06-10 23:00:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 23:00:36] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2022-06-10 23:00:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 23:00:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-06-10 23:00:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 23:00:36] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2022-06-10 23:00:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 23:00:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-06-10 23:00:36] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2022-06-10 23:00:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2022-06-10 23:00:36] [INFO ] Computed and/alt/rep : 6/7/6 causal constraints (skipped 162 transitions) in 22 ms.
[2022-06-10 23:00:36] [INFO ] Added : 0 causal constraints over 0 iterations in 43 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 39965 reset in 633 ms.
Product exploration explored 100000 steps with 39971 reset in 603 ms.
Built C files in :
/tmp/ltsmin2279918026222567226
[2022-06-10 23:00:37] [INFO ] Computing symmetric may disable matrix : 170 transitions.
[2022-06-10 23:00:37] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 23:00:37] [INFO ] Computing symmetric may enable matrix : 170 transitions.
[2022-06-10 23:00:37] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 23:00:37] [INFO ] Computing Do-Not-Accords matrix : 170 transitions.
[2022-06-10 23:00:37] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 23:00:37] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2279918026222567226
Running compilation step : cd /tmp/ltsmin2279918026222567226;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 946 ms.
Running link step : cd /tmp/ltsmin2279918026222567226;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin2279918026222567226;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased306128399121641243.hoa' '--buchi-type=spotba'
LTSmin run took 152 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-06b-LTLFireability-01 finished in 9227 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)||G(p1)))))'
Support contains 5 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 238 transition count 449
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 238 transition count 449
Applied a total of 6 rules in 14 ms. Remains 238 /241 variables (removed 3) and now considering 449/452 (removed 3) transitions.
// Phase 1: matrix 449 rows 238 cols
[2022-06-10 23:00:39] [INFO ] Computed 11 place invariants in 5 ms
[2022-06-10 23:00:39] [INFO ] Implicit Places using invariants in 195 ms returned []
// Phase 1: matrix 449 rows 238 cols
[2022-06-10 23:00:39] [INFO ] Computed 11 place invariants in 5 ms
[2022-06-10 23:00:39] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
// Phase 1: matrix 449 rows 238 cols
[2022-06-10 23:00:39] [INFO ] Computed 11 place invariants in 10 ms
[2022-06-10 23:00:40] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/241 places, 449/452 transitions.
Finished structural reductions, in 1 iterations. Remains : 238/241 places, 449/452 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s219 1), p1:(AND (EQ s4 1) (EQ s6 1) (EQ s124 1) (EQ s201 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 103 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-03 finished in 1201 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(p0)&&(X(p1) U !X(F(p2)))))))'
Support contains 13 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
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 236 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 235 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 235 transition count 446
Applied a total of 12 rules in 25 ms. Remains 235 /241 variables (removed 6) and now considering 446/452 (removed 6) transitions.
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:40] [INFO ] Computed 11 place invariants in 4 ms
[2022-06-10 23:00:40] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:40] [INFO ] Computed 11 place invariants in 5 ms
[2022-06-10 23:00:40] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:40] [INFO ] Computed 11 place invariants in 3 ms
[2022-06-10 23:00:41] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 446/452 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/241 places, 446/452 transitions.
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), p2, (AND (NOT p0) p2 p1)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s15 0) (EQ s45 0) (EQ s201 0)), p2:(AND (EQ s4 1) (EQ s14 1) (EQ s124 1) (EQ s201 1)), p1:(OR (AND (EQ s50 1) (EQ s80 1) (EQ s100 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 101 reset in 206 ms.
Product exploration explored 100000 steps with 34 reset in 201 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 p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 336 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 179 ms :[p2, (NOT p0), p2, (AND (NOT p0) p1 p2)]
Incomplete random walk after 10000 steps, including 99 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:43] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 23:00:43] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-06-10 23:00:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2022-06-10 23:00:43] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT p0)), (F p2)]
Knowledge based reduction with 9 factoid took 507 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[(AND p2 p0), (AND p2 p0)]
Stuttering acceptance computed with spot in 87 ms :[(AND p2 p0), (AND p2 p0)]
Support contains 6 out of 235 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 446/446 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:44] [INFO ] Computed 11 place invariants in 9 ms
[2022-06-10 23:00:44] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:44] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 23:00:44] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:44] [INFO ] Computed 11 place invariants in 3 ms
[2022-06-10 23:00:44] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 446/446 transitions.
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 p2) p0), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND p2 p0), (AND p2 p0)]
Finished random walk after 206 steps, including 1 resets, run visited all 2 properties in 7 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(F p2), (F (AND p0 p2))]
Knowledge based reduction with 5 factoid took 244 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[(AND p2 p0), (AND p2 p0)]
Stuttering acceptance computed with spot in 74 ms :[(AND p2 p0), (AND p2 p0)]
Stuttering acceptance computed with spot in 72 ms :[(AND p2 p0), (AND p2 p0)]
Product exploration explored 100000 steps with 2 reset in 126 ms.
Product exploration explored 100000 steps with 19 reset in 351 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 72 ms :[(AND p2 p0), (AND p2 p0)]
Support contains 6 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.
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 233 transition count 444
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 101 place count 233 transition count 429
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 101 place count 233 transition count 429
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 118 place count 233 transition count 429
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 190 place count 161 transition count 357
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 2 with 72 rules applied. Total rules applied 262 place count 161 transition count 357
Performed 65 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 2 with 65 rules applied. Total rules applied 327 place count 161 transition count 365
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 329 place count 161 transition count 363
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 383 place count 107 transition count 254
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 3 with 54 rules applied. Total rules applied 437 place count 107 transition count 254
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 447 place count 107 transition count 244
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 453 place count 101 transition count 238
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 459 place count 101 transition count 238
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 460 place count 101 transition count 238
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 462 place count 99 transition count 236
Deduced a syphon composed of 46 places in 1 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 464 place count 99 transition count 236
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 465 place count 99 transition count 238
Deduced a syphon composed of 47 places in 0 ms
Applied a total of 465 rules in 75 ms. Remains 99 /235 variables (removed 136) and now considering 238/446 (removed 208) transitions.
[2022-06-10 23:00:46] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 238 rows 99 cols
[2022-06-10 23:00:46] [INFO ] Computed 10 place invariants in 1 ms
[2022-06-10 23:00:46] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/235 places, 238/446 transitions.
Finished structural reductions, in 1 iterations. Remains : 99/235 places, 238/446 transitions.
Product exploration explored 100000 steps with 46 reset in 314 ms.
Stack based approach found an accepted trace after 120 steps with 2 reset with depth 86 and stack size 85 in 2 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-04 finished in 6571 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(G(!(F(G(!F(G(p0))))||p1))))))'
Support contains 5 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 238 transition count 449
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 238 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 237 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 237 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 236 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 236 transition count 447
Applied a total of 10 rules in 22 ms. Remains 236 /241 variables (removed 5) and now considering 447/452 (removed 5) transitions.
// Phase 1: matrix 447 rows 236 cols
[2022-06-10 23:00:46] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 23:00:47] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 447 rows 236 cols
[2022-06-10 23:00:47] [INFO ] Computed 11 place invariants in 3 ms
[2022-06-10 23:00:47] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
// Phase 1: matrix 447 rows 236 cols
[2022-06-10 23:00:47] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 23:00:47] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/241 places, 447/452 transitions.
Finished structural reductions, in 1 iterations. Remains : 236/241 places, 447/452 transitions.
Stuttering acceptance computed with spot in 329 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true, (NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 6}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}, { cond=(AND p0 p1), acceptance={0} source=7 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 5}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s11 1) (EQ s95 1) (EQ s201 1)), p1:(EQ s230 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 94 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-05 finished in 1154 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(((X(!p0) U p1)||G(p0)))||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 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
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 236 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 235 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 235 transition count 446
Applied a total of 12 rules in 18 ms. Remains 235 /241 variables (removed 6) and now considering 446/452 (removed 6) transitions.
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:48] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 23:00:48] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:48] [INFO ] Computed 11 place invariants in 8 ms
[2022-06-10 23:00:48] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:48] [INFO ] Computed 11 place invariants in 3 ms
[2022-06-10 23:00:48] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 446/452 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/241 places, 446/452 transitions.
Stuttering acceptance computed with spot in 207 ms :[true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(AND (EQ s4 1) (EQ s12 1) (EQ s136 1) (EQ s201 1)), p1:(EQ s112 1), p2:(EQ s31 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, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 329 ms.
Product exploration explored 100000 steps with 50000 reset in 332 ms.
Computed a total of 39 stabilizing places and 40 stable transitions
Computed a total of 39 stabilizing places and 40 stable transitions
Detected a total of 39/235 stabilizing places and 40/446 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))
Knowledge based reduction with 6 factoid took 130 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-06b-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-06b-LTLFireability-06 finished in 1853 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(p0))&&G(p1))))'
Support contains 5 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
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 236 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 235 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 235 transition count 446
Applied a total of 12 rules in 26 ms. Remains 235 /241 variables (removed 6) and now considering 446/452 (removed 6) transitions.
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:49] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 23:00:50] [INFO ] Implicit Places using invariants in 145 ms returned []
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:50] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 23:00:50] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:50] [INFO ] Computed 11 place invariants in 1 ms
[2022-06-10 23:00:50] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 446/452 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/241 places, 446/452 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (EQ s4 0) (EQ s11 0) (EQ s61 0) (EQ s201 0)), p0:(EQ s187 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, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-07 finished in 1128 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 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
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 236 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 235 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 235 transition count 446
Applied a total of 12 rules in 26 ms. Remains 235 /241 variables (removed 6) and now considering 446/452 (removed 6) transitions.
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:51] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 23:00:51] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:51] [INFO ] Computed 11 place invariants in 1 ms
[2022-06-10 23:00:51] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:51] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 23:00:51] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 446/452 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/241 places, 446/452 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s15 1) (EQ s176 1) (EQ s201 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 102 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-09 finished in 1035 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(G(p1)&&p0)))))'
Support contains 2 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 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 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 91 place count 238 transition count 359
Reduce places removed 90 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 127 rules applied. Total rules applied 218 place count 148 transition count 322
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 240 place count 126 transition count 322
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 240 place count 126 transition count 315
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 254 place count 119 transition count 315
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 256 place count 117 transition count 313
Iterating global reduction 3 with 2 rules applied. Total rules applied 258 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 259 place count 116 transition count 312
Iterating global reduction 3 with 1 rules applied. Total rules applied 260 place count 116 transition count 312
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 364 place count 64 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 365 place count 64 transition count 258
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 375 place count 54 transition count 193
Iterating global reduction 4 with 10 rules applied. Total rules applied 385 place count 54 transition count 193
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 390 place count 54 transition count 188
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 392 place count 53 transition count 187
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 394 place count 51 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 395 place count 50 transition count 185
Applied a total of 395 rules in 73 ms. Remains 50 /241 variables (removed 191) and now considering 185/452 (removed 267) transitions.
// Phase 1: matrix 185 rows 50 cols
[2022-06-10 23:00:52] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:00:52] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 185 rows 50 cols
[2022-06-10 23:00:52] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:00:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 23:00:52] [INFO ] Implicit Places using invariants and state equation in 177 ms returned [45, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 273 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/241 places, 185/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 47 transition count 184
Applied a total of 2 rules in 9 ms. Remains 47 /48 variables (removed 1) and now considering 184/185 (removed 1) transitions.
// Phase 1: matrix 184 rows 47 cols
[2022-06-10 23:00:52] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 23:00:52] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 184 rows 47 cols
[2022-06-10 23:00:52] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 23:00:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 23:00:52] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/241 places, 184/452 transitions.
Finished structural reductions, in 2 iterations. Remains : 47/241 places, 184/452 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s8 1), p1:(EQ s29 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-11 finished in 743 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(((G(p2)||p3)&&p1)))&&p0)))'
Support contains 5 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
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 236 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 235 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 235 transition count 446
Applied a total of 12 rules in 21 ms. Remains 235 /241 variables (removed 6) and now considering 446/452 (removed 6) transitions.
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:52] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 23:00:53] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:53] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 23:00:53] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:53] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 23:00:53] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 446/452 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/241 places, 446/452 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p2))), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p3) p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s14 1) (EQ s95 1) (EQ s201 1)), p1:(AND (EQ s4 1) (EQ s14 1) (EQ s95 1) (EQ s201 1)), p3:(EQ s43 1), p2:(AND (EQ s4 1) (EQ s14 1) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-12 finished in 1112 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p0))||(G(p1)&&F(p2))))))'
Support contains 7 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 225 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 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 238 transition count 361
Reduce places removed 88 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 125 rules applied. Total rules applied 214 place count 150 transition count 324
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 237 place count 128 transition count 323
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 238 place count 127 transition count 323
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 238 place count 127 transition count 317
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 250 place count 121 transition count 317
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 253 place count 118 transition count 314
Iterating global reduction 4 with 3 rules applied. Total rules applied 256 place count 118 transition count 314
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 358 place count 67 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 359 place count 67 transition count 261
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 369 place count 57 transition count 196
Iterating global reduction 5 with 10 rules applied. Total rules applied 379 place count 57 transition count 196
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 384 place count 57 transition count 191
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 386 place count 56 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 388 place count 55 transition count 190
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 390 place count 53 transition count 188
Applied a total of 390 rules in 63 ms. Remains 53 /241 variables (removed 188) and now considering 188/452 (removed 264) transitions.
// Phase 1: matrix 188 rows 53 cols
[2022-06-10 23:00:54] [INFO ] Computed 10 place invariants in 1 ms
[2022-06-10 23:00:54] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 188 rows 53 cols
[2022-06-10 23:00:54] [INFO ] Computed 10 place invariants in 1 ms
[2022-06-10 23:00:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 23:00:54] [INFO ] Implicit Places using invariants and state equation in 133 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 218 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/241 places, 188/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 51 transition count 187
Applied a total of 2 rules in 8 ms. Remains 51 /52 variables (removed 1) and now considering 187/188 (removed 1) transitions.
// Phase 1: matrix 187 rows 51 cols
[2022-06-10 23:00:54] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:00:54] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 187 rows 51 cols
[2022-06-10 23:00:54] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:00:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 23:00:54] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/241 places, 187/452 transitions.
Finished structural reductions, in 2 iterations. Remains : 51/241 places, 187/452 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s1 0) (EQ s4 0) (EQ s29 0) (EQ s44 0)), p0:(EQ s48 1), p2:(OR (EQ s1 0) (EQ s6 0) (EQ s32 0) (EQ s44 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 222 reset in 163 ms.
Product exploration explored 100000 steps with 46 reset in 201 ms.
Computed a total of 2 stabilizing places and 4 stable transitions
Computed a total of 2 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 493 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 588 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 187 rows 51 cols
[2022-06-10 23:00:55] [INFO ] Computed 9 place invariants in 0 ms
[2022-06-10 23:00:55] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 23:00:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-06-10 23:00:56] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 23:00:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 23:00:56] [INFO ] After 70ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-10 23:00:56] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 80 ms.
[2022-06-10 23:00:56] [INFO ] After 449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 51 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 51/51 places, 187/187 transitions.
Graph (complete) has 470 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 185
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 49 transition count 178
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 49 transition count 178
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 11 place count 49 transition count 171
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 18 place count 42 transition count 171
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 42 transition count 170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 40 transition count 170
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 40 transition count 169
Applied a total of 23 rules in 56 ms. Remains 40 /51 variables (removed 11) and now considering 169/187 (removed 18) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/51 places, 169/187 transitions.
Incomplete random walk after 10000 steps, including 200 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Finished Best-First random walk after 416 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=138 )
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0)))), (F (AND p1 (NOT p0) (NOT p2)))]
Knowledge based reduction with 9 factoid took 496 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 116 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 7 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 187/187 transitions.
Applied a total of 0 rules in 7 ms. Remains 51 /51 variables (removed 0) and now considering 187/187 (removed 0) transitions.
// Phase 1: matrix 187 rows 51 cols
[2022-06-10 23:00:57] [INFO ] Computed 9 place invariants in 0 ms
[2022-06-10 23:00:57] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 187 rows 51 cols
[2022-06-10 23:00:57] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:00:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 23:00:57] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2022-06-10 23:00:57] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 187 rows 51 cols
[2022-06-10 23:00:57] [INFO ] Computed 9 place invariants in 0 ms
[2022-06-10 23:00:57] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 187/187 transitions.
Computed a total of 2 stabilizing places and 4 stable transitions
Computed a total of 2 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 352 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 116 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 593 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 187 rows 51 cols
[2022-06-10 23:00:58] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:00:58] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 23:00:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-06-10 23:00:58] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 23:00:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 23:00:58] [INFO ] After 68ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-10 23:00:58] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 64 ms.
[2022-06-10 23:00:58] [INFO ] After 426ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 51 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 51/51 places, 187/187 transitions.
Graph (complete) has 470 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 185
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 49 transition count 178
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 49 transition count 178
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 11 place count 49 transition count 171
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 18 place count 42 transition count 171
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 42 transition count 170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 40 transition count 170
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 40 transition count 169
Applied a total of 23 rules in 46 ms. Remains 40 /51 variables (removed 11) and now considering 169/187 (removed 18) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/51 places, 169/187 transitions.
Finished random walk after 4484 steps, including 111 resets, run visited all 2 properties in 81 ms. (steps per millisecond=55 )
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0)))), (F (AND p1 (NOT p0) (NOT p2)))]
Knowledge based reduction with 9 factoid took 571 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 182 reset in 225 ms.
Product exploration explored 100000 steps with 53 reset in 301 ms.
Built C files in :
/tmp/ltsmin3030718452130822439
[2022-06-10 23:01:00] [INFO ] Computing symmetric may disable matrix : 187 transitions.
[2022-06-10 23:01:00] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 23:01:00] [INFO ] Computing symmetric may enable matrix : 187 transitions.
[2022-06-10 23:01:00] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 23:01:00] [INFO ] Computing Do-Not-Accords matrix : 187 transitions.
[2022-06-10 23:01:00] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 23:01:00] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3030718452130822439
Running compilation step : cd /tmp/ltsmin3030718452130822439;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 837 ms.
Running link step : cd /tmp/ltsmin3030718452130822439;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3030718452130822439;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14545939327581782247.hoa' '--buchi-type=spotba'
LTSmin run took 3973 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-06b-LTLFireability-14 finished in 11584 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&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 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 238 transition count 361
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 123 rules applied. Total rules applied 212 place count 150 transition count 326
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 22 rules applied. Total rules applied 234 place count 129 transition count 325
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 237 place count 128 transition count 323
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 238 place count 127 transition count 323
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 238 place count 127 transition count 317
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 250 place count 121 transition count 317
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 254 place count 117 transition count 313
Iterating global reduction 5 with 4 rules applied. Total rules applied 258 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 259 place count 116 transition count 312
Iterating global reduction 5 with 1 rules applied. Total rules applied 260 place count 116 transition count 312
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 5 with 102 rules applied. Total rules applied 362 place count 65 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 363 place count 65 transition count 259
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 374 place count 54 transition count 188
Iterating global reduction 6 with 11 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 6 with 6 rules applied. Total rules applied 391 place count 54 transition count 182
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 393 place count 53 transition count 181
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 395 place count 51 transition count 179
Applied a total of 395 rules in 36 ms. Remains 51 /241 variables (removed 190) and now considering 179/452 (removed 273) transitions.
// Phase 1: matrix 179 rows 51 cols
[2022-06-10 23:01:05] [INFO ] Computed 10 place invariants in 0 ms
[2022-06-10 23:01:05] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 179 rows 51 cols
[2022-06-10 23:01:05] [INFO ] Computed 10 place invariants in 1 ms
[2022-06-10 23:01:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 23:01:05] [INFO ] Implicit Places using invariants and state equation in 137 ms returned [46, 50]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 211 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
[2022-06-10 23:01:05] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 23:01:05] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 178 rows 48 cols
[2022-06-10 23:01:05] [INFO ] Computed 8 place invariants in 0 ms
[2022-06-10 23:01:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 23:01:06] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 247 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 2 iterations. Remains : 48/241 places, 178/452 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (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=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s10 1), p1:(OR (NEQ s1 1) (NEQ s6 1) (NEQ s38 1) (NEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 34 steps with 3 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-15 finished in 642 ms.
All properties solved by simple procedures.
Total runtime 46227 ms.

BK_STOP 1654902066383

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-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 r294-smll-165463873000500"
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 ;