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-165463872900419.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-01b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872900419
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 9.0K Jun 7 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Jun 7 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 15:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 7 15:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 3 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 3 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 3 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 3 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 15K Jun 7 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K Jun 7 15:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Jun 7 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:18 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 31K 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-01b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1654897977541

Running Version 202205111006
[2022-06-10 21:53:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 21:53:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 21:53:00] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2022-06-10 21:53:00] [INFO ] Transformed 119 places.
[2022-06-10 21:53:00] [INFO ] Transformed 132 transitions.
[2022-06-10 21:53:00] [INFO ] Found NUPN structural information;
[2022-06-10 21:53:00] [INFO ] Parsed PT model containing 119 places and 132 transitions in 294 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-01b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 132/132 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 104 transition count 117
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 104 transition count 117
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 102 transition count 115
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 102 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 101 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 101 transition count 114
Applied a total of 36 rules in 45 ms. Remains 101 /119 variables (removed 18) and now considering 114/132 (removed 18) transitions.
// Phase 1: matrix 114 rows 101 cols
[2022-06-10 21:53:00] [INFO ] Computed 6 place invariants in 11 ms
[2022-06-10 21:53:00] [INFO ] Implicit Places using invariants in 206 ms returned []
// Phase 1: matrix 114 rows 101 cols
[2022-06-10 21:53:00] [INFO ] Computed 6 place invariants in 5 ms
[2022-06-10 21:53:01] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
// Phase 1: matrix 114 rows 101 cols
[2022-06-10 21:53:01] [INFO ] Computed 6 place invariants in 4 ms
[2022-06-10 21:53:01] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/119 places, 114/132 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/119 places, 114/132 transitions.
Support contains 28 out of 101 places after structural reductions.
[2022-06-10 21:53:01] [INFO ] Flatten gal took : 74 ms
[2022-06-10 21:53:01] [INFO ] Flatten gal took : 28 ms
[2022-06-10 21:53:01] [INFO ] Input system was already deterministic with 114 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 929 ms. (steps per millisecond=10 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 114 rows 101 cols
[2022-06-10 21:53:03] [INFO ] Computed 6 place invariants in 5 ms
[2022-06-10 21:53:03] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 21:53:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2022-06-10 21:53:04] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-06-10 21:53:04] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 8 ms to minimize.
[2022-06-10 21:53:04] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 2 ms to minimize.
[2022-06-10 21:53:04] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2022-06-10 21:53:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 437 ms
[2022-06-10 21:53:04] [INFO ] After 543ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-10 21:53:04] [INFO ] After 644ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 101/101 places, 114/114 transitions.
Graph (trivial) has 90 edges and 101 vertex of which 4 / 101 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 183 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 97 transition count 69
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 52 rules applied. Total rules applied 95 place count 58 transition count 56
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 103 place count 51 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 104 place count 50 transition count 55
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 104 place count 50 transition count 49
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 116 place count 44 transition count 49
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 119 place count 41 transition count 46
Iterating global reduction 4 with 3 rules applied. Total rules applied 122 place count 41 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 126 place count 41 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 126 place count 41 transition count 41
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 128 place count 40 transition count 41
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 129 place count 39 transition count 40
Iterating global reduction 5 with 1 rules applied. Total rules applied 130 place count 39 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 132 place count 39 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 133 place count 38 transition count 38
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 165 place count 22 transition count 22
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 167 place count 20 transition count 19
Iterating global reduction 7 with 2 rules applied. Total rules applied 169 place count 20 transition count 19
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 171 place count 20 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 172 place count 19 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 173 place count 18 transition count 18
Applied a total of 173 rules in 54 ms. Remains 18 /101 variables (removed 83) and now considering 18/114 (removed 96) transitions.
Finished structural reductions, in 1 iterations. Remains : 18/101 places, 18/114 transitions.
Finished random walk after 65 steps, including 6 resets, run visited all 1 properties in 2 ms. (steps per millisecond=32 )
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA AutonomousCar-PT-01b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 26 stabilizing places and 27 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U F((G(p1)||!F(p2))))))'
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 114/114 transitions.
Graph (trivial) has 88 edges and 101 vertex of which 4 / 101 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 98 transition count 74
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 47 rules applied. Total rules applied 85 place count 61 transition count 64
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 93 place count 55 transition count 62
Reduce places removed 2 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 4 rules applied. Total rules applied 97 place count 53 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 98 place count 52 transition count 60
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 98 place count 52 transition count 55
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 108 place count 47 transition count 55
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 111 place count 44 transition count 52
Iterating global reduction 5 with 3 rules applied. Total rules applied 114 place count 44 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 118 place count 44 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 118 place count 44 transition count 47
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 120 place count 43 transition count 47
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 121 place count 42 transition count 46
Iterating global reduction 6 with 1 rules applied. Total rules applied 122 place count 42 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 124 place count 42 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 125 place count 41 transition count 44
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 8 with 30 rules applied. Total rules applied 155 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 157 place count 24 transition count 25
Iterating global reduction 8 with 2 rules applied. Total rules applied 159 place count 24 transition count 25
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 8 with 2 rules applied. Total rules applied 161 place count 23 transition count 24
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 162 place count 23 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 164 place count 21 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 165 place count 20 transition count 22
Applied a total of 165 rules in 26 ms. Remains 20 /101 variables (removed 81) and now considering 22/114 (removed 92) transitions.
// Phase 1: matrix 22 rows 20 cols
[2022-06-10 21:53:04] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 21:53:04] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 22 rows 20 cols
[2022-06-10 21:53:04] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:53:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-10 21:53:05] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 101 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/101 places, 22/114 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 17 transition count 21
Applied a total of 2 rules in 5 ms. Remains 17 /18 variables (removed 1) and now considering 21/22 (removed 1) transitions.
// Phase 1: matrix 21 rows 17 cols
[2022-06-10 21:53:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 21:53:05] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 21 rows 17 cols
[2022-06-10 21:53:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 21:53:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 21:53:05] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/101 places, 21/114 transitions.
Finished structural reductions, in 2 iterations. Remains : 17/101 places, 21/114 transitions.
Stuttering acceptance computed with spot in 289 ms :[(AND p2 (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p2:(AND (OR (EQ s7 0) (EQ s10 1)) (EQ s12 1)), p1:(OR (EQ s7 0) (EQ s10 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2 reset in 471 ms.
Product exploration explored 100000 steps with 3 reset in 209 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 542 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 1061 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 524 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 21 rows 17 cols
[2022-06-10 21:53:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 21:53:06] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (G (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2))]
Knowledge based reduction with 6 factoid took 634 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p1) p2)]
Support contains 3 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 17 cols
[2022-06-10 21:53:07] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 21:53:07] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 21 rows 17 cols
[2022-06-10 21:53:07] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 21:53:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 21:53:07] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2022-06-10 21:53:07] [INFO ] Redundant transitions in 15 ms returned [17]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 20 rows 17 cols
[2022-06-10 21:53:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 21:53:07] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/17 places, 20/21 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 15 transition count 20
Applied a total of 2 rules in 3 ms. Remains 15 /17 variables (removed 2) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 15 cols
[2022-06-10 21:53:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 21:53:07] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 20 rows 15 cols
[2022-06-10 21:53:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 21:53:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 21:53:07] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/17 places, 20/21 transitions.
Finished structural reductions, in 2 iterations. Remains : 15/17 places, 20/21 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 440 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 1266 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 723 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 20 rows 15 cols
[2022-06-10 21:53:08] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 21:53:08] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2))]
Knowledge based reduction with 10 factoid took 572 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p1) p2)]
Product exploration explored 100000 steps with 2 reset in 204 ms.
Product exploration explored 100000 steps with 2 reset in 175 ms.
Built C files in :
/tmp/ltsmin5971437161158053976
[2022-06-10 21:53:09] [INFO ] Computing symmetric may disable matrix : 20 transitions.
[2022-06-10 21:53:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 21:53:09] [INFO ] Computing symmetric may enable matrix : 20 transitions.
[2022-06-10 21:53:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 21:53:09] [INFO ] Computing Do-Not-Accords matrix : 20 transitions.
[2022-06-10 21:53:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 21:53:09] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5971437161158053976
Running compilation step : cd /tmp/ltsmin5971437161158053976;'/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 319 ms.
Running link step : cd /tmp/ltsmin5971437161158053976;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin5971437161158053976;'/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/stateBased3057008453190379346.hoa' '--buchi-type=spotba'
LTSmin run took 112 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-01b-LTLCardinality-01 finished in 5277 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(G(p0))||G(p1))))'
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 114/114 transitions.
Graph (trivial) has 89 edges and 101 vertex of which 4 / 101 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 98 transition count 73
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 51 rules applied. Total rules applied 90 place count 60 transition count 60
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 99 place count 53 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 101 place count 51 transition count 58
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 101 place count 51 transition count 52
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 113 place count 45 transition count 52
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 116 place count 42 transition count 49
Iterating global reduction 4 with 3 rules applied. Total rules applied 119 place count 42 transition count 49
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 123 place count 42 transition count 45
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 123 place count 42 transition count 44
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 125 place count 41 transition count 44
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 153 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 154 place count 26 transition count 27
Iterating global reduction 5 with 1 rules applied. Total rules applied 155 place count 26 transition count 27
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 5 with 2 rules applied. Total rules applied 157 place count 25 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 159 place count 23 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 160 place count 22 transition count 25
Applied a total of 160 rules in 26 ms. Remains 22 /101 variables (removed 79) and now considering 25/114 (removed 89) transitions.
// Phase 1: matrix 25 rows 22 cols
[2022-06-10 21:53:10] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:53:10] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 25 rows 22 cols
[2022-06-10 21:53:10] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 21:53:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 21:53:10] [INFO ] Implicit Places using invariants and state equation in 74 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 121 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/101 places, 25/114 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/101 places, 25/114 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s17 0) (EQ s2 1)), p1:(AND (EQ s19 0) (EQ s13 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1 reset in 157 ms.
Product exploration explored 100000 steps with 0 reset in 183 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Detected a total of 5/21 stabilizing places and 7/25 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 441 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1113 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 292 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 25 rows 21 cols
[2022-06-10 21:53:11] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:53:11] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 21:53:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 21:53:11] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 21:53:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:53:11] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 21:53:11] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-10 21:53:11] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 21/21 places, 25/25 transitions.
Graph (complete) has 58 edges and 21 vertex of which 20 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 23
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 20 transition count 23
Applied a total of 4 rules in 7 ms. Remains 20 /21 variables (removed 1) and now considering 23/25 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 20/21 places, 23/25 transitions.
Incomplete random walk after 10000 steps, including 882 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 285 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Probably explored full state space saw : 121 states, properties seen :0
Probabilistic random walk after 354 steps, saw 121 distinct states, run finished after 17 ms. (steps per millisecond=20 ) properties seen :0
Explored full state space saw : 121 states, properties seen :0
Exhaustive walk after 354 steps, saw 121 distinct states, run finished after 3 ms. (steps per millisecond=118 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 663 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 2 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 25/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 21 cols
[2022-06-10 21:53:12] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 21:53:12] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 25 rows 21 cols
[2022-06-10 21:53:12] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:53:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:53:12] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2022-06-10 21:53:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 21 cols
[2022-06-10 21:53:12] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:53:12] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 25/25 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3 reset in 310 ms.
Product exploration explored 100000 steps with 0 reset in 154 ms.
Built C files in :
/tmp/ltsmin7325870517707272837
[2022-06-10 21:53:13] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2022-06-10 21:53:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 21:53:13] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2022-06-10 21:53:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 21:53:13] [INFO ] Computing Do-Not-Accords matrix : 25 transitions.
[2022-06-10 21:53:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 21:53:13] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7325870517707272837
Running compilation step : cd /tmp/ltsmin7325870517707272837;'/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 200 ms.
Running link step : cd /tmp/ltsmin7325870517707272837;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin7325870517707272837;'/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/stateBased16002279190420586556.hoa' '--buchi-type=spotba'
LTSmin run took 48 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-01b-LTLCardinality-03 finished in 3539 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 114/114 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 110
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 97 transition count 106
Applied a total of 12 rules in 14 ms. Remains 97 /101 variables (removed 4) and now considering 106/114 (removed 8) transitions.
// Phase 1: matrix 106 rows 97 cols
[2022-06-10 21:53:13] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:13] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 106 rows 97 cols
[2022-06-10 21:53:13] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:13] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
// Phase 1: matrix 106 rows 97 cols
[2022-06-10 21:53:13] [INFO ] Computed 6 place invariants in 4 ms
[2022-06-10 21:53:14] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 106/114 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/101 places, 106/114 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (EQ s36 0) (EQ s16 1)) (OR (EQ s75 0) (EQ s42 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 31 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-07 finished in 524 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((((X(p0)&&F(p0)) U !F(p1)) U !p0)))'
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 114/114 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 98 transition count 111
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 98 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 97 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 97 transition count 110
Applied a total of 8 rules in 20 ms. Remains 97 /101 variables (removed 4) and now considering 110/114 (removed 4) transitions.
// Phase 1: matrix 110 rows 97 cols
[2022-06-10 21:53:14] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:14] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 110 rows 97 cols
[2022-06-10 21:53:14] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 21:53:14] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
// Phase 1: matrix 110 rows 97 cols
[2022-06-10 21:53:14] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 21:53:14] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 110/114 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/101 places, 110/114 transitions.
Stuttering acceptance computed with spot in 315 ms :[p1, p0, (OR p1 p0), true, p0, true]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(NOT p0), acceptance={0} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(OR (EQ s38 0) (EQ s51 1)), p0:(OR (EQ s3 0) (EQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-09 finished in 707 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X(X(F(!(!F(p0) U p1))))))))'
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 114/114 transitions.
Graph (trivial) has 84 edges and 101 vertex of which 4 / 101 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 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 98 transition count 77
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 44 rules applied. Total rules applied 79 place count 64 transition count 67
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 9 rules applied. Total rules applied 88 place count 58 transition count 64
Reduce places removed 3 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 5 rules applied. Total rules applied 93 place count 55 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 94 place count 54 transition count 62
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 94 place count 54 transition count 57
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 104 place count 49 transition count 57
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 109 place count 44 transition count 52
Iterating global reduction 5 with 5 rules applied. Total rules applied 114 place count 44 transition count 52
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 119 place count 44 transition count 47
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 119 place count 44 transition count 45
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 123 place count 42 transition count 45
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 124 place count 41 transition count 44
Iterating global reduction 6 with 1 rules applied. Total rules applied 125 place count 41 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 126 place count 41 transition count 43
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 150 place count 29 transition count 30
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 152 place count 27 transition count 27
Iterating global reduction 7 with 2 rules applied. Total rules applied 154 place count 27 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 156 place count 26 transition count 26
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 158 place count 26 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 159 place count 25 transition count 25
Applied a total of 159 rules in 28 ms. Remains 25 /101 variables (removed 76) and now considering 25/114 (removed 89) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-06-10 21:53:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 21:53:14] [INFO ] Implicit Places using invariants in 46 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/101 places, 25/114 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 23 transition count 24
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 23 transition count 24
Applied a total of 2 rules in 4 ms. Remains 23 /24 variables (removed 1) and now considering 24/25 (removed 1) transitions.
// Phase 1: matrix 24 rows 23 cols
[2022-06-10 21:53:14] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:53:15] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 24 rows 23 cols
[2022-06-10 21:53:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:53:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 21:53:15] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 108 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/101 places, 24/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 22/101 places, 24/114 transitions.
Stuttering acceptance computed with spot in 168 ms :[p1, p1, (AND p1 (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s1 1) (NOT (OR (EQ s15 0) (EQ s18 1)))), p0:(OR (EQ s4 0) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-10 finished in 380 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(X(p0)))))'
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 114/114 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 96 transition count 109
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 96 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 95 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 95 transition count 104
Applied a total of 16 rules in 14 ms. Remains 95 /101 variables (removed 6) and now considering 104/114 (removed 10) transitions.
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:53:15] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 21:53:15] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:53:15] [INFO ] Computed 6 place invariants in 4 ms
[2022-06-10 21:53:15] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:53:15] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:15] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/101 places, 104/114 transitions.
Finished structural reductions, in 1 iterations. Remains : 95/101 places, 104/114 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(NEQ s85 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 296 ms.
Product exploration explored 100000 steps with 33333 reset in 357 ms.
Computed a total of 24 stabilizing places and 25 stable transitions
Computed a total of 24 stabilizing places and 25 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 160 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-01b-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-01b-LTLCardinality-11 finished in 1306 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)&&G(p1)))))'
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 114/114 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 110
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 97 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 96 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 96 transition count 105
Applied a total of 14 rules in 10 ms. Remains 96 /101 variables (removed 5) and now considering 105/114 (removed 9) transitions.
// Phase 1: matrix 105 rows 96 cols
[2022-06-10 21:53:16] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 21:53:16] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 105 rows 96 cols
[2022-06-10 21:53:16] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 21:53:16] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
// Phase 1: matrix 105 rows 96 cols
[2022-06-10 21:53:16] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:16] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/101 places, 105/114 transitions.
Finished structural reductions, in 1 iterations. Remains : 96/101 places, 105/114 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s78 0) (EQ s20 1)), p1:(OR (EQ s38 0) (EQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-12 finished in 401 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0)) U !G(p0)))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 114/114 transitions.
Graph (trivial) has 90 edges and 101 vertex of which 4 / 101 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 98 transition count 72
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 51 rules applied. Total rules applied 91 place count 59 transition count 60
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 98 place count 53 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 99 place count 52 transition count 59
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 99 place count 52 transition count 54
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 109 place count 47 transition count 54
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 113 place count 43 transition count 50
Iterating global reduction 4 with 4 rules applied. Total rules applied 117 place count 43 transition count 50
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 121 place count 43 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 121 place count 43 transition count 45
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 123 place count 42 transition count 45
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 124 place count 41 transition count 44
Iterating global reduction 5 with 1 rules applied. Total rules applied 125 place count 41 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 127 place count 41 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 128 place count 40 transition count 42
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 160 place count 24 transition count 25
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 162 place count 22 transition count 22
Iterating global reduction 7 with 2 rules applied. Total rules applied 164 place count 22 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 165 place count 22 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 167 place count 20 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 168 place count 19 transition count 20
Applied a total of 168 rules in 27 ms. Remains 19 /101 variables (removed 82) and now considering 20/114 (removed 94) transitions.
// Phase 1: matrix 20 rows 19 cols
[2022-06-10 21:53:17] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:53:17] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 20 rows 19 cols
[2022-06-10 21:53:17] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 21:53:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 21:53:17] [INFO ] Implicit Places using invariants and state equation in 42 ms returned [14, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 86 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/101 places, 20/114 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 16 transition count 19
Applied a total of 2 rules in 3 ms. Remains 16 /17 variables (removed 1) and now considering 19/20 (removed 1) transitions.
// Phase 1: matrix 19 rows 16 cols
[2022-06-10 21:53:17] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 21:53:17] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 19 rows 16 cols
[2022-06-10 21:53:17] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 21:53:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:53:17] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/101 places, 19/114 transitions.
Finished structural reductions, in 2 iterations. Remains : 16/101 places, 19/114 transitions.
Stuttering acceptance computed with spot in 48 ms :[p0]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s7 0) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-14 finished in 268 ms.
All properties solved by simple procedures.
Total runtime 17231 ms.

BK_STOP 1654897997384

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-01b"
export BK_EXAMINATION="LTLCardinality"
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-01b, examination is LTLCardinality"
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-165463872900419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-01b.tgz
mv AutonomousCar-PT-01b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;