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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.0K Feb 25 12:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 12:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 12:53 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 72K 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-04a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678637202157

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-04a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:06:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:06:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:06:44] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-12 16:06:44] [INFO ] Transformed 49 places.
[2023-03-12 16:06:44] [INFO ] Transformed 193 transitions.
[2023-03-12 16:06:44] [INFO ] Found NUPN structural information;
[2023-03-12 16:06:44] [INFO ] Parsed PT model containing 49 places and 193 transitions and 1306 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 75 transitions
Reduce redundant transitions removed 75 transitions.
FORMULA AutonomousCar-PT-04a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 118/118 transitions.
Applied a total of 0 rules in 12 ms. Remains 49 /49 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2023-03-12 16:06:44] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
// Phase 1: matrix 117 rows 49 cols
[2023-03-12 16:06:44] [INFO ] Computed 9 place invariants in 7 ms
[2023-03-12 16:06:44] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-12 16:06:44] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
[2023-03-12 16:06:44] [INFO ] Invariant cache hit.
[2023-03-12 16:06:45] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-12 16:06:45] [INFO ] Implicit Places using invariants and state equation in 150 ms returned [44, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 519 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/49 places, 118/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 534 ms. Remains : 47/49 places, 118/118 transitions.
Support contains 31 out of 47 places after structural reductions.
[2023-03-12 16:06:45] [INFO ] Flatten gal took : 44 ms
[2023-03-12 16:06:45] [INFO ] Flatten gal took : 18 ms
[2023-03-12 16:06:45] [INFO ] Input system was already deterministic with 118 transitions.
Incomplete random walk after 10000 steps, including 617 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 25) seen :23
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 16:06:45] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
// Phase 1: matrix 117 rows 47 cols
[2023-03-12 16:06:45] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-12 16:06:45] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-12 16:06:45] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-12 16:06:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-12 16:06:46] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 16:06:46] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-12 16:06:46] [INFO ] After 23ms SMT Verify possible using 67 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 16:06:46] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-12 16:06:46] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 118/118 transitions.
Graph (complete) has 274 edges and 47 vertex of which 45 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 45 transition count 107
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 39 transition count 107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 39 transition count 106
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 18 place count 38 transition count 106
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 22 place count 34 transition count 90
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 34 transition count 90
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 31 transition count 87
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 31 transition count 83
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 56 place count 27 transition count 67
Applied a total of 56 rules in 24 ms. Remains 27 /47 variables (removed 20) and now considering 67/118 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 27/47 places, 67/118 transitions.
Finished random walk after 2319 steps, including 23 resets, run visited all 1 properties in 25 ms. (steps per millisecond=92 )
FORMULA AutonomousCar-PT-04a-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 3 stabilizing places and 2 stable transitions
FORMULA AutonomousCar-PT-04a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 9 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 97
Applied a total of 10 rules in 2 ms. Remains 42 /47 variables (removed 5) and now considering 97/118 (removed 21) transitions.
// Phase 1: matrix 97 rows 42 cols
[2023-03-12 16:06:46] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-12 16:06:46] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-12 16:06:46] [INFO ] Invariant cache hit.
[2023-03-12 16:06:46] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-12 16:06:46] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-12 16:06:46] [INFO ] Invariant cache hit.
[2023-03-12 16:06:46] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/47 places, 97/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 239 ms. Remains : 42/47 places, 97/118 transitions.
Stuttering acceptance computed with spot in 383 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (EQ s1 1) (EQ s5 1) (EQ s12 1) (EQ s37 1) (EQ s11 1) (EQ s19 1) (EQ s25 1) (EQ s29 1) (EQ s38 1)) (AND (EQ s11 1) (EQ s19 1) (EQ s25 1) (EQ s2...], 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 10 steps with 0 reset in 4 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-00 finished in 717 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 98
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 98
Applied a total of 8 rules in 7 ms. Remains 43 /47 variables (removed 4) and now considering 98/118 (removed 20) transitions.
[2023-03-12 16:06:47] [INFO ] Flow matrix only has 97 transitions (discarded 1 similar events)
// Phase 1: matrix 97 rows 43 cols
[2023-03-12 16:06:47] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-12 16:06:47] [INFO ] Implicit Places using invariants in 120 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 122 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/47 places, 98/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 42/47 places, 98/118 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s39 0), p0:(EQ s26 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 50000 reset in 322 ms.
Product exploration explored 100000 steps with 50000 reset in 181 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 : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 6 factoid took 212 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-04a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-04a-LTLFireability-01 finished in 1103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 118/118 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 47 transition count 113
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 42 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 41 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 41 transition count 111
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 14 place count 40 transition count 111
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 19 place count 35 transition count 90
Iterating global reduction 3 with 5 rules applied. Total rules applied 24 place count 35 transition count 90
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 3 with 4 rules applied. Total rules applied 28 place count 33 transition count 88
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 30 place count 32 transition count 88
Applied a total of 30 rules in 38 ms. Remains 32 /47 variables (removed 15) and now considering 88/118 (removed 30) transitions.
// Phase 1: matrix 88 rows 32 cols
[2023-03-12 16:06:48] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 16:06:48] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-12 16:06:48] [INFO ] Invariant cache hit.
[2023-03-12 16:06:48] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-12 16:06:48] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2023-03-12 16:06:48] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-12 16:06:48] [INFO ] Invariant cache hit.
[2023-03-12 16:06:48] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/47 places, 88/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 433 ms. Remains : 32/47 places, 88/118 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s6 1) (EQ s15 1) (EQ s28 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 7 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-03 finished in 598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((F(p0) U G(p1))&&(p1 U p2)))))'
Support contains 6 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 44 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 44 transition count 107
Applied a total of 6 rules in 3 ms. Remains 44 /47 variables (removed 3) and now considering 107/118 (removed 11) transitions.
// Phase 1: matrix 107 rows 44 cols
[2023-03-12 16:06:49] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-12 16:06:49] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-12 16:06:49] [INFO ] Invariant cache hit.
[2023-03-12 16:06:49] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-12 16:06:49] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2023-03-12 16:06:49] [INFO ] Invariant cache hit.
[2023-03-12 16:06:49] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 44/47 places, 107/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 518 ms. Remains : 44/47 places, 107/118 transitions.
Stuttering acceptance computed with spot in 419 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s31 1), p2:(AND (EQ s1 1) (EQ s5 1) (EQ s24 1) (EQ s39 1)), p0:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-05 finished in 993 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((X(p1)||p0))||G(p2)))))'
Support contains 7 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 44 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 44 transition count 107
Applied a total of 6 rules in 4 ms. Remains 44 /47 variables (removed 3) and now considering 107/118 (removed 11) transitions.
// Phase 1: matrix 107 rows 44 cols
[2023-03-12 16:06:49] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 16:06:50] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-12 16:06:50] [INFO ] Invariant cache hit.
[2023-03-12 16:06:50] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-12 16:06:50] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-12 16:06:50] [INFO ] Invariant cache hit.
[2023-03-12 16:06:50] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 44/47 places, 107/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 337 ms. Remains : 44/47 places, 107/118 transitions.
Stuttering acceptance computed with spot in 514 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=(NOT p2), acceptance={} source=7 dest: 0}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=5, aps=[p1:(OR (EQ s1 0) (EQ s7 0) (EQ s17 0) (EQ s39 0)), p0:(OR (EQ s1 0) (EQ s2 0) (EQ s10 0) (EQ s39 0)), p2:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 29 reset in 170 ms.
Product exploration explored 100000 steps with 13 reset in 125 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 : [(AND p1 p0 (NOT p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 350 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 532 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 578 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 16:06:52] [INFO ] Invariant cache hit.
[2023-03-12 16:06:52] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:06:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 16:06:52] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (AND p1 p0 p2)), (F (NOT (AND p1 p0 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p1) p2)), (F (AND p0 p2)), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 7 factoid took 940 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 300 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 44 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 107/107 transitions.
Applied a total of 0 rules in 5 ms. Remains 44 /44 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2023-03-12 16:06:53] [INFO ] Invariant cache hit.
[2023-03-12 16:06:53] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-12 16:06:53] [INFO ] Invariant cache hit.
[2023-03-12 16:06:54] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-12 16:06:54] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-12 16:06:54] [INFO ] Invariant cache hit.
[2023-03-12 16:06:54] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 358 ms. Remains : 44/44 places, 107/107 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 95 steps, including 4 resets, run visited all 4 properties in 5 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 2 factoid took 277 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 272 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 292 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1 reset in 100 ms.
Product exploration explored 100000 steps with 0 reset in 165 ms.
Support contains 6 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 107/107 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2023-03-12 16:06:56] [INFO ] Invariant cache hit.
[2023-03-12 16:06:56] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-12 16:06:56] [INFO ] Invariant cache hit.
[2023-03-12 16:06:56] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-12 16:06:56] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2023-03-12 16:06:56] [INFO ] Invariant cache hit.
[2023-03-12 16:06:57] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 636 ms. Remains : 44/44 places, 107/107 transitions.
Treatment of property AutonomousCar-PT-04a-LTLFireability-07 finished in 7138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((X(p2)&&p1))))))'
Support contains 8 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 97
Applied a total of 10 rules in 2 ms. Remains 42 /47 variables (removed 5) and now considering 97/118 (removed 21) transitions.
// Phase 1: matrix 97 rows 42 cols
[2023-03-12 16:06:57] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 16:06:57] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-12 16:06:57] [INFO ] Invariant cache hit.
[2023-03-12 16:06:57] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-12 16:06:57] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2023-03-12 16:06:57] [INFO ] Invariant cache hit.
[2023-03-12 16:06:57] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/47 places, 97/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 569 ms. Remains : 42/47 places, 97/118 transitions.
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1 1) (EQ s6 1) (EQ s12 1) (EQ s37 1)), p1:(AND (EQ s1 1) (EQ s5 1) (EQ s30 1) (EQ s37 1)), p2:(AND (EQ s1 1) (EQ s2 1) (EQ s20 1) (EQ s37 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-09 finished in 801 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 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 45 transition count 113
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 41 transition count 111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 39 transition count 111
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 13 place count 39 transition count 110
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 15 place count 38 transition count 110
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 20 place count 33 transition count 89
Iterating global reduction 3 with 5 rules applied. Total rules applied 25 place count 33 transition count 89
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 3 with 4 rules applied. Total rules applied 29 place count 31 transition count 87
Applied a total of 29 rules in 16 ms. Remains 31 /47 variables (removed 16) and now considering 87/118 (removed 31) transitions.
// Phase 1: matrix 87 rows 31 cols
[2023-03-12 16:06:57] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 16:06:57] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-12 16:06:58] [INFO ] Invariant cache hit.
[2023-03-12 16:06:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:06:58] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-12 16:06:58] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 16:06:58] [INFO ] Invariant cache hit.
[2023-03-12 16:06:58] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/47 places, 87/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 309 ms. Remains : 31/47 places, 87/118 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s18 1), p1:(EQ s26 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 26 reset in 103 ms.
Product exploration explored 100000 steps with 7 reset in 100 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 7 factoid took 598 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 5285 steps, including 431 resets, run visited all 4 properties in 31 ms. (steps per millisecond=170 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 640 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1))]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 87/87 transitions.
Applied a total of 0 rules in 7 ms. Remains 31 /31 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2023-03-12 16:06:59] [INFO ] Invariant cache hit.
[2023-03-12 16:07:00] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-12 16:07:00] [INFO ] Invariant cache hit.
[2023-03-12 16:07:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:07:00] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-12 16:07:00] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 16:07:00] [INFO ] Invariant cache hit.
[2023-03-12 16:07:00] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 295 ms. Remains : 31/31 places, 87/87 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 7 factoid took 404 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 2646 steps, including 224 resets, run visited all 4 properties in 16 ms. (steps per millisecond=165 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 658 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7 reset in 143 ms.
Product exploration explored 100000 steps with 0 reset in 124 ms.
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 87/87 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2023-03-12 16:07:01] [INFO ] Invariant cache hit.
[2023-03-12 16:07:02] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-12 16:07:02] [INFO ] Invariant cache hit.
[2023-03-12 16:07:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:07:02] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-12 16:07:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 16:07:02] [INFO ] Invariant cache hit.
[2023-03-12 16:07:02] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 284 ms. Remains : 31/31 places, 87/87 transitions.
Treatment of property AutonomousCar-PT-04a-LTLFireability-11 finished in 4345 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((F(p0) U X(p1)))))'
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 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 6 rules applied. Total rules applied 6 place count 45 transition count 112
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 40 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 40 transition count 111
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 13 place count 39 transition count 111
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 17 place count 35 transition count 95
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 35 transition count 95
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 25 place count 33 transition count 93
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 27 place count 32 transition count 93
Applied a total of 27 rules in 15 ms. Remains 32 /47 variables (removed 15) and now considering 93/118 (removed 25) transitions.
// Phase 1: matrix 93 rows 32 cols
[2023-03-12 16:07:02] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 16:07:02] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-12 16:07:02] [INFO ] Invariant cache hit.
[2023-03-12 16:07:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:07:02] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-12 16:07:02] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-12 16:07:02] [INFO ] Invariant cache hit.
[2023-03-12 16:07:02] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/47 places, 93/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 190 ms. Remains : 32/47 places, 93/118 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s16 1), p1:(EQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 122 steps with 24 reset in 1 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-12 finished in 404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(!p0))||(G((p1&&F(!p2)))&&X(F(!p0)))))))'
Support contains 10 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 97
Applied a total of 10 rules in 3 ms. Remains 42 /47 variables (removed 5) and now considering 97/118 (removed 21) transitions.
// Phase 1: matrix 97 rows 42 cols
[2023-03-12 16:07:02] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-12 16:07:02] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-12 16:07:02] [INFO ] Invariant cache hit.
[2023-03-12 16:07:02] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-12 16:07:02] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2023-03-12 16:07:02] [INFO ] Invariant cache hit.
[2023-03-12 16:07:02] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/47 places, 97/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 240 ms. Remains : 42/47 places, 97/118 transitions.
Stuttering acceptance computed with spot in 354 ms :[p0, p0, p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 p2)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(OR p0 p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s9 1), p0:(AND (EQ s1 1) (EQ s7 1) (EQ s30 1) (EQ s37 1)), p2:(AND (EQ s13 1) (EQ s19 1) (EQ s23 1) (EQ s29 1) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 133 ms.
Product exploration explored 100000 steps with 13 reset in 103 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 : [(AND p1 (NOT p0) (NOT p2)), (X p1), (X (OR p0 p1)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR p0 p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 591 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 361 ms :[p0, p0, p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 p2)]
Incomplete random walk after 10000 steps, including 530 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10000 steps, including 113 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 16:07:04] [INFO ] Invariant cache hit.
[2023-03-12 16:07:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 16:07:04] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X p1), (X (OR p0 p1)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR p0 p1))), (X (X (NOT p0))), (G (NOT (AND p1 p2 p0))), (G (NOT (AND p2 p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F p0), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 10 factoid took 634 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 266 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Support contains 5 out of 42 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-12 16:07:05] [INFO ] Invariant cache hit.
[2023-03-12 16:07:05] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-12 16:07:05] [INFO ] Invariant cache hit.
[2023-03-12 16:07:06] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-12 16:07:06] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2023-03-12 16:07:06] [INFO ] Invariant cache hit.
[2023-03-12 16:07:06] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 273 ms. Remains : 42/42 places, 97/97 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (OR p1 p0)), (X (X p1)), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 430 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Finished random walk after 1586 steps, including 93 resets, run visited all 4 properties in 6 ms. (steps per millisecond=264 )
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (OR p1 p0)), (X (X p1)), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F p0), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 7 factoid took 426 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 213 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 278 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 8 reset in 91 ms.
Product exploration explored 100000 steps with 7 reset in 64 ms.
Applying partial POR strategy [false, false, true, false]
Stuttering acceptance computed with spot in 221 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Support contains 5 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 97/97 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 42 transition count 97
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 42 transition count 99
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 42 transition count 99
Performed 2 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 2 rules applied. Total rules applied 8 place count 42 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 41 transition count 98
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 41 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 41 transition count 101
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 11 rules in 13 ms. Remains 41 /42 variables (removed 1) and now considering 101/97 (removed -4) transitions.
[2023-03-12 16:07:08] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 101 rows 41 cols
[2023-03-12 16:07:08] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 16:07:08] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/42 places, 101/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 41/42 places, 101/97 transitions.
Support contains 5 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 42 cols
[2023-03-12 16:07:08] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 16:07:08] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-12 16:07:08] [INFO ] Invariant cache hit.
[2023-03-12 16:07:08] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-12 16:07:08] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-12 16:07:08] [INFO ] Invariant cache hit.
[2023-03-12 16:07:08] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 42/42 places, 97/97 transitions.
Treatment of property AutonomousCar-PT-04a-LTLFireability-13 finished in 6217 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 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 118/118 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 47 transition count 113
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 42 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 41 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 41 transition count 111
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 40 transition count 111
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 19 place count 35 transition count 90
Iterating global reduction 3 with 5 rules applied. Total rules applied 24 place count 35 transition count 90
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 3 with 4 rules applied. Total rules applied 28 place count 33 transition count 88
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 30 place count 32 transition count 88
Applied a total of 30 rules in 10 ms. Remains 32 /47 variables (removed 15) and now considering 88/118 (removed 30) transitions.
// Phase 1: matrix 88 rows 32 cols
[2023-03-12 16:07:08] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 16:07:08] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-12 16:07:08] [INFO ] Invariant cache hit.
[2023-03-12 16:07:09] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-12 16:07:09] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-12 16:07:09] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-12 16:07:09] [INFO ] Invariant cache hit.
[2023-03-12 16:07:09] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/47 places, 88/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 309 ms. Remains : 32/47 places, 88/118 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s6 0) (EQ s10 0) (EQ s28 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10 reset in 99 ms.
Product exploration explored 100000 steps with 18 reset in 67 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Finished random walk after 29 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 232 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 88/88 transitions.
Applied a total of 0 rules in 10 ms. Remains 32 /32 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-12 16:07:10] [INFO ] Invariant cache hit.
[2023-03-12 16:07:10] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-12 16:07:10] [INFO ] Invariant cache hit.
[2023-03-12 16:07:10] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-12 16:07:10] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2023-03-12 16:07:10] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-12 16:07:10] [INFO ] Invariant cache hit.
[2023-03-12 16:07:10] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 437 ms. Remains : 32/32 places, 88/88 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 16 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 228 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 94 ms.
Product exploration explored 100000 steps with 17 reset in 69 ms.
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-12 16:07:11] [INFO ] Invariant cache hit.
[2023-03-12 16:07:11] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-12 16:07:11] [INFO ] Invariant cache hit.
[2023-03-12 16:07:11] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-12 16:07:11] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2023-03-12 16:07:11] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-12 16:07:11] [INFO ] Invariant cache hit.
[2023-03-12 16:07:11] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 390 ms. Remains : 32/32 places, 88/88 transitions.
Treatment of property AutonomousCar-PT-04a-LTLFireability-14 finished in 2805 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 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 47 transition count 112
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 41 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 41 transition count 111
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 14 place count 40 transition count 111
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 36 transition count 95
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 36 transition count 95
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 35 transition count 94
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 34 transition count 94
Applied a total of 26 rules in 21 ms. Remains 34 /47 variables (removed 13) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 34 cols
[2023-03-12 16:07:11] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 16:07:11] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-12 16:07:11] [INFO ] Invariant cache hit.
[2023-03-12 16:07:11] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-12 16:07:11] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-12 16:07:11] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-12 16:07:11] [INFO ] Invariant cache hit.
[2023-03-12 16:07:12] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/47 places, 94/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 355 ms. Remains : 34/47 places, 94/118 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-15 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 s2 1) (EQ s19 1) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-15 finished in 423 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((X(p1)||p0))||G(p2)))))'
Found a Lengthening insensitive property : AutonomousCar-PT-04a-LTLFireability-07
Stuttering acceptance computed with spot in 459 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2)]
Support contains 7 out of 47 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 47/47 places, 118/118 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 47 transition count 113
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 42 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 41 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 41 transition count 111
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 14 place count 40 transition count 111
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 17 place count 37 transition count 100
Iterating global reduction 3 with 3 rules applied. Total rules applied 20 place count 37 transition count 100
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 22 place count 36 transition count 99
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 24 place count 35 transition count 99
Applied a total of 24 rules in 19 ms. Remains 35 /47 variables (removed 12) and now considering 99/118 (removed 19) transitions.
// Phase 1: matrix 99 rows 35 cols
[2023-03-12 16:07:12] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 16:07:12] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-12 16:07:12] [INFO ] Invariant cache hit.
[2023-03-12 16:07:12] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-12 16:07:12] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2023-03-12 16:07:12] [INFO ] Invariant cache hit.
[2023-03-12 16:07:12] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 35/47 places, 99/118 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 303 ms. Remains : 35/47 places, 99/118 transitions.
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=(NOT p2), acceptance={} source=7 dest: 0}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=5, aps=[p1:(OR (EQ s1 0) (EQ s7 0) (EQ s15 0) (EQ s31 0)), p0:(OR (EQ s1 0) (EQ s2 0) (EQ s9 0) (EQ s31 0)), p2:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22 reset in 69 ms.
Product exploration explored 100000 steps with 2 reset in 106 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 p1 p0 (NOT p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 371 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 483 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 760 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 109 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 16:07:14] [INFO ] Invariant cache hit.
[2023-03-12 16:07:14] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:07:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 16:07:14] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (AND p1 p0 p2)), (F (NOT (AND p1 p0 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p1) p2)), (F (AND p0 p2)), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 7 factoid took 837 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 316 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 35 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-12 16:07:15] [INFO ] Invariant cache hit.
[2023-03-12 16:07:15] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-12 16:07:15] [INFO ] Invariant cache hit.
[2023-03-12 16:07:15] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-12 16:07:15] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-12 16:07:15] [INFO ] Invariant cache hit.
[2023-03-12 16:07:16] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 403 ms. Remains : 35/35 places, 99/99 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 p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 957 steps, including 74 resets, run visited all 4 properties in 18 ms. (steps per millisecond=53 )
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 2 factoid took 226 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 322 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 333 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 11 reset in 128 ms.
Product exploration explored 100000 steps with 24 reset in 59 ms.
Support contains 6 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-12 16:07:18] [INFO ] Invariant cache hit.
[2023-03-12 16:07:18] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-12 16:07:18] [INFO ] Invariant cache hit.
[2023-03-12 16:07:18] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-12 16:07:18] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2023-03-12 16:07:18] [INFO ] Invariant cache hit.
[2023-03-12 16:07:18] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 303 ms. Remains : 35/35 places, 99/99 transitions.
Treatment of property AutonomousCar-PT-04a-LTLFireability-07 finished in 6282 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' '!(X(F((G(F(!p0))||(G((p1&&F(!p2)))&&X(F(!p0)))))))'
Found a Shortening insensitive property : AutonomousCar-PT-04a-LTLFireability-13
Stuttering acceptance computed with spot in 333 ms :[p0, p0, p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 p2)]
Support contains 10 out of 47 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 116
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 45 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 44 transition count 115
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 44 transition count 113
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 10 place count 42 transition count 113
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 15 place count 37 transition count 92
Iterating global reduction 3 with 5 rules applied. Total rules applied 20 place count 37 transition count 92
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 22 place count 36 transition count 91
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 24 place count 35 transition count 91
Applied a total of 24 rules in 21 ms. Remains 35 /47 variables (removed 12) and now considering 91/118 (removed 27) transitions.
// Phase 1: matrix 91 rows 35 cols
[2023-03-12 16:07:18] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 16:07:18] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-12 16:07:18] [INFO ] Invariant cache hit.
[2023-03-12 16:07:18] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-12 16:07:19] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-12 16:07:19] [INFO ] Invariant cache hit.
[2023-03-12 16:07:19] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 35/47 places, 91/118 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 289 ms. Remains : 35/47 places, 91/118 transitions.
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(OR p0 p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s8 1), p0:(AND (EQ s1 1) (EQ s6 1) (EQ s26 1) (EQ s31 1)), p2:(AND (EQ s12 1) (EQ s17 1) (EQ s20 1) (EQ s25 1) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 23 reset in 84 ms.
Product exploration explored 100000 steps with 1 reset in 61 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X p1), (X (OR p0 p1)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR p0 p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 574 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 345 ms :[p0, p0, p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 p2)]
Incomplete random walk after 10000 steps, including 669 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 106 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 16:07:20] [INFO ] Invariant cache hit.
[2023-03-12 16:07:20] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 16:07:20] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X p1), (X (OR p0 p1)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR p0 p1))), (X (X (NOT p0))), (G (NOT (AND p1 p2 p0))), (G (NOT (AND p2 p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F p0), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 10 factoid took 589 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 269 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Support contains 5 out of 35 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-12 16:07:21] [INFO ] Invariant cache hit.
[2023-03-12 16:07:21] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-12 16:07:21] [INFO ] Invariant cache hit.
[2023-03-12 16:07:21] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-12 16:07:21] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-12 16:07:21] [INFO ] Invariant cache hit.
[2023-03-12 16:07:21] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 284 ms. Remains : 35/35 places, 91/91 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (OR p1 p0)), (X (X p1)), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 497 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Finished random walk after 2543 steps, including 159 resets, run visited all 4 properties in 15 ms. (steps per millisecond=169 )
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (OR p1 p0)), (X (X p1)), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F p0), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 7 factoid took 626 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 259 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 256 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 20 reset in 91 ms.
Product exploration explored 100000 steps with 11 reset in 102 ms.
Applying partial POR strategy [false, false, true, false]
Stuttering acceptance computed with spot in 243 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Support contains 5 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 91/91 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 91
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 14 ms. Remains 35 /35 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-12 16:07:24] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 91 rows 35 cols
[2023-03-12 16:07:24] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-12 16:07:24] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/35 places, 91/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 192 ms. Remains : 35/35 places, 91/91 transitions.
Support contains 5 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 91/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 91/91 (removed 0) transitions.
// Phase 1: matrix 91 rows 35 cols
[2023-03-12 16:07:24] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-12 16:07:24] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-12 16:07:24] [INFO ] Invariant cache hit.
[2023-03-12 16:07:24] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-12 16:07:25] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2023-03-12 16:07:25] [INFO ] Invariant cache hit.
[2023-03-12 16:07:25] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 348 ms. Remains : 35/35 places, 91/91 transitions.
Treatment of property AutonomousCar-PT-04a-LTLFireability-13 finished in 6830 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)))'
[2023-03-12 16:07:25] [INFO ] Flatten gal took : 37 ms
[2023-03-12 16:07:25] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 14 ms.
[2023-03-12 16:07:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 47 places, 118 transitions and 765 arcs took 6 ms.
Total runtime 41131 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2283/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2283/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2283/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2283/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutonomousCar-PT-04a-LTLFireability-07
Could not compute solution for formula : AutonomousCar-PT-04a-LTLFireability-11
Could not compute solution for formula : AutonomousCar-PT-04a-LTLFireability-13
Could not compute solution for formula : AutonomousCar-PT-04a-LTLFireability-14

BK_STOP 1678637246275

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name AutonomousCar-PT-04a-LTLFireability-07
ltl formula formula --ltl=/tmp/2283/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 47 places, 118 transitions and 765 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2283/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2283/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2283/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2283/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name AutonomousCar-PT-04a-LTLFireability-11
ltl formula formula --ltl=/tmp/2283/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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 47 places, 118 transitions and 765 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.020 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2283/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2283/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2283/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2283/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-04a-LTLFireability-13
ltl formula formula --ltl=/tmp/2283/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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 47 places, 118 transitions and 765 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.020 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2283/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2283/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2283/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2283/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 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-04a-LTLFireability-14
ltl formula formula --ltl=/tmp/2283/ltl_3_
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
pnml2lts-mc( 0/ 4): Petri net has 47 places, 118 transitions and 765 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
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.030 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2283/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2283/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2283/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2283/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-04a"
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-04a, 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-167813598100580"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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