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-167987246600364.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-PT-D4N025, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246600364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.3K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 7 12:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 7 12:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 7 12:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 7 12:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.7K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 7 12:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 19K 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-PT-D4N025-LTLFireability-00
FORMULA_NAME Murphy-PT-D4N025-LTLFireability-01
FORMULA_NAME Murphy-PT-D4N025-LTLFireability-02
FORMULA_NAME Murphy-PT-D4N025-LTLFireability-03
FORMULA_NAME Murphy-PT-D4N025-LTLFireability-04
FORMULA_NAME Murphy-PT-D4N025-LTLFireability-05
FORMULA_NAME Murphy-PT-D4N025-LTLFireability-06
FORMULA_NAME Murphy-PT-D4N025-LTLFireability-07
FORMULA_NAME Murphy-PT-D4N025-LTLFireability-08
FORMULA_NAME Murphy-PT-D4N025-LTLFireability-09
FORMULA_NAME Murphy-PT-D4N025-LTLFireability-10
FORMULA_NAME Murphy-PT-D4N025-LTLFireability-11
FORMULA_NAME Murphy-PT-D4N025-LTLFireability-12
FORMULA_NAME Murphy-PT-D4N025-LTLFireability-13
FORMULA_NAME Murphy-PT-D4N025-LTLFireability-14
FORMULA_NAME Murphy-PT-D4N025-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680938689476

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-PT-D4N025
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-08 07:24:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-08 07:24:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-08 07:24:51] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2023-04-08 07:24:51] [INFO ] Transformed 30 places.
[2023-04-08 07:24:51] [INFO ] Transformed 35 transitions.
[2023-04-08 07:24:51] [INFO ] Parsed PT model containing 30 places and 35 transitions and 135 arcs in 102 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 2 formulas.
FORMULA Murphy-PT-D4N025-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D4N025-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 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 9 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2023-04-08 07:24:51] [INFO ] Computed 6 invariants in 7 ms
[2023-04-08 07:24:51] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
[2023-04-08 07:24:51] [INFO ] Invariant cache hit.
[2023-04-08 07:24:51] [INFO ] Implicit Places using invariants in 25 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 247 ms. Remains : 29/30 places, 35/35 transitions.
Support contains 24 out of 29 places after structural reductions.
[2023-04-08 07:24:51] [INFO ] Flatten gal took : 19 ms
[2023-04-08 07:24:51] [INFO ] Flatten gal took : 14 ms
[2023-04-08 07:24:51] [INFO ] Input system was already deterministic with 35 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 21) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 35 rows 29 cols
[2023-04-08 07:24:52] [INFO ] Computed 5 invariants in 1 ms
[2023-04-08 07:24:52] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-08 07:24:52] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:24:52] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-08 07:24:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:52] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:24:52] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-08 07:24:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:52] [INFO ] After 15ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-08 07:24:52] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-04-08 07:24:52] [INFO ] After 174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 43 ms.
Support contains 12 out of 29 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 5 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:52] [INFO ] Invariant cache hit.
[2023-04-08 07:24:52] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 29/29 places, 35/35 transitions.
Incomplete random walk after 10020 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=91 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) 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 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 366156 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 366156 steps, saw 253296 distinct states, run finished after 3003 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 5 properties.
[2023-04-08 07:24:55] [INFO ] Invariant cache hit.
[2023-04-08 07:24:55] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:55] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:24:56] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-08 07:24:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:56] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 15 ms returned sat
[2023-04-08 07:24:56] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-08 07:24:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:56] [INFO ] After 24ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-08 07:24:56] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-04-08 07:24:56] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 19 ms.
Support contains 12 out of 29 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 29/29 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:56] [INFO ] Invariant cache hit.
[2023-04-08 07:24:56] [INFO ] Implicit Places using invariants in 46 ms returned [10, 12, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 47 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 26/29 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 2 iterations and 52 ms. Remains : 26/29 places, 35/35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 359404 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 359404 steps, saw 248493 distinct states, run finished after 3002 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 35 rows 26 cols
[2023-04-08 07:24:59] [INFO ] Computed 2 invariants in 1 ms
[2023-04-08 07:24:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:59] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-08 07:24:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:59] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-08 07:24:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:59] [INFO ] After 12ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-08 07:24:59] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-04-08 07:24:59] [INFO ] After 128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 12 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 1 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.
[2023-04-08 07:24:59] [INFO ] Invariant cache hit.
[2023-04-08 07:24:59] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-08 07:24:59] [INFO ] Invariant cache hit.
[2023-04-08 07:24:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:59] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-04-08 07:24:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:24:59] [INFO ] Invariant cache hit.
[2023-04-08 07:24:59] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 26/26 places, 35/35 transitions.
Graph (complete) has 68 edges and 26 vertex of which 20 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 2 ms. Remains 20 /26 variables (removed 6) and now considering 27/35 (removed 8) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 27 rows 20 cols
[2023-04-08 07:24:59] [INFO ] Computed 2 invariants in 1 ms
[2023-04-08 07:24:59] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:59] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-08 07:24:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:59] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-08 07:24:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:25:00] [INFO ] After 66ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-08 07:25:00] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-04-08 07:25:00] [INFO ] After 153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
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' '!(F((G(p1)||p0)))'
Support contains 7 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 29 cols
[2023-04-08 07:25:00] [INFO ] Computed 5 invariants in 1 ms
[2023-04-08 07:25:00] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
[2023-04-08 07:25:00] [INFO ] Invariant cache hit.
[2023-04-08 07:25:00] [INFO ] Implicit Places using invariants in 30 ms returned [11, 12, 13]
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 : 26/29 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 SI_LTL mode , in 2 iterations and 91 ms. Remains : 26/29 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 142 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Murphy-PT-D4N025-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)), p0:(OR (AND (GEQ s15 2) (GEQ s20 1) (GEQ s4 1) (GEQ s9 1)) (AND (GEQ s15 2) (GEQ s20 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 348 ms.
Stack based approach found an accepted trace after 1168 steps with 0 reset with depth 1169 and stack size 1151 in 16 ms.
FORMULA Murphy-PT-D4N025-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N025-LTLFireability-00 finished in 655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&F(p1)))))'
Support contains 6 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:01] [INFO ] Invariant cache hit.
[2023-04-08 07:25:01] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-04-08 07:25:01] [INFO ] Invariant cache hit.
[2023-04-08 07:25:01] [INFO ] Implicit Places using invariants in 31 ms returned [10, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/29 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 70 ms. Remains : 27/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Murphy-PT-D4N025-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s3 3) (GEQ s10 1) (GEQ s20 1)), p1:(AND (GEQ s4 3) (GEQ s11 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 556 reset in 214 ms.
Stack based approach found an accepted trace after 92 steps with 0 reset with depth 93 and stack size 93 in 0 ms.
FORMULA Murphy-PT-D4N025-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N025-LTLFireability-01 finished in 498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 7 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 4 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:01] [INFO ] Invariant cache hit.
[2023-04-08 07:25:01] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-04-08 07:25:01] [INFO ] Invariant cache hit.
[2023-04-08 07:25:01] [INFO ] Implicit Places using invariants in 29 ms returned [10, 12, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 29 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/29 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 74 ms. Remains : 26/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Murphy-PT-D4N025-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s2 1) (GEQ s7 1) (GEQ s10 1) (GEQ s13 2) (GEQ s18 1)), p0:(AND (GEQ s1 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 179 ms.
Stack based approach found an accepted trace after 101 steps with 0 reset with depth 102 and stack size 102 in 1 ms.
FORMULA Murphy-PT-D4N025-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N025-LTLFireability-02 finished in 355 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 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:01] [INFO ] Invariant cache hit.
[2023-04-08 07:25:01] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-04-08 07:25:01] [INFO ] Invariant cache hit.
[2023-04-08 07:25:01] [INFO ] Implicit Places using invariants in 24 ms returned [10, 11, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 26 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/29 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 63 ms. Remains : 26/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-PT-D4N025-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 s3 1) (GEQ s8 1) (GEQ s10 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-D4N025-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D4N025-LTLFireability-03 finished in 179 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 1 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:02] [INFO ] Invariant cache hit.
[2023-04-08 07:25:02] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-04-08 07:25:02] [INFO ] Invariant cache hit.
[2023-04-08 07:25:02] [INFO ] Implicit Places using invariants in 28 ms returned [10, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 29 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/29 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 69 ms. Remains : 25/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Murphy-PT-D4N025-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s19 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 164 ms.
Stack based approach found an accepted trace after 505 steps with 0 reset with depth 506 and stack size 497 in 2 ms.
FORMULA Murphy-PT-D4N025-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N025-LTLFireability-04 finished in 283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(!p1))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:02] [INFO ] Invariant cache hit.
[2023-04-08 07:25:02] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-04-08 07:25:02] [INFO ] Invariant cache hit.
[2023-04-08 07:25:02] [INFO ] Implicit Places using invariants in 31 ms returned [10, 11, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/29 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 84 ms. Remains : 26/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 138 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : Murphy-PT-D4N025-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s3 1) (GEQ s8 1) (GEQ s10 1)), p0:(LT s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 306 reset in 165 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 0 ms.
FORMULA Murphy-PT-D4N025-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N025-LTLFireability-05 finished in 407 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)||G(F(p1)))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:02] [INFO ] Invariant cache hit.
[2023-04-08 07:25:02] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-04-08 07:25:02] [INFO ] Invariant cache hit.
[2023-04-08 07:25:02] [INFO ] Implicit Places using invariants in 33 ms returned [10, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 34 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/29 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 72 ms. Remains : 25/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-PT-D4N025-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s13 2) (LT s18 1)), p1:(AND (GEQ s14 2) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 173 ms.
Product exploration explored 100000 steps with 0 reset in 203 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 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 115 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 517298 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 517298 steps, saw 359474 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 35 rows 25 cols
[2023-04-08 07:25:06] [INFO ] Computed 1 invariants in 2 ms
[2023-04-08 07:25:06] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:25:06] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-08 07:25:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:25:06] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-08 07:25:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:06] [INFO ] After 10ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-08 07:25:06] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-08 07:25:06] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 6 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 25 output transitions
Drop transitions removed 25 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 1 ms. Remains 6 /25 variables (removed 19) and now considering 8/35 (removed 27) transitions.
// Phase 1: matrix 8 rows 6 cols
[2023-04-08 07:25:06] [INFO ] Computed 0 invariants in 0 ms
[2023-04-08 07:25:06] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 6/25 places, 8/35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Incomplete Best-First 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 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) 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 19 ms. (steps per millisecond=6 ) 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 2 ms. (steps per millisecond=66 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (AND p0 (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Murphy-PT-D4N025-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Murphy-PT-D4N025-LTLFireability-07 finished in 4147 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&&F(G((F(p2)||p1)))))))'
Support contains 6 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 29 cols
[2023-04-08 07:25:06] [INFO ] Computed 5 invariants in 2 ms
[2023-04-08 07:25:06] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-04-08 07:25:06] [INFO ] Invariant cache hit.
[2023-04-08 07:25:06] [INFO ] Implicit Places using invariants in 28 ms returned [10, 12, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 29 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/29 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 64 ms. Remains : 26/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Murphy-PT-D4N025-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s2 3) (GEQ s10 1) (GEQ s18 1)) (AND (GEQ s15 2) (GEQ s20 1))), p1:(OR (AND (GEQ s2 3) (GEQ s10 1) (GEQ s18 1)) (GEQ s23 3)), p2:(AND (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Murphy-PT-D4N025-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D4N025-LTLFireability-08 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' '!(X(X(F((p0&&X(X(F(p1))))))))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:07] [INFO ] Invariant cache hit.
[2023-04-08 07:25:07] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-04-08 07:25:07] [INFO ] Invariant cache hit.
[2023-04-08 07:25:07] [INFO ] Implicit Places using invariants in 39 ms returned [10, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 40 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/29 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 78 ms. Remains : 25/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-PT-D4N025-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(GEQ s22 3), p0:(OR (GEQ s22 3) (LT s12 2) (LT s17 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]]
Product exploration explored 100000 steps with 7645 reset in 170 ms.
Stack based approach found an accepted trace after 291 steps with 26 reset with depth 40 and stack size 40 in 1 ms.
FORMULA Murphy-PT-D4N025-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N025-LTLFireability-09 finished in 481 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))||(p1&&X(p0))))))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:07] [INFO ] Invariant cache hit.
[2023-04-08 07:25:07] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-04-08 07:25:07] [INFO ] Invariant cache hit.
[2023-04-08 07:25:07] [INFO ] Implicit Places using invariants in 26 ms returned [10, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 27 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/29 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 63 ms. Remains : 25/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-PT-D4N025-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(OR p1 p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LT s20 3), p0:(OR (LT s3 1) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 328 reset in 206 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA Murphy-PT-D4N025-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N025-LTLFireability-10 finished in 414 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) U (G(!p1) U X(p2))))))'
Support contains 6 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:08] [INFO ] Invariant cache hit.
[2023-04-08 07:25:08] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-04-08 07:25:08] [INFO ] Invariant cache hit.
[2023-04-08 07:25:08] [INFO ] Implicit Places using invariants in 26 ms returned [11, 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 : 26/29 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 65 ms. Remains : 26/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 582 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND p1 p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), true, p0, p1, (AND p0 p1)]
Running random walk in product with property : Murphy-PT-D4N025-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p2), acceptance={} source=3 dest: 8}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 8}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 9}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 10}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 11}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 10}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=p0, acceptance={} source=9 dest: 8}, { cond=(NOT p0), acceptance={} source=9 dest: 9}], [{ cond=p1, acceptance={} source=10 dest: 8}, { cond=(NOT p1), acceptance={} source=10 dest: 10}], [{ cond=(AND p1 p0), acceptance={} source=11 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p1) p0), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=11 dest: 11}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)), p0:(AND (GEQ s15 2) (GEQ s20 1)), p2:(GEQ s22 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3 reset in 173 ms.
Product exploration explored 100000 steps with 0 reset in 205 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 231 ms. Reduced automaton from 12 states, 31 edges and 3 AP (stutter sensitive) to 12 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 457 ms :[(OR (NOT p2) p1), (OR (NOT p2) p0), (OR (NOT p2) (AND p0 p1)), p1, p0, (AND p1 p0), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Incomplete random walk after 10022 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 18) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 35 rows 26 cols
[2023-04-08 07:25:10] [INFO ] Computed 2 invariants in 1 ms
[2023-04-08 07:25:10] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:25:10] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-08 07:25:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:25:10] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-08 07:25:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:10] [INFO ] After 29ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-08 07:25:10] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-04-08 07:25:10] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 38 ms.
Support contains 6 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.
[2023-04-08 07:25:10] [INFO ] Invariant cache hit.
[2023-04-08 07:25:10] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 26/26 places, 35/35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) 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 7) 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 7) seen :0
Interrupted probabilistic random walk after 257123 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 257123 steps, saw 177426 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 7 properties.
[2023-04-08 07:25:13] [INFO ] Invariant cache hit.
[2023-04-08 07:25:13] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:25:13] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-08 07:25:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:25:13] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-08 07:25:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:13] [INFO ] After 17ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-08 07:25:13] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-04-08 07:25:13] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 22 ms.
Support contains 6 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 1 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 1 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.
[2023-04-08 07:25:13] [INFO ] Invariant cache hit.
[2023-04-08 07:25:13] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-08 07:25:13] [INFO ] Invariant cache hit.
[2023-04-08 07:25:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:13] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-04-08 07:25:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:25:13] [INFO ] Invariant cache hit.
[2023-04-08 07:25:13] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 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.0 ms
Discarding 9 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Applied a total of 1 rules in 1 ms. Remains 17 /26 variables (removed 9) and now considering 23/35 (removed 12) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 23 rows 17 cols
[2023-04-08 07:25:13] [INFO ] Computed 2 invariants in 1 ms
[2023-04-08 07:25:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:25:13] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-08 07:25:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:25:13] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-08 07:25:13] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-04-08 07:25:13] [INFO ] After 12ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-08 07:25:13] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-04-08 07:25:13] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (NOT (AND p1 (NOT p0) p2))), (F (AND p1 (NOT p0) (NOT p2)))]
Knowledge based reduction with 4 factoid took 553 ms. Reduced automaton from 12 states, 32 edges and 3 AP (stutter sensitive) to 12 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 501 ms :[(OR (NOT p2) p1), (OR (NOT p2) p0), (OR (NOT p2) (AND p0 p1)), p1, p0, (AND p1 p0), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 486 ms :[(OR (NOT p2) p1), (OR (NOT p2) p0), (OR (NOT p2) (AND p0 p1)), p1, p0, (AND p1 p0), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Support contains 6 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL 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.
// Phase 1: matrix 35 rows 26 cols
[2023-04-08 07:25:15] [INFO ] Computed 2 invariants in 2 ms
[2023-04-08 07:25:15] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-04-08 07:25:15] [INFO ] Invariant cache hit.
[2023-04-08 07:25:15] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-08 07:25:15] [INFO ] Invariant cache hit.
[2023-04-08 07:25:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:15] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-04-08 07:25:15] [INFO ] Invariant cache hit.
[2023-04-08 07:25:15] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 26/26 places, 35/35 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 12 states, 32 edges and 3 AP (stutter sensitive) to 12 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 470 ms :[(OR (NOT p2) p1), (OR (NOT p2) p0), (OR (NOT p2) (AND p0 p1)), p1, p0, (AND p1 p0), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 18) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) 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 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-04-08 07:25:16] [INFO ] Invariant cache hit.
[2023-04-08 07:25:16] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:25:16] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-08 07:25:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:25:16] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-08 07:25:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:16] [INFO ] After 16ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-08 07:25:16] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-04-08 07:25:16] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 25 ms.
Support contains 6 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 1 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:16] [INFO ] Invariant cache hit.
[2023-04-08 07:25:16] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 26/26 places, 35/35 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) 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 7) seen :0
Interrupted probabilistic random walk after 271854 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 271854 steps, saw 187707 distinct states, run finished after 3002 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 7 properties.
[2023-04-08 07:25:19] [INFO ] Invariant cache hit.
[2023-04-08 07:25:19] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:25:19] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-08 07:25:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:25:19] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-08 07:25:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:19] [INFO ] After 16ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-08 07:25:19] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-04-08 07:25:19] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 21 ms.
Support contains 6 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 1 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 1 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.
[2023-04-08 07:25:19] [INFO ] Invariant cache hit.
[2023-04-08 07:25:19] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-08 07:25:19] [INFO ] Invariant cache hit.
[2023-04-08 07:25:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:19] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-08 07:25:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-08 07:25:19] [INFO ] Invariant cache hit.
[2023-04-08 07:25:20] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 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.0 ms
Discarding 9 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Applied a total of 1 rules in 1 ms. Remains 17 /26 variables (removed 9) and now considering 23/35 (removed 12) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 23 rows 17 cols
[2023-04-08 07:25:20] [INFO ] Computed 2 invariants in 2 ms
[2023-04-08 07:25:20] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:25:20] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-08 07:25:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:25:20] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-08 07:25:20] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-04-08 07:25:20] [INFO ] After 12ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-08 07:25:20] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-04-08 07:25:20] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Knowledge obtained : [(AND p1 p2 (NOT p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F (AND (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) p1 p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 1 factoid took 305 ms. Reduced automaton from 12 states, 32 edges and 3 AP (stutter sensitive) to 12 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 445 ms :[(OR (NOT p2) p1), (OR (NOT p2) p0), (OR (NOT p2) (AND p0 p1)), p1, p0, (AND p1 p0), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 458 ms :[(OR (NOT p2) p1), (OR (NOT p2) p0), (OR (NOT p2) (AND p0 p1)), p1, p0, (AND p1 p0), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 469 ms :[(OR (NOT p2) p1), (OR (NOT p2) p0), (OR (NOT p2) (AND p0 p1)), p1, p0, (AND p1 p0), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Product exploration explored 100000 steps with 1 reset in 176 ms.
Stack based approach found an accepted trace after 30 steps with 2 reset with depth 23 and stack size 23 in 2 ms.
FORMULA Murphy-PT-D4N025-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N025-LTLFireability-11 finished in 14014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 29 cols
[2023-04-08 07:25:22] [INFO ] Computed 5 invariants in 1 ms
[2023-04-08 07:25:22] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2023-04-08 07:25:22] [INFO ] Invariant cache hit.
[2023-04-08 07:25:22] [INFO ] Implicit Places using invariants in 31 ms returned [10, 11, 12, 13]
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 : 25/29 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 85 ms. Remains : 25/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-PT-D4N025-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 32432 reset in 135 ms.
Stack based approach found an accepted trace after 482 steps with 188 reset with depth 13 and stack size 13 in 1 ms.
FORMULA Murphy-PT-D4N025-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N025-LTLFireability-12 finished in 313 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 U (p1||G(!p0))))))'
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:22] [INFO ] Invariant cache hit.
[2023-04-08 07:25:22] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-04-08 07:25:22] [INFO ] Invariant cache hit.
[2023-04-08 07:25:22] [INFO ] Implicit Places using invariants in 32 ms returned [10, 11, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/29 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 SI_LTL mode , in 2 iterations and 72 ms. Remains : 26/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Murphy-PT-D4N025-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s4 3) (GEQ s10 1) (GEQ s20 1))) (NOT (AND (GEQ s0 1) (GEQ s5 1)))), p0:(AND (GEQ s4 3) (GEQ s10 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 198 reset in 207 ms.
Stack based approach found an accepted trace after 105 steps with 0 reset with depth 106 and stack size 106 in 0 ms.
FORMULA Murphy-PT-D4N025-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N025-LTLFireability-14 finished in 377 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(F(p1)))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:22] [INFO ] Invariant cache hit.
[2023-04-08 07:25:22] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:25:22] [INFO ] Invariant cache hit.
[2023-04-08 07:25:22] [INFO ] Implicit Places using invariants in 26 ms returned [10, 11, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 27 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/29 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 64 ms. Remains : 26/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-PT-D4N025-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s16 1), p1:(OR (LT s4 1) (LT s9 1) (LT s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2700 reset in 171 ms.
Stack based approach found an accepted trace after 111 steps with 2 reset with depth 31 and stack size 31 in 0 ms.
FORMULA Murphy-PT-D4N025-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N025-LTLFireability-15 finished in 340 ms.
All properties solved by simple procedures.
Total runtime 31918 ms.
ITS solved all properties within timeout

BK_STOP 1680938724090

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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-PT-D4N025"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Murphy-PT-D4N025, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r521-tall-167987246600364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D4N025.tgz
mv Murphy-PT-D4N025 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;