Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.2K Apr 11 22:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 11 22:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 11 22:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 22:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 6 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 6 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 6 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 6 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 11 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 22:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 11 22:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 19K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716679539565

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D4N025
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 23:25:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 23:25:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 23:25:41] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2024-05-25 23:25:41] [INFO ] Transformed 30 places.
[2024-05-25 23:25:41] [INFO ] Transformed 35 transitions.
[2024-05-25 23:25:41] [INFO ] Parsed PT model containing 30 places and 35 transitions and 135 arcs in 89 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 3 formulas.
FORMULA Murphy-PT-D4N025-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D4N025-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D4N025-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 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
[2024-05-25 23:25:41] [INFO ] Computed 6 invariants in 6 ms
[2024-05-25 23:25:41] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
[2024-05-25 23:25:41] [INFO ] Invariant cache hit.
[2024-05-25 23:25:41] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-25 23:25:41] [INFO ] Invariant cache hit.
[2024-05-25 23:25:41] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:25:41] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-25 23:25:41] [INFO ] Invariant cache hit.
[2024-05-25 23:25:41] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 357 ms. Remains : 30/30 places, 35/35 transitions.
Support contains 28 out of 30 places after structural reductions.
[2024-05-25 23:25:42] [INFO ] Flatten gal took : 18 ms
[2024-05-25 23:25:42] [INFO ] Flatten gal took : 7 ms
[2024-05-25 23:25:42] [INFO ] Input system was already deterministic with 35 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 33) seen :32
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 23:25:42] [INFO ] Invariant cache hit.
[2024-05-25 23:25:42] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-25 23:25:42] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 23:25:42] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 23:25:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:25:42] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:25:42] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 23:25:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:25:42] [INFO ] After 4ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 23:25:42] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-25 23:25:42] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Graph (complete) has 115 edges and 30 vertex of which 3 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.1 ms
Discarding 27 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 6 ms. Remains 3 /30 variables (removed 27) and now considering 4/35 (removed 31) transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 23:25:42] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 23:25:42] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 3/30 places, 4/35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) 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 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 12 ms. (steps per millisecond=1 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
FORMULA Murphy-PT-D4N025-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA Murphy-PT-D4N025-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2024-05-25 23:25:43] [INFO ] Computed 6 invariants in 3 ms
[2024-05-25 23:25:43] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2024-05-25 23:25:43] [INFO ] Invariant cache hit.
[2024-05-25 23:25:43] [INFO ] Implicit Places using invariants in 42 ms returned [11, 12, 13, 14]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 54 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103 ms. Remains : 26/30 places, 35/35 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 156 ms :[(NOT p0)]
Running random walk in product with property : Murphy-PT-D4N025-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s10 s23)], 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 353 ms.
Stack based approach found an accepted trace after 177 steps with 0 reset with depth 178 and stack size 178 in 1 ms.
FORMULA Murphy-PT-D4N025-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N025-LTLCardinality-02 finished in 831 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&&G((p1 U p2)))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 23:25:43] [INFO ] Invariant cache hit.
[2024-05-25 23:25:43] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2024-05-25 23:25:43] [INFO ] Invariant cache hit.
[2024-05-25 23:25:43] [INFO ] Implicit Places using invariants in 64 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 72 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 118 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : Murphy-PT-D4N025-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(OR p2 p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 s23), p2:(AND (LEQ 2 s21) (LEQ 1 s16)), p1:(LEQ 2 s21)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 252 ms.
Stack based approach found an accepted trace after 295 steps with 0 reset with depth 296 and stack size 295 in 5 ms.
FORMULA Murphy-PT-D4N025-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N025-LTLCardinality-03 finished in 547 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(F(p0)))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 23:25:44] [INFO ] Invariant cache hit.
[2024-05-25 23:25:44] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
[2024-05-25 23:25:44] [INFO ] Invariant cache hit.
[2024-05-25 23:25:44] [INFO ] Implicit Places using invariants in 242 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 243 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 383 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-PT-D4N025-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (GT s23 s21) (GT 1 s12))], 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][false, false, false, false]]
Product exploration explored 100000 steps with 18907 reset in 262 ms.
Stack based approach found an accepted trace after 127 steps with 19 reset with depth 17 and stack size 17 in 0 ms.
FORMULA Murphy-PT-D4N025-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N025-LTLCardinality-05 finished in 817 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((X(p0)&&p1)))))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 23:25:45] [INFO ] Invariant cache hit.
[2024-05-25 23:25:45] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
[2024-05-25 23:25:45] [INFO ] Invariant cache hit.
[2024-05-25 23:25:45] [INFO ] Implicit Places using invariants in 52 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 73 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 152 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Murphy-PT-D4N025-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p1, acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s19), p1:(AND (GT 1 s19) (GT 2 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 345 reset in 175 ms.
Stack based approach found an accepted trace after 186 steps with 9 reset with depth 169 and stack size 169 in 1 ms.
FORMULA Murphy-PT-D4N025-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N025-LTLCardinality-06 finished in 461 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(p1))||p0)) U p2))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 23:25:45] [INFO ] Invariant cache hit.
[2024-05-25 23:25:45] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
[2024-05-25 23:25:45] [INFO ] Invariant cache hit.
[2024-05-25 23:25:45] [INFO ] Implicit Places using invariants in 66 ms returned [11, 12, 13, 14]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 76 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 144 ms. Remains : 26/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) p1)), p1, p1, true]
Running random walk in product with property : Murphy-PT-D4N025-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ 2 s10), p0:(OR (LEQ 2 s11) (LEQ 1 s2)), p1:(LEQ s6 s11)], nbAcceptance=0, 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 8218 reset in 170 ms.
Stack based approach found an accepted trace after 235 steps with 22 reset with depth 10 and stack size 10 in 0 ms.
FORMULA Murphy-PT-D4N025-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N025-LTLCardinality-07 finished in 493 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||G(p1)))||((p0||G(p1))&&F((G(p2)&&F(p0))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 23:25:46] [INFO ] Invariant cache hit.
[2024-05-25 23:25:46] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
[2024-05-25 23:25:46] [INFO ] Invariant cache hit.
[2024-05-25 23:25:46] [INFO ] Implicit Places using invariants in 47 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 50 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 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 121 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 421 ms :[(AND (NOT p0) (NOT p1)), true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Murphy-PT-D4N025-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 10}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 8}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}, { cond=p2, acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 8}], [{ cond=(NOT p2), acceptance={0} source=7 dest: 6}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=9 dest: 8}, { cond=(AND p1 (NOT p2)), acceptance={} source=9 dest: 9}, { cond=(AND p1 p2), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={} source=10 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={} source=10 dest: 9}, { cond=(AND p1 p2), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(GT s17 s8), p1:(GT 2 s2), p2:(LEQ 1 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 0 ms.
FORMULA Murphy-PT-D4N025-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D4N025-LTLCardinality-08 finished in 567 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)||p0)) U p1)||X(X(G(p2)))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 23:25:46] [INFO ] Invariant cache hit.
[2024-05-25 23:25:46] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2024-05-25 23:25:46] [INFO ] Invariant cache hit.
[2024-05-25 23:25:46] [INFO ] Implicit Places using invariants in 31 ms returned [10, 12, 13, 14]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 40 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 26/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Murphy-PT-D4N025-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(LEQ 2 s1), p1:(OR (LEQ 2 s10) (LEQ 2 s1)), p2:(GT s22 s16)], 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6032 reset in 222 ms.
Stack based approach found an accepted trace after 44 steps with 1 reset with depth 34 and stack size 34 in 1 ms.
FORMULA Murphy-PT-D4N025-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N025-LTLCardinality-09 finished in 579 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||G(p1)))||X(X((p2&&G(F(p3)))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 23:25:47] [INFO ] Invariant cache hit.
[2024-05-25 23:25:47] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
[2024-05-25 23:25:47] [INFO ] Invariant cache hit.
[2024-05-25 23:25:47] [INFO ] Implicit Places using invariants in 32 ms returned [10, 11, 13, 14]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 35 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 26/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 752 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3)), true, (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p1) (NOT p0))]
Running random walk in product with property : Murphy-PT-D4N025-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 8}, { cond=p0, acceptance={} source=3 dest: 9}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 6}, { cond=p2, acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p3), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={} source=8 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 10}, { cond=(AND p1 p2), acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=9 dest: 10}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=9 dest: 11}, { cond=(AND p0 (NOT p2)), acceptance={} source=9 dest: 12}, { cond=(AND p0 p2), acceptance={} source=9 dest: 13}], [{ cond=(NOT p1), acceptance={} source=10 dest: 5}, { cond=p1, acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=11 dest: 6}, { cond=(NOT p1), acceptance={} source=11 dest: 7}, { cond=p1, acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=12 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=12 dest: 10}, { cond=p0, acceptance={} source=12 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=13 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=13 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=13 dest: 11}, { cond=p0, acceptance={} source=13 dest: 13}]], initial=0, aps=[p0:(LEQ s21 s11), p1:(OR (LEQ s21 s11) (LEQ 3 s3)), p2:(LEQ 3 s3), p3:(LEQ 3 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Murphy-PT-D4N025-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D4N025-LTLCardinality-10 finished in 939 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 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 23:25:48] [INFO ] Invariant cache hit.
[2024-05-25 23:25:48] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2024-05-25 23:25:48] [INFO ] Invariant cache hit.
[2024-05-25 23:25:48] [INFO ] Implicit Places using invariants in 26 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 36 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 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 88 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Murphy-PT-D4N025-LTLCardinality-11 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 s9)], 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 198 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 0 ms.
FORMULA Murphy-PT-D4N025-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N025-LTLCardinality-11 finished in 339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1)||X((p2&&X(G((p2||G(p3)))))))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 23:25:48] [INFO ] Invariant cache hit.
[2024-05-25 23:25:48] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2024-05-25 23:25:48] [INFO ] Invariant cache hit.
[2024-05-25 23:25:48] [INFO ] Implicit Places using invariants in 49 ms returned [10, 11, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 76 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 27/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 546 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Murphy-PT-D4N025-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 6}, { cond=(AND p1 p0 p2), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 11}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 12}], [{ cond=(NOT p3), acceptance={} source=5 dest: 0}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=7 dest: 9}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=7 dest: 12}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 6}, { cond=(AND p1 p0 p2), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=8 dest: 8}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={} source=8 dest: 9}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={} source=8 dest: 10}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=8 dest: 11}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={} source=8 dest: 12}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=9 dest: 5}, { cond=(AND p0 p3), acceptance={} source=9 dest: 9}, { cond=(AND p0 (NOT p3)), acceptance={} source=9 dest: 12}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=10 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=10 dest: 5}, { cond=(AND p1 p0 p3), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=10 dest: 11}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=10 dest: 12}], [{ cond=(NOT p0), acceptance={0} source=11 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=11 dest: 11}, { cond=(AND p1 p0), acceptance={0} source=11 dest: 12}], [{ cond=(NOT p0), acceptance={} source=12 dest: 0}, { cond=p0, acceptance={} source=12 dest: 12}]], initial=1, aps=[p1:(LEQ 3 s11), p0:(GT s10 s19), p2:(GT 1 s2), p3:(LEQ s9 s6)], 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, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA Murphy-PT-D4N025-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D4N025-LTLCardinality-12 finished in 688 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0 U (p1||G(p0)))&&(X((p2 U (G(p2)||(p2&&G(p0))))) U ((p3&&X((p2 U (G(p2)||(p2&&G(p0))))))||X(G(p2))))))))'
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 23:25:49] [INFO ] Invariant cache hit.
[2024-05-25 23:25:49] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2024-05-25 23:25:49] [INFO ] Invariant cache hit.
[2024-05-25 23:25:49] [INFO ] Implicit Places using invariants in 30 ms returned [10, 12, 13, 14]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 46 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 26/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 387 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Murphy-PT-D4N025-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1, 2} source=1 dest: 2}, { cond=(OR p1 p0), acceptance={0, 1, 2} source=1 dest: 3}, { cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={0, 1, 2} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1, 2} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1, 2} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0, 2} source=3 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(OR (AND p1 (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2))), acceptance={0, 1, 2} source=3 dest: 4}, { cond=(AND p0 p2), acceptance={0} source=3 dest: 5}], [{ cond=(AND p0 p2), acceptance={0, 2} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0, 2} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1, 2} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0, 2} source=5 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1, 2} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1} source=5 dest: 6}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=6 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 2} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1, 2} source=7 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GT s17 s10) (GT s5 s15)), p0:(GT s5 s15), p3:(GT s18 s12), p2:(GT 3 s22)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 650 reset in 207 ms.
Stack based approach found an accepted trace after 1155 steps with 12 reset with depth 670 and stack size 663 in 2 ms.
FORMULA Murphy-PT-D4N025-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D4N025-LTLCardinality-13 finished in 719 ms.
All properties solved by simple procedures.
Total runtime 8574 ms.

BK_STOP 1716679550815

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Murphy-PT-D4N025"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Murphy-PT-D4N025, 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 r263-tall-171654372300202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D4N025.tgz
mv Murphy-PT-D4N025 execution
cd execution
if [ "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 ;