fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r009-oct2-167813598100596
Last Updated
May 14, 2023

About the Execution of LTSMin+red for AutonomousCar-PT-05a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
436.684 29140.00 57594.00 61.80 FFFF?FTFF?FFFTF? normal

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-167813598100596.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-05a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598100596
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 15K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K 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 114K 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-05a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-05a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678637625381

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-05a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:13:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:13:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:13:47] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-12 16:13:47] [INFO ] Transformed 57 places.
[2023-03-12 16:13:47] [INFO ] Transformed 289 transitions.
[2023-03-12 16:13:47] [INFO ] Found NUPN structural information;
[2023-03-12 16:13:47] [INFO ] Parsed PT model containing 57 places and 289 transitions and 2123 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 113 transitions
Reduce redundant transitions removed 113 transitions.
FORMULA AutonomousCar-PT-05a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 176/176 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 55 transition count 169
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 55 transition count 169
Applied a total of 4 rules in 32 ms. Remains 55 /57 variables (removed 2) and now considering 169/176 (removed 7) transitions.
// Phase 1: matrix 169 rows 55 cols
[2023-03-12 16:13:48] [INFO ] Computed 9 place invariants in 11 ms
[2023-03-12 16:13:48] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-12 16:13:48] [INFO ] Invariant cache hit.
[2023-03-12 16:13:48] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-12 16:13:48] [INFO ] Implicit Places using invariants and state equation in 203 ms returned [51, 53]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 465 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/57 places, 169/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 169/169 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 500 ms. Remains : 53/57 places, 169/176 transitions.
Support contains 30 out of 53 places after structural reductions.
[2023-03-12 16:13:48] [INFO ] Flatten gal took : 47 ms
[2023-03-12 16:13:48] [INFO ] Flatten gal took : 37 ms
[2023-03-12 16:13:48] [INFO ] Input system was already deterministic with 169 transitions.
Incomplete random walk after 10000 steps, including 573 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 24) seen :19
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 169 rows 53 cols
[2023-03-12 16:13:49] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-12 16:13:49] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 16:13:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 16:13:49] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-12 16:13:49] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-12 16:13:49] [INFO ] After 56ms SMT Verify possible using 98 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-12 16:13:49] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-12 16:13:49] [INFO ] After 394ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 12 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 169/169 transitions.
Graph (complete) has 379 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 52 transition count 161
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 47 transition count 161
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 13 place count 47 transition count 159
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 17 place count 45 transition count 159
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 20 place count 42 transition count 141
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 42 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 41 transition count 140
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 41 transition count 135
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 60 place count 36 transition count 110
Applied a total of 60 rules in 42 ms. Remains 36 /53 variables (removed 17) and now considering 110/169 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 36/53 places, 110/169 transitions.
Incomplete random walk after 10000 steps, including 122 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 110 rows 36 cols
[2023-03-12 16:13:50] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 16:13:50] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:13:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 16:13:50] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:13:50] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-12 16:13:50] [INFO ] After 42ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:13:50] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-12 16:13:50] [INFO ] After 261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 10 out of 36 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36/36 places, 110/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 35 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 35 transition count 104
Applied a total of 2 rules in 8 ms. Remains 35 /36 variables (removed 1) and now considering 104/110 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 35/36 places, 104/110 transitions.
Incomplete random walk after 10000 steps, including 120 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 132 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 130 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Finished probabilistic random walk after 2874 steps, run visited all 2 properties in 11 ms. (steps per millisecond=261 )
Probabilistic random walk after 2874 steps, saw 879 distinct states, run finished after 11 ms. (steps per millisecond=261 ) properties seen :2
FORMULA AutonomousCar-PT-05a-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 10 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 169/169 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 49 transition count 145
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 49 transition count 145
Applied a total of 8 rules in 3 ms. Remains 49 /53 variables (removed 4) and now considering 145/169 (removed 24) transitions.
// Phase 1: matrix 145 rows 49 cols
[2023-03-12 16:13:50] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-12 16:13:50] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-12 16:13:50] [INFO ] Invariant cache hit.
[2023-03-12 16:13:50] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-12 16:13:50] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-12 16:13:50] [INFO ] Invariant cache hit.
[2023-03-12 16:13:51] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/53 places, 145/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 329 ms. Remains : 49/53 places, 145/169 transitions.
Stuttering acceptance computed with spot in 446 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s4 0) (EQ s44 0) (EQ s47 0)), p1:(AND (EQ s12 1) (EQ s18 1) (EQ s26 1) (EQ s30 1) (EQ s38 1) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-02 finished in 855 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(G(p0))))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 169/169 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 49 transition count 145
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 49 transition count 145
Applied a total of 8 rules in 5 ms. Remains 49 /53 variables (removed 4) and now considering 145/169 (removed 24) transitions.
[2023-03-12 16:13:51] [INFO ] Invariant cache hit.
[2023-03-12 16:13:51] [INFO ] Implicit Places using invariants in 117 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 131 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/53 places, 145/169 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 48/53 places, 145/169 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s13 0) (EQ s17 0) (EQ s25 0) (EQ s29 0) (EQ s37 0) (EQ s44 0))], 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]]
Product exploration explored 100000 steps with 17 reset in 160 ms.
Product exploration explored 100000 steps with 28 reset in 112 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2390 steps, including 140 resets, run visited all 1 properties in 20 ms. (steps per millisecond=119 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 145/145 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 145/145 (removed 0) transitions.
// Phase 1: matrix 145 rows 48 cols
[2023-03-12 16:13:53] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-12 16:13:53] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-12 16:13:53] [INFO ] Invariant cache hit.
[2023-03-12 16:13:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:13:53] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-12 16:13:53] [INFO ] Invariant cache hit.
[2023-03-12 16:13:53] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 390 ms. Remains : 48/48 places, 145/145 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 419 steps, including 23 resets, run visited all 1 properties in 2 ms. (steps per millisecond=209 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3 reset in 83 ms.
Product exploration explored 100000 steps with 0 reset in 101 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 145/145 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 48 transition count 145
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 5 place count 48 transition count 147
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 48 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 48 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 48 transition count 150
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 9 rules in 11 ms. Remains 48 /48 variables (removed 0) and now considering 150/145 (removed -5) transitions.
[2023-03-12 16:13:54] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 150 rows 48 cols
[2023-03-12 16:13:54] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 16:13:54] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/48 places, 150/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 48/48 places, 150/145 transitions.
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 145/145 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 145/145 (removed 0) transitions.
// Phase 1: matrix 145 rows 48 cols
[2023-03-12 16:13:55] [INFO ] Computed 6 place invariants in 12 ms
[2023-03-12 16:13:55] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-12 16:13:55] [INFO ] Invariant cache hit.
[2023-03-12 16:13:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:13:55] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2023-03-12 16:13:55] [INFO ] Invariant cache hit.
[2023-03-12 16:13:55] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 316 ms. Remains : 48/48 places, 145/145 transitions.
Treatment of property AutonomousCar-PT-05a-LTLFireability-04 finished in 3784 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 10 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 169/169 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 53 transition count 164
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 48 transition count 164
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 48 transition count 163
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 47 transition count 163
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 43 transition count 139
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 43 transition count 139
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 2 with 2 rules applied. Total rules applied 22 place count 42 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 41 transition count 138
Applied a total of 24 rules in 21 ms. Remains 41 /53 variables (removed 12) and now considering 138/169 (removed 31) transitions.
// Phase 1: matrix 138 rows 41 cols
[2023-03-12 16:13:55] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:13:55] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-12 16:13:55] [INFO ] Invariant cache hit.
[2023-03-12 16:13:55] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-12 16:13:55] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2023-03-12 16:13:55] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-12 16:13:55] [INFO ] Invariant cache hit.
[2023-03-12 16:13:56] [INFO ] Dead Transitions using invariants and state equation in 966 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/53 places, 138/169 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1234 ms. Remains : 41/53 places, 138/169 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s3 1) (EQ s36 1) (EQ s39 1) (OR (EQ s10 0) (EQ s15 0) (EQ s20 0) (EQ s25 0) (EQ s32 0) (EQ s37 0)))], 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 10 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-05 finished in 1293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 169/169 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 53 transition count 162
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 46 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 46 transition count 161
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 45 transition count 161
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 42 transition count 143
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 42 transition count 143
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 2 with 4 rules applied. Total rules applied 26 place count 40 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 39 transition count 141
Applied a total of 28 rules in 24 ms. Remains 39 /53 variables (removed 14) and now considering 141/169 (removed 28) transitions.
// Phase 1: matrix 141 rows 39 cols
[2023-03-12 16:13:56] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:13:56] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-12 16:13:56] [INFO ] Invariant cache hit.
[2023-03-12 16:13:56] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-12 16:13:56] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2023-03-12 16:13:57] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-12 16:13:57] [INFO ] Invariant cache hit.
[2023-03-12 16:13:57] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/53 places, 141/169 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 465 ms. Remains : 39/53 places, 141/169 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s7 1) (EQ s24 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-07 finished in 520 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||(p1 U p2)))))'
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 169/169 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 53 transition count 162
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 46 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 46 transition count 161
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 45 transition count 161
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 43 transition count 149
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 43 transition count 149
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 41 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 40 transition count 147
Applied a total of 26 rules in 51 ms. Remains 40 /53 variables (removed 13) and now considering 147/169 (removed 22) transitions.
// Phase 1: matrix 147 rows 40 cols
[2023-03-12 16:13:57] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-12 16:13:57] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-12 16:13:57] [INFO ] Invariant cache hit.
[2023-03-12 16:13:57] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-03-12 16:13:57] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-12 16:13:57] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-12 16:13:57] [INFO ] Invariant cache hit.
[2023-03-12 16:13:57] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/53 places, 147/169 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 394 ms. Remains : 40/53 places, 147/169 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s30 1) (EQ s1 1) (EQ s7 1) (EQ s21 1) (EQ s36 1)), p0:(AND (EQ s1 1) (EQ s7 1) (EQ s21 1) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-08 finished in 522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 8 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 169/169 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 53 transition count 164
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 48 transition count 164
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 10 place count 48 transition count 162
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 46 transition count 162
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 42 transition count 138
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 42 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 41 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 40 transition count 137
Applied a total of 26 rules in 25 ms. Remains 40 /53 variables (removed 13) and now considering 137/169 (removed 32) transitions.
// Phase 1: matrix 137 rows 40 cols
[2023-03-12 16:13:57] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:13:57] [INFO ] Implicit Places using invariants in 96 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/53 places, 137/169 transitions.
Applied a total of 0 rules in 7 ms. Remains 39 /39 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 132 ms. Remains : 39/53 places, 137/169 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s11 0) (EQ s14 0) (EQ s19 0) (EQ s26 0) (EQ s29 0) (EQ s36 0)), p0:(OR (NEQ s9 1) (NEQ s14 1) (NEQ s19 1) (NEQ s24 1) (NEQ s29 1) (NEQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2 reset in 121 ms.
Product exploration explored 100000 steps with 63 reset in 106 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 292 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 583 steps, including 37 resets, run visited all 2 properties in 15 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 320 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 8 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 137/137 transitions.
Applied a total of 0 rules in 8 ms. Remains 39 /39 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 39 cols
[2023-03-12 16:13:59] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 16:13:59] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-12 16:13:59] [INFO ] Invariant cache hit.
[2023-03-12 16:13:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:13:59] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-12 16:13:59] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-12 16:13:59] [INFO ] Invariant cache hit.
[2023-03-12 16:13:59] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 315 ms. Remains : 39/39 places, 137/137 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 : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 262 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 5037 steps, including 342 resets, run visited all 2 properties in 47 ms. (steps per millisecond=107 )
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 270 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 16 reset in 85 ms.
Product exploration explored 100000 steps with 49 reset in 87 ms.
Support contains 8 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 137/137 transitions.
Applied a total of 0 rules in 9 ms. Remains 39 /39 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-12 16:14:00] [INFO ] Invariant cache hit.
[2023-03-12 16:14:00] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-12 16:14:00] [INFO ] Invariant cache hit.
[2023-03-12 16:14:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:14:00] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2023-03-12 16:14:01] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-12 16:14:01] [INFO ] Invariant cache hit.
[2023-03-12 16:14:01] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 362 ms. Remains : 39/39 places, 137/137 transitions.
Treatment of property AutonomousCar-PT-05a-LTLFireability-09 finished in 3442 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((p0||G(!p1)))))'
Support contains 10 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 169/169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 50 transition count 151
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 50 transition count 151
Applied a total of 6 rules in 1 ms. Remains 50 /53 variables (removed 3) and now considering 151/169 (removed 18) transitions.
// Phase 1: matrix 151 rows 50 cols
[2023-03-12 16:14:01] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-12 16:14:01] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-12 16:14:01] [INFO ] Invariant cache hit.
[2023-03-12 16:14:01] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-12 16:14:01] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2023-03-12 16:14:01] [INFO ] Invariant cache hit.
[2023-03-12 16:14:01] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/53 places, 151/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 506 ms. Remains : 50/53 places, 151/169 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (NEQ s12 1) (NEQ s18 1) (NEQ s24 1) (NEQ s30 1) (NEQ s36 1) (NEQ s46 1)), p0:(AND (EQ s1 1) (EQ s5 1) (EQ s37 1) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-11 finished in 741 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)||(G(p3)&&p2))))'
Support contains 14 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 169/169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 50 transition count 151
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 50 transition count 151
Applied a total of 6 rules in 3 ms. Remains 50 /53 variables (removed 3) and now considering 151/169 (removed 18) transitions.
// Phase 1: matrix 151 rows 50 cols
[2023-03-12 16:14:01] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-12 16:14:02] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-12 16:14:02] [INFO ] Invariant cache hit.
[2023-03-12 16:14:02] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-12 16:14:02] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2023-03-12 16:14:02] [INFO ] Invariant cache hit.
[2023-03-12 16:14:02] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/53 places, 151/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 459 ms. Remains : 50/53 places, 151/169 transitions.
Stuttering acceptance computed with spot in 357 ms :[true, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={} source=2 dest: 0}, { cond=p3, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 (NOT p3))), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p3), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p3), acceptance={} source=5 dest: 5}]], initial=1, aps=[p3:(OR (EQ s12 0) (EQ s18 0) (EQ s27 0) (EQ s31 0) (EQ s37 0) (EQ s46 0) (AND (EQ s14 1) (EQ s21 1) (EQ s27 1) (EQ s31 1) (EQ s37 1) (EQ s46 1))), p0:(AND...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, 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-05a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-12 finished in 852 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 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 169/169 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 49 transition count 145
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 49 transition count 145
Applied a total of 8 rules in 3 ms. Remains 49 /53 variables (removed 4) and now considering 145/169 (removed 24) transitions.
// Phase 1: matrix 145 rows 49 cols
[2023-03-12 16:14:02] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-12 16:14:02] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-12 16:14:02] [INFO ] Invariant cache hit.
[2023-03-12 16:14:03] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-12 16:14:03] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2023-03-12 16:14:03] [INFO ] Invariant cache hit.
[2023-03-12 16:14:03] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/53 places, 145/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 432 ms. Remains : 49/53 places, 145/169 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-13 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 (EQ s1 1) (EQ s2 1) (EQ s19 1) (EQ s44 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 567 ms.
Product exploration explored 100000 steps with 33333 reset in 354 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-05a-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-05a-LTLFireability-13 finished in 1582 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 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 169/169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 50 transition count 151
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 50 transition count 151
Applied a total of 6 rules in 2 ms. Remains 50 /53 variables (removed 3) and now considering 151/169 (removed 18) transitions.
// Phase 1: matrix 151 rows 50 cols
[2023-03-12 16:14:04] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:14:04] [INFO ] Implicit Places using invariants in 182 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 195 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/53 places, 151/169 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 200 ms. Remains : 49/53 places, 151/169 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-14 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:(EQ s34 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]]
Stuttering criterion allowed to conclude after 32 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-14 finished in 384 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)&&F(G((F(p2)||p1))))))'
Support contains 7 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 169/169 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 53 transition count 164
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 48 transition count 162
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 46 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 46 transition count 161
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 45 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 19 place count 42 transition count 143
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 42 transition count 143
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 3 with 2 rules applied. Total rules applied 24 place count 41 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 40 transition count 142
Applied a total of 26 rules in 15 ms. Remains 40 /53 variables (removed 13) and now considering 142/169 (removed 27) transitions.
// Phase 1: matrix 142 rows 40 cols
[2023-03-12 16:14:04] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-12 16:14:04] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-12 16:14:04] [INFO ] Invariant cache hit.
[2023-03-12 16:14:04] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-12 16:14:04] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-12 16:14:04] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-12 16:14:04] [INFO ] Invariant cache hit.
[2023-03-12 16:14:05] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/53 places, 142/169 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 436 ms. Remains : 40/53 places, 142/169 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (EQ s1 1) (EQ s2 1) (EQ s33 1) (EQ s36 1)) (EQ s1 0) (EQ s2 0) (EQ s12 0) (EQ s36 0)), p1:(OR (EQ s1 0) (EQ s5 0) (EQ s22 0) (EQ s36 0)), p2:(...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 19 reset in 110 ms.
Product exploration explored 100000 steps with 40 reset in 92 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 446 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 762 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 16:14:06] [INFO ] Invariant cache hit.
[2023-03-12 16:14:06] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:14:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 16:14:06] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:14:06] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-12 16:14:06] [INFO ] After 37ms SMT Verify possible using 85 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:14:06] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-12 16:14:06] [INFO ] After 204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 142/142 transitions.
Graph (complete) has 352 edges and 40 vertex of which 39 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 39 transition count 139
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 39 transition count 135
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 31 place count 35 transition count 115
Applied a total of 31 rules in 44 ms. Remains 35 /40 variables (removed 5) and now considering 115/142 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 35/40 places, 115/142 transitions.
Finished random walk after 3325 steps, including 75 resets, run visited all 1 properties in 15 ms. (steps per millisecond=221 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 554 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 7 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 142/142 transitions.
Applied a total of 0 rules in 10 ms. Remains 40 /40 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2023-03-12 16:14:07] [INFO ] Invariant cache hit.
[2023-03-12 16:14:07] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-12 16:14:07] [INFO ] Invariant cache hit.
[2023-03-12 16:14:07] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-12 16:14:07] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2023-03-12 16:14:07] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-12 16:14:07] [INFO ] Invariant cache hit.
[2023-03-12 16:14:07] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 416 ms. Remains : 40/40 places, 142/142 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 355 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 767 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 16:14:08] [INFO ] Invariant cache hit.
[2023-03-12 16:14:08] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:14:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 16:14:08] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:14:08] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-12 16:14:08] [INFO ] After 31ms SMT Verify possible using 85 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:14:08] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-12 16:14:08] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 142/142 transitions.
Graph (complete) has 352 edges and 40 vertex of which 39 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.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 39 transition count 139
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 39 transition count 135
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 31 place count 35 transition count 115
Applied a total of 31 rules in 9 ms. Remains 35 /40 variables (removed 5) and now considering 115/142 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 35/40 places, 115/142 transitions.
Finished random walk after 3501 steps, including 82 resets, run visited all 1 properties in 23 ms. (steps per millisecond=152 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 565 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 32 reset in 149 ms.
Product exploration explored 100000 steps with 19 reset in 105 ms.
Support contains 7 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 142/142 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2023-03-12 16:14:10] [INFO ] Invariant cache hit.
[2023-03-12 16:14:10] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-12 16:14:10] [INFO ] Invariant cache hit.
[2023-03-12 16:14:10] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-12 16:14:10] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-12 16:14:10] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-12 16:14:10] [INFO ] Invariant cache hit.
[2023-03-12 16:14:10] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 296 ms. Remains : 40/40 places, 142/142 transitions.
Treatment of property AutonomousCar-PT-05a-LTLFireability-15 finished in 5708 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(G(p0))))'
Found a Lengthening insensitive property : AutonomousCar-PT-05a-LTLFireability-04
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 53/53 places, 169/169 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 53 transition count 164
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 48 transition count 164
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 10 place count 48 transition count 162
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 46 transition count 162
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 42 transition count 138
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 42 transition count 138
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 2 with 2 rules applied. Total rules applied 24 place count 41 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 40 transition count 137
Applied a total of 26 rules in 12 ms. Remains 40 /53 variables (removed 13) and now considering 137/169 (removed 32) transitions.
// Phase 1: matrix 137 rows 40 cols
[2023-03-12 16:14:10] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:14:10] [INFO ] Implicit Places using invariants in 88 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 39/53 places, 137/169 transitions.
Applied a total of 0 rules in 4 ms. Remains 39 /39 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 106 ms. Remains : 39/53 places, 137/169 transitions.
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s11 0) (EQ s14 0) (EQ s21 0) (EQ s24 0) (EQ s31 0) (EQ s36 0))], 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7 reset in 46 ms.
Product exploration explored 100000 steps with 14 reset in 47 ms.
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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 133 steps, including 11 resets, run visited all 1 properties in 1 ms. (steps per millisecond=133 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 137/137 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 39 cols
[2023-03-12 16:14:11] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-12 16:14:11] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-12 16:14:11] [INFO ] Invariant cache hit.
[2023-03-12 16:14:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:14:11] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-12 16:14:11] [INFO ] Invariant cache hit.
[2023-03-12 16:14:11] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 39/39 places, 137/137 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 322 steps, including 26 resets, run visited all 1 properties in 2 ms. (steps per millisecond=161 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 44 reset in 108 ms.
Product exploration explored 100000 steps with 1 reset in 128 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 137/137 transitions.
Applied a total of 0 rules in 6 ms. Remains 39 /39 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-12 16:14:13] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-12 16:14:13] [INFO ] Invariant cache hit.
[2023-03-12 16:14:13] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 39/39 places, 137/137 transitions.
Support contains 6 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 137/137 transitions.
Applied a total of 0 rules in 0 ms. Remains 39 /39 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-12 16:14:13] [INFO ] Invariant cache hit.
[2023-03-12 16:14:13] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-12 16:14:13] [INFO ] Invariant cache hit.
[2023-03-12 16:14:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:14:13] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-12 16:14:13] [INFO ] Invariant cache hit.
[2023-03-12 16:14:13] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 226 ms. Remains : 39/39 places, 137/137 transitions.
Treatment of property AutonomousCar-PT-05a-LTLFireability-04 finished in 3232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
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)&&F(G((F(p2)||p1))))))'
[2023-03-12 16:14:13] [INFO ] Flatten gal took : 18 ms
[2023-03-12 16:14:13] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 16:14:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 53 places, 169 transitions and 1246 arcs took 8 ms.
Total runtime 26245 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1545/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1545/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1545/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutonomousCar-PT-05a-LTLFireability-04
Could not compute solution for formula : AutonomousCar-PT-05a-LTLFireability-09
Could not compute solution for formula : AutonomousCar-PT-05a-LTLFireability-15

BK_STOP 1678637654521

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-05a-LTLFireability-04
ltl formula formula --ltl=/tmp/1545/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 53 places, 169 transitions and 1246 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1545/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1545/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1545/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1545/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name AutonomousCar-PT-05a-LTLFireability-09
ltl formula formula --ltl=/tmp/1545/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 53 places, 169 transitions and 1246 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1545/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1545/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1545/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.020 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1545/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name AutonomousCar-PT-05a-LTLFireability-15
ltl formula formula --ltl=/tmp/1545/ltl_2_
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 53 places, 169 transitions and 1246 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.040 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1545/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1545/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1545/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1545/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
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:
0: pnml2lts-mc(+0xa23f4) [0x55fdc98d83f4]
1: pnml2lts-mc(+0xa2496) [0x55fdc98d8496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fc2c84c1140]
3: pnml2lts-mc(+0x405be5) [0x55fdc9c3bbe5]
4: pnml2lts-mc(+0x16b3f9) [0x55fdc99a13f9]
5: pnml2lts-mc(+0x164ac4) [0x55fdc999aac4]
6: pnml2lts-mc(+0x272e0a) [0x55fdc9aa8e0a]
7: pnml2lts-mc(+0xb61f0) [0x55fdc98ec1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fc2c83144d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fc2c831467a]
10: pnml2lts-mc(+0xa1581) [0x55fdc98d7581]
11: pnml2lts-mc(+0xa1910) [0x55fdc98d7910]
12: pnml2lts-mc(+0xa32a2) [0x55fdc98d92a2]
13: pnml2lts-mc(+0xa50f4) [0x55fdc98db0f4]
14: pnml2lts-mc(+0xa516b) [0x55fdc98db16b]
15: pnml2lts-mc(+0x3f34b3) [0x55fdc9c294b3]
16: pnml2lts-mc(+0x7c63d) [0x55fdc98b263d]
17: pnml2lts-mc(+0x67d86) [0x55fdc989dd86]
18: pnml2lts-mc(+0x60a8a) [0x55fdc9896a8a]
19: pnml2lts-mc(+0x5eb15) [0x55fdc9894b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fc2c82fcd0a]
21: pnml2lts-mc(+0x6075e) [0x55fdc989675e]

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-05a"
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-05a, 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-167813598100596"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-05a.tgz
mv AutonomousCar-PT-05a 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 ;