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.r005-oct2-167813593400603.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 itstools
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 r005-oct2-167813593400603
=====================================================================

--------------------
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 1678520899305

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-05b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-11 07:48:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 07:48:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:48:22] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2023-03-11 07:48:22] [INFO ] Transformed 255 places.
[2023-03-11 07:48:22] [INFO ] Transformed 490 transitions.
[2023-03-11 07:48:22] [INFO ] Found NUPN structural information;
[2023-03-11 07:48:22] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 453 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 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 66 ms. Remains 215 /255 variables (removed 40) and now considering 350/490 (removed 140) transitions.
// Phase 1: matrix 350 rows 215 cols
[2023-03-11 07:48:22] [INFO ] Computed 10 place invariants in 11 ms
[2023-03-11 07:48:23] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-03-11 07:48:23] [INFO ] Invariant cache hit.
[2023-03-11 07:48:23] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
[2023-03-11 07:48:23] [INFO ] Invariant cache hit.
[2023-03-11 07:48:24] [INFO ] Dead Transitions using invariants and state equation in 414 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 1269 ms. Remains : 215/255 places, 350/490 transitions.
Support contains 30 out of 215 places after structural reductions.
[2023-03-11 07:48:24] [INFO ] Flatten gal took : 169 ms
[2023-03-11 07:48:24] [INFO ] Flatten gal took : 32 ms
[2023-03-11 07:48:24] [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 2 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 18) seen :12
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-11 07:48:25] [INFO ] Invariant cache hit.
[2023-03-11 07:48:25] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:48:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-11 07:48:25] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:48:25] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 7 ms to minimize.
[2023-03-11 07:48:25] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 1 ms to minimize.
[2023-03-11 07:48:25] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 1 ms to minimize.
[2023-03-11 07:48:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 399 ms
[2023-03-11 07:48:25] [INFO ] After 529ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-11 07:48:25] [INFO ] After 637ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 350/350 transitions.
Graph (trivial) has 200 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.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 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 83 rules applied. Total rules applied 85 place count 213 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 199 place count 131 transition count 233
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 218 place count 112 transition count 233
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 218 place count 112 transition count 225
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 234 place count 104 transition count 225
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 236 place count 102 transition count 223
Iterating global reduction 3 with 2 rules applied. Total rules applied 238 place count 102 transition count 223
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 239 place count 101 transition count 218
Iterating global reduction 3 with 1 rules applied. Total rules applied 240 place count 101 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 3 with 2 rules applied. Total rules applied 242 place count 101 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 243 place count 100 transition count 216
Performed 43 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 329 place count 57 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 330 place count 57 transition count 171
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 339 place count 48 transition count 126
Iterating global reduction 6 with 9 rules applied. Total rules applied 348 place count 48 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 352 place count 48 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 354 place count 47 transition count 121
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 360 place count 47 transition count 115
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 366 place count 41 transition count 115
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 367 place count 41 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 368 place count 40 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 369 place count 39 transition count 114
Applied a total of 369 rules in 66 ms. Remains 39 /215 variables (removed 176) and now considering 114/350 (removed 236) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 39/215 places, 114/350 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Probably explored full state space saw : 72276 states, properties seen :0
Probabilistic random walk after 488168 steps, saw 72276 distinct states, run finished after 491 ms. (steps per millisecond=994 ) properties seen :0
Explored full state space saw : 72276 states, properties seen :0
Exhaustive walk after 488168 steps, saw 72276 distinct states, run finished after 402 ms. (steps per millisecond=1214 ) 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 23 ms. Remains 209 /215 variables (removed 6) and now considering 344/350 (removed 6) transitions.
// Phase 1: matrix 344 rows 209 cols
[2023-03-11 07:48:27] [INFO ] Computed 10 place invariants in 6 ms
[2023-03-11 07:48:27] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-11 07:48:27] [INFO ] Invariant cache hit.
[2023-03-11 07:48:27] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-11 07:48:27] [INFO ] Invariant cache hit.
[2023-03-11 07:48:27] [INFO ] Dead Transitions using invariants and state equation in 207 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 563 ms. Remains : 209/215 places, 344/350 transitions.
Stuttering acceptance computed with spot in 560 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 353 ms.
Product exploration explored 100000 steps with 50000 reset in 234 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 241 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 2093 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 2 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 69 ms. Remains 42 /215 variables (removed 173) and now considering 113/350 (removed 237) transitions.
// Phase 1: matrix 113 rows 42 cols
[2023-03-11 07:48:29] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 07:48:29] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-11 07:48:29] [INFO ] Invariant cache hit.
[2023-03-11 07:48:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 07:48:29] [INFO ] Implicit Places using invariants and state equation in 140 ms returned [37, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 216 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-11 07:48:29] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-11 07:48:29] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-11 07:48:29] [INFO ] Invariant cache hit.
[2023-03-11 07:48:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:48:29] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 316 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 608 ms. Remains : 39/215 places, 112/350 transitions.
Stuttering acceptance computed with spot in 115 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 52 reset in 145 ms.
Product exploration explored 100000 steps with 6 reset in 92 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 172 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 132 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 342 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 964 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 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 5 ms. Remains 39 /39 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2023-03-11 07:48:32] [INFO ] Invariant cache hit.
[2023-03-11 07:48:32] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-11 07:48:32] [INFO ] Invariant cache hit.
[2023-03-11 07:48:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:48:32] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2023-03-11 07:48:32] [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-11 07:48:32] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 07:48:32] [INFO ] Dead Transitions using invariants and state equation in 207 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 8 ms. Remains 37 /39 variables (removed 2) and now considering 109/111 (removed 2) transitions.
// Phase 1: matrix 109 rows 37 cols
[2023-03-11 07:48:32] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 07:48:32] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-11 07:48:32] [INFO ] Invariant cache hit.
[2023-03-11 07:48:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:48:32] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 153 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 632 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 116 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 100 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 284 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 161 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 102 reset in 90 ms.
Product exploration explored 100000 steps with 632 reset in 106 ms.
Built C files in :
/tmp/ltsmin16710909180718237389
[2023-03-11 07:48:34] [INFO ] Computing symmetric may disable matrix : 109 transitions.
[2023-03-11 07:48:34] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:48:34] [INFO ] Computing symmetric may enable matrix : 109 transitions.
[2023-03-11 07:48:34] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:48:34] [INFO ] Computing Do-Not-Accords matrix : 109 transitions.
[2023-03-11 07:48:34] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:48:34] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16710909180718237389
Running compilation step : cd /tmp/ltsmin16710909180718237389;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 521 ms.
Running link step : cd /tmp/ltsmin16710909180718237389;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin16710909180718237389;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17168801510150996809.hoa' '--buchi-type=spotba'
LTSmin run took 388 ms.
FORMULA AutonomousCar-PT-05b-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-05b-LTLCardinality-04 finished in 5768 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 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-11 07:48:35] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-11 07:48:35] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-11 07:48:35] [INFO ] Invariant cache hit.
[2023-03-11 07:48:35] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2023-03-11 07:48:35] [INFO ] Invariant cache hit.
[2023-03-11 07:48:35] [INFO ] Dead Transitions using invariants and state equation in 292 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 778 ms. Remains : 208/215 places, 343/350 transitions.
Stuttering acceptance computed with spot in 429 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 152 reset in 311 ms.
Product exploration explored 100000 steps with 359 reset in 268 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 792 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 403 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 35 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 07:48:38] [INFO ] Invariant cache hit.
[2023-03-11 07:48:38] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 07:48:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-11 07:48:38] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 07:48:39] [INFO ] Deduced a trap composed of 36 places in 188 ms of which 1 ms to minimize.
[2023-03-11 07:48:39] [INFO ] Deduced a trap composed of 14 places in 234 ms of which 1 ms to minimize.
[2023-03-11 07:48:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 463 ms
[2023-03-11 07:48:39] [INFO ] After 713ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-11 07:48:39] [INFO ] After 897ms 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 0 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.0 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 1 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 26 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 26 ms. Remains : 41/208 places, 111/343 transitions.
Incomplete random walk after 10000 steps, including 83 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Finished probabilistic random walk after 59434 steps, run visited all 2 properties in 213 ms. (steps per millisecond=279 )
Probabilistic random walk after 59434 steps, saw 10601 distinct states, run finished after 213 ms. (steps per millisecond=279 ) properties seen :2
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 1829 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 394 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 327 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 19 ms. Remains 208 /208 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-11 07:48:42] [INFO ] Invariant cache hit.
[2023-03-11 07:48:42] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-11 07:48:42] [INFO ] Invariant cache hit.
[2023-03-11 07:48:42] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2023-03-11 07:48:42] [INFO ] Invariant cache hit.
[2023-03-11 07:48:43] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 778 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 961 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 531 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 41 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
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-11 07:48:45] [INFO ] Invariant cache hit.
[2023-03-11 07:48:45] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 07:48:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-11 07:48:45] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 07:48:45] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 1 ms to minimize.
[2023-03-11 07:48:45] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 0 ms to minimize.
[2023-03-11 07:48:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 363 ms
[2023-03-11 07:48:45] [INFO ] After 563ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-11 07:48:45] [INFO ] After 701ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 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 0 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.0 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 55 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 55 ms. Remains : 41/208 places, 111/343 transitions.
Incomplete random walk after 10000 steps, including 85 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Finished probabilistic random walk after 59434 steps, run visited all 2 properties in 145 ms. (steps per millisecond=409 )
Probabilistic random walk after 59434 steps, saw 10601 distinct states, run finished after 146 ms. (steps per millisecond=407 ) properties seen :2
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 1161 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 413 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 483 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 303 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 259 reset in 172 ms.
Product exploration explored 100000 steps with 29 reset in 175 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 270 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 4 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 1 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 34 ms. Remains 90 /208 variables (removed 118) and now considering 165/343 (removed 178) transitions.
[2023-03-11 07:48:49] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 165 rows 90 cols
[2023-03-11 07:48:49] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:48:49] [INFO ] Dead Transitions using invariants and state equation in 89 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 134 ms. Remains : 90/208 places, 165/343 transitions.
Built C files in :
/tmp/ltsmin13091902529085019739
[2023-03-11 07:48:49] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13091902529085019739
Running compilation step : cd /tmp/ltsmin13091902529085019739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 616 ms.
Running link step : cd /tmp/ltsmin13091902529085019739;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin13091902529085019739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased483554497542616002.hoa' '--buchi-type=spotba'
LTSmin run took 357 ms.
FORMULA AutonomousCar-PT-05b-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-05b-LTLCardinality-05 finished in 15456 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 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.
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 49 ms. Remains 44 /215 variables (removed 171) and now considering 125/350 (removed 225) transitions.
// Phase 1: matrix 125 rows 44 cols
[2023-03-11 07:48:50] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 07:48:50] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-11 07:48:50] [INFO ] Invariant cache hit.
[2023-03-11 07:48:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 07:48:51] [INFO ] Implicit Places using invariants and state equation in 457 ms returned [39, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 527 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 15 ms. Remains 41 /42 variables (removed 1) and now considering 124/125 (removed 1) transitions.
// Phase 1: matrix 124 rows 41 cols
[2023-03-11 07:48:51] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 07:48:51] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-11 07:48:51] [INFO ] Invariant cache hit.
[2023-03-11 07:48:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:48:51] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 255 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 846 ms. Remains : 41/215 places, 124/350 transitions.
Stuttering acceptance computed with spot in 140 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 21 steps with 1 reset in 1 ms.
FORMULA AutonomousCar-PT-05b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLCardinality-06 finished in 1008 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 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 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 60 ms. Remains 49 /215 variables (removed 166) and now considering 131/350 (removed 219) transitions.
// Phase 1: matrix 131 rows 49 cols
[2023-03-11 07:48:51] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 07:48:52] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-11 07:48:52] [INFO ] Invariant cache hit.
[2023-03-11 07:48:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 07:48:52] [INFO ] Implicit Places using invariants and state equation in 150 ms returned [42, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 461 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 4 ms. Remains 46 /47 variables (removed 1) and now considering 130/131 (removed 1) transitions.
// Phase 1: matrix 130 rows 46 cols
[2023-03-11 07:48:52] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 07:48:52] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-11 07:48:52] [INFO ] Invariant cache hit.
[2023-03-11 07:48:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:48:52] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 320 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 845 ms. Remains : 46/215 places, 130/350 transitions.
Stuttering acceptance computed with spot in 66 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 12 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 949 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 19 ms. Remains 208 /215 variables (removed 7) and now considering 343/350 (removed 7) transitions.
// Phase 1: matrix 343 rows 208 cols
[2023-03-11 07:48:52] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-11 07:48:52] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-11 07:48:52] [INFO ] Invariant cache hit.
[2023-03-11 07:48:53] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
[2023-03-11 07:48:53] [INFO ] Invariant cache hit.
[2023-03-11 07:48:53] [INFO ] Dead Transitions using invariants and state equation in 210 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 752 ms. Remains : 208/215 places, 343/350 transitions.
Stuttering acceptance computed with spot in 260 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 172 ms.
Product exploration explored 100000 steps with 33333 reset in 168 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 207 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 1592 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 18 ms. Remains 207 /215 variables (removed 8) and now considering 342/350 (removed 8) transitions.
// Phase 1: matrix 342 rows 207 cols
[2023-03-11 07:48:54] [INFO ] Computed 10 place invariants in 16 ms
[2023-03-11 07:48:54] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-11 07:48:54] [INFO ] Invariant cache hit.
[2023-03-11 07:48:54] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2023-03-11 07:48:54] [INFO ] Invariant cache hit.
[2023-03-11 07:48:54] [INFO ] Dead Transitions using invariants and state equation in 177 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 696 ms. Remains : 207/215 places, 342/350 transitions.
Stuttering acceptance computed with spot in 95 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 14704 reset in 130 ms.
Product exploration explored 100000 steps with 14763 reset in 167 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 295 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 47 ms :[(NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
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 367 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 99 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0)]
[2023-03-11 07:48:56] [INFO ] Invariant cache hit.
[2023-03-11 07:48:56] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-11 07:48:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:48:56] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2023-03-11 07:48:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:48:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-11 07:48:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:48:56] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2023-03-11 07:48:57] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 1 ms to minimize.
[2023-03-11 07:48:57] [INFO ] Deduced a trap composed of 34 places in 287 ms of which 1 ms to minimize.
[2023-03-11 07:48:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 511 ms
[2023-03-11 07:48:57] [INFO ] Computed and/alt/rep : 184/313/184 causal constraints (skipped 157 transitions) in 81 ms.
[2023-03-11 07:48:57] [INFO ] Added : 53 causal constraints over 11 iterations in 393 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 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 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 1 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 18 ms. Remains 42 /207 variables (removed 165) and now considering 113/342 (removed 229) transitions.
// Phase 1: matrix 113 rows 42 cols
[2023-03-11 07:48:57] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-11 07:48:57] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-11 07:48:57] [INFO ] Invariant cache hit.
[2023-03-11 07:48:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 07:48:58] [INFO ] Implicit Places using invariants and state equation in 133 ms returned [37, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 195 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 3 ms. Remains 39 /40 variables (removed 1) and now considering 112/113 (removed 1) transitions.
// Phase 1: matrix 112 rows 39 cols
[2023-03-11 07:48:58] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 07:48:58] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-11 07:48:58] [INFO ] Invariant cache hit.
[2023-03-11 07:48:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:48:58] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/207 places, 112/342 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 440 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 184 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 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 335 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 64 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
[2023-03-11 07:48:58] [INFO ] Invariant cache hit.
[2023-03-11 07:48:59] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 07:48:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:48:59] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-11 07:48:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:48:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 07:48:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:48:59] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-11 07:48:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:48:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 07:48:59] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 0 ms to minimize.
[2023-03-11 07:48:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-03-11 07:48:59] [INFO ] Computed and/alt/rep : 6/7/6 causal constraints (skipped 104 transitions) in 21 ms.
[2023-03-11 07:48:59] [INFO ] Added : 0 causal constraints over 0 iterations in 66 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 39971 reset in 103 ms.
Product exploration explored 100000 steps with 39998 reset in 138 ms.
Built C files in :
/tmp/ltsmin3382689073967554349
[2023-03-11 07:48:59] [INFO ] Computing symmetric may disable matrix : 112 transitions.
[2023-03-11 07:48:59] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:48:59] [INFO ] Computing symmetric may enable matrix : 112 transitions.
[2023-03-11 07:48:59] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:48:59] [INFO ] Computing Do-Not-Accords matrix : 112 transitions.
[2023-03-11 07:48:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:48:59] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3382689073967554349
Running compilation step : cd /tmp/ltsmin3382689073967554349;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 308 ms.
Running link step : cd /tmp/ltsmin3382689073967554349;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3382689073967554349;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11522377657328898511.hoa' '--buchi-type=spotba'
LTSmin run took 138 ms.
FORMULA AutonomousCar-PT-05b-LTLCardinality-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-05b-LTLCardinality-12 finished in 6153 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 11 ms. Remains 207 /215 variables (removed 8) and now considering 342/350 (removed 8) transitions.
// Phase 1: matrix 342 rows 207 cols
[2023-03-11 07:49:00] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-11 07:49:00] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-11 07:49:00] [INFO ] Invariant cache hit.
[2023-03-11 07:49:00] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2023-03-11 07:49:00] [INFO ] Invariant cache hit.
[2023-03-11 07:49:00] [INFO ] Dead Transitions using invariants and state equation in 187 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 597 ms. Remains : 207/215 places, 342/350 transitions.
Stuttering acceptance computed with spot in 247 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 165 ms.
Product exploration explored 100000 steps with 25000 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 157 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 278 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 67 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=67 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 218 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 2133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 266 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-11 07:49:04] [INFO ] Invariant cache hit.
[2023-03-11 07:49:04] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-11 07:49:04] [INFO ] Invariant cache hit.
[2023-03-11 07:49:04] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2023-03-11 07:49:05] [INFO ] Invariant cache hit.
[2023-03-11 07:49:05] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 660 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 306 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 125 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=62 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 172 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 292 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 286 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 132 ms.
Product exploration explored 100000 steps with 25000 reset in 144 ms.
Built C files in :
/tmp/ltsmin6405901643518768404
[2023-03-11 07:49:07] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6405901643518768404
Running compilation step : cd /tmp/ltsmin6405901643518768404;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1133 ms.
Running link step : cd /tmp/ltsmin6405901643518768404;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6405901643518768404;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14742456556305158658.hoa' '--buchi-type=spotba'
LTSmin run took 753 ms.
FORMULA AutonomousCar-PT-05b-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-05b-LTLCardinality-14 finished in 8731 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 5 ms. Remains 207 /215 variables (removed 8) and now considering 342/350 (removed 8) transitions.
[2023-03-11 07:49:09] [INFO ] Invariant cache hit.
[2023-03-11 07:49:09] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-11 07:49:09] [INFO ] Invariant cache hit.
[2023-03-11 07:49:09] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2023-03-11 07:49:09] [INFO ] Invariant cache hit.
[2023-03-11 07:49:09] [INFO ] Dead Transitions using invariants and state equation in 248 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 611 ms. Remains : 207/215 places, 342/350 transitions.
Stuttering acceptance computed with spot in 275 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 213 steps with 2 reset in 1 ms.
FORMULA AutonomousCar-PT-05b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLCardinality-15 finished in 903 ms.
All properties solved by simple procedures.
Total runtime 47903 ms.

BK_STOP 1678520952114

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
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 r005-oct2-167813593400603"
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 ;