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.r007-oct2-167813595800603.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 lolaxred
Input is AutonomousCar-PT-05b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595800603
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 12:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 12:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 159K 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-05b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678351700420

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-05b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 08:48:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 08:48:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:48:23] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2023-03-09 08:48:23] [INFO ] Transformed 255 places.
[2023-03-09 08:48:23] [INFO ] Transformed 490 transitions.
[2023-03-09 08:48:23] [INFO ] Found NUPN structural information;
[2023-03-09 08:48:23] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-05b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 490/490 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 220 transition count 455
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 220 transition count 455
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 170 place count 220 transition count 355
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 175 place count 215 transition count 350
Iterating global reduction 1 with 5 rules applied. Total rules applied 180 place count 215 transition count 350
Applied a total of 180 rules in 73 ms. Remains 215 /255 variables (removed 40) and now considering 350/490 (removed 140) transitions.
// Phase 1: matrix 350 rows 215 cols
[2023-03-09 08:48:23] [INFO ] Computed 10 place invariants in 16 ms
[2023-03-09 08:48:23] [INFO ] Implicit Places using invariants in 409 ms returned []
[2023-03-09 08:48:23] [INFO ] Invariant cache hit.
[2023-03-09 08:48:24] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 1021 ms to find 0 implicit places.
[2023-03-09 08:48:24] [INFO ] Invariant cache hit.
[2023-03-09 08:48:24] [INFO ] Dead Transitions using invariants and state equation in 352 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 215/255 places, 350/490 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1447 ms. Remains : 215/255 places, 350/490 transitions.
Support contains 30 out of 215 places after structural reductions.
[2023-03-09 08:48:25] [INFO ] Flatten gal took : 82 ms
[2023-03-09 08:48:25] [INFO ] Flatten gal took : 41 ms
[2023-03-09 08:48:25] [INFO ] Input system was already deterministic with 350 transitions.
Support contains 29 out of 215 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 100 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 18) seen :16
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 08:48:25] [INFO ] Invariant cache hit.
[2023-03-09 08:48:25] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-09 08:48:25] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:48:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 49 ms returned sat
[2023-03-09 08:48:26] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 08:48:26] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 6 ms to minimize.
[2023-03-09 08:48:26] [INFO ] Deduced a trap composed of 28 places in 403 ms of which 6 ms to minimize.
[2023-03-09 08:48:27] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 1 ms to minimize.
[2023-03-09 08:48:27] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2023-03-09 08:48:27] [INFO ] Deduced a trap composed of 58 places in 240 ms of which 2 ms to minimize.
[2023-03-09 08:48:27] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 1 ms to minimize.
[2023-03-09 08:48:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1488 ms
[2023-03-09 08:48:27] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 0 ms to minimize.
[2023-03-09 08:48:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-03-09 08:48:28] [INFO ] After 2048ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-09 08:48:28] [INFO ] After 2222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 20 ms.
Support contains 8 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 350/350 transitions.
Graph (trivial) has 193 edges and 215 vertex of which 2 / 215 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 692 edges and 214 vertex of which 213 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 78 rules applied. Total rules applied 80 place count 213 transition count 270
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 109 rules applied. Total rules applied 189 place count 136 transition count 238
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 208 place count 117 transition count 238
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 208 place count 117 transition count 230
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 224 place count 109 transition count 230
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 225 place count 108 transition count 229
Iterating global reduction 3 with 1 rules applied. Total rules applied 226 place count 108 transition count 229
Performed 44 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 314 place count 64 transition count 184
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 322 place count 56 transition count 145
Iterating global reduction 3 with 8 rules applied. Total rules applied 330 place count 56 transition count 145
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 334 place count 56 transition count 141
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 343 place count 56 transition count 132
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 352 place count 47 transition count 132
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 353 place count 47 transition count 131
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 354 place count 47 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 355 place count 46 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 356 place count 45 transition count 130
Applied a total of 356 rules in 85 ms. Remains 45 /215 variables (removed 170) and now considering 130/350 (removed 220) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 45/215 places, 130/350 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Probably explored full state space saw : 228612 states, properties seen :1
Probabilistic random walk after 1536164 steps, saw 228612 distinct states, run finished after 1532 ms. (steps per millisecond=1002 ) properties seen :1
Explored full state space saw : 228612 states, properties seen :0
Exhaustive walk after 1536164 steps, saw 228612 distinct states, run finished after 1021 ms. (steps per millisecond=1504 ) properties seen :0
FORMULA AutonomousCar-PT-05b-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 38 stabilizing places and 39 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(p0)||(p1 U G(p0))))'
Support contains 4 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 350/350 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 211 transition count 346
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 211 transition count 346
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 209 transition count 344
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 209 transition count 344
Applied a total of 12 rules in 29 ms. Remains 209 /215 variables (removed 6) and now considering 344/350 (removed 6) transitions.
// Phase 1: matrix 344 rows 209 cols
[2023-03-09 08:48:31] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-09 08:48:31] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-09 08:48:31] [INFO ] Invariant cache hit.
[2023-03-09 08:48:32] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2023-03-09 08:48:32] [INFO ] Invariant cache hit.
[2023-03-09 08:48:32] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 209/215 places, 344/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1140 ms. Remains : 209/215 places, 344/350 transitions.
Stuttering acceptance computed with spot in 585 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s25 0) (EQ s169 1)), p0:(OR (EQ s14 0) (EQ s206 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 300 ms.
Product exploration explored 100000 steps with 50000 reset in 212 ms.
Computed a total of 37 stabilizing places and 38 stable transitions
Computed a total of 37 stabilizing places and 38 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 9 factoid took 236 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-05b-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-05b-LTLCardinality-00 finished in 2605 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 2 out of 215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 215/215 places, 350/350 transitions.
Graph (trivial) has 200 edges and 215 vertex of which 4 / 215 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 212 transition count 265
Reduce places removed 82 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 114 rules applied. Total rules applied 197 place count 130 transition count 233
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 217 place count 111 transition count 232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 218 place count 110 transition count 232
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 218 place count 110 transition count 226
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 230 place count 104 transition count 226
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 233 place count 101 transition count 223
Iterating global reduction 4 with 3 rules applied. Total rules applied 236 place count 101 transition count 223
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 237 place count 100 transition count 218
Iterating global reduction 4 with 1 rules applied. Total rules applied 238 place count 100 transition count 218
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 4 with 2 rules applied. Total rules applied 240 place count 100 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 241 place count 99 transition count 216
Performed 42 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 325 place count 57 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 326 place count 57 transition count 172
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 336 place count 47 transition count 121
Iterating global reduction 7 with 10 rules applied. Total rules applied 346 place count 47 transition count 121
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 350 place count 47 transition count 117
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 8 with 4 rules applied. Total rules applied 354 place count 45 transition count 115
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 356 place count 43 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 357 place count 42 transition count 113
Applied a total of 357 rules in 87 ms. Remains 42 /215 variables (removed 173) and now considering 113/350 (removed 237) transitions.
// Phase 1: matrix 113 rows 42 cols
[2023-03-09 08:48:33] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-09 08:48:33] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-09 08:48:33] [INFO ] Invariant cache hit.
[2023-03-09 08:48:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:48:34] [INFO ] Implicit Places using invariants and state equation in 624 ms returned [37, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 728 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/215 places, 113/350 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 39 transition count 112
Applied a total of 2 rules in 7 ms. Remains 39 /40 variables (removed 1) and now considering 112/113 (removed 1) transitions.
// Phase 1: matrix 112 rows 39 cols
[2023-03-09 08:48:34] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 08:48:34] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-09 08:48:34] [INFO ] Invariant cache hit.
[2023-03-09 08:48:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:48:34] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/215 places, 112/350 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 990 ms. Remains : 39/215 places, 112/350 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLCardinality-04 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:(OR (EQ s11 0) (EQ s7 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]]
Product exploration explored 100000 steps with 580 reset in 128 ms.
Product exploration explored 100000 steps with 18 reset in 70 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 204 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 248 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 112/112 transitions.
Applied a total of 0 rules in 6 ms. Remains 39 /39 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2023-03-09 08:48:36] [INFO ] Invariant cache hit.
[2023-03-09 08:48:36] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-09 08:48:36] [INFO ] Invariant cache hit.
[2023-03-09 08:48:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:48:37] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 980 ms to find 0 implicit places.
[2023-03-09 08:48:37] [INFO ] Redundant transitions in 26 ms returned [59]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 111 rows 39 cols
[2023-03-09 08:48:37] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 08:48:39] [INFO ] Dead Transitions using invariants and state equation in 1968 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/39 places, 111/112 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 37 transition count 109
Applied a total of 2 rules in 9 ms. Remains 37 /39 variables (removed 2) and now considering 109/111 (removed 2) transitions.
// Phase 1: matrix 109 rows 37 cols
[2023-03-09 08:48:39] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-09 08:48:39] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-09 08:48:39] [INFO ] Invariant cache hit.
[2023-03-09 08:48:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:48:39] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/39 places, 109/112 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3221 ms. Remains : 37/39 places, 109/112 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 223 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9 reset in 74 ms.
Product exploration explored 100000 steps with 47 reset in 146 ms.
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 37 /37 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-09 08:48:40] [INFO ] Invariant cache hit.
[2023-03-09 08:48:41] [INFO ] Implicit Places using invariants in 1279 ms returned []
[2023-03-09 08:48:41] [INFO ] Invariant cache hit.
[2023-03-09 08:48:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:48:42] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 1562 ms to find 0 implicit places.
[2023-03-09 08:48:42] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-09 08:48:42] [INFO ] Invariant cache hit.
[2023-03-09 08:48:42] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1721 ms. Remains : 37/37 places, 109/109 transitions.
Treatment of property AutonomousCar-PT-05b-LTLCardinality-04 finished in 8650 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) U (G(F(p1))||G((p0 U p2))))))'
Support contains 5 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 350/350 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 210 transition count 345
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 210 transition count 345
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 208 transition count 343
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 208 transition count 343
Applied a total of 14 rules in 7 ms. Remains 208 /215 variables (removed 7) and now considering 343/350 (removed 7) transitions.
// Phase 1: matrix 343 rows 208 cols
[2023-03-09 08:48:42] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-09 08:48:42] [INFO ] Implicit Places using invariants in 433 ms returned []
[2023-03-09 08:48:42] [INFO ] Invariant cache hit.
[2023-03-09 08:48:43] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2023-03-09 08:48:43] [INFO ] Invariant cache hit.
[2023-03-09 08:48:43] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 208/215 places, 343/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 891 ms. Remains : 208/215 places, 343/350 transitions.
Stuttering acceptance computed with spot in 400 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p1) p2) (AND (NOT p1) p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s175 1), p2:(OR (EQ s75 0) (EQ s199 1)), p0:(OR (EQ s184 0) (EQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 43 reset in 270 ms.
Product exploration explored 100000 steps with 94 reset in 116 ms.
Computed a total of 37 stabilizing places and 38 stable transitions
Computed a total of 37 stabilizing places and 38 stable transitions
Detected a total of 37/208 stabilizing places and 38/343 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 970 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 08:48:45] [INFO ] Invariant cache hit.
[2023-03-09 08:48:45] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:48:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 08:48:45] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 08:48:46] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 1 ms to minimize.
[2023-03-09 08:48:46] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 0 ms to minimize.
[2023-03-09 08:48:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 373 ms
[2023-03-09 08:48:46] [INFO ] After 534ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-09 08:48:46] [INFO ] After 656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 343/343 transitions.
Graph (trivial) has 188 edges and 208 vertex of which 4 / 208 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 683 edges and 206 vertex of which 204 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 204 transition count 266
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 104 rules applied. Total rules applied 179 place count 133 transition count 233
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 199 place count 114 transition count 232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 200 place count 113 transition count 232
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 200 place count 113 transition count 225
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 214 place count 106 transition count 225
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 306 place count 60 transition count 179
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 317 place count 49 transition count 123
Iterating global reduction 4 with 11 rules applied. Total rules applied 328 place count 49 transition count 123
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 333 place count 49 transition count 118
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 339 place count 49 transition count 112
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 345 place count 43 transition count 112
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 346 place count 43 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 347 place count 42 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 348 place count 41 transition count 111
Applied a total of 348 rules in 48 ms. Remains 41 /208 variables (removed 167) and now considering 111/343 (removed 232) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 41/208 places, 111/343 transitions.
Finished random walk after 1747 steps, including 14 resets, run visited all 2 properties in 32 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT (OR (AND p2 (NOT p1)) (AND (NOT p1) p0)))), (F (AND p2 (NOT p0))), (F (AND p2 (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p1) p0)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 13 factoid took 908 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 496 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 572 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 343/343 transitions.
Applied a total of 0 rules in 9 ms. Remains 208 /208 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-09 08:48:48] [INFO ] Invariant cache hit.
[2023-03-09 08:48:48] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-09 08:48:48] [INFO ] Invariant cache hit.
[2023-03-09 08:48:49] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2023-03-09 08:48:49] [INFO ] Invariant cache hit.
[2023-03-09 08:48:49] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 986 ms. Remains : 208/208 places, 343/343 transitions.
Computed a total of 37 stabilizing places and 38 stable transitions
Computed a total of 37 stabilizing places and 38 stable transitions
Detected a total of 37/208 stabilizing places and 38/343 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (OR (AND p2 (NOT p1)) (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 874 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 420 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 65 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 08:48:51] [INFO ] Invariant cache hit.
[2023-03-09 08:48:51] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:48:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 58 ms returned sat
[2023-03-09 08:48:51] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 08:48:51] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 1 ms to minimize.
[2023-03-09 08:48:52] [INFO ] Deduced a trap composed of 14 places in 641 ms of which 0 ms to minimize.
[2023-03-09 08:48:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 821 ms
[2023-03-09 08:48:52] [INFO ] After 1039ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-09 08:48:52] [INFO ] After 1281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 343/343 transitions.
Graph (trivial) has 188 edges and 208 vertex of which 4 / 208 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 683 edges and 206 vertex of which 204 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 204 transition count 266
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 104 rules applied. Total rules applied 179 place count 133 transition count 233
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 199 place count 114 transition count 232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 200 place count 113 transition count 232
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 200 place count 113 transition count 225
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 214 place count 106 transition count 225
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 306 place count 60 transition count 179
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 317 place count 49 transition count 123
Iterating global reduction 4 with 11 rules applied. Total rules applied 328 place count 49 transition count 123
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 333 place count 49 transition count 118
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 339 place count 49 transition count 112
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 345 place count 43 transition count 112
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 346 place count 43 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 347 place count 42 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 348 place count 41 transition count 111
Applied a total of 348 rules in 31 ms. Remains 41 /208 variables (removed 167) and now considering 111/343 (removed 232) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 41/208 places, 111/343 transitions.
Finished random walk after 7156 steps, including 69 resets, run visited all 2 properties in 101 ms. (steps per millisecond=70 )
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (OR (AND p2 (NOT p1)) (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT (OR (AND p2 (NOT p1)) (AND (NOT p1) p0)))), (F (AND p2 (NOT p0))), (F (AND p2 (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p1) p0)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 13 factoid took 1260 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 425 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 387 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 357 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 554 reset in 153 ms.
Product exploration explored 100000 steps with 834 reset in 197 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 374 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 343/343 transitions.
Graph (trivial) has 188 edges and 208 vertex of which 4 / 208 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 206 transition count 341
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 15 rules applied. Total rules applied 88 place count 206 transition count 327
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 88 place count 206 transition count 327
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 103 place count 206 transition count 327
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 166 place count 143 transition count 264
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 2 with 63 rules applied. Total rules applied 229 place count 143 transition count 264
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 2 with 55 rules applied. Total rules applied 284 place count 143 transition count 271
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 332 place count 95 transition count 178
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 380 place count 95 transition count 178
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 390 place count 95 transition count 168
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 395 place count 90 transition count 163
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 400 place count 90 transition count 163
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 401 place count 90 transition count 165
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 401 rules in 68 ms. Remains 90 /208 variables (removed 118) and now considering 165/343 (removed 178) transitions.
[2023-03-09 08:48:56] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 165 rows 90 cols
[2023-03-09 08:48:56] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-09 08:48:56] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/208 places, 165/343 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 90/208 places, 165/343 transitions.
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 343/343 transitions.
Applied a total of 0 rules in 2 ms. Remains 208 /208 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 208 cols
[2023-03-09 08:48:56] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-09 08:48:56] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-09 08:48:56] [INFO ] Invariant cache hit.
[2023-03-09 08:48:56] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-09 08:48:56] [INFO ] Invariant cache hit.
[2023-03-09 08:48:56] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 532 ms. Remains : 208/208 places, 343/343 transitions.
Treatment of property AutonomousCar-PT-05b-LTLCardinality-05 finished in 14330 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 2 out of 215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 215/215 places, 350/350 transitions.
Graph (trivial) has 201 edges and 215 vertex of which 4 / 215 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 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 212 transition count 265
Reduce places removed 82 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 114 rules applied. Total rules applied 197 place count 130 transition count 233
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 216 place count 111 transition count 233
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 216 place count 111 transition count 227
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 228 place count 105 transition count 227
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 231 place count 102 transition count 224
Iterating global reduction 3 with 3 rules applied. Total rules applied 234 place count 102 transition count 224
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 235 place count 101 transition count 219
Iterating global reduction 3 with 1 rules applied. Total rules applied 236 place count 101 transition count 219
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 238 place count 101 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 239 place count 100 transition count 217
Performed 43 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 325 place count 57 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 326 place count 57 transition count 172
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 334 place count 49 transition count 132
Iterating global reduction 6 with 8 rules applied. Total rules applied 342 place count 49 transition count 132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 345 place count 49 transition count 129
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 349 place count 47 transition count 127
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 351 place count 45 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 352 place count 44 transition count 125
Applied a total of 352 rules in 24 ms. Remains 44 /215 variables (removed 171) and now considering 125/350 (removed 225) transitions.
// Phase 1: matrix 125 rows 44 cols
[2023-03-09 08:48:56] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-09 08:48:56] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-09 08:48:56] [INFO ] Invariant cache hit.
[2023-03-09 08:48:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:48:56] [INFO ] Implicit Places using invariants and state equation in 106 ms returned [39, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 226 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/215 places, 125/350 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 41 transition count 124
Applied a total of 2 rules in 4 ms. Remains 41 /42 variables (removed 1) and now considering 124/125 (removed 1) transitions.
// Phase 1: matrix 124 rows 41 cols
[2023-03-09 08:48:57] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 08:48:57] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-09 08:48:57] [INFO ] Invariant cache hit.
[2023-03-09 08:48:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:48:57] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/215 places, 124/350 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 436 ms. Remains : 41/215 places, 124/350 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s21 0) (NEQ s31 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 24 steps with 0 reset in 13 ms.
FORMULA AutonomousCar-PT-05b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLCardinality-06 finished in 608 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)||G(p1))))'
Support contains 4 out of 215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 215/215 places, 350/350 transitions.
Graph (trivial) has 197 edges and 215 vertex of which 4 / 215 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 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 212 transition count 269
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 110 rules applied. Total rules applied 189 place count 134 transition count 237
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 208 place count 115 transition count 237
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 208 place count 115 transition count 231
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 220 place count 109 transition count 231
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 222 place count 107 transition count 229
Iterating global reduction 3 with 2 rules applied. Total rules applied 224 place count 107 transition count 229
Performed 45 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 314 place count 62 transition count 183
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 323 place count 53 transition count 138
Iterating global reduction 3 with 9 rules applied. Total rules applied 332 place count 53 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 336 place count 53 transition count 134
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 4 with 2 rules applied. Total rules applied 338 place count 52 transition count 133
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 340 place count 50 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 341 place count 49 transition count 131
Applied a total of 341 rules in 33 ms. Remains 49 /215 variables (removed 166) and now considering 131/350 (removed 219) transitions.
// Phase 1: matrix 131 rows 49 cols
[2023-03-09 08:48:57] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-09 08:48:57] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-09 08:48:57] [INFO ] Invariant cache hit.
[2023-03-09 08:48:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:48:57] [INFO ] Implicit Places using invariants and state equation in 190 ms returned [42, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 314 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/215 places, 131/350 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 46 transition count 130
Applied a total of 2 rules in 3 ms. Remains 46 /47 variables (removed 1) and now considering 130/131 (removed 1) transitions.
// Phase 1: matrix 130 rows 46 cols
[2023-03-09 08:48:57] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-09 08:48:57] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-09 08:48:57] [INFO ] Invariant cache hit.
[2023-03-09 08:48:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:48:57] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/215 places, 130/350 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 558 ms. Remains : 46/215 places, 130/350 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s12 0) (EQ s27 1)), p1:(AND (EQ s12 0) (EQ s27 1) (EQ s36 0) (EQ s45 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLCardinality-07 finished in 626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 3 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 350/350 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 211 transition count 346
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 211 transition count 346
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 208 transition count 343
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 208 transition count 343
Applied a total of 14 rules in 17 ms. Remains 208 /215 variables (removed 7) and now considering 343/350 (removed 7) transitions.
// Phase 1: matrix 343 rows 208 cols
[2023-03-09 08:48:58] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-09 08:48:58] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-09 08:48:58] [INFO ] Invariant cache hit.
[2023-03-09 08:48:58] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2023-03-09 08:48:58] [INFO ] Invariant cache hit.
[2023-03-09 08:48:58] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 208/215 places, 343/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 803 ms. Remains : 208/215 places, 343/350 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (EQ s155 0) (EQ s206 1)), p0:(EQ s38 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 147 ms.
Product exploration explored 100000 steps with 33333 reset in 158 ms.
Computed a total of 36 stabilizing places and 37 stable transitions
Computed a total of 36 stabilizing places and 37 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 5 factoid took 172 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-05b-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-05b-LTLCardinality-11 finished in 1533 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 350/350 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 210 transition count 345
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 210 transition count 345
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 207 transition count 342
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 207 transition count 342
Applied a total of 16 rules in 4 ms. Remains 207 /215 variables (removed 8) and now considering 342/350 (removed 8) transitions.
// Phase 1: matrix 342 rows 207 cols
[2023-03-09 08:48:59] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-09 08:48:59] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-09 08:48:59] [INFO ] Invariant cache hit.
[2023-03-09 08:48:59] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2023-03-09 08:48:59] [INFO ] Invariant cache hit.
[2023-03-09 08:49:00] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/215 places, 342/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 661 ms. Remains : 207/215 places, 342/350 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 14815 reset in 128 ms.
Product exploration explored 100000 steps with 14799 reset in 186 ms.
Computed a total of 36 stabilizing places and 37 stable transitions
Computed a total of 36 stabilizing places and 37 stable transitions
Detected a total of 36/207 stabilizing places and 37/342 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 279 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 267 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0)]
[2023-03-09 08:49:01] [INFO ] Invariant cache hit.
[2023-03-09 08:49:01] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-09 08:49:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:49:01] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2023-03-09 08:49:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:49:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-09 08:49:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:49:02] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-09 08:49:02] [INFO ] Deduced a trap composed of 31 places in 423 ms of which 0 ms to minimize.
[2023-03-09 08:49:02] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 0 ms to minimize.
[2023-03-09 08:49:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 621 ms
[2023-03-09 08:49:02] [INFO ] Computed and/alt/rep : 184/313/184 causal constraints (skipped 157 transitions) in 34 ms.
[2023-03-09 08:49:03] [INFO ] Added : 53 causal constraints over 11 iterations in 324 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 342/342 transitions.
Graph (trivial) has 195 edges and 207 vertex of which 4 / 207 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 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 204 transition count 265
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 106 rules applied. Total rules applied 181 place count 130 transition count 233
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 201 place count 111 transition count 232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 202 place count 110 transition count 232
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 202 place count 110 transition count 225
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 216 place count 103 transition count 225
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 217 place count 102 transition count 224
Iterating global reduction 4 with 1 rules applied. Total rules applied 218 place count 102 transition count 224
Performed 44 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 306 place count 58 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 307 place count 58 transition count 178
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 318 place count 47 transition count 122
Iterating global reduction 5 with 11 rules applied. Total rules applied 329 place count 47 transition count 122
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 334 place count 47 transition count 117
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 338 place count 45 transition count 115
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 340 place count 43 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 341 place count 42 transition count 113
Applied a total of 341 rules in 39 ms. Remains 42 /207 variables (removed 165) and now considering 113/342 (removed 229) transitions.
// Phase 1: matrix 113 rows 42 cols
[2023-03-09 08:49:03] [INFO ] Computed 8 place invariants in 14 ms
[2023-03-09 08:49:03] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-09 08:49:03] [INFO ] Invariant cache hit.
[2023-03-09 08:49:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:49:03] [INFO ] Implicit Places using invariants and state equation in 80 ms returned [37, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 198 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/207 places, 113/342 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 39 transition count 112
Applied a total of 2 rules in 12 ms. Remains 39 /40 variables (removed 1) and now considering 112/113 (removed 1) transitions.
// Phase 1: matrix 112 rows 39 cols
[2023-03-09 08:49:03] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-09 08:49:03] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-09 08:49:03] [INFO ] Invariant cache hit.
[2023-03-09 08:49:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:49:03] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/207 places, 112/342 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 404 ms. Remains : 39/207 places, 112/342 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Detected a total of 3/39 stabilizing places and 4/112 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 263 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0)]
[2023-03-09 08:49:04] [INFO ] Invariant cache hit.
[2023-03-09 08:49:04] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-09 08:49:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:49:04] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-09 08:49:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:49:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-09 08:49:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:49:04] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-09 08:49:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:49:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-09 08:49:04] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2023-03-09 08:49:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-09 08:49:04] [INFO ] Computed and/alt/rep : 6/7/6 causal constraints (skipped 104 transitions) in 20 ms.
[2023-03-09 08:49:04] [INFO ] Added : 0 causal constraints over 0 iterations in 35 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Product exploration explored 100000 steps with 40007 reset in 99 ms.
Product exploration explored 100000 steps with 40010 reset in 83 ms.
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 112/112 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2023-03-09 08:49:04] [INFO ] Invariant cache hit.
[2023-03-09 08:49:05] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-09 08:49:05] [INFO ] Invariant cache hit.
[2023-03-09 08:49:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:49:05] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2023-03-09 08:49:05] [INFO ] Redundant transitions in 17 ms returned [59]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 111 rows 39 cols
[2023-03-09 08:49:05] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-09 08:49:05] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/39 places, 111/112 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 37 transition count 109
Applied a total of 2 rules in 15 ms. Remains 37 /39 variables (removed 2) and now considering 109/111 (removed 2) transitions.
// Phase 1: matrix 109 rows 37 cols
[2023-03-09 08:49:05] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 08:49:05] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-09 08:49:05] [INFO ] Invariant cache hit.
[2023-03-09 08:49:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:49:05] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/39 places, 109/112 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 812 ms. Remains : 37/39 places, 109/112 transitions.
Treatment of property AutonomousCar-PT-05b-LTLCardinality-12 finished in 6130 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(p0))))))'
Support contains 1 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 350/350 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 210 transition count 345
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 210 transition count 345
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 207 transition count 342
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 207 transition count 342
Applied a total of 16 rules in 6 ms. Remains 207 /215 variables (removed 8) and now considering 342/350 (removed 8) transitions.
// Phase 1: matrix 342 rows 207 cols
[2023-03-09 08:49:05] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-09 08:49:05] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-09 08:49:05] [INFO ] Invariant cache hit.
[2023-03-09 08:49:05] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2023-03-09 08:49:05] [INFO ] Invariant cache hit.
[2023-03-09 08:49:06] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/215 places, 342/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 509 ms. Remains : 207/215 places, 342/350 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 145 ms.
Product exploration explored 100000 steps with 25000 reset in 147 ms.
Computed a total of 36 stabilizing places and 37 stable transitions
Computed a total of 36 stabilizing places and 37 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 240 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=120 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 342/342 transitions.
Applied a total of 0 rules in 2 ms. Remains 207 /207 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-09 08:49:07] [INFO ] Invariant cache hit.
[2023-03-09 08:49:07] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-09 08:49:07] [INFO ] Invariant cache hit.
[2023-03-09 08:49:07] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2023-03-09 08:49:07] [INFO ] Invariant cache hit.
[2023-03-09 08:49:08] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 559 ms. Remains : 207/207 places, 342/342 transitions.
Computed a total of 36 stabilizing places and 37 stable transitions
Computed a total of 36 stabilizing places and 37 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 225 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=225 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 149 ms.
Product exploration explored 100000 steps with 25000 reset in 134 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 342/342 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-09 08:49:09] [INFO ] Invariant cache hit.
[2023-03-09 08:49:09] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-09 08:49:09] [INFO ] Invariant cache hit.
[2023-03-09 08:49:09] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2023-03-09 08:49:09] [INFO ] Invariant cache hit.
[2023-03-09 08:49:10] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 722 ms. Remains : 207/207 places, 342/342 transitions.
Treatment of property AutonomousCar-PT-05b-LTLCardinality-14 finished in 4521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X(X(X(F(p1))))))))'
Support contains 4 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 350/350 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 210 transition count 345
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 210 transition count 345
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 207 transition count 342
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 207 transition count 342
Applied a total of 16 rules in 13 ms. Remains 207 /215 variables (removed 8) and now considering 342/350 (removed 8) transitions.
[2023-03-09 08:49:10] [INFO ] Invariant cache hit.
[2023-03-09 08:49:10] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-09 08:49:10] [INFO ] Invariant cache hit.
[2023-03-09 08:49:10] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-09 08:49:10] [INFO ] Invariant cache hit.
[2023-03-09 08:49:10] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/215 places, 342/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 511 ms. Remains : 207/215 places, 342/350 transitions.
Stuttering acceptance computed with spot in 337 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(OR (EQ s42 0) (EQ s197 1)), p1:(AND (EQ s64 0) (EQ s125 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLCardinality-15 finished in 901 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)))'
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) U (G(F(p1))||G((p0 U p2))))))'
Found a Lengthening insensitive property : AutonomousCar-PT-05b-LTLCardinality-05
Stuttering acceptance computed with spot in 478 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 215 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 215/215 places, 350/350 transitions.
Graph (trivial) has 195 edges and 215 vertex of which 4 / 215 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 212 transition count 270
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 108 rules applied. Total rules applied 186 place count 135 transition count 239
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 19 rules applied. Total rules applied 205 place count 117 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 206 place count 116 transition count 238
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 206 place count 116 transition count 232
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 218 place count 110 transition count 232
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 221 place count 107 transition count 229
Iterating global reduction 4 with 3 rules applied. Total rules applied 224 place count 107 transition count 229
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 225 place count 106 transition count 224
Iterating global reduction 4 with 1 rules applied. Total rules applied 226 place count 106 transition count 224
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 4 with 2 rules applied. Total rules applied 228 place count 106 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 229 place count 105 transition count 222
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 313 place count 63 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 314 place count 63 transition count 179
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 324 place count 53 transition count 128
Iterating global reduction 7 with 10 rules applied. Total rules applied 334 place count 53 transition count 128
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 338 place count 53 transition count 124
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 8 with 4 rules applied. Total rules applied 342 place count 51 transition count 122
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 343 place count 51 transition count 122
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 345 place count 49 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 346 place count 48 transition count 120
Applied a total of 346 rules in 46 ms. Remains 48 /215 variables (removed 167) and now considering 120/350 (removed 230) transitions.
// Phase 1: matrix 120 rows 48 cols
[2023-03-09 08:49:11] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-09 08:49:12] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-09 08:49:12] [INFO ] Invariant cache hit.
[2023-03-09 08:49:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:49:12] [INFO ] Implicit Places using invariants and state equation in 184 ms returned [40, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 477 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 46/215 places, 120/350 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 119
Applied a total of 2 rules in 2 ms. Remains 45 /46 variables (removed 1) and now considering 119/120 (removed 1) transitions.
// Phase 1: matrix 119 rows 45 cols
[2023-03-09 08:49:12] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 08:49:12] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-09 08:49:12] [INFO ] Invariant cache hit.
[2023-03-09 08:49:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:49:12] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 45/215 places, 119/350 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 732 ms. Remains : 45/215 places, 119/350 transitions.
Running random walk in product with property : AutonomousCar-PT-05b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p1) p2) (AND (NOT p1) p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s38 1), p2:(OR (EQ s14 0) (EQ s43 1)), p0:(OR (EQ s39 0) (EQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 21 reset in 63 ms.
Product exploration explored 100000 steps with 146 reset in 73 ms.
Computed a total of 3 stabilizing places and 6 stable transitions
Computed a total of 3 stabilizing places and 6 stable transitions
Detected a total of 3/45 stabilizing places and 6/119 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))))]
Knowledge based reduction with 12 factoid took 740 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 486 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 08:49:13] [INFO ] Invariant cache hit.
[2023-03-09 08:49:13] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:49:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-09 08:49:14] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 08:49:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:49:14] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 08:49:14] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2023-03-09 08:49:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-09 08:49:14] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-09 08:49:14] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 119/119 transitions.
Graph (complete) has 295 edges and 45 vertex of which 44 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 44 transition count 117
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 44 transition count 111
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 38 transition count 111
Applied a total of 14 rules in 6 ms. Remains 38 /45 variables (removed 7) and now considering 111/119 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 38/45 places, 111/119 transitions.
Finished random walk after 9329 steps, including 141 resets, run visited all 2 properties in 115 ms. (steps per millisecond=81 )
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 12 factoid took 1042 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 341 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 119/119 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-09 08:49:16] [INFO ] Invariant cache hit.
[2023-03-09 08:49:16] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-09 08:49:16] [INFO ] Invariant cache hit.
[2023-03-09 08:49:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:49:16] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2023-03-09 08:49:16] [INFO ] Invariant cache hit.
[2023-03-09 08:49:16] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 475 ms. Remains : 45/45 places, 119/119 transitions.
Computed a total of 3 stabilizing places and 6 stable transitions
Computed a total of 3 stabilizing places and 6 stable transitions
Detected a total of 3/45 stabilizing places and 6/119 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))))]
Knowledge based reduction with 12 factoid took 662 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 519 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 08:49:17] [INFO ] Invariant cache hit.
[2023-03-09 08:49:17] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:49:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-09 08:49:17] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 08:49:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:49:17] [INFO ] After 67ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 08:49:17] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 0 ms to minimize.
[2023-03-09 08:49:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-09 08:49:17] [INFO ] After 167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 08:49:17] [INFO ] After 267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 119/119 transitions.
Graph (complete) has 295 edges and 45 vertex of which 44 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 44 transition count 117
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 44 transition count 111
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 38 transition count 111
Applied a total of 14 rules in 12 ms. Remains 38 /45 variables (removed 7) and now considering 111/119 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 38/45 places, 111/119 transitions.
Incomplete random walk after 10000 steps, including 150 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Finished probabilistic random walk after 61272 steps, run visited all 2 properties in 131 ms. (steps per millisecond=467 )
Probabilistic random walk after 61272 steps, saw 10636 distinct states, run finished after 131 ms. (steps per millisecond=467 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 12 factoid took 858 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 349 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 118 reset in 76 ms.
Stuttering criterion allowed to conclude after 717 steps with 51 reset in 2 ms.
Treatment of property AutonomousCar-PT-05b-LTLCardinality-05 finished in 8913 ms.
FORMULA AutonomousCar-PT-05b-LTLCardinality-05 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : AutonomousCar-PT-05b-LTLCardinality-12
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 215 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 215/215 places, 350/350 transitions.
Graph (trivial) has 203 edges and 215 vertex of which 4 / 215 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 212 transition count 265
Reduce places removed 82 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 114 rules applied. Total rules applied 197 place count 130 transition count 233
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 217 place count 111 transition count 232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 218 place count 110 transition count 232
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 218 place count 110 transition count 226
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 230 place count 104 transition count 226
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 233 place count 101 transition count 223
Iterating global reduction 4 with 3 rules applied. Total rules applied 236 place count 101 transition count 223
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 237 place count 100 transition count 218
Iterating global reduction 4 with 1 rules applied. Total rules applied 238 place count 100 transition count 218
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 4 with 2 rules applied. Total rules applied 240 place count 100 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 241 place count 99 transition count 216
Performed 42 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 325 place count 57 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 326 place count 57 transition count 172
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 336 place count 47 transition count 121
Iterating global reduction 7 with 10 rules applied. Total rules applied 346 place count 47 transition count 121
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 350 place count 47 transition count 117
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 8 with 4 rules applied. Total rules applied 354 place count 45 transition count 115
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 356 place count 43 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 357 place count 42 transition count 113
Applied a total of 357 rules in 34 ms. Remains 42 /215 variables (removed 173) and now considering 113/350 (removed 237) transitions.
// Phase 1: matrix 113 rows 42 cols
[2023-03-09 08:49:20] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-09 08:49:20] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-09 08:49:20] [INFO ] Invariant cache hit.
[2023-03-09 08:49:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:49:20] [INFO ] Implicit Places using invariants and state equation in 101 ms returned [37, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 191 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 40/215 places, 113/350 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 39 transition count 112
Applied a total of 2 rules in 2 ms. Remains 39 /40 variables (removed 1) and now considering 112/113 (removed 1) transitions.
// Phase 1: matrix 112 rows 39 cols
[2023-03-09 08:49:20] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 08:49:20] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-09 08:49:20] [INFO ] Invariant cache hit.
[2023-03-09 08:49:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:49:20] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 39/215 places, 112/350 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 385 ms. Remains : 39/215 places, 112/350 transitions.
Running random walk in product with property : AutonomousCar-PT-05b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 40011 reset in 77 ms.
Product exploration explored 100000 steps with 39933 reset in 77 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Detected a total of 3/39 stabilizing places and 4/112 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 230 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 344 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
[2023-03-09 08:49:21] [INFO ] Invariant cache hit.
[2023-03-09 08:49:21] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-09 08:49:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:49:21] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-09 08:49:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:49:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-09 08:49:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:49:22] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2023-03-09 08:49:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:49:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2023-03-09 08:49:22] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2023-03-09 08:49:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-09 08:49:22] [INFO ] Computed and/alt/rep : 6/7/6 causal constraints (skipped 104 transitions) in 30 ms.
[2023-03-09 08:49:22] [INFO ] Added : 0 causal constraints over 0 iterations in 51 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 112/112 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2023-03-09 08:49:22] [INFO ] Invariant cache hit.
[2023-03-09 08:49:22] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-09 08:49:22] [INFO ] Invariant cache hit.
[2023-03-09 08:49:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:49:22] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2023-03-09 08:49:22] [INFO ] Redundant transitions in 22 ms returned [59]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 111 rows 39 cols
[2023-03-09 08:49:22] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-09 08:49:22] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/39 places, 111/112 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 37 transition count 109
Applied a total of 2 rules in 2 ms. Remains 37 /39 variables (removed 2) and now considering 109/111 (removed 2) transitions.
// Phase 1: matrix 109 rows 37 cols
[2023-03-09 08:49:22] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-09 08:49:22] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-09 08:49:22] [INFO ] Invariant cache hit.
[2023-03-09 08:49:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:49:22] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/39 places, 109/112 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 540 ms. Remains : 37/39 places, 109/112 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/37 stabilizing places and 5/109 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
Treatment of property AutonomousCar-PT-05b-LTLCardinality-12 finished in 2876 ms.
FORMULA AutonomousCar-PT-05b-LTLCardinality-12 TRUE TECHNIQUES SHORTENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(p0))))))'
Found a Shortening insensitive property : AutonomousCar-PT-05b-LTLCardinality-14
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 215 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 215/215 places, 350/350 transitions.
Graph (trivial) has 202 edges and 215 vertex of which 4 / 215 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 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 212 transition count 266
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 112 rules applied. Total rules applied 194 place count 131 transition count 235
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 19 rules applied. Total rules applied 213 place count 113 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 214 place count 112 transition count 234
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 214 place count 112 transition count 228
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 226 place count 106 transition count 228
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 229 place count 103 transition count 225
Iterating global reduction 4 with 3 rules applied. Total rules applied 232 place count 103 transition count 225
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 233 place count 102 transition count 220
Iterating global reduction 4 with 1 rules applied. Total rules applied 234 place count 102 transition count 220
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 4 with 2 rules applied. Total rules applied 236 place count 102 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 237 place count 101 transition count 218
Performed 44 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 6 with 88 rules applied. Total rules applied 325 place count 57 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 326 place count 57 transition count 172
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 336 place count 47 transition count 121
Iterating global reduction 7 with 10 rules applied. Total rules applied 346 place count 47 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 349 place count 47 transition count 118
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 353 place count 45 transition count 116
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 355 place count 43 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 356 place count 42 transition count 114
Applied a total of 356 rules in 39 ms. Remains 42 /215 variables (removed 173) and now considering 114/350 (removed 236) transitions.
// Phase 1: matrix 114 rows 42 cols
[2023-03-09 08:49:23] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-09 08:49:23] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-09 08:49:23] [INFO ] Invariant cache hit.
[2023-03-09 08:49:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:49:23] [INFO ] Implicit Places using invariants and state equation in 134 ms returned [37, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 468 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 40/215 places, 114/350 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 39 transition count 113
Applied a total of 2 rules in 2 ms. Remains 39 /40 variables (removed 1) and now considering 113/114 (removed 1) transitions.
// Phase 1: matrix 113 rows 39 cols
[2023-03-09 08:49:23] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 08:49:24] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-09 08:49:24] [INFO ] Invariant cache hit.
[2023-03-09 08:49:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:49:24] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 39/215 places, 113/350 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 913 ms. Remains : 39/215 places, 113/350 transitions.
Running random walk in product with property : AutonomousCar-PT-05b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 24919 reset in 140 ms.
Product exploration explored 100000 steps with 24935 reset in 129 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 196 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 48 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=48 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 279 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 113/113 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2023-03-09 08:49:25] [INFO ] Invariant cache hit.
[2023-03-09 08:49:25] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-09 08:49:25] [INFO ] Invariant cache hit.
[2023-03-09 08:49:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:49:26] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2023-03-09 08:49:26] [INFO ] Invariant cache hit.
[2023-03-09 08:49:26] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 519 ms. Remains : 39/39 places, 113/113 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 151 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 20 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 213 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 251 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 24909 reset in 166 ms.
Product exploration explored 100000 steps with 24918 reset in 179 ms.
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 113/113 transitions.
Applied a total of 0 rules in 0 ms. Remains 39 /39 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2023-03-09 08:49:28] [INFO ] Invariant cache hit.
[2023-03-09 08:49:28] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-09 08:49:28] [INFO ] Invariant cache hit.
[2023-03-09 08:49:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:49:28] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-09 08:49:28] [INFO ] Invariant cache hit.
[2023-03-09 08:49:28] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 414 ms. Remains : 39/39 places, 113/113 transitions.
Treatment of property AutonomousCar-PT-05b-LTLCardinality-14 finished in 5647 ms.
[2023-03-09 08:49:28] [INFO ] Flatten gal took : 28 ms
[2023-03-09 08:49:28] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-09 08:49:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 215 places, 350 transitions and 1647 arcs took 3 ms.
Total runtime 65834 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutonomousCar-PT-05b
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/377
LTLCardinality

FORMULA AutonomousCar-PT-05b-LTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-05b-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-05b-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678351824169

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/377/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/377/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/377/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 AutonomousCar-PT-05b-LTLCardinality-04
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for AutonomousCar-PT-05b-LTLCardinality-04
lola: result : false
lola: markings : 46348
lola: fired transitions : 139079
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 AutonomousCar-PT-05b-LTLCardinality-14
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for AutonomousCar-PT-05b-LTLCardinality-14
lola: result : true
lola: markings : 8
lola: fired transitions : 8
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 AutonomousCar-PT-05b-LTLCardinality-12
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for AutonomousCar-PT-05b-LTLCardinality-12
lola: result : true
lola: markings : 306
lola: fired transitions : 505
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 AutonomousCar-PT-05b-LTLCardinality-05
lola: time limit : 3599 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-05b-LTLCardinality-04: LTL false LTL model checker
AutonomousCar-PT-05b-LTLCardinality-12: LTL true LTL model checker
AutonomousCar-PT-05b-LTLCardinality-14: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-05b-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3599 5/32 AutonomousCar-PT-05b-LTLCardinality-05 598722 m, 119744 m/sec, 2754076 t fired, .

Time elapsed: 6 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-05b-LTLCardinality-04: LTL false LTL model checker
AutonomousCar-PT-05b-LTLCardinality-12: LTL true LTL model checker
AutonomousCar-PT-05b-LTLCardinality-14: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-05b-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3599 8/32 AutonomousCar-PT-05b-LTLCardinality-05 1115586 m, 103372 m/sec, 5833136 t fired, .

Time elapsed: 11 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-05b-LTLCardinality-04: LTL false LTL model checker
AutonomousCar-PT-05b-LTLCardinality-12: LTL true LTL model checker
AutonomousCar-PT-05b-LTLCardinality-14: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-05b-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3599 12/32 AutonomousCar-PT-05b-LTLCardinality-05 1576477 m, 92178 m/sec, 8859806 t fired, .

Time elapsed: 16 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-05b-LTLCardinality-04: LTL false LTL model checker
AutonomousCar-PT-05b-LTLCardinality-12: LTL true LTL model checker
AutonomousCar-PT-05b-LTLCardinality-14: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-05b-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3599 15/32 AutonomousCar-PT-05b-LTLCardinality-05 2037178 m, 92140 m/sec, 11893697 t fired, .

Time elapsed: 21 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-05b-LTLCardinality-04: LTL false LTL model checker
AutonomousCar-PT-05b-LTLCardinality-12: LTL true LTL model checker
AutonomousCar-PT-05b-LTLCardinality-14: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-05b-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3599 18/32 AutonomousCar-PT-05b-LTLCardinality-05 2475559 m, 87676 m/sec, 14787286 t fired, .

Time elapsed: 26 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-05b-LTLCardinality-04: LTL false LTL model checker
AutonomousCar-PT-05b-LTLCardinality-12: LTL true LTL model checker
AutonomousCar-PT-05b-LTLCardinality-14: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-05b-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3599 21/32 AutonomousCar-PT-05b-LTLCardinality-05 2939942 m, 92876 m/sec, 17817421 t fired, .

Time elapsed: 31 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-05b-LTLCardinality-04: LTL false LTL model checker
AutonomousCar-PT-05b-LTLCardinality-12: LTL true LTL model checker
AutonomousCar-PT-05b-LTLCardinality-14: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-05b-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/3599 24/32 AutonomousCar-PT-05b-LTLCardinality-05 3371441 m, 86299 m/sec, 20664725 t fired, .

Time elapsed: 36 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-05b-LTLCardinality-04: LTL false LTL model checker
AutonomousCar-PT-05b-LTLCardinality-12: LTL true LTL model checker
AutonomousCar-PT-05b-LTLCardinality-14: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-05b-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/3599 27/32 AutonomousCar-PT-05b-LTLCardinality-05 3806250 m, 86961 m/sec, 23533474 t fired, .

Time elapsed: 41 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-05b-LTLCardinality-04: LTL false LTL model checker
AutonomousCar-PT-05b-LTLCardinality-12: LTL true LTL model checker
AutonomousCar-PT-05b-LTLCardinality-14: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-05b-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/3599 30/32 AutonomousCar-PT-05b-LTLCardinality-05 4234018 m, 85553 m/sec, 26449454 t fired, .

Time elapsed: 46 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-05b-LTLCardinality-04: LTL false LTL model checker
AutonomousCar-PT-05b-LTLCardinality-12: LTL true LTL model checker
AutonomousCar-PT-05b-LTLCardinality-14: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-05b-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/3599 32/32 AutonomousCar-PT-05b-LTLCardinality-05 4599375 m, 73071 m/sec, 29232856 t fired, .

Time elapsed: 51 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 4 (type EXCL) for AutonomousCar-PT-05b-LTLCardinality-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-05b-LTLCardinality-04: LTL false LTL model checker
AutonomousCar-PT-05b-LTLCardinality-12: LTL true LTL model checker
AutonomousCar-PT-05b-LTLCardinality-14: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-05b-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 56 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-05b-LTLCardinality-04: LTL false LTL model checker
AutonomousCar-PT-05b-LTLCardinality-05: LTL unknown AGGR
AutonomousCar-PT-05b-LTLCardinality-12: LTL true LTL model checker
AutonomousCar-PT-05b-LTLCardinality-14: LTL true LTL model checker


Time elapsed: 56 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-05b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is AutonomousCar-PT-05b, 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 r007-oct2-167813595800603"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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