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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 7 12:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 7 12:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 7 12:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 7 12:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K 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 15K 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-D3N050-LTLFireability-00
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-01
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-02
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-03
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-04
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-05
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-06
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-07
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-08
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-09
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-10
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-11
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-12
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-13
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-14
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680938677395

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-D3N050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-08 07:24:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-08 07:24:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-08 07:24:39] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-04-08 07:24:39] [INFO ] Transformed 24 places.
[2023-04-08 07:24:39] [INFO ] Transformed 28 transitions.
[2023-04-08 07:24:39] [INFO ] Parsed PT model containing 24 places and 28 transitions and 108 arcs in 89 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-D3N050-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D3N050-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D3N050-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 10 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 24 cols
[2023-04-08 07:24:39] [INFO ] Computed 5 invariants in 6 ms
[2023-04-08 07:24:39] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
[2023-04-08 07:24:39] [INFO ] Invariant cache hit.
[2023-04-08 07:24:39] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-08 07:24:39] [INFO ] Invariant cache hit.
[2023-04-08 07:24:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:39] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-04-08 07:24:39] [INFO ] Invariant cache hit.
[2023-04-08 07:24:39] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 24/24 places, 28/28 transitions.
Support contains 20 out of 24 places after structural reductions.
[2023-04-08 07:24:39] [INFO ] Flatten gal took : 18 ms
[2023-04-08 07:24:39] [INFO ] Flatten gal took : 6 ms
[2023-04-08 07:24:39] [INFO ] Input system was already deterministic with 28 transitions.
Support contains 19 out of 24 places (down from 20) after GAL structural reductions.
Incomplete random walk after 10045 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 19) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-08 07:24:40] [INFO ] Invariant cache hit.
[2023-04-08 07:24:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:40] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2023-04-08 07:24:40] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:24:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:40] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-04-08 07:24:40] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-08 07:24:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:40] [INFO ] After 8ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-08 07:24:40] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-04-08 07:24:40] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:40] [INFO ] Invariant cache hit.
[2023-04-08 07:24:40] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 24/24 places, 28/28 transitions.
Incomplete random walk after 10025 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=278 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 387400 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :{}
Probabilistic random walk after 387400 steps, saw 261488 distinct states, run finished after 3002 ms. (steps per millisecond=129 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-08 07:24:43] [INFO ] Invariant cache hit.
[2023-04-08 07:24:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:43] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:24:43] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:24:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:43] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:24:43] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-08 07:24:43] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:43] [INFO ] After 7ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-08 07:24:43] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-08 07:24:43] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 24/24 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:43] [INFO ] Invariant cache hit.
[2023-04-08 07:24:43] [INFO ] Implicit Places using invariants in 34 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 35 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 4 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 42 ms. Remains : 20/24 places, 28/28 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 327666 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 327666 steps, saw 222937 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 28 rows 20 cols
[2023-04-08 07:24:46] [INFO ] Computed 1 invariants in 1 ms
[2023-04-08 07:24:46] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:46] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-04-08 07:24:46] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:46] [INFO ] After 6ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:24:46] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:24:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:46] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-08 07:24:46] [INFO ] After 23ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-08 07:24:46] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-08 07:24:46] [INFO ] After 78ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:46] [INFO ] Invariant cache hit.
[2023-04-08 07:24:46] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-08 07:24:46] [INFO ] Invariant cache hit.
[2023-04-08 07:24:46] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:46] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-04-08 07:24:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:24:46] [INFO ] Invariant cache hit.
[2023-04-08 07:24:46] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 20/20 places, 28/28 transitions.
Graph (complete) has 48 edges and 20 vertex of which 14 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 4 ms. Remains 14 /20 variables (removed 6) and now considering 20/28 (removed 8) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 20 rows 14 cols
[2023-04-08 07:24:46] [INFO ] Computed 1 invariants in 2 ms
[2023-04-08 07:24:46] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2023-04-08 07:24:46] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-04-08 07:24:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:24:46] [INFO ] After 3ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:24:46] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:24:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:47] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-08 07:24:47] [INFO ] After 5ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-08 07:24:47] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-08 07:24:47] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 24 cols
[2023-04-08 07:24:47] [INFO ] Computed 5 invariants in 1 ms
[2023-04-08 07:24:47] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-04-08 07:24:47] [INFO ] Invariant cache hit.
[2023-04-08 07:24:47] [INFO ] Implicit Places using invariants in 33 ms returned [8, 9, 10, 11]
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 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 76 ms. Remains : 20/24 places, 28/28 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 254 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s10 2) (GEQ s14 1)), p1:(AND (GEQ s0 1) (GEQ s4 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 280 ms.
Stack based approach found an accepted trace after 43 steps with 0 reset with depth 44 and stack size 44 in 0 ms.
FORMULA Murphy-PT-D3N050-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D3N050-LTLFireability-00 finished in 663 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&&X(F(p1)))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:48] [INFO ] Invariant cache hit.
[2023-04-08 07:24:48] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-04-08 07:24:48] [INFO ] Invariant cache hit.
[2023-04-08 07:24:48] [INFO ] Implicit Places using invariants in 27 ms returned [8, 10, 11]
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 : 21/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 21/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 3) (LT s8 1) (LT s14 1)), p1:(OR (AND (GEQ s9 1) (LT s9 1)) (LT s1 3) (LT s8 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, 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 50000 reset in 137 ms.
Product exploration explored 100000 steps with 50000 reset in 136 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 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Murphy-PT-D3N050-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Murphy-PT-D3N050-LTLFireability-01 finished in 469 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))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:48] [INFO ] Invariant cache hit.
[2023-04-08 07:24:48] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:24:48] [INFO ] Invariant cache hit.
[2023-04-08 07:24:48] [INFO ] Implicit Places using invariants in 33 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 34 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 20/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s10 2) (GEQ s14 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 0 reset in 154 ms.
Stack based approach found an accepted trace after 60 steps with 0 reset with depth 61 and stack size 61 in 1 ms.
FORMULA Murphy-PT-D3N050-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D3N050-LTLFireability-02 finished in 346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(!p1)&&F(p2))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:48] [INFO ] Invariant cache hit.
[2023-04-08 07:24:48] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-04-08 07:24:48] [INFO ] Invariant cache hit.
[2023-04-08 07:24:48] [INFO ] Implicit Places using invariants in 23 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 24 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62 ms. Remains : 20/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p2) p1), true, p1, (NOT p2), p1]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s7 1)), p0:(AND (GEQ s2 1) (GEQ s6 1)), p2:(LT s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Murphy-PT-D3N050-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D3N050-LTLFireability-06 finished in 301 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(p0)&&F(p1)))))) U p2))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:49] [INFO ] Invariant cache hit.
[2023-04-08 07:24:49] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-04-08 07:24:49] [INFO ] Invariant cache hit.
[2023-04-08 07:24:49] [INFO ] Implicit Places using invariants in 25 ms returned [9, 10, 11]
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 : 21/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 21/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (OR (NOT p2) (AND p0 p1)), (AND p0 p1)]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s13 1) (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)), p0:(GEQ s9 1), p1:(AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3625 reset in 165 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA Murphy-PT-D3N050-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D3N050-LTLFireability-07 finished in 369 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 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:49] [INFO ] Invariant cache hit.
[2023-04-08 07:24:49] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-04-08 07:24:49] [INFO ] Invariant cache hit.
[2023-04-08 07:24:49] [INFO ] Implicit Places using invariants in 30 ms returned [8, 10, 11]
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 : 21/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 21/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 3) (LT s8 1) (LT s14 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 10 steps with 0 reset in 1 ms.
FORMULA Murphy-PT-D3N050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D3N050-LTLFireability-08 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' '!(F(G(p0)))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 5 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:49] [INFO ] Invariant cache hit.
[2023-04-08 07:24:49] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-04-08 07:24:49] [INFO ] Invariant cache hit.
[2023-04-08 07:24:49] [INFO ] Implicit Places using invariants in 31 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 32 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 79 ms. Remains : 20/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-09 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 s11 2) (GEQ s15 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 157 ms.
Stack based approach found an accepted trace after 44 steps with 0 reset with depth 45 and stack size 45 in 1 ms.
FORMULA Murphy-PT-D3N050-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D3N050-LTLFireability-09 finished in 285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p1)||p0))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:49] [INFO ] Invariant cache hit.
[2023-04-08 07:24:50] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-04-08 07:24:50] [INFO ] Invariant cache hit.
[2023-04-08 07:24:50] [INFO ] Implicit Places using invariants in 31 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 32 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 75 ms. Remains : 20/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s11 2) (GEQ s15 1)), p0:(OR (LT s0 1) (LT s4 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 156 ms.
Product exploration explored 100000 steps with 0 reset in 305 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 190 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 92 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=715 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 28 rows 20 cols
[2023-04-08 07:24:50] [INFO ] Computed 1 invariants in 2 ms
[2023-04-08 07:24:50] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:50] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:24:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:50] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:24:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:50] [INFO ] After 3ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:24:50] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-08 07:24:50] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:50] [INFO ] Invariant cache hit.
[2023-04-08 07:24:51] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 20/20 places, 28/28 transitions.
Incomplete random walk after 10032 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2006 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2378547 steps, run timeout after 3001 ms. (steps per millisecond=792 ) properties seen :{}
Probabilistic random walk after 2378547 steps, saw 1618936 distinct states, run finished after 3001 ms. (steps per millisecond=792 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-08 07:24:54] [INFO ] Invariant cache hit.
[2023-04-08 07:24:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:54] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:24:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:54] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:24:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:54] [INFO ] After 3ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:24:54] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-08 07:24:54] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:54] [INFO ] Invariant cache hit.
[2023-04-08 07:24:54] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-08 07:24:54] [INFO ] Invariant cache hit.
[2023-04-08 07:24:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:54] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-04-08 07:24:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:24:54] [INFO ] Invariant cache hit.
[2023-04-08 07:24:54] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 20/20 places, 28/28 transitions.
Graph (complete) has 48 edges and 20 vertex of which 11 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 2 ms. Remains 11 /20 variables (removed 9) and now considering 16/28 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 11 cols
[2023-04-08 07:24:54] [INFO ] Computed 1 invariants in 0 ms
[2023-04-08 07:24:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:54] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:24:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:54] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:24:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:24:54] [INFO ] After 6ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:24:54] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-08 07:24:54] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 221 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 99 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 20 cols
[2023-04-08 07:24:54] [INFO ] Computed 1 invariants in 2 ms
[2023-04-08 07:24:54] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:24:54] [INFO ] Invariant cache hit.
[2023-04-08 07:24:54] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-08 07:24:54] [INFO ] Invariant cache hit.
[2023-04-08 07:24:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:54] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-04-08 07:24:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:24:54] [INFO ] Invariant cache hit.
[2023-04-08 07:24:54] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 20/20 places, 28/28 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 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 152 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 81 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1112 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-08 07:24:55] [INFO ] Invariant cache hit.
[2023-04-08 07:24:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:55] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:24:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:55] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:24:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:55] [INFO ] After 2ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:24:55] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-08 07:24:55] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:55] [INFO ] Invariant cache hit.
[2023-04-08 07:24:55] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 20/20 places, 28/28 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2192383 steps, run timeout after 3001 ms. (steps per millisecond=730 ) properties seen :{}
Probabilistic random walk after 2192383 steps, saw 1491213 distinct states, run finished after 3001 ms. (steps per millisecond=730 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-08 07:24:58] [INFO ] Invariant cache hit.
[2023-04-08 07:24:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:58] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:24:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:58] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:24:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:58] [INFO ] After 3ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:24:58] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-08 07:24:58] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:58] [INFO ] Invariant cache hit.
[2023-04-08 07:24:58] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-08 07:24:58] [INFO ] Invariant cache hit.
[2023-04-08 07:24:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:58] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-08 07:24:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:24:58] [INFO ] Invariant cache hit.
[2023-04-08 07:24:58] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 20/20 places, 28/28 transitions.
Graph (complete) has 48 edges and 20 vertex of which 11 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 11 /20 variables (removed 9) and now considering 16/28 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 11 cols
[2023-04-08 07:24:58] [INFO ] Computed 1 invariants in 2 ms
[2023-04-08 07:24:58] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:58] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:24:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:58] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:24:58] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:24:58] [INFO ] After 2ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:24:58] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-08 07:24:58] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 183 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 84 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 158 ms.
Product exploration explored 100000 steps with 0 reset in 189 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 20 cols
[2023-04-08 07:24:59] [INFO ] Computed 1 invariants in 1 ms
[2023-04-08 07:24:59] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-04-08 07:24:59] [INFO ] Invariant cache hit.
[2023-04-08 07:24:59] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-08 07:24:59] [INFO ] Invariant cache hit.
[2023-04-08 07:24:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:59] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 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 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 20/20 places, 28/28 transitions.
Treatment of property Murphy-PT-D3N050-LTLFireability-10 finished in 9459 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))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 24 cols
[2023-04-08 07:24:59] [INFO ] Computed 5 invariants in 0 ms
[2023-04-08 07:24:59] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-04-08 07:24:59] [INFO ] Invariant cache hit.
[2023-04-08 07:24:59] [INFO ] Implicit Places using invariants in 22 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 24 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 53 ms. Remains : 20/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s0 1) (LT s4 1) (LT s10 2) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 188 ms.
Product exploration explored 100000 steps with 0 reset in 188 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2414909 steps, run timeout after 3001 ms. (steps per millisecond=804 ) properties seen :{}
Probabilistic random walk after 2414909 steps, saw 1643616 distinct states, run finished after 3001 ms. (steps per millisecond=804 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 28 rows 20 cols
[2023-04-08 07:25:03] [INFO ] Computed 1 invariants in 1 ms
[2023-04-08 07:25:03] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-04-08 07:25:03] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:25:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:25:03] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:25:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:25:03] [INFO ] After 9ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:25:03] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-08 07:25:03] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:25:03] [INFO ] Invariant cache hit.
[2023-04-08 07:25:03] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 20/20 places, 28/28 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2301661 steps, run timeout after 3001 ms. (steps per millisecond=766 ) properties seen :{}
Probabilistic random walk after 2301661 steps, saw 1565950 distinct states, run finished after 3001 ms. (steps per millisecond=766 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-08 07:25:06] [INFO ] Invariant cache hit.
[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 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[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 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:25:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:25:06] [INFO ] After 4ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:25:06] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-08 07:25:06] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:25:06] [INFO ] Invariant cache hit.
[2023-04-08 07:25:06] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-08 07:25:06] [INFO ] Invariant cache hit.
[2023-04-08 07:25:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:25:06] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-04-08 07:25:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:25:06] [INFO ] Invariant cache hit.
[2023-04-08 07:25:06] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 20/20 places, 28/28 transitions.
Graph (complete) has 48 edges and 20 vertex of which 11 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 11 /20 variables (removed 9) and now considering 16/28 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 11 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 0 ms returned sat
[2023-04-08 07:25:06] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:25:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:25:06] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:25:06] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:25:06] [INFO ] After 2ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:25:06] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-08 07:25:06] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 327 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0)]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 20 cols
[2023-04-08 07:25:06] [INFO ] Computed 1 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 21 ms returned []
[2023-04-08 07:25:06] [INFO ] Invariant cache hit.
[2023-04-08 07:25:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:25:07] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-04-08 07:25:07] [INFO ] Redundant transitions in 0 ms returned []
[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 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 139 ms. Remains : 20/20 places, 28/28 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0)]
Incomplete random walk after 10039 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1254 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2493467 steps, run timeout after 3001 ms. (steps per millisecond=830 ) properties seen :{}
Probabilistic random walk after 2493467 steps, saw 1697274 distinct states, run finished after 3001 ms. (steps per millisecond=830 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-08 07:25:10] [INFO ] Invariant cache hit.
[2023-04-08 07:25:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:25:10] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:25:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:25:10] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:25:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:25:10] [INFO ] After 7ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:25:10] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-08 07:25:10] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (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 28 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 20/20 places, 28/28 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2284524 steps, run timeout after 3001 ms. (steps per millisecond=761 ) properties seen :{}
Probabilistic random walk after 2284524 steps, saw 1554121 distinct states, run finished after 3001 ms. (steps per millisecond=761 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-08 07:25:13] [INFO ] Invariant cache hit.
[2023-04-08 07:25:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:25:13] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:25:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:25:13] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:25:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:25:13] [INFO ] After 3ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:25:13] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-08 07:25:13] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (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 23 ms returned []
[2023-04-08 07:25:13] [INFO ] Invariant cache hit.
[2023-04-08 07:25:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:25:13] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 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 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 20/20 places, 28/28 transitions.
Graph (complete) has 48 edges and 20 vertex of which 11 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 11 /20 variables (removed 9) and now considering 16/28 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 11 cols
[2023-04-08 07:25:13] [INFO ] Computed 1 invariants in 1 ms
[2023-04-08 07:25:13] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:25:13] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:25:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:25:13] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:25:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:25:13] [INFO ] After 2ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:25:13] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-08 07:25:13] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 178 ms.
Product exploration explored 100000 steps with 0 reset in 201 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 20 cols
[2023-04-08 07:25:14] [INFO ] Computed 1 invariants in 2 ms
[2023-04-08 07:25:14] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-04-08 07:25:14] [INFO ] Invariant cache hit.
[2023-04-08 07:25:14] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-08 07:25:14] [INFO ] Invariant cache hit.
[2023-04-08 07:25:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:25:14] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-04-08 07:25:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:25:14] [INFO ] Invariant cache hit.
[2023-04-08 07:25:14] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144 ms. Remains : 20/20 places, 28/28 transitions.
Treatment of property Murphy-PT-D3N050-LTLFireability-11 finished in 15084 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 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 24 cols
[2023-04-08 07:25:14] [INFO ] Computed 5 invariants in 1 ms
[2023-04-08 07:25:14] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-04-08 07:25:14] [INFO ] Invariant cache hit.
[2023-04-08 07:25:14] [INFO ] Implicit Places using invariants in 35 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 37 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 20/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 80 ms :[p0, p0]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[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][false, false]]
Product exploration explored 100000 steps with 7900 reset in 141 ms.
Stack based approach found an accepted trace after 140 steps with 11 reset with depth 5 and stack size 5 in 0 ms.
FORMULA Murphy-PT-D3N050-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D3N050-LTLFireability-12 finished in 319 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(p1)&&p0) U (p2||X(p3))))'
Support contains 8 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:25:14] [INFO ] Invariant cache hit.
[2023-04-08 07:25:14] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-04-08 07:25:14] [INFO ] Invariant cache hit.
[2023-04-08 07:25:14] [INFO ] Implicit Places using invariants in 23 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 22/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p1)]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) p1 (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0 p1 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s10 1), p0:(AND (GEQ s2 3) (GEQ s8 1) (GEQ s16 1)), p1:(AND (GEQ s3 1) (GEQ s7 1) (GEQ s9 1)), p3:(AND (GEQ s2 1) (GEQ s6 1) (GEQ s8 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Murphy-PT-D3N050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D3N050-LTLFireability-13 finished in 286 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(p0)||X(p1)))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[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 37 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 27 ms returned [9, 10, 11]
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 : 21/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 21/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s4 1)), p1:(AND (GEQ s0 3) (GEQ s8 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 193 reset in 161 ms.
Stack based approach found an accepted trace after 75 steps with 4 reset with depth 22 and stack size 22 in 1 ms.
FORMULA Murphy-PT-D3N050-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D3N050-LTLFireability-14 finished in 441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&G(F(p0))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[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 34 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 27 ms returned [9, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 28 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 67 ms. Remains : 21/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)), p0:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 6467 reset in 152 ms.
Stack based approach found an accepted trace after 24 steps with 1 reset with depth 17 and stack size 17 in 1 ms.
FORMULA Murphy-PT-D3N050-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D3N050-LTLFireability-15 finished in 436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p1)||p0))))'
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))'
[2023-04-08 07:25:16] [INFO ] Flatten gal took : 4 ms
[2023-04-08 07:25:16] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-04-08 07:25:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 28 transitions and 108 arcs took 1 ms.
Total runtime 37120 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1224/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1224/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Murphy-PT-D3N050-LTLFireability-10
Could not compute solution for formula : Murphy-PT-D3N050-LTLFireability-11

BK_STOP 1680938717551

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name Murphy-PT-D3N050-LTLFireability-10
ltl formula formula --ltl=/tmp/1224/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 24 places, 28 transitions and 108 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1224/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1224/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1224/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1224/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55b15275f3f4]
1: pnml2lts-mc(+0xa2496) [0x55b15275f496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f172308b140]
3: pnml2lts-mc(+0x405be5) [0x55b152ac2be5]
4: pnml2lts-mc(+0x16b3f9) [0x55b1528283f9]
5: pnml2lts-mc(+0x164ac4) [0x55b152821ac4]
6: pnml2lts-mc(+0x272e0a) [0x55b15292fe0a]
7: pnml2lts-mc(+0xb61f0) [0x55b1527731f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f1722ede4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f1722ede67a]
10: pnml2lts-mc(+0xa1581) [0x55b15275e581]
11: pnml2lts-mc(+0xa1910) [0x55b15275e910]
12: pnml2lts-mc(+0xa32a2) [0x55b1527602a2]
13: pnml2lts-mc(+0xa50f4) [0x55b1527620f4]
14: pnml2lts-mc(+0xa516b) [0x55b15276216b]
15: pnml2lts-mc(+0x3f34b3) [0x55b152ab04b3]
16: pnml2lts-mc(+0x7c63d) [0x55b15273963d]
17: pnml2lts-mc(+0x67d86) [0x55b152724d86]
18: pnml2lts-mc(+0x60a8a) [0x55b15271da8a]
19: pnml2lts-mc(+0x5eb15) [0x55b15271bb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f1722ec6d0a]
21: pnml2lts-mc(+0x6075e) [0x55b15271d75e]
ltl formula name Murphy-PT-D3N050-LTLFireability-11
ltl formula formula --ltl=/tmp/1224/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 24 places, 28 transitions and 108 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1224/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1224/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1224/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1224/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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

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