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.r519-tall-167987245200371.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 lolaxred
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 r519-tall-167987245200371
=====================================================================

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

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D4N050
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-08 07:24:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-08 07:24:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-08 07:24:48] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-04-08 07:24:48] [INFO ] Transformed 30 places.
[2023-04-08 07:24:48] [INFO ] Transformed 35 transitions.
[2023-04-08 07:24:48] [INFO ] Parsed PT model containing 30 places and 35 transitions and 135 arcs in 82 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 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 9 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2023-04-08 07:24:48] [INFO ] Computed 6 invariants in 8 ms
[2023-04-08 07:24:49] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
[2023-04-08 07:24:49] [INFO ] Invariant cache hit.
[2023-04-08 07:24:49] [INFO ] Implicit Places using invariants in 40 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 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 462 ms. Remains : 29/30 places, 35/35 transitions.
Support contains 25 out of 29 places after structural reductions.
[2023-04-08 07:24:49] [INFO ] Flatten gal took : 19 ms
[2023-04-08 07:24:49] [INFO ] Flatten gal took : 9 ms
[2023-04-08 07:24:49] [INFO ] Input system was already deterministic with 35 transitions.
Incomplete random walk after 10033 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 31) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 35 rows 29 cols
[2023-04-08 07:24:49] [INFO ] Computed 5 invariants in 12 ms
[2023-04-08 07:24:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:49] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:24:49] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-04-08 07:24:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-04-08 07:24:49] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:24:49] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-04-08 07:24:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:49] [INFO ] After 11ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-04-08 07:24:49] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-04-08 07:24:49] [INFO ] After 122ms 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 29 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:49] [INFO ] Invariant cache hit.
[2023-04-08 07:24:49] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 29/29 places, 35/35 transitions.
Incomplete random walk after 10030 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) 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 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 266763 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 266763 steps, saw 184077 distinct states, run finished after 3002 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-08 07:24:53] [INFO ] Invariant cache hit.
[2023-04-08 07:24:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-08 07:24:53] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:24:53] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-08 07:24:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:53] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 7 ms returned sat
[2023-04-08 07:24:53] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-08 07:24:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:53] [INFO ] After 11ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-08 07:24:53] [INFO ] After 25ms 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:53] [INFO ] After 102ms 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 1 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 1 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 2 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:53] [INFO ] Invariant cache hit.
[2023-04-08 07:24:53] [INFO ] Implicit Places using invariants in 28 ms returned [10, 11, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 29 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 3 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 34 ms. Remains : 26/29 places, 35/35 transitions.
Incomplete random walk after 10037 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=286 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) 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
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
Interrupted probabilistic random walk after 330359 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 330359 steps, saw 228648 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 35 rows 26 cols
[2023-04-08 07:24:56] [INFO ] Computed 2 invariants in 2 ms
[2023-04-08 07:24:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:56] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-08 07:24:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:56] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-08 07:24:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:56] [INFO ] After 38ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-08 07:24:56] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-04-08 07:24:56] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 14 ms.
Support contains 6 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 26/26 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:56] [INFO ] Invariant cache hit.
[2023-04-08 07:24:56] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-08 07:24:56] [INFO ] Invariant cache hit.
[2023-04-08 07:24:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:56] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-04-08 07:24:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:24:56] [INFO ] Invariant cache hit.
[2023-04-08 07:24:56] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 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 2 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:56] [INFO ] Computed 2 invariants in 0 ms
[2023-04-08 07:24:56] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:56] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-08 07:24:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:56] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-08 07:24:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:56] [INFO ] After 22ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-08 07:24:56] [INFO ] After 51ms 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:56] [INFO ] After 120ms 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:57] [INFO ] Computed 5 invariants in 1 ms
[2023-04-08 07:24:57] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
[2023-04-08 07:24:57] [INFO ] Invariant cache hit.
[2023-04-08 07:24:57] [INFO ] Implicit Places using invariants in 26 ms returned [10, 11, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 27 ms to find 3 implicit places.
Starting structural reductions in 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 83 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 520 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 329 ms.
Stack based approach found an accepted trace after 212 steps with 0 reset with depth 213 and stack size 211 in 1 ms.
FORMULA Murphy-PT-D4N050-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N050-LTLCardinality-00 finished in 1005 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 0 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:58] [INFO ] Invariant cache hit.
[2023-04-08 07:24:58] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:24:58] [INFO ] Invariant cache hit.
[2023-04-08 07:24:58] [INFO ] Implicit Places using invariants in 28 ms returned [10, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 29 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/29 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 25/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 203 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 14722 reset in 183 ms.
Stack based approach found an accepted trace after 229 steps with 37 reset with depth 21 and stack size 21 in 1 ms.
FORMULA Murphy-PT-D4N050-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N050-LTLCardinality-01 finished in 468 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 7 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:58] [INFO ] Invariant cache hit.
[2023-04-08 07:24:58] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-04-08 07:24:58] [INFO ] Invariant cache hit.
[2023-04-08 07:24:58] [INFO ] Implicit Places using invariants in 26 ms returned [10, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 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 3 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 77 ms. Remains : 25/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 142 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 2 reset in 194 ms.
Stack based approach found an accepted trace after 1377 steps with 1 reset with depth 1362 and stack size 1339 in 3 ms.
FORMULA Murphy-PT-D4N050-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N050-LTLCardinality-02 finished in 440 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:24:59] [INFO ] Invariant cache hit.
[2023-04-08 07:24:59] [INFO ] Dead Transitions using invariants and state equation in 31 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 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 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 61 ms. Remains : 25/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 212 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 49 reset in 187 ms.
Stack based approach found an accepted trace after 41 steps with 0 reset with depth 42 and stack size 42 in 0 ms.
FORMULA Murphy-PT-D4N050-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N050-LTLCardinality-03 finished in 480 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:24:59] [INFO ] Invariant cache hit.
[2023-04-08 07:24:59] [INFO ] Dead Transitions using invariants and state equation in 36 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 26 ms returned [11, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 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 70 ms. Remains : 27/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 292 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 0 reset in 195 ms.
Product exploration explored 100000 steps with 5 reset in 236 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 455 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 632 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 2469 steps, including 0 resets, run visited all 9 properties in 7 ms. (steps per millisecond=352 )
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 729 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 287 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 283 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 6 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:02] [INFO ] Computed 3 invariants in 6 ms
[2023-04-08 07:25:02] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-04-08 07:25:02] [INFO ] Invariant cache hit.
[2023-04-08 07:25:02] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-08 07:25:02] [INFO ] Invariant cache hit.
[2023-04-08 07:25:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:03] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-04-08 07:25:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:25:03] [INFO ] Invariant cache hit.
[2023-04-08 07:25:03] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 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 459 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 303 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 177 steps, including 0 resets, run visited all 9 properties in 4 ms. (steps per millisecond=44 )
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 676 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 282 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 275 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 295 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 7 reset in 221 ms.
Product exploration explored 100000 steps with 0 reset in 340 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 1 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[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 38 ms found 0 transitions.
[2023-04-08 07:25:05] [INFO ] Invariant cache hit.
[2023-04-08 07:25:06] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-08 07:25:06] [INFO ] Invariant cache hit.
[2023-04-08 07:25:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:06] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-04-08 07:25:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:25:06] [INFO ] Invariant cache hit.
[2023-04-08 07:25:06] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154 ms. Remains : 27/27 places, 35/35 transitions.
Treatment of property Murphy-PT-D4N050-LTLCardinality-04 finished in 6500 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 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:06] [INFO ] Computed 5 invariants in 2 ms
[2023-04-08 07:25:06] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-04-08 07:25:06] [INFO ] Invariant cache hit.
[2023-04-08 07:25:06] [INFO ] Implicit Places using invariants in 25 ms returned [10, 11, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 26 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/29 places, 35/35 transitions.
Applied a total of 0 rules in 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 63 ms. Remains : 26/29 places, 35/35 transitions.
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))]
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 144 ms.
Product exploration explored 100000 steps with 25000 reset in 146 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 127 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 192 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 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :1
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
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 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 35 rows 26 cols
[2023-04-08 07:25:07] [INFO ] Computed 2 invariants in 2 ms
[2023-04-08 07:25:07] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:25:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:25:07] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-08 07:25:07] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:07] [INFO ] After 8ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-08 07:25:07] [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:07] [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 2 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:07] [INFO ] Invariant cache hit.
[2023-04-08 07:25:07] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 26/26 places, 35/35 transitions.
Incomplete random walk after 10045 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=372 ) properties (out of 3) 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 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 413889 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :{}
Probabilistic random walk after 413889 steps, saw 286099 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-08 07:25:10] [INFO ] Invariant cache hit.
[2023-04-08 07:25:10] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:25:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:25:10] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-08 07:25:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:10] [INFO ] After 9ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-08 07:25:10] [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:10] [INFO ] After 79ms 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:10] [INFO ] Invariant cache hit.
[2023-04-08 07:25:10] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-08 07:25:10] [INFO ] Invariant cache hit.
[2023-04-08 07:25:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:10] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-08 07:25:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:25:10] [INFO ] Invariant cache hit.
[2023-04-08 07:25:10] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 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:10] [INFO ] Computed 2 invariants in 1 ms
[2023-04-08 07:25:10] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:25:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:25:10] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-08 07:25:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:25:10] [INFO ] After 7ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-08 07:25:10] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2023-04-08 07:25:10] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2023-04-08 07:25:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 50 ms
[2023-04-08 07:25:10] [INFO ] After 69ms 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:10] [INFO ] After 121ms 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 163 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 180 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 238 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:11] [INFO ] Computed 2 invariants in 1 ms
[2023-04-08 07:25:11] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-04-08 07:25:11] [INFO ] Invariant cache hit.
[2023-04-08 07:25:11] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-08 07:25:11] [INFO ] Invariant cache hit.
[2023-04-08 07:25:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:11] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-08 07:25:11] [INFO ] Invariant cache hit.
[2023-04-08 07:25:11] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 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 137 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))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-08 07:25:11] [INFO ] Invariant cache hit.
[2023-04-08 07:25:11] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:25:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:25:11] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-08 07:25:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:11] [INFO ] After 12ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-08 07:25:11] [INFO ] After 25ms 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:11] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 21 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:11] [INFO ] Invariant cache hit.
[2023-04-08 07:25:12] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 26/26 places, 35/35 transitions.
Incomplete random walk after 10035 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 367783 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 367783 steps, saw 254096 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-08 07:25:15] [INFO ] Invariant cache hit.
[2023-04-08 07:25:15] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:25:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:25:15] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-08 07:25:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:15] [INFO ] After 11ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-08 07:25:15] [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 16 ms.
[2023-04-08 07:25:15] [INFO ] After 82ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 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:15] [INFO ] Invariant cache hit.
[2023-04-08 07:25:15] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-08 07:25:15] [INFO ] Invariant cache hit.
[2023-04-08 07:25:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:15] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-04-08 07:25:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:25:15] [INFO ] Invariant cache hit.
[2023-04-08 07:25:15] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
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:15] [INFO ] Computed 2 invariants in 1 ms
[2023-04-08 07:25:15] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:25:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:25:15] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-08 07:25:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:25:15] [INFO ] After 7ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-08 07:25:15] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2023-04-08 07:25:15] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2023-04-08 07:25:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 39 ms
[2023-04-08 07:25:15] [INFO ] After 62ms 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:15] [INFO ] After 116ms 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 124 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))]
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))]
Stuttering acceptance computed with spot in 313 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 146 ms.
Product exploration explored 100000 steps with 25000 reset in 132 ms.
Applying partial POR strategy [true, false, true, false, false]
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 SI_LTL 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.
// Phase 1: matrix 35 rows 26 cols
[2023-04-08 07:25:16] [INFO ] Computed 2 invariants in 2 ms
[2023-04-08 07:25:17] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-04-08 07:25:17] [INFO ] Redundant transitions in 0 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 SI_LTL mode , in 1 iterations and 77 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 0 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 ] Dead Transitions using invariants and state equation in 31 ms found 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 32 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[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 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 26/26 places, 35/35 transitions.
Treatment of property Murphy-PT-D4N050-LTLCardinality-06 finished in 11054 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 2 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 29 cols
[2023-04-08 07:25:17] [INFO ] Computed 5 invariants in 5 ms
[2023-04-08 07:25:17] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-04-08 07:25:17] [INFO ] Invariant cache hit.
[2023-04-08 07:25:17] [INFO ] Implicit Places using invariants in 29 ms returned [10, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 31 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 78 ms. Remains : 25/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Murphy-PT-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 180 ms.
Stack based approach found an accepted trace after 44 steps with 0 reset with depth 45 and stack size 45 in 0 ms.
FORMULA Murphy-PT-D4N050-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N050-LTLCardinality-07 finished in 301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(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 2 ms. Remains 29 /29 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 ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-04-08 07:25:17] [INFO ] Invariant cache hit.
[2023-04-08 07:25:17] [INFO ] Implicit Places using invariants in 30 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 71 ms. Remains : 26/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 189 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 7 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 281 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 2 ms. Remains 29 /29 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 ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:25:17] [INFO ] Invariant cache hit.
[2023-04-08 07:25:17] [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 3 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 65 ms. Remains : 25/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 29 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 49 reset in 190 ms.
Stack based approach found an accepted trace after 64 steps with 0 reset with depth 65 and stack size 65 in 1 ms.
FORMULA Murphy-PT-D4N050-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N050-LTLCardinality-10 finished in 301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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:18] [INFO ] Invariant cache hit.
[2023-04-08 07:25:18] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-04-08 07:25:18] [INFO ] Invariant cache hit.
[2023-04-08 07:25:18] [INFO ] Implicit Places using invariants in 24 ms returned [10, 12, 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 69 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 13362 reset in 221 ms.
Stack based approach found an accepted trace after 3167 steps with 458 reset with depth 11 and stack size 11 in 8 ms.
FORMULA Murphy-PT-D4N050-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N050-LTLCardinality-11 finished in 792 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 3 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:18] [INFO ] Invariant cache hit.
[2023-04-08 07:25:18] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
[2023-04-08 07:25:18] [INFO ] Invariant cache hit.
[2023-04-08 07:25:18] [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 27 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 118 ms. Remains : 25/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 27 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 196 ms.
Product exploration explored 100000 steps with 0 reset in 198 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 65 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 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2073861 steps, run timeout after 3001 ms. (steps per millisecond=691 ) properties seen :{}
Probabilistic random walk after 2073861 steps, saw 1444048 distinct states, run finished after 3001 ms. (steps per millisecond=691 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 35 rows 25 cols
[2023-04-08 07:25:22] [INFO ] Computed 1 invariants in 6 ms
[2023-04-08 07:25:22] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:25:22] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:25:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:25:22] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:25:22] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:25:22] [INFO ] After 3ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:25:22] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-08 07:25:22] [INFO ] After 48ms 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:22] [INFO ] Computed 0 invariants in 0 ms
[2023-04-08 07:25:22] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 3/25 places, 4/35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
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 2 ms. (steps per millisecond=7 ) 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 16 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 3845 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 1 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 29 cols
[2023-04-08 07:25:22] [INFO ] Computed 5 invariants in 0 ms
[2023-04-08 07:25:22] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-04-08 07:25:22] [INFO ] Invariant cache hit.
[2023-04-08 07:25:22] [INFO ] Implicit Places using invariants in 28 ms returned [10, 11, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 29 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/29 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 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 13 steps with 0 reset in 1 ms.
FORMULA Murphy-PT-D4N050-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D4N050-LTLCardinality-13 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' '!(((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:22] [INFO ] Invariant cache hit.
[2023-04-08 07:25:22] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-04-08 07:25:23] [INFO ] Invariant cache hit.
[2023-04-08 07:25:23] [INFO ] Implicit Places using invariants in 53 ms returned [10, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 54 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 93 ms. Remains : 25/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 143 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 257 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 1 ms. Remains 29 /29 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:25:23] [INFO ] Invariant cache hit.
[2023-04-08 07:25:23] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-04-08 07:25:23] [INFO ] Invariant cache hit.
[2023-04-08 07:25:23] [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 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 66 ms. Remains : 25/29 places, 35/35 transitions.
Stuttering acceptance computed with spot in 110 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 6476 reset in 160 ms.
Stack based approach found an accepted trace after 147 steps with 9 reset with depth 29 and stack size 29 in 1 ms.
FORMULA Murphy-PT-D4N050-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N050-LTLCardinality-15 finished in 353 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:23] [INFO ] Flatten gal took : 7 ms
[2023-04-08 07:25:23] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-04-08 07:25:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 29 places, 35 transitions and 131 arcs took 0 ms.
Total runtime 35382 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Murphy-PT-D4N050
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

FORMULA Murphy-PT-D4N050-LTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1680938734767

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 4 (type EXCL) for 3 Murphy-PT-D4N050-LTLCardinality-06
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for Murphy-PT-D4N050-LTLCardinality-06
lola: result : true
lola: markings : 1491
lola: fired transitions : 3398
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 Murphy-PT-D4N050-LTLCardinality-04
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Murphy-PT-D4N050-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Murphy-PT-D4N050-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 20/32 Murphy-PT-D4N050-LTLCardinality-04 2870281 m, 574056 m/sec, 6527553 t fired, .

Time elapsed: 5 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for Murphy-PT-D4N050-LTLCardinality-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Murphy-PT-D4N050-LTLCardinality-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Murphy-PT-D4N050-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 10 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Murphy-PT-D4N050-LTLCardinality-04: LTL unknown AGGR
Murphy-PT-D4N050-LTLCardinality-06: LTL true LTL model checker


Time elapsed: 10 secs. Pages in use: 32

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="lolaxred"
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 lolaxred"
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 r519-tall-167987245200371"
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 ;