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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 7 12:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 18K 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:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 7 12:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 19K Mar 31 16:48 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Murphy-PT-D4N050-LTLCardinality-00
FORMULA_NAME Murphy-PT-D4N050-LTLCardinality-01
FORMULA_NAME Murphy-PT-D4N050-LTLCardinality-02
FORMULA_NAME Murphy-PT-D4N050-LTLCardinality-03
FORMULA_NAME Murphy-PT-D4N050-LTLCardinality-04
FORMULA_NAME Murphy-PT-D4N050-LTLCardinality-05
FORMULA_NAME Murphy-PT-D4N050-LTLCardinality-06
FORMULA_NAME Murphy-PT-D4N050-LTLCardinality-07
FORMULA_NAME Murphy-PT-D4N050-LTLCardinality-08
FORMULA_NAME Murphy-PT-D4N050-LTLCardinality-09
FORMULA_NAME Murphy-PT-D4N050-LTLCardinality-10
FORMULA_NAME Murphy-PT-D4N050-LTLCardinality-11
FORMULA_NAME Murphy-PT-D4N050-LTLCardinality-12
FORMULA_NAME Murphy-PT-D4N050-LTLCardinality-13
FORMULA_NAME Murphy-PT-D4N050-LTLCardinality-14
FORMULA_NAME Murphy-PT-D4N050-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680938689502

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D4N050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-08 07:24:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-08 07:24:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-08 07:24:51] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2023-04-08 07:24:51] [INFO ] Transformed 30 places.
[2023-04-08 07:24:51] [INFO ] Transformed 35 transitions.
[2023-04-08 07:24:51] [INFO ] Parsed PT model containing 30 places and 35 transitions and 135 arcs in 87 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Murphy-PT-D4N050-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D4N050-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 12 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2023-04-08 07:24:51] [INFO ] Computed 6 invariants in 8 ms
[2023-04-08 07:24:51] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
[2023-04-08 07:24:51] [INFO ] Invariant cache hit.
[2023-04-08 07:24:51] [INFO ] Implicit Places using invariants in 30 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 235 ms. Remains : 29/30 places, 35/35 transitions.
Support contains 25 out of 29 places after structural reductions.
[2023-04-08 07:24:51] [INFO ] Flatten gal took : 18 ms
[2023-04-08 07:24:51] [INFO ] Flatten gal took : 8 ms
[2023-04-08 07:24:51] [INFO ] Input system was already deterministic with 35 transitions.
Incomplete random walk after 10014 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 31) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 35 rows 29 cols
[2023-04-08 07:24:52] [INFO ] Computed 5 invariants in 1 ms
[2023-04-08 07:24:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:52] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:24:52] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-04-08 07:24:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:52] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:24:52] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-04-08 07:24:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:52] [INFO ] After 21ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-04-08 07:24:52] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-04-08 07:24:52] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 6 out of 29 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 5 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:52] [INFO ] Invariant cache hit.
[2023-04-08 07:24:52] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 29/29 places, 35/35 transitions.
Incomplete random walk after 10021 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 296479 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 296479 steps, saw 205161 distinct states, run finished after 3002 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-08 07:24:55] [INFO ] Invariant cache hit.
[2023-04-08 07:24:55] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:55] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:24:55] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-08 07:24:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:55] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:24:55] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-08 07:24:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:55] [INFO ] After 13ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-08 07:24:55] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-04-08 07:24:55] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 11 ms.
Support contains 6 out of 29 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 29/29 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:55] [INFO ] Invariant cache hit.
[2023-04-08 07:24:55] [INFO ] Implicit Places using invariants in 30 ms returned [10, 11, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 26/29 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 33 ms. Remains : 26/29 places, 35/35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 290491 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 290491 steps, saw 201595 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 35 rows 26 cols
[2023-04-08 07:24:58] [INFO ] Computed 2 invariants in 1 ms
[2023-04-08 07:24:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:58] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-08 07:24:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:58] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-08 07:24:58] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:58] [INFO ] After 12ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-08 07:24:58] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-04-08 07:24:59] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 15 ms.
Support contains 6 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 26/26 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:59] [INFO ] Invariant cache hit.
[2023-04-08 07:24:59] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-08 07:24:59] [INFO ] Invariant cache hit.
[2023-04-08 07:24:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:59] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 65 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 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 26/26 places, 35/35 transitions.
Graph (complete) has 68 edges and 26 vertex of which 20 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 3 ms. Remains 20 /26 variables (removed 6) and now considering 27/35 (removed 8) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 27 rows 20 cols
[2023-04-08 07:24:59] [INFO ] Computed 2 invariants in 0 ms
[2023-04-08 07:24:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:59] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-08 07:24:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:59] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-08 07:24:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:59] [INFO ] After 11ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-08 07:24:59] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-04-08 07:24:59] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U G((p1&&(p2 U (G(p2)||(p2&&G(p3)))))))))'
Support contains 6 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 29 cols
[2023-04-08 07:24:59] [INFO ] Computed 5 invariants in 2 ms
[2023-04-08 07:24:59] [INFO ] Dead Transitions using invariants and state equation in 42 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 41 ms returned [10, 11, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/29 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 26/29 places, 35/35 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 478 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) p1 p2 (NOT p3))]
Running random walk in product with property : Murphy-PT-D4N050-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p2), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p3) p2), acceptance={0, 2} source=1 dest: 3}, { cond=(AND p1 p3 p2), acceptance={2} source=1 dest: 4}], [{ cond=p0, acceptance={0, 1} source=2 dest: 2}, { cond=(NOT p0), acceptance={0, 1, 2} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0, 2} source=3 dest: 3}, { cond=(AND p3 p2), acceptance={2} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0, 2} source=4 dest: 3}, { cond=(AND p3 p2), acceptance={2} source=4 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={1, 2} source=4 dest: 5}, { cond=(AND p3 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p3) p2), acceptance={0, 1} source=5 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p3) (NOT p2))), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p3) (NOT p2))), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p3) p2), acceptance={0, 2} source=5 dest: 3}, { cond=(AND p1 p3 p2), acceptance={2} source=5 dest: 4}, { cond=(AND p1 p3 p2), acceptance={1} source=5 dest: 5}, { cond=(OR (AND (NOT p1) p3) (AND p3 (NOT p2))), acceptance={1, 2} source=5 dest: 5}, { cond=(OR (AND (NOT p1) p3) (AND p3 (NOT p2))), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 (NOT p3) p2), acceptance={} source=6 dest: 2}, { cond=(AND p1 p3 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GT s2 s25), p2:(GT s10 s14), p3:(GT 2 s4), p0:(LEQ 1 s17)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 288 ms.
Stack based approach found an accepted trace after 210 steps with 0 reset with depth 211 and stack size 209 in 1 ms.
FORMULA Murphy-PT-D4N050-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N050-LTLCardinality-00 finished in 937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X(F(p1))))))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:00] [INFO ] Invariant cache hit.
[2023-04-08 07:25:00] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-04-08 07:25:00] [INFO ] Invariant cache hit.
[2023-04-08 07:25:00] [INFO ] Implicit Places using invariants in 33 ms returned [10, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 34 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/29 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 25/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-PT-D4N050-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p1:(GT 2 s16), p0:(GT 2 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 15062 reset in 175 ms.
Stack based approach found an accepted trace after 45 steps with 5 reset with depth 13 and stack size 13 in 0 ms.
FORMULA Murphy-PT-D4N050-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N050-LTLCardinality-01 finished in 442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||G(p1)))&&F(G((p2||X(F(p0))))))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 5 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:01] [INFO ] Invariant cache hit.
[2023-04-08 07:25:01] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:25:01] [INFO ] Invariant cache hit.
[2023-04-08 07:25:01] [INFO ] Implicit Places using invariants in 27 ms returned [10, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 28 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/29 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 69 ms. Remains : 25/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Murphy-PT-D4N050-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s4 s12), p1:(LEQ 1 s3), p2:(LEQ 1 s5)], 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 1 reset in 189 ms.
Stack based approach found an accepted trace after 1386 steps with 0 reset with depth 1387 and stack size 1373 in 4 ms.
FORMULA Murphy-PT-D4N050-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N050-LTLCardinality-02 finished in 399 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)&&G(F(p1)))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:01] [INFO ] Invariant cache hit.
[2023-04-08 07:25:01] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-04-08 07:25:01] [INFO ] Invariant cache hit.
[2023-04-08 07:25:01] [INFO ] Implicit Places using invariants in 32 ms returned [10, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 33 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/29 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77 ms. Remains : 25/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : Murphy-PT-D4N050-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s19 s21), p1:(LEQ s9 s22)], 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]]
Product exploration explored 100000 steps with 50 reset in 165 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA Murphy-PT-D4N050-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N050-LTLCardinality-03 finished in 457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(!p0)||(G((p1||F(p2)))&&F(p3)))))'
Support contains 8 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:01] [INFO ] Invariant cache hit.
[2023-04-08 07:25:01] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-04-08 07:25:01] [INFO ] Invariant cache hit.
[2023-04-08 07:25:01] [INFO ] Implicit Places using invariants in 26 ms returned [11, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/29 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 75 ms. Remains : 27/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 320 ms :[false, (AND (NOT p2) p0 p1), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p3) p0), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p3)]
Running random walk in product with property : Murphy-PT-D4N050-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s19 s4), p1:(LEQ s25 s10), p2:(LEQ s22 s11), p3:(LEQ s16 s17)], 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, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 7 reset in 189 ms.
Product exploration explored 100000 steps with 0 reset in 288 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), true]
False Knowledge obtained : [(X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 2 factoid took 519 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter insensitive) to 7 states, 12 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 317 ms :[false, (AND (NOT p2) p0 p1), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p3) p0), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p3)]
Finished random walk after 441 steps, including 0 resets, run visited all 9 properties in 6 ms. (steps per millisecond=73 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), true]
False Knowledge obtained : [(X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p3))), (X (X p3)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND p0 p1 (NOT p2))), (F p2), (F (AND p0 (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p3))), (F (NOT p0)), (F (NOT p3)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 736 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter insensitive) to 7 states, 12 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 297 ms :[false, (AND (NOT p2) p0 p1), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p3) p0), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p3)]
Stuttering acceptance computed with spot in 289 ms :[false, (AND (NOT p2) p0 p1), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p3) p0), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p3)]
Support contains 8 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 35/35 transitions.
Applied a total of 0 rules in 5 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 27 cols
[2023-04-08 07:25:04] [INFO ] Computed 3 invariants in 2 ms
[2023-04-08 07:25:05] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-04-08 07:25:05] [INFO ] Invariant cache hit.
[2023-04-08 07:25:05] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-08 07:25:05] [INFO ] Invariant cache hit.
[2023-04-08 07:25:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:05] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-08 07:25:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:25:05] [INFO ] Invariant cache hit.
[2023-04-08 07:25:05] [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 148 ms. Remains : 27/27 places, 35/35 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), true]
False Knowledge obtained : [(X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 2 factoid took 467 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter insensitive) to 7 states, 12 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 271 ms :[false, (AND (NOT p2) p0 p1), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p3) p0), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p3)]
Finished random walk after 1271 steps, including 0 resets, run visited all 9 properties in 5 ms. (steps per millisecond=254 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), true]
False Knowledge obtained : [(X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p3))), (X (X p3)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND p0 p1 (NOT p2))), (F p2), (F (AND p0 (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p3))), (F (NOT p0)), (F (NOT p3)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 660 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter insensitive) to 7 states, 12 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 349 ms :[false, (AND (NOT p2) p0 p1), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p3) p0), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p3)]
Stuttering acceptance computed with spot in 341 ms :[false, (AND (NOT p2) p0 p1), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p3) p0), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p3)]
Stuttering acceptance computed with spot in 378 ms :[false, (AND (NOT p2) p0 p1), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p3) p0), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p3)]
Product exploration explored 100000 steps with 16 reset in 203 ms.
Product exploration explored 100000 steps with 9 reset in 234 ms.
Support contains 8 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:08] [INFO ] Invariant cache hit.
[2023-04-08 07:25:08] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-04-08 07:25:08] [INFO ] Invariant cache hit.
[2023-04-08 07:25:08] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-04-08 07:25:08] [INFO ] Invariant cache hit.
[2023-04-08 07:25:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:08] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-04-08 07:25:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:25:08] [INFO ] Invariant cache hit.
[2023-04-08 07:25:08] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163 ms. Remains : 27/27 places, 35/35 transitions.
Treatment of property Murphy-PT-D4N050-LTLCardinality-04 finished in 6425 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)||X(F(p1))))))'
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 29 cols
[2023-04-08 07:25:08] [INFO ] Computed 5 invariants in 2 ms
[2023-04-08 07:25:08] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-04-08 07:25:08] [INFO ] Invariant cache hit.
[2023-04-08 07:25:08] [INFO ] Implicit Places using invariants in 24 ms returned [10, 11, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 25 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/29 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 26/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Murphy-PT-D4N050-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p1:(OR (GT 2 s15) (LEQ s17 s10)), p0:(LEQ s1 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 159 ms.
Product exploration explored 100000 steps with 25000 reset in 183 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 119 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10039 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=264 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 35 rows 26 cols
[2023-04-08 07:25:09] [INFO ] Computed 2 invariants in 1 ms
[2023-04-08 07:25:09] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:25:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:25:09] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-08 07:25:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:09] [INFO ] After 8ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-08 07:25:09] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-04-08 07:25:09] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 18 ms.
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:09] [INFO ] Invariant cache hit.
[2023-04-08 07:25:09] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 26/26 places, 35/35 transitions.
Incomplete random walk after 10044 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=436 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 403696 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 403696 steps, saw 279188 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-08 07:25:12] [INFO ] Invariant cache hit.
[2023-04-08 07:25:12] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:25:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:25:12] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-08 07:25:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:12] [INFO ] After 9ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-08 07:25:12] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-04-08 07:25:12] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 12 ms.
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 26/26 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:12] [INFO ] Invariant cache hit.
[2023-04-08 07:25:12] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-08 07:25:12] [INFO ] Invariant cache hit.
[2023-04-08 07:25:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:12] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-04-08 07:25:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:25:12] [INFO ] Invariant cache hit.
[2023-04-08 07:25:12] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 26/26 places, 35/35 transitions.
Graph (complete) has 68 edges and 26 vertex of which 20 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 1 ms. Remains 20 /26 variables (removed 6) and now considering 27/35 (removed 8) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 27 rows 20 cols
[2023-04-08 07:25:12] [INFO ] Computed 2 invariants in 0 ms
[2023-04-08 07:25:12] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:25:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:25:12] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-08 07:25:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:25:12] [INFO ] After 12ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-08 07:25:12] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2023-04-08 07:25:12] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2023-04-08 07:25:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 46 ms
[2023-04-08 07:25:12] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-04-08 07:25:12] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 162 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 26 cols
[2023-04-08 07:25:13] [INFO ] Computed 2 invariants in 1 ms
[2023-04-08 07:25:13] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-04-08 07:25:13] [INFO ] Invariant cache hit.
[2023-04-08 07:25:13] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-08 07:25:13] [INFO ] Invariant cache hit.
[2023-04-08 07:25:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:13] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[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 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 26/26 places, 35/35 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10033 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=501 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-08 07:25:14] [INFO ] Invariant cache hit.
[2023-04-08 07:25:14] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:25:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:25:14] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-08 07:25:14] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:14] [INFO ] After 9ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-08 07:25:14] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-04-08 07:25:14] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 14 ms.
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (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 31 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 26/26 places, 35/35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) 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 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 406612 steps, run timeout after 3014 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 406612 steps, saw 281307 distinct states, run finished after 3014 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-08 07:25:17] [INFO ] Invariant cache hit.
[2023-04-08 07:25:17] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:25:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:25:17] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-08 07:25:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:17] [INFO ] After 16ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-08 07:25:17] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-04-08 07:25:17] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 14 ms.
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 26/26 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:17] [INFO ] Invariant cache hit.
[2023-04-08 07:25:17] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-04-08 07:25:17] [INFO ] Invariant cache hit.
[2023-04-08 07:25:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:17] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-04-08 07:25:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-08 07:25:17] [INFO ] Invariant cache hit.
[2023-04-08 07:25:17] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 26/26 places, 35/35 transitions.
Graph (complete) has 68 edges and 26 vertex of which 20 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 1 ms. Remains 20 /26 variables (removed 6) and now considering 27/35 (removed 8) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 27 rows 20 cols
[2023-04-08 07:25:17] [INFO ] Computed 2 invariants in 0 ms
[2023-04-08 07:25:17] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:25:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:25:17] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-08 07:25:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:25:17] [INFO ] After 8ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-08 07:25:17] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2023-04-08 07:25:17] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2023-04-08 07:25:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 44 ms
[2023-04-08 07:25:17] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-04-08 07:25:17] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 149 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 132 ms.
Product exploration explored 100000 steps with 25000 reset in 142 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 35/35 transitions.
Applied a total of 0 rules in 4 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 26 cols
[2023-04-08 07:25:19] [INFO ] Computed 2 invariants in 2 ms
[2023-04-08 07:25:19] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:25:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:25:19] [INFO ] Invariant cache hit.
[2023-04-08 07:25:19] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 26/26 places, 35/35 transitions.
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:19] [INFO ] Invariant cache hit.
[2023-04-08 07:25:19] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:25:19] [INFO ] Invariant cache hit.
[2023-04-08 07:25:19] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-08 07:25:19] [INFO ] Invariant cache hit.
[2023-04-08 07:25:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:19] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-04-08 07:25:19] [INFO ] Invariant cache hit.
[2023-04-08 07:25:19] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 26/26 places, 35/35 transitions.
Treatment of property Murphy-PT-D4N050-LTLCardinality-06 finished in 11093 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 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 29 cols
[2023-04-08 07:25:19] [INFO ] Computed 5 invariants in 1 ms
[2023-04-08 07:25:19] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-04-08 07:25:19] [INFO ] Invariant cache hit.
[2023-04-08 07:25:19] [INFO ] Implicit Places using invariants in 27 ms returned [10, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 29 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/29 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 66 ms. Remains : 25/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Murphy-PT-D4N050-LTLCardinality-07 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 (LEQ 2 s13) (GT s14 s1))], 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 195 ms.
Stack based approach found an accepted trace after 56 steps with 0 reset with depth 57 and stack size 57 in 0 ms.
FORMULA Murphy-PT-D4N050-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N050-LTLCardinality-07 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' '!(X(X(X(X(G(p0))))))'
Support contains 1 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 26 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:19] [INFO ] Invariant cache hit.
[2023-04-08 07:25:19] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-04-08 07:25:19] [INFO ] Invariant cache hit.
[2023-04-08 07:25:19] [INFO ] Implicit Places using invariants in 27 ms returned [10, 12, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/29 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 26/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-PT-D4N050-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(GT 3 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 36 steps with 0 reset in 1 ms.
FORMULA Murphy-PT-D4N050-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D4N050-LTLCardinality-09 finished in 296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:20] [INFO ] Invariant cache hit.
[2023-04-08 07:25:20] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-04-08 07:25:20] [INFO ] Invariant cache hit.
[2023-04-08 07:25:20] [INFO ] Implicit Places using invariants in 24 ms returned [10, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 25 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/29 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63 ms. Remains : 25/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : Murphy-PT-D4N050-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s9 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50 reset in 157 ms.
Stack based approach found an accepted trace after 99 steps with 0 reset with depth 100 and stack size 100 in 1 ms.
FORMULA Murphy-PT-D4N050-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N050-LTLCardinality-10 finished in 277 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((X(X((p0||F(p1))))||(p0 U (p2||G(p0)))))))'
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:20] [INFO ] Invariant cache hit.
[2023-04-08 07:25:20] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:25:20] [INFO ] Invariant cache hit.
[2023-04-08 07:25:20] [INFO ] Implicit Places using invariants in 25 ms returned [10, 12, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 26 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/29 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 26/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 466 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-PT-D4N050-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 7}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=7 dest: 3}, { cond=(NOT p1), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=7 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 7}, { cond=(NOT p1), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=8 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=9 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=9 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=9 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=9 dest: 6}]], initial=0, aps=[p2:(AND (GT s16 s10) (GT 1 s12)), p0:(GT 1 s12), p1:(GT s2 s5)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13709 reset in 215 ms.
Stack based approach found an accepted trace after 2873 steps with 384 reset with depth 55 and stack size 55 in 7 ms.
FORMULA Murphy-PT-D4N050-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N050-LTLCardinality-11 finished in 775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:21] [INFO ] Invariant cache hit.
[2023-04-08 07:25:21] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
[2023-04-08 07:25:21] [INFO ] Invariant cache hit.
[2023-04-08 07:25:21] [INFO ] Implicit Places using invariants in 74 ms returned [10, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 76 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/29 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 129 ms. Remains : 25/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : Murphy-PT-D4N050-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 s14)], 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 193 ms.
Product exploration explored 100000 steps with 0 reset in 339 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Incomplete random walk after 10047 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1004 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2047133 steps, run timeout after 3001 ms. (steps per millisecond=682 ) properties seen :{}
Probabilistic random walk after 2047133 steps, saw 1425793 distinct states, run finished after 3001 ms. (steps per millisecond=682 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 35 rows 25 cols
[2023-04-08 07:25:24] [INFO ] Computed 1 invariants in 1 ms
[2023-04-08 07:25:24] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:25:24] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:25:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:25:25] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:25:25] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:25] [INFO ] After 2ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:25:25] [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 1 ms.
[2023-04-08 07:25:25] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions removed 30 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
// Phase 1: matrix 4 rows 3 cols
[2023-04-08 07:25:25] [INFO ] Computed 0 invariants in 0 ms
[2023-04-08 07:25:25] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 3/25 places, 4/35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 4 ms. (steps per millisecond=3 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), (X (X p0)), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Murphy-PT-D4N050-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Murphy-PT-D4N050-LTLCardinality-12 finished in 4028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 29 cols
[2023-04-08 07:25:25] [INFO ] Computed 5 invariants in 1 ms
[2023-04-08 07:25:25] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-04-08 07:25:25] [INFO ] Invariant cache hit.
[2023-04-08 07:25:25] [INFO ] Implicit Places using invariants in 30 ms returned [10, 11, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/29 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 26/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-PT-D4N050-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ s10 s17), p1:(GT 3 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Murphy-PT-D4N050-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D4N050-LTLCardinality-13 finished in 217 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))&&X((G(p1) U !p0))))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:25] [INFO ] Invariant cache hit.
[2023-04-08 07:25:25] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-04-08 07:25:25] [INFO ] Invariant cache hit.
[2023-04-08 07:25:25] [INFO ] Implicit Places using invariants in 30 ms returned [10, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 31 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/29 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 25/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), true, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : Murphy-PT-D4N050-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(OR p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ s9 s18), p0:(LEQ 3 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Murphy-PT-D4N050-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D4N050-LTLCardinality-14 finished in 234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1))))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:25] [INFO ] Invariant cache hit.
[2023-04-08 07:25:25] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-04-08 07:25:25] [INFO ] Invariant cache hit.
[2023-04-08 07:25:25] [INFO ] Implicit Places using invariants in 30 ms returned [10, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 31 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/29 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 25/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Murphy-PT-D4N050-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s14), p0:(AND (GT 2 s11) (LEQ 1 s14))], 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 6548 reset in 148 ms.
Stack based approach found an accepted trace after 130 steps with 4 reset with depth 21 and stack size 21 in 0 ms.
FORMULA Murphy-PT-D4N050-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N050-LTLCardinality-15 finished in 343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(!p0)||(G((p1||F(p2)))&&F(p3)))))'
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)||X(F(p1))))))'
[2023-04-08 07:25:26] [INFO ] Flatten gal took : 6 ms
[2023-04-08 07:25:26] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-04-08 07:25:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 29 places, 35 transitions and 131 arcs took 1 ms.
Total runtime 34845 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1684/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1684/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Murphy-PT-D4N050-LTLCardinality-04
Could not compute solution for formula : Murphy-PT-D4N050-LTLCardinality-06

BK_STOP 1680938727422

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name Murphy-PT-D4N050-LTLCardinality-06
ltl formula formula --ltl=/tmp/1684/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
pnml2lts-mc( 0/ 4): Petri net has 29 places, 35 transitions and 131 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
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/1684/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1684/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1684/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1684/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Murphy-PT-D4N050"
export BK_EXAMINATION="LTLCardinality"
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-D4N050, examination is LTLCardinality"
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-167987246600371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D4N050.tgz
mv Murphy-PT-D4N050 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;