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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 12:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 42K 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-03a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678636782038

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-03a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 15:59:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 15:59:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 15:59:45] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-12 15:59:45] [INFO ] Transformed 41 places.
[2023-03-12 15:59:45] [INFO ] Transformed 121 transitions.
[2023-03-12 15:59:45] [INFO ] Found NUPN structural information;
[2023-03-12 15:59:45] [INFO ] Parsed PT model containing 41 places and 121 transitions and 745 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA AutonomousCar-PT-03a-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 76/76 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 40 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 40 transition count 75
Applied a total of 2 rules in 37 ms. Remains 40 /41 variables (removed 1) and now considering 75/76 (removed 1) transitions.
// Phase 1: matrix 75 rows 40 cols
[2023-03-12 15:59:45] [INFO ] Computed 7 place invariants in 5 ms
[2023-03-12 15:59:46] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-12 15:59:46] [INFO ] Invariant cache hit.
[2023-03-12 15:59:46] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-12 15:59:46] [INFO ] Implicit Places using invariants and state equation in 275 ms returned [36, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 635 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 38/41 places, 75/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 673 ms. Remains : 38/41 places, 75/76 transitions.
Support contains 26 out of 38 places after structural reductions.
[2023-03-12 15:59:46] [INFO ] Flatten gal took : 29 ms
[2023-03-12 15:59:46] [INFO ] Flatten gal took : 13 ms
[2023-03-12 15:59:46] [INFO ] Input system was already deterministic with 75 transitions.
Incomplete random walk after 10000 steps, including 572 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 23) seen :21
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 75 rows 38 cols
[2023-03-12 15:59:47] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 15:59:47] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 15:59:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 15:59:47] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 15:59:47] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-12 15:59:47] [INFO ] After 10ms SMT Verify possible using 39 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 15:59:47] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-12 15:59:47] [INFO ] After 169ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 75/75 transitions.
Graph (complete) has 182 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 37 transition count 67
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 32 transition count 67
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 29 transition count 55
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 29 transition count 55
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 25 place count 26 transition count 52
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 26 transition count 49
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 40 place count 23 transition count 40
Applied a total of 40 rules in 16 ms. Remains 23 /38 variables (removed 15) and now considering 40/75 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 23/38 places, 40/75 transitions.
Finished random walk after 1233 steps, including 39 resets, run visited all 1 properties in 7 ms. (steps per millisecond=176 )
FORMULA AutonomousCar-PT-03a-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 3 stabilizing places and 2 stable transitions
FORMULA AutonomousCar-PT-03a-LTLFireability-14 FALSE 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' '!(F(p0))'
Support contains 1 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 75/75 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 36 transition count 70
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 32 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 31 transition count 69
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 31 transition count 68
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 13 place count 30 transition count 68
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 16 place count 27 transition count 56
Iterating global reduction 3 with 3 rules applied. Total rules applied 19 place count 27 transition count 56
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 23 place count 25 transition count 54
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 25 place count 24 transition count 54
Applied a total of 25 rules in 29 ms. Remains 24 /38 variables (removed 14) and now considering 54/75 (removed 21) transitions.
// Phase 1: matrix 54 rows 24 cols
[2023-03-12 15:59:47] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-12 15:59:48] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-12 15:59:48] [INFO ] Invariant cache hit.
[2023-03-12 15:59:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 15:59:48] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-12 15:59:48] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-12 15:59:48] [INFO ] Invariant cache hit.
[2023-03-12 15:59:48] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/38 places, 54/75 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 422 ms. Remains : 24/38 places, 54/75 transitions.
Stuttering acceptance computed with spot in 313 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 368 ms.
Product exploration explored 100000 steps with 50000 reset in 161 ms.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-03a-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-03a-LTLFireability-00 finished in 1496 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 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 75/75 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 4 rules applied. Total rules applied 4 place count 38 transition count 71
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 34 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 33 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 33 transition count 69
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 12 place count 32 transition count 69
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 15 place count 29 transition count 57
Iterating global reduction 3 with 3 rules applied. Total rules applied 18 place count 29 transition count 57
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 22 place count 27 transition count 55
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 26 transition count 55
Applied a total of 24 rules in 12 ms. Remains 26 /38 variables (removed 12) and now considering 55/75 (removed 20) transitions.
// Phase 1: matrix 55 rows 26 cols
[2023-03-12 15:59:49] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 15:59:49] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-12 15:59:49] [INFO ] Invariant cache hit.
[2023-03-12 15:59:49] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-12 15:59:49] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2023-03-12 15:59:49] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-12 15:59:49] [INFO ] Invariant cache hit.
[2023-03-12 15:59:49] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/38 places, 55/75 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 602 ms. Remains : 26/38 places, 55/75 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s1 1) (NEQ s5 1) (NEQ s14 1) (NEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4 reset in 142 ms.
Product exploration explored 100000 steps with 2 reset in 115 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 199 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0)]
Finished random walk after 24 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 305 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 55/55 transitions.
Applied a total of 0 rules in 5 ms. Remains 26 /26 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2023-03-12 15:59:51] [INFO ] Invariant cache hit.
[2023-03-12 15:59:51] [INFO ] Implicit Places using invariants in 592 ms returned []
[2023-03-12 15:59:51] [INFO ] Invariant cache hit.
[2023-03-12 15:59:52] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-12 15:59:52] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
[2023-03-12 15:59:52] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-12 15:59:52] [INFO ] Invariant cache hit.
[2023-03-12 15:59:52] [INFO ] Dead Transitions using invariants and state equation in 742 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1486 ms. Remains : 26/26 places, 55/55 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 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0)]
Finished random walk after 121 steps, including 5 resets, run visited all 1 properties in 15 ms. (steps per millisecond=8 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10 reset in 127 ms.
Product exploration explored 100000 steps with 13 reset in 61 ms.
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 55/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2023-03-12 15:59:54] [INFO ] Invariant cache hit.
[2023-03-12 15:59:54] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-12 15:59:54] [INFO ] Invariant cache hit.
[2023-03-12 15:59:54] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-12 15:59:54] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
[2023-03-12 15:59:54] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-12 15:59:54] [INFO ] Invariant cache hit.
[2023-03-12 15:59:54] [INFO ] Dead Transitions using invariants and state equation in 448 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 915 ms. Remains : 26/26 places, 55/55 transitions.
Treatment of property AutonomousCar-PT-03a-LTLFireability-02 finished in 5668 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(F((!p1 U (p2||G(!p1))))))))'
Support contains 8 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 75/75 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 4 rules applied. Total rules applied 4 place count 38 transition count 71
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 34 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 34 transition count 70
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 10 place count 33 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 32 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 32 transition count 66
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 14 place count 31 transition count 65
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 16 place count 30 transition count 65
Applied a total of 16 rules in 8 ms. Remains 30 /38 variables (removed 8) and now considering 65/75 (removed 10) transitions.
// Phase 1: matrix 65 rows 30 cols
[2023-03-12 15:59:55] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 15:59:55] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-12 15:59:55] [INFO ] Invariant cache hit.
[2023-03-12 15:59:55] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-12 15:59:55] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-12 15:59:55] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-12 15:59:55] [INFO ] Invariant cache hit.
[2023-03-12 15:59:55] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/38 places, 65/75 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 351 ms. Remains : 30/38 places, 65/75 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s1 1) (EQ s5 1) (EQ s22 1) (EQ s26 1))) (NOT (AND (EQ s1 1) (EQ s2 1) (EQ s16 1) (EQ s26 1)))), p1:(AND (EQ s1 1) (EQ s2 1) (EQ s16 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12 reset in 187 ms.
Product exploration explored 100000 steps with 1 reset in 159 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 p2 (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 522 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 754 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 157 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 153 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 15:59:56] [INFO ] Invariant cache hit.
[2023-03-12 15:59:56] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 15:59:56] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-12 15:59:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-12 15:59:57] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 15:59:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-12 15:59:57] [INFO ] After 15ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 15:59:57] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-12 15:59:57] [INFO ] After 149ms 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 0 ms.
Support contains 8 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 65/65 transitions.
Graph (complete) has 174 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 29 transition count 62
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 29 transition count 60
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 27 transition count 54
Applied a total of 13 rules in 5 ms. Remains 27 /30 variables (removed 3) and now considering 54/65 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 27/30 places, 54/65 transitions.
Incomplete random walk after 10000 steps, including 480 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 154 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4541 steps, run visited all 1 properties in 24 ms. (steps per millisecond=189 )
Probabilistic random walk after 4541 steps, saw 1225 distinct states, run finished after 24 ms. (steps per millisecond=189 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 10 factoid took 914 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 131 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 6 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-12 15:59:58] [INFO ] Invariant cache hit.
[2023-03-12 15:59:58] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-12 15:59:58] [INFO ] Invariant cache hit.
[2023-03-12 15:59:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-12 15:59:58] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2023-03-12 15:59:58] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-12 15:59:58] [INFO ] Invariant cache hit.
[2023-03-12 15:59:59] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 929 ms. Remains : 30/30 places, 65/65 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 (NOT p1) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 257 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Finished random walk after 616 steps, including 35 resets, run visited all 2 properties in 10 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 331 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 154 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 212 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 3 reset in 137 ms.
Product exploration explored 100000 steps with 0 reset in 140 ms.
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 65/65 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 29 transition count 64
Applied a total of 2 rules in 43 ms. Remains 29 /30 variables (removed 1) and now considering 64/65 (removed 1) transitions.
// Phase 1: matrix 64 rows 29 cols
[2023-03-12 16:00:00] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 16:00:01] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-12 16:00:01] [INFO ] Invariant cache hit.
[2023-03-12 16:00:01] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-12 16:00:01] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2023-03-12 16:00:01] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-12 16:00:01] [INFO ] Invariant cache hit.
[2023-03-12 16:00:01] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/30 places, 64/65 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 791 ms. Remains : 29/30 places, 64/65 transitions.
Treatment of property AutonomousCar-PT-03a-LTLFireability-04 finished in 6637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(X(F(p1))||G(p2))))'
Support contains 9 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 36 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 36 transition count 67
Applied a total of 4 rules in 3 ms. Remains 36 /38 variables (removed 2) and now considering 67/75 (removed 8) transitions.
// Phase 1: matrix 67 rows 36 cols
[2023-03-12 16:00:01] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 16:00:01] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-12 16:00:01] [INFO ] Invariant cache hit.
[2023-03-12 16:00:01] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-12 16:00:01] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2023-03-12 16:00:01] [INFO ] Invariant cache hit.
[2023-03-12 16:00:02] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/38 places, 67/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 716 ms. Remains : 36/38 places, 67/75 transitions.
Stuttering acceptance computed with spot in 389 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (OR (EQ s11 1) (AND (EQ s1 1) (EQ s4 1) (EQ s31 1) (EQ s34 1))) (EQ s1 1) (EQ s5 1) (EQ s15 1) (EQ s31 1)), p0:(AND (EQ s1 1) (EQ s6 1) (EQ s17 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 2 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-05 finished in 1132 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' '!((p0 U (F(G(!p0))||(X(!p1) U ((X(!p1)&&G(p2))||X(G(!p1)))))))'
Support contains 7 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 37 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 37 transition count 71
Applied a total of 2 rules in 1 ms. Remains 37 /38 variables (removed 1) and now considering 71/75 (removed 4) transitions.
// Phase 1: matrix 71 rows 37 cols
[2023-03-12 16:00:02] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 16:00:02] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-12 16:00:02] [INFO ] Invariant cache hit.
[2023-03-12 16:00:03] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-12 16:00:03] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-12 16:00:03] [INFO ] Invariant cache hit.
[2023-03-12 16:00:03] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 37/38 places, 71/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 371 ms. Remains : 37/38 places, 71/75 transitions.
Stuttering acceptance computed with spot in 625 ms :[(AND p1 p0), (AND p0 p1), (AND p1 p0 (NOT p2)), (AND p0 p1), (AND p0 p1), (AND p1 p0 (NOT p2)), p0, (AND p0 p1 (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1, 2} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={2} source=1 dest: 2}, { cond=(AND p0 p2 p1), acceptance={0, 2} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1, 2} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={2} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={0, 2} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 p1), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1, 2} source=3 dest: 4}, { cond=(AND p0 p2 p1), acceptance={0, 2} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 p2 p1), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1, 2} source=4 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 p2 p1), acceptance={0, 2} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1, 2} source=5 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p2 p1), acceptance={0, 2} source=5 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={1, 2} source=6 dest: 6}, { cond=p0, acceptance={0, 1, 2} source=6 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 6}, { cond=(AND p2 p1), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 8}]], initial=4, aps=[p1:(AND (EQ s1 1) (EQ s6 1) (EQ s11 1) (EQ s32 1)), p0:(AND (EQ s1 1) (EQ s5 1) (EQ s24 1) (EQ s32 1)), p2:(NEQ s22 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10447 reset in 92 ms.
Product exploration explored 100000 steps with 33454 reset in 252 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 (NOT p1) (NOT p0) p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 32 factoid took 3346 ms. Reduced automaton from 9 states, 49 edges and 3 AP (stutter sensitive) to 7 states, 27 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 470 ms :[(AND p1 p0), (AND p0 p1), (AND p1 p0 (NOT p2)), (AND p1 p0 (NOT p2)), p0, (AND p0 p1 (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 586 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 137 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 122 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 121 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 16:00:08] [INFO ] Invariant cache hit.
[2023-03-12 16:00:08] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 16:00:08] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-12 16:00:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 16:00:08] [INFO ] After 21ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p1))), (G (NOT (AND p0 p2 p1))), (G (NOT (AND p0 (NOT p2) p1))), (G (NOT (AND p0 (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p2 p1)), (F (NOT p2)), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (AND p0 p2 (NOT p1))), (F (AND p2 p1)), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F p1), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p2) p1)), (F p0)]
Knowledge based reduction with 35 factoid took 4156 ms. Reduced automaton from 7 states, 27 edges and 3 AP (stutter sensitive) to 7 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 538 ms :[false, (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p2), false, false]
Stuttering acceptance computed with spot in 561 ms :[false, (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p2), false, false]
Support contains 7 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 71/71 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2023-03-12 16:00:13] [INFO ] Invariant cache hit.
[2023-03-12 16:00:13] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-12 16:00:13] [INFO ] Invariant cache hit.
[2023-03-12 16:00:13] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-12 16:00:14] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2023-03-12 16:00:14] [INFO ] Invariant cache hit.
[2023-03-12 16:00:14] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 669 ms. Remains : 37/37 places, 71/71 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 (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p1 p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 1985 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter sensitive) to 7 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 424 ms :[false, (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p2), false, false]
Incomplete random walk after 10000 steps, including 593 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 10000 steps, including 144 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 123 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 16:00:16] [INFO ] Invariant cache hit.
[2023-03-12 16:00:16] [INFO ] [Real]Absence check using 5 positive place invariants in 39 ms returned sat
[2023-03-12 16:00:16] [INFO ] After 135ms 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 (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p1 p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (G (NOT (AND p0 p1))), (G (OR p2 (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (NOT p2)), (F (NOT (AND p2 (NOT p0) (NOT p1)))), (F (AND (NOT p2) p1)), (F (NOT (AND p2 (NOT p1)))), (F (AND p2 (NOT p0) p1)), (F (AND p2 p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p2) (NOT p1))), (F (AND p2 p0)), (F p0)]
Knowledge based reduction with 22 factoid took 2621 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter sensitive) to 7 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 598 ms :[(AND p1 p0), (AND p0 p1), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), p0, (AND p0 p1 (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 610 ms :[(AND p1 p0), (AND p0 p1), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), p0, (AND p0 p1 (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 524 ms :[(AND p1 p0), (AND p0 p1), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), p0, (AND p0 p1 (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 22098 reset in 194 ms.
Product exploration explored 100000 steps with 4535 reset in 76 ms.
Applying partial POR strategy [true, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 579 ms :[(AND p1 p0), (AND p0 p1), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), p0, (AND p0 p1 (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Support contains 7 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 71/71 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 37 transition count 71
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 37 transition count 73
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 37 transition count 73
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 37 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 36 transition count 72
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 36 transition count 72
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 36 transition count 75
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 11 rules in 8 ms. Remains 36 /37 variables (removed 1) and now considering 75/71 (removed -4) transitions.
[2023-03-12 16:00:22] [INFO ] Redundant transitions in 107 ms returned []
// Phase 1: matrix 75 rows 36 cols
[2023-03-12 16:00:22] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 16:00:23] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/37 places, 75/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 493 ms. Remains : 36/37 places, 75/71 transitions.
Support contains 7 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 71/71 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 71/71 (removed 0) transitions.
// Phase 1: matrix 71 rows 37 cols
[2023-03-12 16:00:23] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 16:00:23] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-12 16:00:23] [INFO ] Invariant cache hit.
[2023-03-12 16:00:23] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-12 16:00:23] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2023-03-12 16:00:23] [INFO ] Invariant cache hit.
[2023-03-12 16:00:23] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 377 ms. Remains : 37/37 places, 71/71 transitions.
Treatment of property AutonomousCar-PT-03a-LTLFireability-06 finished in 20639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0 U !p1)||G(p2)) U G(p1))))'
Support contains 10 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 37 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 37 transition count 71
Applied a total of 2 rules in 1 ms. Remains 37 /38 variables (removed 1) and now considering 71/75 (removed 4) transitions.
// Phase 1: matrix 71 rows 37 cols
[2023-03-12 16:00:23] [INFO ] Computed 5 place invariants in 14 ms
[2023-03-12 16:00:23] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-12 16:00:23] [INFO ] Invariant cache hit.
[2023-03-12 16:00:23] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-12 16:00:23] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-12 16:00:23] [INFO ] Invariant cache hit.
[2023-03-12 16:00:23] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 37/38 places, 71/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 207 ms. Remains : 37/38 places, 71/75 transitions.
Stuttering acceptance computed with spot in 450 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false, true, (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p1 p0) (AND p1 p2)), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 6}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s5 1) (EQ s16 1) (EQ s32 1)), p0:(AND (EQ s13 1) (EQ s20 1) (EQ s26 1) (EQ s33 1)), p2:(AND (EQ s1 1) (EQ s6 1) (EQ s9 1) (EQ s32 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-07 finished in 696 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(X(G(p0)))))'
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 35 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 35 transition count 63
Applied a total of 6 rules in 1 ms. Remains 35 /38 variables (removed 3) and now considering 63/75 (removed 12) transitions.
// Phase 1: matrix 63 rows 35 cols
[2023-03-12 16:00:24] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 16:00:24] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-12 16:00:24] [INFO ] Invariant cache hit.
[2023-03-12 16:00:24] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-12 16:00:24] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2023-03-12 16:00:24] [INFO ] Invariant cache hit.
[2023-03-12 16:00:24] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 35/38 places, 63/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 640 ms. Remains : 35/38 places, 63/75 transitions.
Stuttering acceptance computed with spot in 262 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s1 0) (EQ s5 0) (EQ s7 0) (EQ s30 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6 reset in 63 ms.
Product exploration explored 100000 steps with 2 reset in 82 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1318 steps, including 84 resets, run visited all 1 properties in 3 ms. (steps per millisecond=439 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 263 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-12 16:00:26] [INFO ] Invariant cache hit.
[2023-03-12 16:00:26] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-12 16:00:26] [INFO ] Invariant cache hit.
[2023-03-12 16:00:26] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-12 16:00:26] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-12 16:00:26] [INFO ] Invariant cache hit.
[2023-03-12 16:00:26] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 376 ms. Remains : 35/35 places, 63/63 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 201 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 513 steps, including 24 resets, run visited all 1 properties in 2 ms. (steps per millisecond=256 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 304 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 160 steps with 7 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-09 finished in 3999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 36 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 36 transition count 67
Applied a total of 4 rules in 2 ms. Remains 36 /38 variables (removed 2) and now considering 67/75 (removed 8) transitions.
// Phase 1: matrix 67 rows 36 cols
[2023-03-12 16:00:28] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 16:00:28] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-12 16:00:28] [INFO ] Invariant cache hit.
[2023-03-12 16:00:28] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-12 16:00:28] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-12 16:00:28] [INFO ] Invariant cache hit.
[2023-03-12 16:00:28] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/38 places, 67/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 417 ms. Remains : 36/38 places, 67/75 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s1 1) (NEQ s2 1) (NEQ s9 1) (NEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1 reset in 81 ms.
Product exploration explored 100000 steps with 1 reset in 61 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 255 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 106 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=106 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 227 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 36 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 67/67 transitions.
Applied a total of 0 rules in 0 ms. Remains 36 /36 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2023-03-12 16:00:29] [INFO ] Invariant cache hit.
[2023-03-12 16:00:29] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-12 16:00:29] [INFO ] Invariant cache hit.
[2023-03-12 16:00:29] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-12 16:00:29] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2023-03-12 16:00:29] [INFO ] Invariant cache hit.
[2023-03-12 16:00:30] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 892 ms. Remains : 36/36 places, 67/67 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 194 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 33 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 310 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 43 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-10 finished in 3548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U p1))))'
Support contains 5 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 36 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 36 transition count 67
Applied a total of 4 rules in 2 ms. Remains 36 /38 variables (removed 2) and now considering 67/75 (removed 8) transitions.
// Phase 1: matrix 67 rows 36 cols
[2023-03-12 16:00:31] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 16:00:31] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-12 16:00:31] [INFO ] Invariant cache hit.
[2023-03-12 16:00:32] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-12 16:00:32] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2023-03-12 16:00:32] [INFO ] Invariant cache hit.
[2023-03-12 16:00:32] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/38 places, 67/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 542 ms. Remains : 36/38 places, 67/75 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(AND (EQ s1 1) (EQ s5 1) (EQ s15 1) (EQ s31 1)), p0:(NEQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-12 finished in 709 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 5 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 38 transition count 72
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 35 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 34 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 34 transition count 70
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 10 place count 33 transition count 70
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 13 place count 30 transition count 58
Iterating global reduction 3 with 3 rules applied. Total rules applied 16 place count 30 transition count 58
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 20 place count 28 transition count 56
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 22 place count 27 transition count 56
Applied a total of 22 rules in 17 ms. Remains 27 /38 variables (removed 11) and now considering 56/75 (removed 19) transitions.
// Phase 1: matrix 56 rows 27 cols
[2023-03-12 16:00:32] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 16:00:32] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-12 16:00:32] [INFO ] Invariant cache hit.
[2023-03-12 16:00:32] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-12 16:00:32] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-12 16:00:32] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-12 16:00:32] [INFO ] Invariant cache hit.
[2023-03-12 16:00:32] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/38 places, 56/75 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 244 ms. Remains : 27/38 places, 56/75 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s4 1) (EQ s14 1) (EQ s23 1)), p1:(EQ s17 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-15 finished in 318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F((!p1 U (p2||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' '!((p0 U (F(G(!p0))||(X(!p1) U ((X(!p1)&&G(p2))||X(G(!p1)))))))'
[2023-03-12 16:00:33] [INFO ] Flatten gal took : 19 ms
[2023-03-12 16:00:33] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-12 16:00:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 38 places, 75 transitions and 430 arcs took 1 ms.
Total runtime 47914 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2093/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2093/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2093/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutonomousCar-PT-03a-LTLFireability-02
Could not compute solution for formula : AutonomousCar-PT-03a-LTLFireability-04
Could not compute solution for formula : AutonomousCar-PT-03a-LTLFireability-06

BK_STOP 1678636833995

--------------------
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-03a-LTLFireability-02
ltl formula formula --ltl=/tmp/2093/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 38 places, 75 transitions and 430 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2093/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2093/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2093/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2093/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name AutonomousCar-PT-03a-LTLFireability-04
ltl formula formula --ltl=/tmp/2093/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
pnml2lts-mc( 0/ 4): Petri net has 38 places, 75 transitions and 430 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( 3/ 4): LTL layer: formula: /tmp/2093/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2093/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2093/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2093/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name AutonomousCar-PT-03a-LTLFireability-06
ltl formula formula --ltl=/tmp/2093/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
pnml2lts-mc( 0/ 4): Petri net has 38 places, 75 transitions and 430 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.020 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2093/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2093/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2093/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2093/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 17 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

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

Sequence of Actions to be Executed by the VM

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

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

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