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.r521-tall-167987246500316.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 Murphy-COL-D4N025, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246500316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 7 12:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 7 12:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 7 12:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 7 12:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 7 12:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 20K Mar 31 16:48 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 Murphy-COL-D4N025-LTLFireability-00
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-01
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-02
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-03
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-04
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-05
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-06
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-07
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-08
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-09
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-10
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-11
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-12
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-13
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-14
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680938632193

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=Murphy-COL-D4N025
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-08 07:23:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-08 07:23:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-08 07:23:53] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-04-08 07:23:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-08 07:23:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 612 ms
[2023-04-08 07:23:54] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 30 PT places and 35.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-04-08 07:23:54] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 4 ms.
[2023-04-08 07:23:54] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Murphy-COL-D4N025-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 3 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 6 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
[2023-04-08 07:23:54] [INFO ] Flatten gal took : 14 ms
[2023-04-08 07:23:54] [INFO ] Flatten gal took : 2 ms
Arc [2:1*[(MOD (ADD $x 1) 5)]] contains successor/predecessor on variables of sort CD
[2023-04-08 07:23:54] [INFO ] Unfolded HLPN to a Petri net with 30 places and 35 transitions 135 arcs in 7 ms.
[2023-04-08 07:23:54] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Murphy-COL-D4N025-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2023-04-08 07:23:54] [INFO ] Computed 6 invariants in 3 ms
[2023-04-08 07:23:54] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
[2023-04-08 07:23:54] [INFO ] Invariant cache hit.
[2023-04-08 07:23:54] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-08 07:23:54] [INFO ] Invariant cache hit.
[2023-04-08 07:23:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:23:54] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-04-08 07:23:54] [INFO ] Invariant cache hit.
[2023-04-08 07:23:54] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 268 ms. Remains : 30/30 places, 35/35 transitions.
Support contains 30 out of 30 places after structural reductions.
[2023-04-08 07:23:54] [INFO ] Flatten gal took : 7 ms
[2023-04-08 07:23:54] [INFO ] Flatten gal took : 8 ms
[2023-04-08 07:23:54] [INFO ] Input system was already deterministic with 35 transitions.
Incomplete random walk after 10029 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-08 07:23:55] [INFO ] Invariant cache hit.
[2023-04-08 07:23:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:23:55] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-04-08 07:23:55] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:23:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-04-08 07:23:55] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-08 07:23:55] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:23:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:23:55] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:23:55] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-04-08 07:23:55] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 10 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Graph (complete) has 115 edges and 30 vertex of which 15 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 15 transition count 20
Applied a total of 6 rules in 5 ms. Remains 15 /30 variables (removed 15) and now considering 20/35 (removed 15) transitions.
// Phase 1: matrix 20 rows 15 cols
[2023-04-08 07:23:55] [INFO ] Computed 0 invariants in 2 ms
[2023-04-08 07:23:55] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 15/30 places, 20/35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Probably explored full state space saw : 7776 states, properties seen :0
Probabilistic random walk after 59616 steps, saw 7776 distinct states, run finished after 97 ms. (steps per millisecond=614 ) properties seen :0
Explored full state space saw : 7776 states, properties seen :0
Exhaustive walk after 59616 steps, saw 7776 distinct states, run finished after 49 ms. (steps per millisecond=1216 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
FORMULA Murphy-COL-D4N025-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Murphy-COL-D4N025-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA Murphy-COL-D4N025-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA Murphy-COL-D4N025-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(p0))&&G(p1)))))'
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2023-04-08 07:23:55] [INFO ] Computed 6 invariants in 2 ms
[2023-04-08 07:23:55] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2023-04-08 07:23:55] [INFO ] Invariant cache hit.
[2023-04-08 07:23:56] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-08 07:23:56] [INFO ] Invariant cache hit.
[2023-04-08 07:23:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:23:56] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-04-08 07:23:56] [INFO ] Invariant cache hit.
[2023-04-08 07:23:56] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 30/30 places, 35/35 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 328 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-COL-D4N025-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p1:(AND (OR (LT s0 3) (LT s10 1) (LT s20 1)) (OR (LT s2 3) (LT s12 1) (LT s22 1)) (OR (LT s4 3) (LT s14 1) (LT s24 1)) (OR (LT s1 3) (LT s11 1) (LT s21 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 12 ms.
FORMULA Murphy-COL-D4N025-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D4N025-LTLFireability-03 finished in 598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(((p1 U p2)||p0))))))'
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:23:56] [INFO ] Invariant cache hit.
[2023-04-08 07:23:56] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
[2023-04-08 07:23:56] [INFO ] Invariant cache hit.
[2023-04-08 07:23:56] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-08 07:23:56] [INFO ] Invariant cache hit.
[2023-04-08 07:23:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:23:56] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-04-08 07:23:56] [INFO ] Invariant cache hit.
[2023-04-08 07:23:56] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 30/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Murphy-COL-D4N025-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s7 1) (GEQ s12 1)) (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s3 1) (GEQ s8 1) (GEQ s13 1)) (AND (GEQ s1 1) (GEQ s6 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]]
Product exploration explored 100000 steps with 25000 reset in 301 ms.
Product exploration explored 100000 steps with 25000 reset in 208 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 455 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=227 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:23:58] [INFO ] Invariant cache hit.
[2023-04-08 07:23:58] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2023-04-08 07:23:58] [INFO ] Invariant cache hit.
[2023-04-08 07:23:58] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-08 07:23:58] [INFO ] Invariant cache hit.
[2023-04-08 07:23:58] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:23:58] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-04-08 07:23:58] [INFO ] Invariant cache hit.
[2023-04-08 07:23:58] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 30/30 places, 35/35 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 420 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=140 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 155 ms.
Product exploration explored 100000 steps with 25000 reset in 168 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:23:59] [INFO ] Invariant cache hit.
[2023-04-08 07:24:00] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-04-08 07:24:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-08 07:24:00] [INFO ] Invariant cache hit.
[2023-04-08 07:24:00] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 30/30 places, 35/35 transitions.
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:00] [INFO ] Invariant cache hit.
[2023-04-08 07:24:00] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-04-08 07:24:00] [INFO ] Invariant cache hit.
[2023-04-08 07:24:00] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-08 07:24:00] [INFO ] Invariant cache hit.
[2023-04-08 07:24:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:00] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-08 07:24:00] [INFO ] Invariant cache hit.
[2023-04-08 07:24:00] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 30/30 places, 35/35 transitions.
Treatment of property Murphy-COL-D4N025-LTLFireability-08 finished in 3766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(F(p2)&&p1)))))'
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:00] [INFO ] Invariant cache hit.
[2023-04-08 07:24:00] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-04-08 07:24:00] [INFO ] Invariant cache hit.
[2023-04-08 07:24:00] [INFO ] Implicit Places using invariants in 31 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 38 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 81 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-COL-D4N025-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s11 2) (LT s16 1)) (OR (LT s12 2) (LT s17 1)) (OR (LT s10 2) (LT s15 1)) (OR (LT s13 2) (LT s18 1)) (OR (LT s14 2) (LT s19 1)) (OR (LT s0 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 43 reset in 272 ms.
Stack based approach found an accepted trace after 72 steps with 0 reset with depth 73 and stack size 73 in 1 ms.
FORMULA Murphy-COL-D4N025-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D4N025-LTLFireability-09 finished in 488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||p0)))))'
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:00] [INFO ] Invariant cache hit.
[2023-04-08 07:24:00] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-04-08 07:24:00] [INFO ] Invariant cache hit.
[2023-04-08 07:24:00] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-08 07:24:00] [INFO ] Invariant cache hit.
[2023-04-08 07:24:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:00] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-04-08 07:24:00] [INFO ] Invariant cache hit.
[2023-04-08 07:24:00] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 30/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Murphy-COL-D4N025-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(AND (OR (LT s0 3) (LT s10 1) (LT s20 1)) (OR (LT s2 3) (LT s12 1) (LT s22 1)) (OR (LT s4 3) (LT s14 1) (LT s24 1)) (OR (LT s1 3) (LT s11 1) (LT s21 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 24302 reset in 203 ms.
Product exploration explored 100000 steps with 24375 reset in 200 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-08 07:24:01] [INFO ] Invariant cache hit.
[2023-04-08 07:24:01] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Murphy-COL-D4N025-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Murphy-COL-D4N025-LTLFireability-10 finished in 1088 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:01] [INFO ] Invariant cache hit.
[2023-04-08 07:24:01] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-04-08 07:24:01] [INFO ] Invariant cache hit.
[2023-04-08 07:24:01] [INFO ] Implicit Places using invariants in 33 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 34 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-COL-D4N025-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s11 1) (GEQ s12 1) (GEQ s13 1) (GEQ s14 1) (GEQ s10 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][false, false]]
Product exploration explored 100000 steps with 26450 reset in 128 ms.
Stack based approach found an accepted trace after 5070 steps with 1335 reset with depth 8 and stack size 8 in 6 ms.
FORMULA Murphy-COL-D4N025-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D4N025-LTLFireability-11 finished in 296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((X(X(!p1))||(!p1&&F(p2))))))'
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:02] [INFO ] Invariant cache hit.
[2023-04-08 07:24:02] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:24:02] [INFO ] Invariant cache hit.
[2023-04-08 07:24:02] [INFO ] Implicit Places using invariants in 26 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 28 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 910 ms :[p1, p1, p1, (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, p1, true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, p1, p1, p1, (NOT p2), (AND (NOT p2) p1), false]
Running random walk in product with property : Murphy-COL-D4N025-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 10}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 11}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 12}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 9}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 11}, { cond=(NOT p0), acceptance={} source=5 dest: 13}, { cond=p0, acceptance={} source=5 dest: 14}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 15}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 16}], [{ cond=p1, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 17}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=9 dest: 8}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=10 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=10 dest: 18}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=11 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=11 dest: 10}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=11 dest: 11}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=11 dest: 12}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=12 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=12 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=12 dest: 18}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=12 dest: 19}], [{ cond=p1, acceptance={} source=13 dest: 1}, { cond=p1, acceptance={} source=13 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=14 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=14 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=14 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=14 dest: 5}], [{ cond=p1, acceptance={} source=15 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=16 dest: 13}, { cond=(AND p1 p0), acceptance={} source=16 dest: 14}, { cond=(AND p1 (NOT p0)), acceptance={} source=16 dest: 15}, { cond=(AND p1 p0), acceptance={0} source=16 dest: 16}], [{ cond=(NOT p2), acceptance={0} source=17 dest: 17}], [{ cond=(NOT p2), acceptance={} source=18 dest: 3}, { cond=(NOT p2), acceptance={} source=18 dest: 18}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=19 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=19 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=19 dest: 18}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=19 dest: 19}]], initial=0, aps=[p0:(OR (GEQ s20 3) (GEQ s21 3) (GEQ s22 3) (GEQ s23 3) (GEQ s24 3)), p1:(OR (GEQ s11 1) (GEQ s12 1) (GEQ s13 1) (GEQ s14 1) (GEQ s10 1)), p2:(OR (AND (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 88 steps with 1 reset in 0 ms.
FORMULA Murphy-COL-D4N025-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D4N025-LTLFireability-12 finished in 1002 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(((!p0&&X(!p0)) U !p1))||X(X(F(p2)))))'
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:03] [INFO ] Invariant cache hit.
[2023-04-08 07:24:03] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-04-08 07:24:03] [INFO ] Invariant cache hit.
[2023-04-08 07:24:03] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-08 07:24:03] [INFO ] Invariant cache hit.
[2023-04-08 07:24:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:03] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-08 07:24:03] [INFO ] Invariant cache hit.
[2023-04-08 07:24:03] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 30/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 321 ms :[(AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : Murphy-COL-D4N025-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 4}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (OR (LT s2 1) (LT s7 1) (LT s12 1)) (OR (LT s0 1) (LT s5 1) (LT s10 1)) (OR (LT s3 1) (LT s8 1) (LT s13 1)) (OR (LT s1 1) (LT s6 1) (LT s11 1)) (O...], 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 312 reset in 232 ms.
Product exploration explored 100000 steps with 342 reset in 255 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))))]
Knowledge based reduction with 7 factoid took 291 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Finished random walk after 275 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=91 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p2)), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 7 factoid took 446 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 245 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:05] [INFO ] Invariant cache hit.
[2023-04-08 07:24:05] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-04-08 07:24:05] [INFO ] Invariant cache hit.
[2023-04-08 07:24:05] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-08 07:24:05] [INFO ] Invariant cache hit.
[2023-04-08 07:24:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:05] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-04-08 07:24:05] [INFO ] Invariant cache hit.
[2023-04-08 07:24:05] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 30/30 places, 35/35 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))))]
Knowledge based reduction with 3 factoid took 316 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Finished random walk after 62 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=31 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p2)), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 249 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 206 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 227 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Product exploration explored 100000 steps with 364 reset in 269 ms.
Product exploration explored 100000 steps with 361 reset in 282 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 223 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:08] [INFO ] Invariant cache hit.
[2023-04-08 07:24:08] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-04-08 07:24:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:24:08] [INFO ] Invariant cache hit.
[2023-04-08 07:24:08] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 30/30 places, 35/35 transitions.
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:08] [INFO ] Invariant cache hit.
[2023-04-08 07:24:08] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-04-08 07:24:08] [INFO ] Invariant cache hit.
[2023-04-08 07:24:08] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-08 07:24:08] [INFO ] Invariant cache hit.
[2023-04-08 07:24:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:08] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-04-08 07:24:08] [INFO ] Invariant cache hit.
[2023-04-08 07:24:08] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 30/30 places, 35/35 transitions.
Treatment of property Murphy-COL-D4N025-LTLFireability-15 finished in 5173 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(((p1 U p2)||p0))))))'
Found a Shortening insensitive property : Murphy-COL-D4N025-LTLFireability-08
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:08] [INFO ] Invariant cache hit.
[2023-04-08 07:24:08] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-04-08 07:24:08] [INFO ] Invariant cache hit.
[2023-04-08 07:24:08] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-08 07:24:08] [INFO ] Invariant cache hit.
[2023-04-08 07:24:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:08] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-04-08 07:24:08] [INFO ] Invariant cache hit.
[2023-04-08 07:24:08] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 143 ms. Remains : 30/30 places, 35/35 transitions.
Running random walk in product with property : Murphy-COL-D4N025-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s7 1) (GEQ s12 1)) (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s3 1) (GEQ s8 1) (GEQ s13 1)) (AND (GEQ s1 1) (GEQ s6 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 133 ms.
Product exploration explored 100000 steps with 25000 reset in 146 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 92 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=92 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:09] [INFO ] Invariant cache hit.
[2023-04-08 07:24:09] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-04-08 07:24:09] [INFO ] Invariant cache hit.
[2023-04-08 07:24:09] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-04-08 07:24:09] [INFO ] Invariant cache hit.
[2023-04-08 07:24:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:09] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-04-08 07:24:09] [INFO ] Invariant cache hit.
[2023-04-08 07:24:09] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 30/30 places, 35/35 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 213 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=213 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 144 ms.
Product exploration explored 100000 steps with 25000 reset in 146 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:11] [INFO ] Invariant cache hit.
[2023-04-08 07:24:11] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-04-08 07:24:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-08 07:24:11] [INFO ] Invariant cache hit.
[2023-04-08 07:24:11] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 30/30 places, 35/35 transitions.
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:11] [INFO ] Invariant cache hit.
[2023-04-08 07:24:11] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-04-08 07:24:11] [INFO ] Invariant cache hit.
[2023-04-08 07:24:11] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-08 07:24:11] [INFO ] Invariant cache hit.
[2023-04-08 07:24:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:11] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-04-08 07:24:11] [INFO ] Invariant cache hit.
[2023-04-08 07:24:11] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 30/30 places, 35/35 transitions.
Treatment of property Murphy-COL-D4N025-LTLFireability-08 finished in 3167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(((!p0&&X(!p0)) U !p1))||X(X(F(p2)))))'
Found a Shortening insensitive property : Murphy-COL-D4N025-LTLFireability-15
Stuttering acceptance computed with spot in 297 ms :[(AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:11] [INFO ] Invariant cache hit.
[2023-04-08 07:24:11] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-04-08 07:24:11] [INFO ] Invariant cache hit.
[2023-04-08 07:24:11] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-08 07:24:11] [INFO ] Invariant cache hit.
[2023-04-08 07:24:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:11] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-04-08 07:24:11] [INFO ] Invariant cache hit.
[2023-04-08 07:24:11] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 122 ms. Remains : 30/30 places, 35/35 transitions.
Running random walk in product with property : Murphy-COL-D4N025-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 4}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (OR (LT s2 1) (LT s7 1) (LT s12 1)) (OR (LT s0 1) (LT s5 1) (LT s10 1)) (OR (LT s3 1) (LT s8 1) (LT s13 1)) (OR (LT s1 1) (LT s6 1) (LT s11 1)) (O...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 327 reset in 235 ms.
Product exploration explored 100000 steps with 340 reset in 261 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))))]
Knowledge based reduction with 7 factoid took 242 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Finished random walk after 104 steps, including 0 resets, run visited all 5 properties in 5 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p2)), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 7 factoid took 373 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 244 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:13] [INFO ] Invariant cache hit.
[2023-04-08 07:24:13] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-04-08 07:24:13] [INFO ] Invariant cache hit.
[2023-04-08 07:24:13] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-08 07:24:13] [INFO ] Invariant cache hit.
[2023-04-08 07:24:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:13] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-04-08 07:24:13] [INFO ] Invariant cache hit.
[2023-04-08 07:24:13] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 30/30 places, 35/35 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Finished random walk after 92 steps, including 0 resets, run visited all 5 properties in 4 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p2)), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 294 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 215 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 221 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Product exploration explored 100000 steps with 320 reset in 274 ms.
Product exploration explored 100000 steps with 367 reset in 291 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 282 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:16] [INFO ] Invariant cache hit.
[2023-04-08 07:24:16] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-04-08 07:24:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-08 07:24:16] [INFO ] Invariant cache hit.
[2023-04-08 07:24:16] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 30/30 places, 35/35 transitions.
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:16] [INFO ] Invariant cache hit.
[2023-04-08 07:24:16] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:24:16] [INFO ] Invariant cache hit.
[2023-04-08 07:24:16] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-08 07:24:16] [INFO ] Invariant cache hit.
[2023-04-08 07:24:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:16] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-04-08 07:24:16] [INFO ] Invariant cache hit.
[2023-04-08 07:24:16] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 30/30 places, 35/35 transitions.
Treatment of property Murphy-COL-D4N025-LTLFireability-15 finished in 4925 ms.
[2023-04-08 07:24:16] [INFO ] Flatten gal took : 3 ms
[2023-04-08 07:24:16] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-04-08 07:24:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 35 transitions and 135 arcs took 1 ms.
Total runtime 22728 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1860/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1860/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Murphy-COL-D4N025-LTLFireability-08
Could not compute solution for formula : Murphy-COL-D4N025-LTLFireability-15

BK_STOP 1680939133533

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name Murphy-COL-D4N025-LTLFireability-08
ltl formula formula --ltl=/tmp/1860/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 30 places, 35 transitions and 135 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1860/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1860/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1860/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1860/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** 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 Murphy-COL-D4N025-LTLFireability-15
ltl formula formula --ltl=/tmp/1860/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
pnml2lts-mc( 0/ 4): Petri net has 30 places, 35 transitions and 135 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
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.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1860/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1860/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1860/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1860/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x561dd197e3f4]
1: pnml2lts-mc(+0xa2496) [0x561dd197e496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f535a8f1140]
3: pnml2lts-mc(+0x405be5) [0x561dd1ce1be5]
4: pnml2lts-mc(+0x16b3f9) [0x561dd1a473f9]
5: pnml2lts-mc(+0x164ac4) [0x561dd1a40ac4]
6: pnml2lts-mc(+0x272e0a) [0x561dd1b4ee0a]
7: pnml2lts-mc(+0xb61f0) [0x561dd19921f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f535a7444d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f535a74467a]
10: pnml2lts-mc(+0xa1581) [0x561dd197d581]
11: pnml2lts-mc(+0xa1910) [0x561dd197d910]
12: pnml2lts-mc(+0xa32a2) [0x561dd197f2a2]
13: pnml2lts-mc(+0xa50f4) [0x561dd19810f4]
14: pnml2lts-mc(+0xa516b) [0x561dd198116b]
15: pnml2lts-mc(+0x3f34b3) [0x561dd1ccf4b3]
16: pnml2lts-mc(+0x7c63d) [0x561dd195863d]
17: pnml2lts-mc(+0x67d86) [0x561dd1943d86]
18: pnml2lts-mc(+0x60a8a) [0x561dd193ca8a]
19: pnml2lts-mc(+0x5eb15) [0x561dd193ab15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f535a72cd0a]
21: pnml2lts-mc(+0x6075e) [0x561dd193c75e]

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="Murphy-COL-D4N025"
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 Murphy-COL-D4N025, 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 r521-tall-167987246500316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-COL-D4N025.tgz
mv Murphy-COL-D4N025 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 ;