Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 12:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 49K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678636606120

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-02b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 15:56:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 15:56:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 15:56:49] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-12 15:56:49] [INFO ] Transformed 155 places.
[2023-03-12 15:56:49] [INFO ] Transformed 194 transitions.
[2023-03-12 15:56:49] [INFO ] Found NUPN structural information;
[2023-03-12 15:56:49] [INFO ] Parsed PT model containing 155 places and 194 transitions and 620 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA AutonomousCar-PT-02b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 194/194 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 135 transition count 174
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 135 transition count 174
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 56 place count 135 transition count 158
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 131 transition count 154
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 131 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 130 transition count 153
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 130 transition count 153
Applied a total of 66 rules in 42 ms. Remains 130 /155 variables (removed 25) and now considering 153/194 (removed 41) transitions.
// Phase 1: matrix 153 rows 130 cols
[2023-03-12 15:56:49] [INFO ] Computed 7 place invariants in 17 ms
[2023-03-12 15:56:50] [INFO ] Implicit Places using invariants in 561 ms returned []
[2023-03-12 15:56:50] [INFO ] Invariant cache hit.
[2023-03-12 15:56:50] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 920 ms to find 0 implicit places.
[2023-03-12 15:56:50] [INFO ] Invariant cache hit.
[2023-03-12 15:56:50] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/155 places, 153/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1094 ms. Remains : 130/155 places, 153/194 transitions.
Support contains 17 out of 130 places after structural reductions.
[2023-03-12 15:56:50] [INFO ] Flatten gal took : 44 ms
[2023-03-12 15:56:50] [INFO ] Flatten gal took : 51 ms
[2023-03-12 15:56:50] [INFO ] Input system was already deterministic with 153 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 12) seen :7
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 15:56:51] [INFO ] Invariant cache hit.
[2023-03-12 15:56:51] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 15:56:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 15:56:51] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-12 15:56:52] [INFO ] Deduced a trap composed of 33 places in 223 ms of which 44 ms to minimize.
[2023-03-12 15:56:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-12 15:56:52] [INFO ] After 382ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-12 15:56:52] [INFO ] After 564ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 153/153 transitions.
Graph (trivial) has 118 edges and 130 vertex of which 4 / 130 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 269 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 126 transition count 97
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 69 rules applied. Total rules applied 123 place count 76 transition count 78
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 134 place count 65 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 134 place count 65 transition count 70
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 150 place count 57 transition count 70
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 152 place count 55 transition count 68
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 55 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 54 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 54 transition count 66
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 3 with 2 rules applied. Total rules applied 158 place count 54 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 159 place count 53 transition count 64
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 201 place count 32 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 202 place count 32 transition count 42
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 205 place count 29 transition count 34
Iterating global reduction 6 with 3 rules applied. Total rules applied 208 place count 29 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 209 place count 29 transition count 33
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 211 place count 28 transition count 32
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 215 place count 26 transition count 38
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 216 place count 26 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 217 place count 25 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 218 place count 24 transition count 37
Applied a total of 218 rules in 33 ms. Remains 24 /130 variables (removed 106) and now considering 37/153 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 24/130 places, 37/153 transitions.
Finished random walk after 28 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=14 )
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA AutonomousCar-PT-02b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 32 stabilizing places and 33 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((!p1 U (G(p3)||G(!p1)||p2)))&&p0)))'
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 153/153 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 127 transition count 150
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 127 transition count 150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 126 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 126 transition count 149
Applied a total of 8 rules in 11 ms. Remains 126 /130 variables (removed 4) and now considering 149/153 (removed 4) transitions.
// Phase 1: matrix 149 rows 126 cols
[2023-03-12 15:56:52] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-12 15:56:52] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-12 15:56:52] [INFO ] Invariant cache hit.
[2023-03-12 15:56:52] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2023-03-12 15:56:52] [INFO ] Invariant cache hit.
[2023-03-12 15:56:53] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/130 places, 149/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 609 ms. Remains : 126/130 places, 149/153 transitions.
Stuttering acceptance computed with spot in 516 ms :[true, (OR (NOT p0) (AND p1 (NOT p2) (NOT p3))), (OR (NOT p0) (AND p1 (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3) p1), (NOT p3)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLCardinality-02 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: 3}], [{ cond=(AND (NOT p2) (NOT p3) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p3 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={} source=4 dest: 0}, { cond=p3, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (NEQ s111 0) (NEQ s7 1)), p2:(OR (EQ s91 0) (EQ s11 1)), p3:(OR (EQ s91 0) (EQ s11 1)), p1:(OR (EQ s111 0) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-02b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLCardinality-02 finished in 1197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 153/153 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 126 transition count 149
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 126 transition count 149
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 125 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 125 transition count 148
Applied a total of 10 rules in 29 ms. Remains 125 /130 variables (removed 5) and now considering 148/153 (removed 5) transitions.
// Phase 1: matrix 148 rows 125 cols
[2023-03-12 15:56:53] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 15:56:53] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-12 15:56:53] [INFO ] Invariant cache hit.
[2023-03-12 15:56:53] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-12 15:56:53] [INFO ] Invariant cache hit.
[2023-03-12 15:56:53] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/130 places, 148/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 331 ms. Remains : 125/130 places, 148/153 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLCardinality-05 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 (NEQ s31 0) (NEQ s57 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 1 reset in 1 ms.
FORMULA AutonomousCar-PT-02b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLCardinality-05 finished in 437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 153/153 transitions.
Graph (trivial) has 117 edges and 130 vertex of which 4 / 130 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 127 transition count 100
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 65 rules applied. Total rules applied 116 place count 77 transition count 85
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 127 place count 68 transition count 83
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 131 place count 66 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 132 place count 65 transition count 81
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 132 place count 65 transition count 74
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 146 place count 58 transition count 74
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 150 place count 54 transition count 70
Iterating global reduction 5 with 4 rules applied. Total rules applied 154 place count 54 transition count 70
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 156 place count 52 transition count 67
Iterating global reduction 5 with 2 rules applied. Total rules applied 158 place count 52 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 159 place count 52 transition count 66
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 8 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 201 place count 31 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 202 place count 31 transition count 43
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 205 place count 28 transition count 35
Iterating global reduction 7 with 3 rules applied. Total rules applied 208 place count 28 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 209 place count 28 transition count 34
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 8 with 2 rules applied. Total rules applied 211 place count 27 transition count 33
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 213 place count 26 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 214 place count 25 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 215 place count 24 transition count 33
Applied a total of 215 rules in 44 ms. Remains 24 /130 variables (removed 106) and now considering 33/153 (removed 120) transitions.
// Phase 1: matrix 33 rows 24 cols
[2023-03-12 15:56:54] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 15:56:54] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-12 15:56:54] [INFO ] Invariant cache hit.
[2023-03-12 15:56:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 15:56:54] [INFO ] Implicit Places using invariants and state equation in 69 ms returned [19, 23]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 155 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/130 places, 33/153 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 32
Applied a total of 2 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 32/33 (removed 1) transitions.
// Phase 1: matrix 32 rows 21 cols
[2023-03-12 15:56:54] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-12 15:56:54] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-12 15:56:54] [INFO ] Invariant cache hit.
[2023-03-12 15:56:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 15:56:54] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/130 places, 32/153 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 350 ms. Remains : 21/130 places, 32/153 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s5 0) (EQ s17 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]]
Product exploration explored 100000 steps with 50000 reset in 193 ms.
Product exploration explored 100000 steps with 50000 reset in 141 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 : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-02b-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-02b-LTLCardinality-08 finished in 896 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(p0) U (G(p1)&&!p2)))'
Support contains 5 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 153/153 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 128 transition count 151
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 128 transition count 151
Applied a total of 4 rules in 4 ms. Remains 128 /130 variables (removed 2) and now considering 151/153 (removed 2) transitions.
// Phase 1: matrix 151 rows 128 cols
[2023-03-12 15:56:54] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 15:56:55] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-12 15:56:55] [INFO ] Invariant cache hit.
[2023-03-12 15:56:55] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2023-03-12 15:56:55] [INFO ] Invariant cache hit.
[2023-03-12 15:56:55] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/130 places, 151/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 427 ms. Remains : 128/130 places, 151/153 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND p1 (NOT p2)), p1, (AND p1 (NOT p2) p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s92 0) (EQ s24 1)), p1:(EQ s30 1), p0:(OR (EQ s0 0) (EQ s47 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]]
Product exploration explored 100000 steps with 1 reset in 167 ms.
Product exploration explored 100000 steps with 7 reset in 244 ms.
Computed a total of 31 stabilizing places and 32 stable transitions
Computed a total of 31 stabilizing places and 32 stable transitions
Detected a total of 31/128 stabilizing places and 32/151 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 p0))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 483 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[false, p1, (AND p1 (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:56:56] [INFO ] Invariant cache hit.
[2023-03-12 15:56:56] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:56:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:56] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:56:57] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 3 ms to minimize.
[2023-03-12 15:56:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-03-12 15:56:57] [INFO ] After 265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-12 15:56:57] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 151/151 transitions.
Graph (trivial) has 112 edges and 128 vertex of which 4 / 128 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 267 edges and 126 vertex of which 124 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 124 transition count 100
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 59 rules applied. Total rules applied 108 place count 79 transition count 86
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 117 place count 71 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 118 place count 70 transition count 85
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 118 place count 70 transition count 76
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 136 place count 61 transition count 76
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 184 place count 37 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 185 place count 37 transition count 51
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 189 place count 33 transition count 42
Iterating global reduction 5 with 4 rules applied. Total rules applied 193 place count 33 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 194 place count 33 transition count 41
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 196 place count 32 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 200 place count 30 transition count 49
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 202 place count 30 transition count 47
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 203 place count 30 transition count 47
Applied a total of 203 rules in 14 ms. Remains 30 /128 variables (removed 98) and now considering 47/151 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 30/128 places, 47/151 transitions.
Finished random walk after 767 steps, including 43 resets, run visited all 1 properties in 2 ms. (steps per millisecond=383 )
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 p0))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND p2 (NOT p0) (NOT p1)))), (F (AND (NOT p2) p0 p1)), (F p1)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 655 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[false, p1, (AND p1 (NOT p2) p0)]
Stuttering acceptance computed with spot in 150 ms :[false, p1, (AND p1 (NOT p2) p0)]
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 151/151 transitions.
Graph (trivial) has 112 edges and 128 vertex of which 4 / 128 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.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 126 transition count 105
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 56 rules applied. Total rules applied 101 place count 82 transition count 93
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 109 place count 75 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 110 place count 74 transition count 92
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 110 place count 74 transition count 83
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 128 place count 65 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 129 place count 64 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 64 transition count 82
Performed 25 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 180 place count 39 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 181 place count 39 transition count 55
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 185 place count 35 transition count 46
Iterating global reduction 5 with 4 rules applied. Total rules applied 189 place count 35 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 190 place count 35 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 194 place count 33 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 198 place count 31 transition count 52
Applied a total of 198 rules in 20 ms. Remains 31 /128 variables (removed 97) and now considering 52/151 (removed 99) transitions.
// Phase 1: matrix 52 rows 31 cols
[2023-03-12 15:56:58] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 15:56:58] [INFO ] Implicit Places using invariants in 70 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/128 places, 52/151 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 100 ms. Remains : 30/128 places, 52/151 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Detected a total of 4/30 stabilizing places and 5/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X p0), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 694 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[false, p1, (AND p1 (NOT p2) p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 4 properties in 14 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X p0), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND p2 (NOT p0) (NOT p1)))), (F (AND (NOT p2) p0 p1)), (F p1)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 656 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 212 ms :[false, p1, (AND p1 (NOT p2) p0)]
Stuttering acceptance computed with spot in 194 ms :[false, p1, (AND p1 (NOT p2) p0)]
Stuttering acceptance computed with spot in 156 ms :[false, p1, (AND p1 (NOT p2) p0)]
Product exploration explored 100000 steps with 14 reset in 133 ms.
Product exploration explored 100000 steps with 0 reset in 74 ms.
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 52/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 30 cols
[2023-03-12 15:57:00] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 15:57:00] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-12 15:57:00] [INFO ] Invariant cache hit.
[2023-03-12 15:57:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-12 15:57:00] [INFO ] Implicit Places using invariants and state equation in 45 ms returned [25, 29]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 125 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/30 places, 52/52 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 27 transition count 51
Applied a total of 2 rules in 3 ms. Remains 27 /28 variables (removed 1) and now considering 51/52 (removed 1) transitions.
// Phase 1: matrix 51 rows 27 cols
[2023-03-12 15:57:00] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 15:57:00] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-12 15:57:00] [INFO ] Invariant cache hit.
[2023-03-12 15:57:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-12 15:57:00] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/30 places, 51/52 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 365 ms. Remains : 27/30 places, 51/52 transitions.
Treatment of property AutonomousCar-PT-02b-LTLCardinality-09 finished in 6080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 153/153 transitions.
Graph (trivial) has 120 edges and 130 vertex of which 4 / 130 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 127 transition count 100
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 66 rules applied. Total rules applied 117 place count 77 transition count 84
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 127 place count 68 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 128 place count 67 transition count 83
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 128 place count 67 transition count 76
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 142 place count 60 transition count 76
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 146 place count 56 transition count 72
Iterating global reduction 4 with 4 rules applied. Total rules applied 150 place count 56 transition count 72
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 152 place count 54 transition count 69
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 54 transition count 69
Performed 23 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 200 place count 31 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 201 place count 31 transition count 44
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 204 place count 28 transition count 36
Iterating global reduction 5 with 3 rules applied. Total rules applied 207 place count 28 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 208 place count 28 transition count 35
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 210 place count 27 transition count 34
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 214 place count 25 transition count 43
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 216 place count 23 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 217 place count 22 transition count 41
Applied a total of 217 rules in 9 ms. Remains 22 /130 variables (removed 108) and now considering 41/153 (removed 112) transitions.
// Phase 1: matrix 41 rows 22 cols
[2023-03-12 15:57:01] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 15:57:01] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-12 15:57:01] [INFO ] Invariant cache hit.
[2023-03-12 15:57:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 15:57:01] [INFO ] Implicit Places using invariants and state equation in 79 ms returned [17, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 107 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/130 places, 41/153 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 19 transition count 40
Applied a total of 2 rules in 5 ms. Remains 19 /20 variables (removed 1) and now considering 40/41 (removed 1) transitions.
// Phase 1: matrix 40 rows 19 cols
[2023-03-12 15:57:01] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-12 15:57:01] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-12 15:57:01] [INFO ] Invariant cache hit.
[2023-03-12 15:57:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:57:01] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/130 places, 40/153 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 205 ms. Remains : 19/130 places, 40/153 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s5 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2 reset in 93 ms.
Product exploration explored 100000 steps with 7 reset in 101 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 268 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Finished random walk after 42 steps, including 5 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 262 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Support contains 2 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 40/40 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2023-03-12 15:57:02] [INFO ] Invariant cache hit.
[2023-03-12 15:57:02] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-12 15:57:02] [INFO ] Invariant cache hit.
[2023-03-12 15:57:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:57:02] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-03-12 15:57:02] [INFO ] Redundant transitions in 26 ms returned [11]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 39 rows 19 cols
[2023-03-12 15:57:02] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-12 15:57:02] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/19 places, 39/40 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 17 transition count 37
Applied a total of 2 rules in 1 ms. Remains 17 /19 variables (removed 2) and now considering 37/39 (removed 2) transitions.
// Phase 1: matrix 37 rows 17 cols
[2023-03-12 15:57:02] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 15:57:02] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-12 15:57:02] [INFO ] Invariant cache hit.
[2023-03-12 15:57:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:57:02] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/19 places, 37/40 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 333 ms. Remains : 17/19 places, 37/40 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 31 steps, including 7 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 151 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Product exploration explored 100000 steps with 20 reset in 71 ms.
Product exploration explored 100000 steps with 0 reset in 39 ms.
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 37/37 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2023-03-12 15:57:03] [INFO ] Invariant cache hit.
[2023-03-12 15:57:03] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-12 15:57:03] [INFO ] Invariant cache hit.
[2023-03-12 15:57:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:57:03] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-12 15:57:03] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-12 15:57:03] [INFO ] Invariant cache hit.
[2023-03-12 15:57:03] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 17/17 places, 37/37 transitions.
Treatment of property AutonomousCar-PT-02b-LTLCardinality-10 finished in 2325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 153/153 transitions.
Graph (trivial) has 122 edges and 130 vertex of which 4 / 130 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 127 transition count 98
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 69 rules applied. Total rules applied 122 place count 75 transition count 81
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 132 place count 65 transition count 81
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 132 place count 65 transition count 74
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 146 place count 58 transition count 74
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 150 place count 54 transition count 70
Iterating global reduction 3 with 4 rules applied. Total rules applied 154 place count 54 transition count 70
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 156 place count 52 transition count 67
Iterating global reduction 3 with 2 rules applied. Total rules applied 158 place count 52 transition count 67
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 3 with 2 rules applied. Total rules applied 160 place count 52 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 161 place count 51 transition count 65
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 205 place count 29 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 206 place count 29 transition count 41
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 209 place count 26 transition count 33
Iterating global reduction 6 with 3 rules applied. Total rules applied 212 place count 26 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 213 place count 26 transition count 32
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 215 place count 25 transition count 31
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 219 place count 23 transition count 37
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 221 place count 21 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 222 place count 20 transition count 35
Applied a total of 222 rules in 8 ms. Remains 20 /130 variables (removed 110) and now considering 35/153 (removed 118) transitions.
// Phase 1: matrix 35 rows 20 cols
[2023-03-12 15:57:03] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 15:57:03] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-12 15:57:03] [INFO ] Invariant cache hit.
[2023-03-12 15:57:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 15:57:03] [INFO ] Implicit Places using invariants and state equation in 81 ms returned [15, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 161 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/130 places, 35/153 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 34
Applied a total of 2 rules in 1 ms. Remains 17 /18 variables (removed 1) and now considering 34/35 (removed 1) transitions.
// Phase 1: matrix 34 rows 17 cols
[2023-03-12 15:57:03] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-12 15:57:03] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-12 15:57:03] [INFO ] Invariant cache hit.
[2023-03-12 15:57:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:57:03] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/130 places, 34/153 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 305 ms. Remains : 17/130 places, 34/153 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLCardinality-15 finished in 432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(p0) U (G(p1)&&!p2)))'
Found a Shortening insensitive property : AutonomousCar-PT-02b-LTLCardinality-09
Stuttering acceptance computed with spot in 179 ms :[(AND p1 (NOT p2)), p1, (AND p1 (NOT p2) p0)]
Support contains 5 out of 130 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 130/130 places, 153/153 transitions.
Graph (trivial) has 114 edges and 130 vertex of which 4 / 130 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.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 128 transition count 105
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 58 rules applied. Total rules applied 105 place count 82 transition count 93
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 113 place count 75 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 114 place count 74 transition count 92
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 114 place count 74 transition count 83
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 132 place count 65 transition count 83
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 134 place count 63 transition count 81
Iterating global reduction 4 with 2 rules applied. Total rules applied 136 place count 63 transition count 81
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 62 transition count 80
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 62 transition count 80
Performed 25 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 188 place count 37 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 189 place count 37 transition count 53
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 192 place count 34 transition count 45
Iterating global reduction 5 with 3 rules applied. Total rules applied 195 place count 34 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 196 place count 34 transition count 44
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 198 place count 33 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 202 place count 31 transition count 52
Applied a total of 202 rules in 47 ms. Remains 31 /130 variables (removed 99) and now considering 52/153 (removed 101) transitions.
// Phase 1: matrix 52 rows 31 cols
[2023-03-12 15:57:04] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 15:57:04] [INFO ] Implicit Places using invariants in 151 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 163 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 30/130 places, 52/153 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 211 ms. Remains : 30/130 places, 52/153 transitions.
Running random walk in product with property : AutonomousCar-PT-02b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s22 0) (EQ s6 1)), p1:(EQ s8 1), p0:(OR (EQ s0 0) (EQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2 reset in 93 ms.
Product exploration explored 100000 steps with 2 reset in 69 ms.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Detected a total of 4/30 stabilizing places and 5/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 p0))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 579 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[false, p1, (AND p1 (NOT p2) p0)]
Finished random walk after 2312 steps, including 161 resets, run visited all 4 properties in 6 ms. (steps per millisecond=385 )
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 p0))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND p2 (NOT p0) (NOT p1)))), (F (AND (NOT p2) p0 p1)), (F p1)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 619 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[false, p1, (AND p1 (NOT p2) p0)]
Stuttering acceptance computed with spot in 141 ms :[false, p1, (AND p1 (NOT p2) p0)]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 30 cols
[2023-03-12 15:57:06] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 15:57:06] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-12 15:57:06] [INFO ] Invariant cache hit.
[2023-03-12 15:57:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-12 15:57:06] [INFO ] Implicit Places using invariants and state equation in 144 ms returned [25, 29]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 205 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/30 places, 52/52 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 27 transition count 51
Applied a total of 2 rules in 2 ms. Remains 27 /28 variables (removed 1) and now considering 51/52 (removed 1) transitions.
// Phase 1: matrix 51 rows 27 cols
[2023-03-12 15:57:06] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-12 15:57:06] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-12 15:57:06] [INFO ] Invariant cache hit.
[2023-03-12 15:57:06] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-12 15:57:06] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/30 places, 51/52 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 434 ms. Remains : 27/30 places, 51/52 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Detected a total of 4/27 stabilizing places and 5/51 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X p0), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 549 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[false, p1, (AND p1 (NOT p2) p0)]
Finished random walk after 2003 steps, including 142 resets, run visited all 4 properties in 8 ms. (steps per millisecond=250 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X p0), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND p2 (NOT p0) (NOT p1)))), (F (AND (NOT p2) p0 p1)), (F p1)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 669 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[false, p1, (AND p1 (NOT p2) p0)]
Stuttering acceptance computed with spot in 189 ms :[false, p1, (AND p1 (NOT p2) p0)]
Stuttering acceptance computed with spot in 174 ms :[false, p1, (AND p1 (NOT p2) p0)]
Product exploration explored 100000 steps with 2 reset in 70 ms.
Product exploration explored 100000 steps with 17 reset in 39 ms.
Support contains 5 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-12 15:57:08] [INFO ] Invariant cache hit.
[2023-03-12 15:57:08] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-12 15:57:08] [INFO ] Invariant cache hit.
[2023-03-12 15:57:08] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-12 15:57:08] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-12 15:57:09] [INFO ] Redundant transitions in 26 ms returned [28]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 50 rows 27 cols
[2023-03-12 15:57:09] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 15:57:09] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/27 places, 50/51 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 25 transition count 48
Applied a total of 4 rules in 2 ms. Remains 25 /27 variables (removed 2) and now considering 48/50 (removed 2) transitions.
// Phase 1: matrix 48 rows 25 cols
[2023-03-12 15:57:09] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-12 15:57:09] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-12 15:57:09] [INFO ] Invariant cache hit.
[2023-03-12 15:57:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-12 15:57:09] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/27 places, 48/51 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 300 ms. Remains : 25/27 places, 48/51 transitions.
Treatment of property AutonomousCar-PT-02b-LTLCardinality-09 finished in 5410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-12 15:57:09] [INFO ] Flatten gal took : 19 ms
[2023-03-12 15:57:09] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 15:57:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 130 places, 153 transitions and 442 arcs took 1 ms.
Total runtime 20109 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1285/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1285/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutonomousCar-PT-02b-LTLCardinality-09
Could not compute solution for formula : AutonomousCar-PT-02b-LTLCardinality-10

BK_STOP 1678636630107

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-02b, examination is 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 r009-oct2-167813598100555"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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