Execution Chart

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

Trace from the execution

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

--------------------
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-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678637679057

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-05b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:14:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:14:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:14:41] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2023-03-12 16:14:41] [INFO ] Transformed 255 places.
[2023-03-12 16:14:41] [INFO ] Transformed 490 transitions.
[2023-03-12 16:14:41] [INFO ] Found NUPN structural information;
[2023-03-12 16:14:41] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-05b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 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 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 177 place count 213 transition count 348
Iterating global reduction 1 with 7 rules applied. Total rules applied 184 place count 213 transition count 348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 185 place count 212 transition count 347
Iterating global reduction 1 with 1 rules applied. Total rules applied 186 place count 212 transition count 347
Applied a total of 186 rules in 79 ms. Remains 212 /255 variables (removed 43) and now considering 347/490 (removed 143) transitions.
// Phase 1: matrix 347 rows 212 cols
[2023-03-12 16:14:41] [INFO ] Computed 10 place invariants in 10 ms
[2023-03-12 16:14:42] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-12 16:14:42] [INFO ] Invariant cache hit.
[2023-03-12 16:14:42] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2023-03-12 16:14:42] [INFO ] Invariant cache hit.
[2023-03-12 16:14:42] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 212/255 places, 347/490 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 966 ms. Remains : 212/255 places, 347/490 transitions.
Support contains 44 out of 212 places after structural reductions.
[2023-03-12 16:14:42] [INFO ] Flatten gal took : 59 ms
[2023-03-12 16:14:42] [INFO ] Flatten gal took : 24 ms
[2023-03-12 16:14:43] [INFO ] Input system was already deterministic with 347 transitions.
Support contains 43 out of 212 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 30) seen :20
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 16:14:44] [INFO ] Invariant cache hit.
[2023-03-12 16:14:44] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 16:14:44] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 16:14:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 59 ms returned sat
[2023-03-12 16:14:44] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-12 16:14:44] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 6 ms to minimize.
[2023-03-12 16:14:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-12 16:14:44] [INFO ] After 373ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-12 16:14:44] [INFO ] After 625ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 7 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 347/347 transitions.
Graph (trivial) has 195 edges and 212 vertex of which 4 / 212 are part of one of the 2 SCC in 7 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 687 edges and 210 vertex of which 207 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.10 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 80 rules applied. Total rules applied 82 place count 207 transition count 262
Reduce places removed 78 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 111 rules applied. Total rules applied 193 place count 129 transition count 229
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 212 place count 110 transition count 229
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 212 place count 110 transition count 223
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 224 place count 104 transition count 223
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 3 with 92 rules applied. Total rules applied 316 place count 58 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 317 place count 58 transition count 176
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 326 place count 49 transition count 131
Iterating global reduction 4 with 9 rules applied. Total rules applied 335 place count 49 transition count 131
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 339 place count 49 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 341 place count 48 transition count 126
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 348 place count 48 transition count 119
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 355 place count 41 transition count 119
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 356 place count 41 transition count 119
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 357 place count 40 transition count 118
Applied a total of 357 rules in 105 ms. Remains 40 /212 variables (removed 172) and now considering 118/347 (removed 229) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 40/212 places, 118/347 transitions.
Finished random walk after 706 steps, including 12 resets, run visited all 3 properties in 10 ms. (steps per millisecond=70 )
FORMULA AutonomousCar-PT-05b-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA AutonomousCar-PT-05b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 36 stabilizing places and 37 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' '!(G(F(p0)))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Graph (trivial) has 199 edges and 212 vertex of which 4 / 212 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 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 209 transition count 263
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 111 rules applied. Total rules applied 193 place count 128 transition count 233
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 210 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 210 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 222 place count 105 transition count 227
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 223 place count 104 transition count 226
Iterating global reduction 3 with 1 rules applied. Total rules applied 224 place count 104 transition count 226
Performed 46 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 316 place count 58 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 317 place count 58 transition count 178
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 327 place count 48 transition count 127
Iterating global reduction 4 with 10 rules applied. Total rules applied 337 place count 48 transition count 127
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 341 place count 48 transition count 123
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 345 place count 46 transition count 121
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 347 place count 44 transition count 119
Applied a total of 347 rules in 60 ms. Remains 44 /212 variables (removed 168) and now considering 119/347 (removed 228) transitions.
// Phase 1: matrix 119 rows 44 cols
[2023-03-12 16:14:45] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 16:14:45] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-12 16:14:45] [INFO ] Invariant cache hit.
[2023-03-12 16:14:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:14:46] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [39, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 229 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/212 places, 119/347 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 118
Applied a total of 2 rules in 5 ms. Remains 41 /42 variables (removed 1) and now considering 118/119 (removed 1) transitions.
// Phase 1: matrix 118 rows 41 cols
[2023-03-12 16:14:46] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:14:46] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-12 16:14:46] [INFO ] Invariant cache hit.
[2023-03-12 16:14:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:14:46] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/212 places, 118/347 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 408 ms. Remains : 41/212 places, 118/347 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-00 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 (NEQ s1 1) (NEQ s7 1) (NEQ s13 1) (NEQ s37 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 20 reset in 215 ms.
Product exploration explored 100000 steps with 74 reset in 76 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 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 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 656 steps, including 40 resets, run visited all 1 properties in 5 ms. (steps per millisecond=131 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 199 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 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 118/118 transitions.
Applied a total of 0 rules in 6 ms. Remains 41 /41 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2023-03-12 16:14:47] [INFO ] Invariant cache hit.
[2023-03-12 16:14:47] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-12 16:14:47] [INFO ] Invariant cache hit.
[2023-03-12 16:14:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:14:47] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-12 16:14:47] [INFO ] Redundant transitions in 14 ms returned [60]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 117 rows 41 cols
[2023-03-12 16:14:47] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:14:47] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/41 places, 117/118 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 39 transition count 115
Applied a total of 2 rules in 4 ms. Remains 39 /41 variables (removed 2) and now considering 115/117 (removed 2) transitions.
// Phase 1: matrix 115 rows 39 cols
[2023-03-12 16:14:47] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:14:47] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-12 16:14:47] [INFO ] Invariant cache hit.
[2023-03-12 16:14:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:14:47] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/41 places, 115/118 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 456 ms. Remains : 39/41 places, 115/118 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 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 103 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1872 steps, including 109 resets, run visited all 1 properties in 21 ms. (steps per millisecond=89 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 178 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 150 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 46 reset in 68 ms.
Product exploration explored 100000 steps with 36 reset in 167 ms.
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 115/115 transitions.
Applied a total of 0 rules in 3 ms. Remains 39 /39 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2023-03-12 16:14:48] [INFO ] Invariant cache hit.
[2023-03-12 16:14:49] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-12 16:14:49] [INFO ] Invariant cache hit.
[2023-03-12 16:14:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:14:49] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2023-03-12 16:14:49] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-12 16:14:49] [INFO ] Invariant cache hit.
[2023-03-12 16:14:49] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 540 ms. Remains : 39/39 places, 115/115 transitions.
Treatment of property AutonomousCar-PT-05b-LTLFireability-00 finished in 3886 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 (p1||G(p0))))))'
Support contains 7 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 207 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 207 transition count 342
Applied a total of 10 rules in 6 ms. Remains 207 /212 variables (removed 5) and now considering 342/347 (removed 5) transitions.
// Phase 1: matrix 342 rows 207 cols
[2023-03-12 16:14:49] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-12 16:14:49] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-12 16:14:49] [INFO ] Invariant cache hit.
[2023-03-12 16:14:50] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
[2023-03-12 16:14:50] [INFO ] Invariant cache hit.
[2023-03-12 16:14:50] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/212 places, 342/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 761 ms. Remains : 207/212 places, 342/347 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s87 1) (NOT (AND (EQ s47 1) (EQ s77 1) (EQ s102 1) (EQ s127 1) (EQ s152 1) (EQ s174 1)))), p0:(NEQ s87 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 221 ms.
Product exploration explored 100000 steps with 50000 reset in 214 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 (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 5 factoid took 255 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-05b-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-05b-LTLFireability-01 finished in 1626 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((G(p0)&&X(F(p1)))))'
Support contains 5 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 208 transition count 343
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 208 transition count 343
Applied a total of 8 rules in 31 ms. Remains 208 /212 variables (removed 4) and now considering 343/347 (removed 4) transitions.
// Phase 1: matrix 343 rows 208 cols
[2023-03-12 16:14:51] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-12 16:14:51] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-12 16:14:51] [INFO ] Invariant cache hit.
[2023-03-12 16:14:51] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2023-03-12 16:14:51] [INFO ] Invariant cache hit.
[2023-03-12 16:14:51] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 208/212 places, 343/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 691 ms. Remains : 208/212 places, 343/347 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s60 0), p1:(AND (EQ s4 1) (EQ s11 1) (EQ s97 1) (EQ s174 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-03 finished in 957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p0)||(p0&&G((!p1&&X((!p1 U (!p2||G(!p1)))))))))))'
Support contains 6 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 207 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 207 transition count 342
Applied a total of 10 rules in 4 ms. Remains 207 /212 variables (removed 5) and now considering 342/347 (removed 5) transitions.
// Phase 1: matrix 342 rows 207 cols
[2023-03-12 16:14:52] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-12 16:14:52] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-12 16:14:52] [INFO ] Invariant cache hit.
[2023-03-12 16:14:52] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2023-03-12 16:14:52] [INFO ] Invariant cache hit.
[2023-03-12 16:14:52] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/212 places, 342/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 583 ms. Remains : 207/212 places, 342/347 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) p1), p1]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(NEQ s167 1), p1:(OR (EQ s62 1) (AND (EQ s4 1) (EQ s12 1) (EQ s71 1) (EQ s173 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 112 ms.
Entered a terminal (fully accepting) state of product in 2041 steps with 21 reset in 5 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-04 finished in 930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(((X(p1)&&F((!p0 U (p2||G(!p0)))))||G(p1)))))))'
Support contains 6 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 207 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 207 transition count 342
Applied a total of 10 rules in 3 ms. Remains 207 /212 variables (removed 5) and now considering 342/347 (removed 5) transitions.
[2023-03-12 16:14:53] [INFO ] Invariant cache hit.
[2023-03-12 16:14:53] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-12 16:14:53] [INFO ] Invariant cache hit.
[2023-03-12 16:14:53] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2023-03-12 16:14:53] [INFO ] Invariant cache hit.
[2023-03-12 16:14:53] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/212 places, 342/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 539 ms. Remains : 207/212 places, 342/347 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (AND p0 (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s90 1), p2:(AND (NEQ s90 1) (NOT (AND (EQ s4 1) (EQ s11 1) (EQ s121 1) (EQ s173 1)))), p1:(NEQ s20 1)], nbAcceptance=2, 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-05 finished in 858 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((X(p1)||p0)))'
Support contains 6 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 207 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 207 transition count 342
Applied a total of 10 rules in 5 ms. Remains 207 /212 variables (removed 5) and now considering 342/347 (removed 5) transitions.
[2023-03-12 16:14:53] [INFO ] Invariant cache hit.
[2023-03-12 16:14:54] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-12 16:14:54] [INFO ] Invariant cache hit.
[2023-03-12 16:14:54] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-03-12 16:14:54] [INFO ] Invariant cache hit.
[2023-03-12 16:14:54] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/212 places, 342/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 506 ms. Remains : 207/212 places, 342/347 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s4 0) (EQ s11 0) (EQ s148 0) (EQ s173 0)), p1:(AND (EQ s4 1) (EQ s14 1) (EQ s33 1) (EQ s173 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8 reset in 159 ms.
Product exploration explored 100000 steps with 0 reset in 121 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 p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 534 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 16:14:55] [INFO ] Invariant cache hit.
[2023-03-12 16:14:55] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:14:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 16:14:55] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 16:14:55] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 2 ms to minimize.
[2023-03-12 16:14:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2023-03-12 16:14:56] [INFO ] After 312ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-12 16:14:56] [INFO ] After 466ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 342/342 transitions.
Graph (trivial) has 193 edges and 207 vertex of which 4 / 207 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 682 edges and 205 vertex of which 203 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 203 transition count 261
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 109 rules applied. Total rules applied 188 place count 128 transition count 227
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 208 place count 108 transition count 227
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 108 transition count 221
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 102 transition count 221
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 314 place count 55 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 315 place count 55 transition count 173
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 325 place count 45 transition count 123
Iterating global reduction 4 with 10 rules applied. Total rules applied 335 place count 45 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 340 place count 45 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 342 place count 44 transition count 117
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 348 place count 44 transition count 111
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 354 place count 38 transition count 111
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 355 place count 38 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 356 place count 37 transition count 110
Applied a total of 356 rules in 24 ms. Remains 37 /207 variables (removed 170) and now considering 110/342 (removed 232) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 37/207 places, 110/342 transitions.
Finished random walk after 360 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=360 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT p1))), (X (X p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p1 p0)), (F p1)]
Knowledge based reduction with 11 factoid took 671 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 6 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-12 16:14:56] [INFO ] Invariant cache hit.
[2023-03-12 16:14:57] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-12 16:14:57] [INFO ] Invariant cache hit.
[2023-03-12 16:14:57] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2023-03-12 16:14:57] [INFO ] Invariant cache hit.
[2023-03-12 16:14:57] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 501 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 : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 245 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-12 16:14:57] [INFO ] Invariant cache hit.
[2023-03-12 16:14:58] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:14:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 16:14:58] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:14:58] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-12 16:14:58] [INFO ] After 227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 342/342 transitions.
Graph (trivial) has 193 edges and 207 vertex of which 4 / 207 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 682 edges and 205 vertex of which 203 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 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 203 transition count 261
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 109 rules applied. Total rules applied 188 place count 128 transition count 227
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 208 place count 108 transition count 227
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 108 transition count 221
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 102 transition count 221
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 314 place count 55 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 315 place count 55 transition count 173
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 325 place count 45 transition count 123
Iterating global reduction 4 with 10 rules applied. Total rules applied 335 place count 45 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 340 place count 45 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 342 place count 44 transition count 117
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 348 place count 44 transition count 111
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 354 place count 38 transition count 111
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 355 place count 38 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 356 place count 37 transition count 110
Applied a total of 356 rules in 48 ms. Remains 37 /207 variables (removed 170) and now considering 110/342 (removed 232) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 37/207 places, 110/342 transitions.
Finished random walk after 569 steps, including 10 resets, run visited all 1 properties in 2 ms. (steps per millisecond=284 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 6 factoid took 324 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 170 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 140 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 3 reset in 95 ms.
Product exploration explored 100000 steps with 43 reset in 148 ms.
Support contains 6 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-12 16:14:59] [INFO ] Invariant cache hit.
[2023-03-12 16:14:59] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-12 16:14:59] [INFO ] Invariant cache hit.
[2023-03-12 16:15:00] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2023-03-12 16:15:00] [INFO ] Invariant cache hit.
[2023-03-12 16:15:00] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 813 ms. Remains : 207/207 places, 342/342 transitions.
Treatment of property AutonomousCar-PT-05b-LTLFireability-07 finished in 6576 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((p1||G(p2))))||p0)))'
Support contains 6 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 208 transition count 343
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 208 transition count 343
Applied a total of 8 rules in 5 ms. Remains 208 /212 variables (removed 4) and now considering 343/347 (removed 4) transitions.
// Phase 1: matrix 343 rows 208 cols
[2023-03-12 16:15:00] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-12 16:15:00] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-12 16:15:00] [INFO ] Invariant cache hit.
[2023-03-12 16:15:01] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2023-03-12 16:15:01] [INFO ] Invariant cache hit.
[2023-03-12 16:15:01] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 208/212 places, 343/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 699 ms. Remains : 208/212 places, 343/347 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s13 0) (EQ s148 0) (EQ s173 0)), p1:(EQ s66 0), p2:(EQ s181 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 167 ms.
Product exploration explored 100000 steps with 50000 reset in 138 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 p0 p1 (NOT p2)), (X p0), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-05b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-05b-LTLFireability-09 finished in 1313 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((F((X(p0) U p1))&&p2))&&X(G(p3))))'
Support contains 7 out of 212 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 209 transition count 344
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 209 transition count 344
Applied a total of 6 rules in 3 ms. Remains 209 /212 variables (removed 3) and now considering 344/347 (removed 3) transitions.
// Phase 1: matrix 344 rows 209 cols
[2023-03-12 16:15:01] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-12 16:15:01] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-12 16:15:01] [INFO ] Invariant cache hit.
[2023-03-12 16:15:02] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-12 16:15:02] [INFO ] Invariant cache hit.
[2023-03-12 16:15:02] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 209/212 places, 344/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 554 ms. Remains : 209/212 places, 344/347 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p3), true, (OR (NOT p2) (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 p3), acceptance={0} source=3 dest: 0}, { cond=(NOT p3), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 p1 p3), acceptance={0} source=4 dest: 0}, { cond=(NOT p3), acceptance={0} source=4 dest: 1}, { cond=(AND p2 (NOT p1) p3), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p3:(EQ s66 0), p2:(OR (EQ s79 1) (EQ s91 1)), p1:(AND (EQ s4 1) (EQ s11 1) (EQ s147 1) (EQ s175 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 84 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-10 finished in 764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 2 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 207 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 207 transition count 342
Applied a total of 10 rules in 7 ms. Remains 207 /212 variables (removed 5) and now considering 342/347 (removed 5) transitions.
// Phase 1: matrix 342 rows 207 cols
[2023-03-12 16:15:02] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-12 16:15:02] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-12 16:15:02] [INFO ] Invariant cache hit.
[2023-03-12 16:15:03] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
[2023-03-12 16:15:03] [INFO ] Invariant cache hit.
[2023-03-12 16:15:03] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/212 places, 342/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 949 ms. Remains : 207/212 places, 342/347 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s123 1), p0:(EQ s172 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-11 finished in 1139 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Graph (trivial) has 198 edges and 212 vertex of which 4 / 212 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 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 209 transition count 265
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 107 rules applied. Total rules applied 187 place count 130 transition count 237
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 204 place count 114 transition count 236
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 207 place count 113 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 208 place count 112 transition count 234
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 208 place count 112 transition count 227
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 222 place count 105 transition count 227
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 223 place count 104 transition count 226
Iterating global reduction 5 with 1 rules applied. Total rules applied 224 place count 104 transition count 226
Performed 46 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 316 place count 58 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 317 place count 58 transition count 178
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 328 place count 47 transition count 122
Iterating global reduction 6 with 11 rules applied. Total rules applied 339 place count 47 transition count 122
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 344 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 7 with 4 rules applied. Total rules applied 348 place count 45 transition count 115
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 350 place count 43 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 351 place count 42 transition count 113
Applied a total of 351 rules in 19 ms. Remains 42 /212 variables (removed 170) and now considering 113/347 (removed 234) transitions.
// Phase 1: matrix 113 rows 42 cols
[2023-03-12 16:15:03] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 16:15:03] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-12 16:15:03] [INFO ] Invariant cache hit.
[2023-03-12 16:15:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:15:03] [INFO ] Implicit Places using invariants and state equation in 203 ms returned [37, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 260 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/212 places, 113/347 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 40 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 39 transition count 112
Applied a total of 2 rules in 4 ms. Remains 39 /40 variables (removed 1) and now considering 112/113 (removed 1) transitions.
// Phase 1: matrix 112 rows 39 cols
[2023-03-12 16:15:03] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 16:15:04] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-12 16:15:04] [INFO ] Invariant cache hit.
[2023-03-12 16:15:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:15:04] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/212 places, 112/347 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 571 ms. Remains : 39/212 places, 112/347 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s32 1)], nbAcceptance=1, 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 46 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-13 finished in 621 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||X(p1)))))'
Support contains 2 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 207 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 207 transition count 342
Applied a total of 10 rules in 7 ms. Remains 207 /212 variables (removed 5) and now considering 342/347 (removed 5) transitions.
// Phase 1: matrix 342 rows 207 cols
[2023-03-12 16:15:04] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-12 16:15:04] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-12 16:15:04] [INFO ] Invariant cache hit.
[2023-03-12 16:15:04] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-12 16:15:04] [INFO ] Invariant cache hit.
[2023-03-12 16:15:04] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/212 places, 342/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 616 ms. Remains : 207/212 places, 342/347 transitions.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s112 1), p1:(NEQ s189 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 165 ms.
Product exploration explored 100000 steps with 33333 reset in 116 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/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-05b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-05b-LTLFireability-14 finished in 1206 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(G((p0&&F((G(!p1)||(!p1&&F(!p2))))))))'
Support contains 7 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 208 transition count 343
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 208 transition count 343
Applied a total of 8 rules in 5 ms. Remains 208 /212 variables (removed 4) and now considering 343/347 (removed 4) transitions.
// Phase 1: matrix 343 rows 208 cols
[2023-03-12 16:15:05] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-12 16:15:05] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-12 16:15:05] [INFO ] Invariant cache hit.
[2023-03-12 16:15:05] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2023-03-12 16:15:05] [INFO ] Invariant cache hit.
[2023-03-12 16:15:06] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 208/212 places, 343/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 546 ms. Remains : 208/212 places, 343/347 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, (AND p1 p2)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s66 0), p1:(AND (EQ s4 1) (EQ s6 1) (EQ s46 1) (EQ s174 1)), p2:(AND (EQ s4 1) (EQ s12 1) (EQ s72 1) (EQ s174 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 406 steps with 4 reset in 2 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-15 finished in 754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Found a Lengthening insensitive property : AutonomousCar-PT-05b-LTLFireability-07
Stuttering acceptance computed with spot in 117 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 6 out of 212 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Graph (trivial) has 197 edges and 212 vertex of which 4 / 212 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 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 209 transition count 265
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 110 rules applied. Total rules applied 190 place count 130 transition count 234
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 208 place count 112 transition count 234
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 112 transition count 228
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 220 place count 106 transition count 228
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 221 place count 105 transition count 227
Iterating global reduction 3 with 1 rules applied. Total rules applied 222 place count 105 transition count 227
Performed 46 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 314 place count 59 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 315 place count 59 transition count 179
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 324 place count 50 transition count 134
Iterating global reduction 4 with 9 rules applied. Total rules applied 333 place count 50 transition count 134
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 337 place count 50 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 341 place count 48 transition count 128
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 343 place count 46 transition count 126
Applied a total of 343 rules in 59 ms. Remains 46 /212 variables (removed 166) and now considering 126/347 (removed 221) transitions.
// Phase 1: matrix 126 rows 46 cols
[2023-03-12 16:15:06] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-12 16:15:06] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-12 16:15:06] [INFO ] Invariant cache hit.
[2023-03-12 16:15:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:15:06] [INFO ] Implicit Places using invariants and state equation in 258 ms returned [41, 45]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 326 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 44/212 places, 126/347 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 43 transition count 125
Applied a total of 2 rules in 3 ms. Remains 43 /44 variables (removed 1) and now considering 125/126 (removed 1) transitions.
// Phase 1: matrix 125 rows 43 cols
[2023-03-12 16:15:06] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-12 16:15:07] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-12 16:15:07] [INFO ] Invariant cache hit.
[2023-03-12 16:15:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:15:07] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 43/212 places, 125/347 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 710 ms. Remains : 43/212 places, 125/347 transitions.
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s1 0) (EQ s4 0) (EQ s33 0) (EQ s39 0)), p1:(AND (EQ s1 1) (EQ s7 1) (EQ s8 1) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 36 reset in 54 ms.
Product exploration explored 100000 steps with 4 reset in 52 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 525 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 552 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 16:15:08] [INFO ] Invariant cache hit.
[2023-03-12 16:15:08] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:15:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2023-03-12 16:15:08] [INFO ] After 144ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT p1))), (X (X p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p1 p0)), (F p1)]
Knowledge based reduction with 11 factoid took 578 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 125/125 transitions.
Applied a total of 0 rules in 0 ms. Remains 43 /43 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-12 16:15:09] [INFO ] Invariant cache hit.
[2023-03-12 16:15:09] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-12 16:15:09] [INFO ] Invariant cache hit.
[2023-03-12 16:15:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:15:09] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2023-03-12 16:15:09] [INFO ] Invariant cache hit.
[2023-03-12 16:15:09] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 340 ms. Remains : 43/43 places, 125/125 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 253 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 561 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 16:15:09] [INFO ] Invariant cache hit.
[2023-03-12 16:15:10] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:15:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-12 16:15:10] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:15:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:15:10] [INFO ] After 26ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:15:10] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-12 16:15:10] [INFO ] After 185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 125/125 transitions.
Graph (complete) has 344 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 0 with 3 rules applied. Total rules applied 4 place count 42 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 41 transition count 121
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 40 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 40 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 40 transition count 115
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 40 transition count 109
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 20 place count 34 transition count 109
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 34 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 22 place count 33 transition count 110
Applied a total of 22 rules in 20 ms. Remains 33 /43 variables (removed 10) and now considering 110/125 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 33/43 places, 110/125 transitions.
Finished random walk after 456 steps, including 9 resets, run visited all 1 properties in 4 ms. (steps per millisecond=114 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 6 factoid took 482 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 22 reset in 76 ms.
Product exploration explored 100000 steps with 0 reset in 52 ms.
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-12 16:15:11] [INFO ] Invariant cache hit.
[2023-03-12 16:15:11] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-12 16:15:11] [INFO ] Invariant cache hit.
[2023-03-12 16:15:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:15:11] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2023-03-12 16:15:11] [INFO ] Invariant cache hit.
[2023-03-12 16:15:11] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 558 ms. Remains : 43/43 places, 125/125 transitions.
Treatment of property AutonomousCar-PT-05b-LTLFireability-07 finished in 5590 ms.
[2023-03-12 16:15:11] [INFO ] Flatten gal took : 22 ms
[2023-03-12 16:15:11] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-12 16:15:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 212 places, 347 transitions and 1641 arcs took 3 ms.
Total runtime 30788 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1472/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1472/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutonomousCar-PT-05b-LTLFireability-00
Could not compute solution for formula : AutonomousCar-PT-05b-LTLFireability-07

BK_STOP 1678637712611

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-05b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813598100604"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;