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-167813598100571.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-03b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598100571
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 75K 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-03b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678637059550

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-03b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:04:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 16:04:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:04:22] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-12 16:04:22] [INFO ] Transformed 190 places.
[2023-03-12 16:04:22] [INFO ] Transformed 273 transitions.
[2023-03-12 16:04:22] [INFO ] Found NUPN structural information;
[2023-03-12 16:04:22] [INFO ] Parsed PT model containing 190 places and 273 transitions and 1051 arcs in 123 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-03b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 273/273 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 163 transition count 246
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 163 transition count 246
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 90 place count 163 transition count 210
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 95 place count 158 transition count 205
Iterating global reduction 1 with 5 rules applied. Total rules applied 100 place count 158 transition count 205
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 157 transition count 204
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 157 transition count 204
Applied a total of 102 rules in 69 ms. Remains 157 /190 variables (removed 33) and now considering 204/273 (removed 69) transitions.
// Phase 1: matrix 204 rows 157 cols
[2023-03-12 16:04:22] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-12 16:04:23] [INFO ] Implicit Places using invariants in 532 ms returned []
[2023-03-12 16:04:23] [INFO ] Invariant cache hit.
[2023-03-12 16:04:23] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 917 ms to find 0 implicit places.
[2023-03-12 16:04:23] [INFO ] Invariant cache hit.
[2023-03-12 16:04:23] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 157/190 places, 204/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1284 ms. Remains : 157/190 places, 204/273 transitions.
Support contains 9 out of 157 places after structural reductions.
[2023-03-12 16:04:23] [INFO ] Flatten gal took : 45 ms
[2023-03-12 16:04:23] [INFO ] Flatten gal took : 18 ms
[2023-03-12 16:04:23] [INFO ] Input system was already deterministic with 204 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 16:04:24] [INFO ] Invariant cache hit.
[2023-03-12 16:04:24] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 16:04:24] [INFO ] After 68ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 16:04:24] [INFO ] After 92ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:04:24] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:04:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 16:04:24] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:04:24] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-12 16:04:24] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 204/204 transitions.
Graph (trivial) has 145 edges and 157 vertex of which 4 / 157 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 384 edges and 155 vertex of which 153 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 153 transition count 138
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 81 rules applied. Total rules applied 145 place count 93 transition count 117
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 158 place count 81 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 159 place count 80 transition count 116
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 159 place count 80 transition count 109
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 173 place count 73 transition count 109
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 235 place count 42 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 236 place count 42 transition count 77
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 243 place count 35 transition count 55
Iterating global reduction 5 with 7 rules applied. Total rules applied 250 place count 35 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 253 place count 35 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 257 place count 33 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 261 place count 31 transition count 68
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 262 place count 31 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 263 place count 30 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 264 place count 29 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 265 place count 28 transition count 66
Applied a total of 265 rules in 37 ms. Remains 28 /157 variables (removed 129) and now considering 66/204 (removed 138) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 28/157 places, 66/204 transitions.
Finished random walk after 119 steps, including 13 resets, run visited all 1 properties in 2 ms. (steps per millisecond=59 )
Computed a total of 34 stabilizing places and 35 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' '!(F((G(p0)||G(F(p1)))))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 204/204 transitions.
Graph (trivial) has 143 edges and 157 vertex of which 4 / 157 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 154 transition count 144
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 73 rules applied. Total rules applied 131 place count 97 transition count 128
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 142 place count 88 transition count 126
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 144 place count 86 transition count 126
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 144 place count 86 transition count 118
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 160 place count 78 transition count 118
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 161 place count 77 transition count 117
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 77 transition count 117
Performed 31 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 224 place count 46 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 225 place count 46 transition count 84
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 232 place count 39 transition count 62
Iterating global reduction 5 with 7 rules applied. Total rules applied 239 place count 39 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 241 place count 39 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 245 place count 37 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 249 place count 35 transition count 83
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 257 place count 35 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 259 place count 33 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 260 place count 32 transition count 73
Applied a total of 260 rules in 58 ms. Remains 32 /157 variables (removed 125) and now considering 73/204 (removed 131) transitions.
// Phase 1: matrix 73 rows 32 cols
[2023-03-12 16:04:25] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 16:04:25] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-12 16:04:25] [INFO ] Invariant cache hit.
[2023-03-12 16:04:25] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-12 16:04:25] [INFO ] Implicit Places using invariants and state equation in 125 ms returned [27, 31]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 210 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/157 places, 73/204 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 29 transition count 72
Applied a total of 2 rules in 3 ms. Remains 29 /30 variables (removed 1) and now considering 72/73 (removed 1) transitions.
// Phase 1: matrix 72 rows 29 cols
[2023-03-12 16:04:25] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 16:04:25] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-12 16:04:25] [INFO ] Invariant cache hit.
[2023-03-12 16:04:25] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 16:04:25] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 29/157 places, 72/204 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 406 ms. Remains : 29/157 places, 72/204 transitions.
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s6 1), p1:(AND (EQ s20 0) (EQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 3 ms.
FORMULA AutonomousCar-PT-03b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLCardinality-01 finished in 708 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)))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 204/204 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 203
Applied a total of 2 rules in 9 ms. Remains 156 /157 variables (removed 1) and now considering 203/204 (removed 1) transitions.
// Phase 1: matrix 203 rows 156 cols
[2023-03-12 16:04:25] [INFO ] Computed 8 place invariants in 4 ms
[2023-03-12 16:04:25] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-12 16:04:25] [INFO ] Invariant cache hit.
[2023-03-12 16:04:25] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2023-03-12 16:04:25] [INFO ] Invariant cache hit.
[2023-03-12 16:04:26] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 156/157 places, 203/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 478 ms. Remains : 156/157 places, 203/204 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s116 0) (EQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-03b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLCardinality-09 finished in 616 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)))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 204/204 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 155 transition count 202
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 155 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 154 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 154 transition count 201
Applied a total of 6 rules in 6 ms. Remains 154 /157 variables (removed 3) and now considering 201/204 (removed 3) transitions.
// Phase 1: matrix 201 rows 154 cols
[2023-03-12 16:04:26] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 16:04:26] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-12 16:04:26] [INFO ] Invariant cache hit.
[2023-03-12 16:04:26] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
[2023-03-12 16:04:26] [INFO ] Invariant cache hit.
[2023-03-12 16:04:27] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/157 places, 201/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1412 ms. Remains : 154/157 places, 201/204 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s148 0) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLCardinality-13 finished in 1559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 204/204 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 155 transition count 202
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 155 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 154 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 154 transition count 201
Applied a total of 6 rules in 7 ms. Remains 154 /157 variables (removed 3) and now considering 201/204 (removed 3) transitions.
[2023-03-12 16:04:27] [INFO ] Invariant cache hit.
[2023-03-12 16:04:27] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-12 16:04:27] [INFO ] Invariant cache hit.
[2023-03-12 16:04:27] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-12 16:04:28] [INFO ] Invariant cache hit.
[2023-03-12 16:04:28] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/157 places, 201/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 385 ms. Remains : 154/157 places, 201/204 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (NEQ s4 0) (NEQ s73 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 6707 reset in 344 ms.
Product exploration explored 100000 steps with 6610 reset in 285 ms.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 158 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-12 16:04:29] [INFO ] Invariant cache hit.
[2023-03-12 16:04:30] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 16:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:04:30] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-03-12 16:04:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:04:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 16:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:04:30] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-12 16:04:30] [INFO ] Computed and/alt/rep : 159/304/159 causal constraints (skipped 41 transitions) in 16 ms.
[2023-03-12 16:04:31] [INFO ] Added : 147 causal constraints over 30 iterations in 742 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 201/201 transitions.
Applied a total of 0 rules in 3 ms. Remains 154 /154 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2023-03-12 16:04:31] [INFO ] Invariant cache hit.
[2023-03-12 16:04:31] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-12 16:04:31] [INFO ] Invariant cache hit.
[2023-03-12 16:04:31] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2023-03-12 16:04:31] [INFO ] Invariant cache hit.
[2023-03-12 16:04:31] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 690 ms. Remains : 154/154 places, 201/201 transitions.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-12 16:04:32] [INFO ] Invariant cache hit.
[2023-03-12 16:04:33] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 16:04:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:04:33] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-12 16:04:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:04:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 25 ms returned sat
[2023-03-12 16:04:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:04:34] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2023-03-12 16:04:34] [INFO ] Computed and/alt/rep : 159/304/159 causal constraints (skipped 41 transitions) in 59 ms.
[2023-03-12 16:04:34] [INFO ] Added : 147 causal constraints over 30 iterations in 805 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6769 reset in 206 ms.
Product exploration explored 100000 steps with 6660 reset in 148 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 201/201 transitions.
Graph (trivial) has 141 edges and 154 vertex of which 4 / 154 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 152 transition count 199
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 68 place count 152 transition count 190
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 68 place count 152 transition count 190
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 79 place count 152 transition count 190
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 127 place count 104 transition count 142
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 175 place count 104 transition count 142
Performed 42 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 2 with 42 rules applied. Total rules applied 217 place count 104 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 219 place count 104 transition count 146
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 254 place count 69 transition count 96
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 3 with 35 rules applied. Total rules applied 289 place count 69 transition count 96
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 295 place count 69 transition count 90
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 299 place count 65 transition count 86
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 303 place count 65 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 33 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 304 place count 65 transition count 86
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 306 place count 63 transition count 84
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 308 place count 63 transition count 84
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 311 place count 63 transition count 110
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 311 rules in 46 ms. Remains 63 /154 variables (removed 91) and now considering 110/201 (removed 91) transitions.
[2023-03-12 16:04:35] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 110 rows 63 cols
[2023-03-12 16:04:35] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:04:36] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/154 places, 110/201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 240 ms. Remains : 63/154 places, 110/201 transitions.
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 201/201 transitions.
Applied a total of 0 rules in 1 ms. Remains 154 /154 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 154 cols
[2023-03-12 16:04:36] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 16:04:36] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-12 16:04:36] [INFO ] Invariant cache hit.
[2023-03-12 16:04:36] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2023-03-12 16:04:36] [INFO ] Invariant cache hit.
[2023-03-12 16:04:36] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 721 ms. Remains : 154/154 places, 201/201 transitions.
Treatment of property AutonomousCar-PT-03b-LTLCardinality-15 finished in 9073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : AutonomousCar-PT-03b-LTLCardinality-15
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 157/157 places, 204/204 transitions.
Graph (trivial) has 144 edges and 157 vertex of which 4 / 157 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 154 transition count 140
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 83 rules applied. Total rules applied 145 place count 93 transition count 118
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 14 rules applied. Total rules applied 159 place count 80 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 160 place count 79 transition count 117
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 160 place count 79 transition count 112
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 170 place count 74 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 171 place count 73 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 172 place count 73 transition count 111
Performed 32 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 236 place count 41 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 237 place count 41 transition count 77
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 244 place count 34 transition count 55
Iterating global reduction 5 with 7 rules applied. Total rules applied 251 place count 34 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 254 place count 34 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 258 place count 32 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 262 place count 30 transition count 68
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 264 place count 28 transition count 66
Applied a total of 264 rules in 38 ms. Remains 28 /157 variables (removed 129) and now considering 66/204 (removed 138) transitions.
// Phase 1: matrix 66 rows 28 cols
[2023-03-12 16:04:37] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-12 16:04:37] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-12 16:04:37] [INFO ] Invariant cache hit.
[2023-03-12 16:04:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:04:37] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [23, 27]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 193 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 26/157 places, 66/204 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 25 transition count 65
Applied a total of 2 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 65/66 (removed 1) transitions.
// Phase 1: matrix 65 rows 25 cols
[2023-03-12 16:04:37] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 16:04:37] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-12 16:04:37] [INFO ] Invariant cache hit.
[2023-03-12 16:04:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:04:37] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 25/157 places, 65/204 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 513 ms. Remains : 25/157 places, 65/204 transitions.
Running random walk in product with property : AutonomousCar-PT-03b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (NEQ s1 0) (NEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 19278 reset in 104 ms.
Product exploration explored 100000 steps with 19147 reset in 104 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 : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 167 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 232 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-12 16:04:38] [INFO ] Invariant cache hit.
[2023-03-12 16:04:38] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 16:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:04:39] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-12 16:04:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:04:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 28 ms returned sat
[2023-03-12 16:04:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:04:40] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2023-03-12 16:04:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:04:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 14 ms returned sat
[2023-03-12 16:04:40] [INFO ] Computed and/alt/rep : 27/122/27 causal constraints (skipped 27 transitions) in 10 ms.
[2023-03-12 16:04:40] [INFO ] Added : 2 causal constraints over 2 iterations in 123 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-12 16:04:40] [INFO ] Invariant cache hit.
[2023-03-12 16:04:41] [INFO ] Implicit Places using invariants in 682 ms returned []
[2023-03-12 16:04:41] [INFO ] Invariant cache hit.
[2023-03-12 16:04:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:04:41] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
[2023-03-12 16:04:41] [INFO ] Invariant cache hit.
[2023-03-12 16:04:41] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1020 ms. Remains : 25/25 places, 65/65 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 : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 242 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 286 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 250 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-12 16:04:43] [INFO ] Invariant cache hit.
[2023-03-12 16:04:43] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 16:04:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:04:43] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-12 16:04:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:04:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 16:04:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:04:43] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2023-03-12 16:04:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:04:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-12 16:04:43] [INFO ] Computed and/alt/rep : 27/122/27 causal constraints (skipped 27 transitions) in 4 ms.
[2023-03-12 16:04:43] [INFO ] Added : 2 causal constraints over 2 iterations in 98 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19213 reset in 133 ms.
Product exploration explored 100000 steps with 19241 reset in 129 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 65/65 transitions.
Applied a total of 0 rules in 5 ms. Remains 25 /25 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-12 16:04:44] [INFO ] Redundant transitions in 23 ms returned [14]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 64 rows 25 cols
[2023-03-12 16:04:44] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 16:04:44] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/25 places, 64/65 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 4 ms. Remains 25 /25 variables (removed 0) and now considering 66/64 (removed -2) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/25 places, 66/65 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 205 ms. Remains : 25/25 places, 66/65 transitions.
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 25 cols
[2023-03-12 16:04:44] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 16:04:44] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-12 16:04:44] [INFO ] Invariant cache hit.
[2023-03-12 16:04:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:04:44] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-03-12 16:04:44] [INFO ] Invariant cache hit.
[2023-03-12 16:04:44] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 377 ms. Remains : 25/25 places, 65/65 transitions.
Treatment of property AutonomousCar-PT-03b-LTLCardinality-15 finished in 8164 ms.
[2023-03-12 16:04:45] [INFO ] Flatten gal took : 11 ms
[2023-03-12 16:04:45] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 16:04:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 157 places, 204 transitions and 697 arcs took 1 ms.
Total runtime 23014 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/982/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutonomousCar-PT-03b-LTLCardinality-15

BK_STOP 1678637085672

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name AutonomousCar-PT-03b-LTLCardinality-15
ltl formula formula --ltl=/tmp/982/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 157 places, 204 transitions and 697 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.000 user 0.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/982/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/982/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/982/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/982/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-03b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813598100571"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-03b.tgz
mv AutonomousCar-PT-03b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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