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

About the Execution of LTSMin+red for Murphy-COL-D1N010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
312.584 8046.00 13536.00 335.80 TFFFFTFTTFTFFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r521-tall-167987246500284.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-D1N010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246500284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 5.5K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K 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.1K Apr 7 12:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 7 12:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 7.2K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Mar 23 15:23 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-D1N010-LTLFireability-00
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-01
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-02
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-03
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-04
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-05
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-06
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-07
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-08
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-09
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-10
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-11
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-12
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-13
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-14
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1681062788877

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-D1N010
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-09 17:53:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-09 17:53:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-09 17:53:10] [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-09 17:53:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-09 17:53:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 597 ms
[2023-04-09 17:53:10] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 12 PT places and 14.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-04-09 17:53:11] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 3 ms.
[2023-04-09 17:53:11] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Murphy-COL-D1N010-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D1N010-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 4 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 24 steps, including 0 resets, run visited all 6 properties in 14 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 1 ms.
[2023-04-09 17:53:11] [INFO ] Flatten gal took : 19 ms
[2023-04-09 17:53:11] [INFO ] Flatten gal took : 2 ms
Arc [2:1*[(MOD (ADD $x 1) 2)]] contains successor/predecessor on variables of sort CD
[2023-04-09 17:53:11] [INFO ] Unfolded HLPN to a Petri net with 12 places and 14 transitions 54 arcs in 5 ms.
[2023-04-09 17:53:11] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Murphy-COL-D1N010-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 4 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 12 cols
[2023-04-09 17:53:11] [INFO ] Computed 3 invariants in 2 ms
[2023-04-09 17:53:11] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
[2023-04-09 17:53:11] [INFO ] Invariant cache hit.
[2023-04-09 17:53:11] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-09 17:53:11] [INFO ] Invariant cache hit.
[2023-04-09 17:53:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-09 17:53:11] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-04-09 17:53:11] [INFO ] Invariant cache hit.
[2023-04-09 17:53:11] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 254 ms. Remains : 12/12 places, 14/14 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-04-09 17:53:11] [INFO ] Flatten gal took : 4 ms
[2023-04-09 17:53:11] [INFO ] Flatten gal took : 3 ms
[2023-04-09 17:53:11] [INFO ] Input system was already deterministic with 14 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-09 17:53:11] [INFO ] Invariant cache hit.
[2023-04-09 17:53:11] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2023-04-09 17:53:11] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-09 17:53:11] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-09 17:53:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-09 17:53:11] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-09 17:53:11] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-09 17:53:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-09 17:53:11] [INFO ] After 5ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-09 17:53:11] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-09 17:53:11] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 14/14 transitions.
Graph (complete) has 46 edges and 12 vertex of which 6 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 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 6 transition count 8
Applied a total of 3 rules in 4 ms. Remains 6 /12 variables (removed 6) and now considering 8/14 (removed 6) transitions.
// Phase 1: matrix 8 rows 6 cols
[2023-04-09 17:53:11] [INFO ] Computed 0 invariants in 1 ms
[2023-04-09 17:53:11] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 6/12 places, 8/14 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Probably explored full state space saw : 36 states, properties seen :0
Probabilistic random walk after 132 steps, saw 36 distinct states, run finished after 11 ms. (steps per millisecond=12 ) properties seen :0
Explored full state space saw : 36 states, properties seen :0
Exhaustive walk after 132 steps, saw 36 distinct states, run finished after 1 ms. (steps per millisecond=132 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA Murphy-COL-D1N010-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA Murphy-COL-D1N010-LTLFireability-05 TRUE 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(G((p0||X(p1))))||G(!p1)))))'
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 12 cols
[2023-04-09 17:53:12] [INFO ] Computed 3 invariants in 1 ms
[2023-04-09 17:53:12] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-04-09 17:53:12] [INFO ] Invariant cache hit.
[2023-04-09 17:53:12] [INFO ] Implicit Places using invariants in 29 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 10/12 places, 14/14 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 556 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), false, false, false, false, false, p1]
Running random walk in product with property : Murphy-COL-D1N010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 p0), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 8}], [{ cond=p1, acceptance={} source=5 dest: 2}, { cond=(NOT p1), acceptance={} source=5 dest: 3}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=p1, acceptance={} source=8 dest: 0}, { cond=(NOT p1), acceptance={} source=8 dest: 8}]], initial=7, aps=[p1:(AND (LT s4 1) (LT s5 1)), p0:(AND (OR (LT s0 1) (LT s2 1)) (OR (LT s1 1) (LT s3 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 5 ms.
FORMULA Murphy-COL-D1N010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D1N010-LTLFireability-01 finished in 693 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(G(p0)))'
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-09 17:53:12] [INFO ] Invariant cache hit.
[2023-04-09 17:53:12] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-04-09 17:53:12] [INFO ] Invariant cache hit.
[2023-04-09 17:53:12] [INFO ] Implicit Places using invariants in 24 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 10/12 places, 14/14 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-COL-D1N010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s8 3) (LT s9 3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Murphy-COL-D1N010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D1N010-LTLFireability-02 finished in 156 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(G(p0)))))'
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-09 17:53:12] [INFO ] Invariant cache hit.
[2023-04-09 17:53:12] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-04-09 17:53:12] [INFO ] Invariant cache hit.
[2023-04-09 17:53:12] [INFO ] Implicit Places using invariants in 26 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 10/12 places, 14/14 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-COL-D1N010-LTLFireability-03 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 (GEQ s6 1) (GEQ s7 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 40 steps with 0 reset in 2 ms.
FORMULA Murphy-COL-D1N010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D1N010-LTLFireability-03 finished in 230 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(G(((!p1&&F(!p2))||p0))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-09 17:53:13] [INFO ] Invariant cache hit.
[2023-04-09 17:53:13] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-04-09 17:53:13] [INFO ] Invariant cache hit.
[2023-04-09 17:53:13] [INFO ] Implicit Places using invariants in 24 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 10/12 places, 14/14 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), true, p2]
Running random walk in product with property : Murphy-COL-D1N010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s8 3) (GEQ s9 3)), p1:(AND (OR (LT s0 1) (LT s2 1)) (OR (LT s1 1) (LT s3 1))), p2:(AND (LT s4 1) (LT s5 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 194 steps with 4 reset in 11 ms.
FORMULA Murphy-COL-D1N010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D1N010-LTLFireability-04 finished in 220 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' '!(F(!p0))'
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-09 17:53:13] [INFO ] Invariant cache hit.
[2023-04-09 17:53:13] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2023-04-09 17:53:13] [INFO ] Invariant cache hit.
[2023-04-09 17:53:13] [INFO ] Implicit Places using invariants in 20 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48 ms. Remains : 10/12 places, 14/14 transitions.
Stuttering acceptance computed with spot in 33 ms :[p0]
Running random walk in product with property : Murphy-COL-D1N010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s4 1) (LT s5 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 26993 reset in 143 ms.
Stack based approach found an accepted trace after 15 steps with 4 reset with depth 3 and stack size 3 in 1 ms.
FORMULA Murphy-COL-D1N010-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D1N010-LTLFireability-06 finished in 238 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((X((G((p1&&(!p2 U X(p1)))) U (!p2&&G((p1&&(!p2 U X(p1)))))))||p0)))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-09 17:53:13] [INFO ] Invariant cache hit.
[2023-04-09 17:53:13] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-04-09 17:53:13] [INFO ] Invariant cache hit.
[2023-04-09 17:53:13] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-04-09 17:53:13] [INFO ] Invariant cache hit.
[2023-04-09 17:53:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-09 17:53:13] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-04-09 17:53:13] [INFO ] Invariant cache hit.
[2023-04-09 17:53:13] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 12/12 places, 14/14 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Murphy-COL-D1N010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s6 1) (GEQ s7 1)), p2:(AND (LT s6 1) (LT s7 1)), p1:(OR (AND (GEQ s1 3) (GEQ s5 1) (GEQ s9 1)) (AND (GEQ s0 3) (GEQ s4 1) (GEQ s8 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Murphy-COL-D1N010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D1N010-LTLFireability-09 finished in 327 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(!p0)&&p1)) U X(X(p2))))'
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-09 17:53:13] [INFO ] Invariant cache hit.
[2023-04-09 17:53:13] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
[2023-04-09 17:53:13] [INFO ] Invariant cache hit.
[2023-04-09 17:53:14] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-09 17:53:14] [INFO ] Invariant cache hit.
[2023-04-09 17:53:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-09 17:53:14] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-04-09 17:53:14] [INFO ] Invariant cache hit.
[2023-04-09 17:53:14] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 12/12 places, 14/14 transitions.
Stuttering acceptance computed with spot in 536 ms :[(NOT p2), (NOT p2), (OR (NOT p1) (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p1) p0), (NOT p2), (OR (NOT p2) p0), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) p0), p0, (NOT p2)]
Running random walk in product with property : Murphy-COL-D1N010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 5}, { cond=p0, acceptance={} source=0 dest: 14}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 7}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 12}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 7}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=2 dest: 13}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 7}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 12}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 13}], [{ cond=p0, acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 13}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(OR p0 (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 13}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={} source=8 dest: 14}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 8}, { cond=p0, acceptance={} source=9 dest: 10}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=10 dest: 1}, { cond=p0, acceptance={} source=10 dest: 11}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 14}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=11 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=11 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=11 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=12 dest: 6}, { cond=p0, acceptance={} source=12 dest: 7}, { cond=(AND (NOT p0) p2), acceptance={} source=12 dest: 13}], [{ cond=p0, acceptance={} source=13 dest: 7}, { cond=(NOT p0), acceptance={} source=13 dest: 13}], [{ cond=(NOT p2), acceptance={} source=14 dest: 7}]], initial=9, aps=[p1:(AND (LT s6 1) (LT s7 1)), p0:(OR (AND (GEQ s0 1) (GEQ s2 1) (GEQ s4 1)) (AND (GEQ s1 1) (GEQ s3 1) (GEQ s5 1))), p2:(OR (AND (GEQ s1 3) (GEQ s5 1) (GE...], 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, 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]]
Entered a terminal (fully accepting) state of product in 280 steps with 0 reset in 4 ms.
FORMULA Murphy-COL-D1N010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D1N010-LTLFireability-11 finished in 686 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 !p1)&&X((F(!p2)&&(G(!p1)||p3)))))'
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-09 17:53:14] [INFO ] Invariant cache hit.
[2023-04-09 17:53:14] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-04-09 17:53:14] [INFO ] Invariant cache hit.
[2023-04-09 17:53:14] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-09 17:53:14] [INFO ] Invariant cache hit.
[2023-04-09 17:53:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-09 17:53:14] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-04-09 17:53:14] [INFO ] Invariant cache hit.
[2023-04-09 17:53:14] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 12/12 places, 14/14 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR p2 p1), true, p1, (OR p2 (AND p1 (NOT p3))), p2, p1]
Running random walk in product with property : Murphy-COL-D1N010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p1) p2) (AND p2 p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (OR (LT s0 1) (LT s2 1)) (OR (LT s1 1) (LT s3 1))), p0:(AND (LT s10 3) (LT s11 3)), p3:(OR (AND (GEQ s0 1) (GEQ s2 1) (GEQ s4 1)) (AND (GEQ s1 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 27110 reset in 164 ms.
Stack based approach found an accepted trace after 47 steps with 12 reset with depth 4 and stack size 4 in 0 ms.
FORMULA Murphy-COL-D1N010-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D1N010-LTLFireability-12 finished in 509 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' '!(F(G(p0)))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-09 17:53:15] [INFO ] Invariant cache hit.
[2023-04-09 17:53:15] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-04-09 17:53:15] [INFO ] Invariant cache hit.
[2023-04-09 17:53:15] [INFO ] Implicit Places using invariants in 21 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 22 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62 ms. Remains : 10/12 places, 14/14 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Murphy-COL-D1N010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s4 1) (GEQ s5 1) (GEQ s8 3) (GEQ s9 3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 130 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 25 in 0 ms.
FORMULA Murphy-COL-D1N010-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D1N010-LTLFireability-13 finished in 236 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((G(!p0)||F(G(p1)))))))'
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-09 17:53:15] [INFO ] Invariant cache hit.
[2023-04-09 17:53:15] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-04-09 17:53:15] [INFO ] Invariant cache hit.
[2023-04-09 17:53:15] [INFO ] Implicit Places using invariants in 42 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/12 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71 ms. Remains : 10/12 places, 14/14 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : Murphy-COL-D1N010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (OR (LT s0 1) (LT s2 1)) (OR (LT s1 1) (LT s3 1))), p1:(AND (OR (LT s0 1) (LT s2 1)) (OR (LT s1 1) (LT s3 1)) (LT s8 3) (LT s9 3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 109 ms.
Stack based approach found an accepted trace after 270 steps with 0 reset with depth 271 and stack size 240 in 1 ms.
FORMULA Murphy-COL-D1N010-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D1N010-LTLFireability-14 finished in 386 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' '!(F(G(!p0)))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-09 17:53:15] [INFO ] Invariant cache hit.
[2023-04-09 17:53:15] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2023-04-09 17:53:15] [INFO ] Invariant cache hit.
[2023-04-09 17:53:15] [INFO ] Implicit Places using invariants in 20 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48 ms. Remains : 10/12 places, 14/14 transitions.
Stuttering acceptance computed with spot in 33 ms :[p0]
Running random walk in product with property : Murphy-COL-D1N010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s2 1)) (OR (LT s1 1) (LT s3 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 111 ms.
Stack based approach found an accepted trace after 235 steps with 0 reset with depth 236 and stack size 224 in 1 ms.
FORMULA Murphy-COL-D1N010-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D1N010-LTLFireability-15 finished in 216 ms.
All properties solved by simple procedures.
Total runtime 5730 ms.
ITS solved all properties within timeout

BK_STOP 1681062796923

--------------------
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.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

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

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