Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r263-tall-171654372300208.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Murphy-PT-D4N050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372300208
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 8.2K Apr 11 22:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 11 22:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 11 22:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 22:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 6 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 6 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 6 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 6 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 22:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 11 22:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 11 22:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 19K May 18 16:43 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-PT-D4N050-LTLFireability-00
FORMULA_NAME Murphy-PT-D4N050-LTLFireability-01
FORMULA_NAME Murphy-PT-D4N050-LTLFireability-02
FORMULA_NAME Murphy-PT-D4N050-LTLFireability-03
FORMULA_NAME Murphy-PT-D4N050-LTLFireability-04
FORMULA_NAME Murphy-PT-D4N050-LTLFireability-05
FORMULA_NAME Murphy-PT-D4N050-LTLFireability-06
FORMULA_NAME Murphy-PT-D4N050-LTLFireability-07
FORMULA_NAME Murphy-PT-D4N050-LTLFireability-08
FORMULA_NAME Murphy-PT-D4N050-LTLFireability-09
FORMULA_NAME Murphy-PT-D4N050-LTLFireability-10
FORMULA_NAME Murphy-PT-D4N050-LTLFireability-11
FORMULA_NAME Murphy-PT-D4N050-LTLFireability-12
FORMULA_NAME Murphy-PT-D4N050-LTLFireability-13
FORMULA_NAME Murphy-PT-D4N050-LTLFireability-14
FORMULA_NAME Murphy-PT-D4N050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716680683916

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D4N050
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 23:44:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 23:44:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 23:44:45] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2024-05-25 23:44:45] [INFO ] Transformed 30 places.
[2024-05-25 23:44:45] [INFO ] Transformed 35 transitions.
[2024-05-25 23:44:45] [INFO ] Parsed PT model containing 30 places and 35 transitions and 135 arcs in 88 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Murphy-PT-D4N050-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D4N050-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D4N050-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 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 8 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2024-05-25 23:44:45] [INFO ] Computed 6 invariants in 11 ms
[2024-05-25 23:44:45] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
[2024-05-25 23:44:45] [INFO ] Invariant cache hit.
[2024-05-25 23:44:45] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-25 23:44:45] [INFO ] Invariant cache hit.
[2024-05-25 23:44:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:44:46] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-25 23:44:46] [INFO ] Invariant cache hit.
[2024-05-25 23:44:46] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 291 ms. Remains : 30/30 places, 35/35 transitions.
Support contains 26 out of 30 places after structural reductions.
[2024-05-25 23:44:46] [INFO ] Flatten gal took : 18 ms
[2024-05-25 23:44:46] [INFO ] Flatten gal took : 6 ms
[2024-05-25 23:44:46] [INFO ] Input system was already deterministic with 35 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 26) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-25 23:44:46] [INFO ] Invariant cache hit.
[2024-05-25 23:44:46] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2024-05-25 23:44:46] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:44:46] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-25 23:44:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:44:46] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:44:46] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-25 23:44:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:44:46] [INFO ] After 8ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-25 23:44:46] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-25 23:44:46] [INFO ] After 103ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 23:44:46] [INFO ] Invariant cache hit.
[2024-05-25 23:44:46] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 30/30 places, 35/35 transitions.
Incomplete random walk after 10026 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=313 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 529077 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :{}
Probabilistic random walk after 529077 steps, saw 362838 distinct states, run finished after 3002 ms. (steps per millisecond=176 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 23:44:49] [INFO ] Invariant cache hit.
[2024-05-25 23:44:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:44:49] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:44:49] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 23:44:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:44:49] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 23:44:49] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 23:44:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:44:49] [INFO ] After 11ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 23:44:49] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-25 23:44:49] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/30 places, 35/35 transitions.
Starting structural reductions in REACHABILITY 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.
[2024-05-25 23:44:49] [INFO ] Invariant cache hit.
[2024-05-25 23:44:49] [INFO ] Implicit Places using invariants in 41 ms returned [10, 11, 13, 14]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 43 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 26/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 46 ms. Remains : 26/30 places, 35/35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 628404 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 628404 steps, saw 431274 distinct states, run finished after 3001 ms. (steps per millisecond=209 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 35 rows 26 cols
[2024-05-25 23:44:52] [INFO ] Computed 2 invariants in 1 ms
[2024-05-25 23:44:52] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 23:44:53] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 23:44:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:44:53] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 23:44:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:44:53] [INFO ] After 12ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 23:44:53] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-25 23:44:53] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 26/26 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 23:44:53] [INFO ] Invariant cache hit.
[2024-05-25 23:44:53] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-25 23:44:53] [INFO ] Invariant cache hit.
[2024-05-25 23:44:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:44:53] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-25 23:44:53] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:44:53] [INFO ] Invariant cache hit.
[2024-05-25 23:44:53] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 26/26 places, 35/35 transitions.
Graph (complete) has 68 edges and 26 vertex of which 17 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Applied a total of 1 rules in 2 ms. Remains 17 /26 variables (removed 9) and now considering 23/35 (removed 12) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 23 rows 17 cols
[2024-05-25 23:44:53] [INFO ] Computed 2 invariants in 2 ms
[2024-05-25 23:44:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:44:53] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 23:44:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:44:53] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 23:44:53] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-25 23:44:53] [INFO ] After 4ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 23:44:53] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-25 23:44:53] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA Murphy-PT-D4N050-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
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(p0) U (G(p1)||G(!p1))))'
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.
// Phase 1: matrix 35 rows 30 cols
[2024-05-25 23:44:53] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 23:44:53] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2024-05-25 23:44:53] [INFO ] Invariant cache hit.
[2024-05-25 23:44:53] [INFO ] Implicit Places using invariants in 29 ms returned [10, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 30 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70 ms. Remains : 26/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 314 ms :[false, (AND p1 (NOT p0)), (AND (NOT p1) (NOT p0)), true, (AND p1 p0), (AND (NOT p1) p0)]
Running random walk in product with property : Murphy-PT-D4N050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={1} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s17 1), p0:(OR (GEQ s15 1) (AND (GEQ s4 3) (GEQ s10 1) (GEQ s20 1)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA Murphy-PT-D4N050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D4N050-LTLFireability-00 finished in 444 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(((G(p0)||(p0&&F(!p1))) U p2))))'
Support contains 7 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.
[2024-05-25 23:44:54] [INFO ] Invariant cache hit.
[2024-05-25 23:44:54] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2024-05-25 23:44:54] [INFO ] Invariant cache hit.
[2024-05-25 23:44:54] [INFO ] Implicit Places using invariants in 27 ms returned [10, 12, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 28 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 27/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p2), (NOT p2), (NOT p2), true, (AND p1 (NOT p0)), p1]
Running random walk in product with property : Murphy-PT-D4N050-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s4 3) (GEQ s11 1) (GEQ s21 1)), p0:(LT s17 1), p1:(AND (GEQ s1 1) (GEQ s6 1) (GEQ s10 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 2014 steps with 1 reset in 25 ms.
FORMULA Murphy-PT-D4N050-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D4N050-LTLFireability-01 finished in 344 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(p0)||(p1&&F((X(p3)||p2))))))'
Support contains 7 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.
[2024-05-25 23:44:54] [INFO ] Invariant cache hit.
[2024-05-25 23:44:54] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2024-05-25 23:44:54] [INFO ] Invariant cache hit.
[2024-05-25 23:44:54] [INFO ] Implicit Places using invariants in 31 ms returned [11, 12, 14]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 32 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 71 ms. Remains : 27/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : Murphy-PT-D4N050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s24 3), p1:(OR (LT s0 1) (LT s5 1) (LT s10 1)), p2:(OR (LT s0 1) (LT s5 1) (LT s10 1)), p3:(OR (LT s3 1) (LT s8 1) (LT s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1889 reset in 259 ms.
Stack based approach found an accepted trace after 134 steps with 3 reset with depth 57 and stack size 57 in 0 ms.
FORMULA Murphy-PT-D4N050-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N050-LTLFireability-02 finished in 473 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 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.
[2024-05-25 23:44:54] [INFO ] Invariant cache hit.
[2024-05-25 23:44:54] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2024-05-25 23:44:54] [INFO ] Invariant cache hit.
[2024-05-25 23:44:54] [INFO ] Implicit Places using invariants in 34 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 35 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 71 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-PT-D4N050-LTLFireability-03 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 (GEQ s11 2) (GEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Murphy-PT-D4N050-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D4N050-LTLFireability-03 finished in 193 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(F(p1))&&G(X(G(p2)))&&p0)) U p3))'
Support contains 9 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.
[2024-05-25 23:44:55] [INFO ] Invariant cache hit.
[2024-05-25 23:44:55] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
[2024-05-25 23:44:55] [INFO ] Invariant cache hit.
[2024-05-25 23:44:55] [INFO ] Implicit Places using invariants in 27 ms returned [10, 11, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 28 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 27/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p3), (OR (NOT p3) (NOT p0) (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : Murphy-PT-D4N050-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(GEQ s20 1), p0:(AND (GEQ s4 3) (GEQ s11 1) (GEQ s21 1)), p2:(AND (GEQ s2 3) (GEQ s10 1) (GEQ s19 1)), p1:(AND (GEQ s13 2) (GEQ s18 1) (GEQ s2 3) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Murphy-PT-D4N050-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D4N050-LTLFireability-05 finished in 288 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)) U G(p1)))'
Support contains 4 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.
[2024-05-25 23:44:55] [INFO ] Invariant cache hit.
[2024-05-25 23:44:55] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2024-05-25 23:44:55] [INFO ] Invariant cache hit.
[2024-05-25 23:44:55] [INFO ] Implicit Places using invariants in 31 ms returned [10, 11, 12, 14]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 32 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 26/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Murphy-PT-D4N050-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s24 3), p0:(OR (LT s3 1) (LT s8 1) (LT s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 249 steps with 74 reset in 2 ms.
FORMULA Murphy-PT-D4N050-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D4N050-LTLFireability-06 finished in 235 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(p0)||G(p1))))'
Support contains 4 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.
[2024-05-25 23:44:55] [INFO ] Invariant cache hit.
[2024-05-25 23:44:55] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2024-05-25 23:44:55] [INFO ] Invariant cache hit.
[2024-05-25 23:44:55] [INFO ] Implicit Places using invariants in 30 ms returned [11, 12, 13, 14]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 31 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 26/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Murphy-PT-D4N050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(OR (LT s0 3) (LT s10 1) (LT s16 1)), p1:(LT s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 138 ms.
Product exploration explored 100000 steps with 33333 reset in 174 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 p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Murphy-PT-D4N050-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Murphy-PT-D4N050-LTLFireability-08 finished in 606 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 2 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.
[2024-05-25 23:44:56] [INFO ] Invariant cache hit.
[2024-05-25 23:44:56] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2024-05-25 23:44:56] [INFO ] Invariant cache hit.
[2024-05-25 23:44:56] [INFO ] Implicit Places using invariants in 35 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 2 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 30 ms :[(NOT p0)]
Running random walk in product with property : Murphy-PT-D4N050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s8 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 183 ms.
Stack based approach found an accepted trace after 2668 steps with 0 reset with depth 2669 and stack size 2622 in 5 ms.
FORMULA Murphy-PT-D4N050-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N050-LTLFireability-10 finished in 310 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 3 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.
[2024-05-25 23:44:56] [INFO ] Invariant cache hit.
[2024-05-25 23:44:56] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-25 23:44:56] [INFO ] Invariant cache hit.
[2024-05-25 23:44:56] [INFO ] Implicit Places using invariants in 24 ms returned [10, 11, 12, 14]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 25 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 58 ms. Remains : 26/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Murphy-PT-D4N050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s8 1) (LT s10 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 179 reset in 181 ms.
Stack based approach found an accepted trace after 102 steps with 3 reset with depth 57 and stack size 57 in 0 ms.
FORMULA Murphy-PT-D4N050-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N050-LTLFireability-12 finished in 284 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((p0&&X((p0 U (p1||G(p0))))))))'
Support contains 2 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.
[2024-05-25 23:44:56] [INFO ] Invariant cache hit.
[2024-05-25 23:44:56] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2024-05-25 23:44:56] [INFO ] Invariant cache hit.
[2024-05-25 23:44:56] [INFO ] Implicit Places using invariants in 25 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 26 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 68 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-PT-D4N050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s11 1), p1:(GEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1568 reset in 173 ms.
Stack based approach found an accepted trace after 46 steps with 0 reset with depth 47 and stack size 47 in 0 ms.
FORMULA Murphy-PT-D4N050-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N050-LTLFireability-13 finished in 363 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((p0&&F(G(p0))))&&(!p1||F(p2))) U (G((X((p0&&F(G(p0))))&&(!p1||F(p2))))||(p3&&X((p0&&F(G(p0))))&&(!p1||F(p2))))))'
Support contains 6 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.
[2024-05-25 23:44:57] [INFO ] Invariant cache hit.
[2024-05-25 23:44:57] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2024-05-25 23:44:57] [INFO ] Invariant cache hit.
[2024-05-25 23:44:57] [INFO ] Implicit Places using invariants in 23 ms returned [10, 12, 13, 14]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 24 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 26/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p2), true, (NOT p0)]
Running random walk in product with property : Murphy-PT-D4N050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(LT s16 1), p1:(LT s11 1), p2:(AND (GEQ s1 1) (GEQ s6 1) (GEQ s10 1)), p0:(GEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Murphy-PT-D4N050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D4N050-LTLFireability-14 finished in 253 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((p0 U p1)) U (X(p1)||(G(p3)&&p2))))'
Support contains 7 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.
[2024-05-25 23:44:57] [INFO ] Invariant cache hit.
[2024-05-25 23:44:57] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2024-05-25 23:44:57] [INFO ] Invariant cache hit.
[2024-05-25 23:44:57] [INFO ] Implicit Places using invariants in 24 ms returned [10, 13, 14]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 25 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 27/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p3)]
Running random walk in product with property : Murphy-PT-D4N050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p2 p3), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 0}, { cond=p3, acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (GEQ s1 3) (GEQ s10 1) (GEQ s18 1)), p3:(GEQ s25 3), p1:(AND (GEQ s1 3) (GEQ s10 1) (GEQ s18 1)), p0:(AND (GEQ s2 1) (GEQ s7 1) (GEQ s11 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Murphy-PT-D4N050-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D4N050-LTLFireability-15 finished in 306 ms.
All properties solved by simple procedures.
Total runtime 12361 ms.

BK_STOP 1716680698743

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-PT-D4N050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Murphy-PT-D4N050, 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 r263-tall-171654372300208"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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