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.r517-tall-167987243500155.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 itstools
Input is CryptoMiner-PT-D03N010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243500155
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 13K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 19K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 5.3K 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 CryptoMiner-PT-D03N010-LTLCardinality-00
FORMULA_NAME CryptoMiner-PT-D03N010-LTLCardinality-01
FORMULA_NAME CryptoMiner-PT-D03N010-LTLCardinality-02
FORMULA_NAME CryptoMiner-PT-D03N010-LTLCardinality-03
FORMULA_NAME CryptoMiner-PT-D03N010-LTLCardinality-04
FORMULA_NAME CryptoMiner-PT-D03N010-LTLCardinality-05
FORMULA_NAME CryptoMiner-PT-D03N010-LTLCardinality-06
FORMULA_NAME CryptoMiner-PT-D03N010-LTLCardinality-07
FORMULA_NAME CryptoMiner-PT-D03N010-LTLCardinality-08
FORMULA_NAME CryptoMiner-PT-D03N010-LTLCardinality-09
FORMULA_NAME CryptoMiner-PT-D03N010-LTLCardinality-10
FORMULA_NAME CryptoMiner-PT-D03N010-LTLCardinality-11
FORMULA_NAME CryptoMiner-PT-D03N010-LTLCardinality-12
FORMULA_NAME CryptoMiner-PT-D03N010-LTLCardinality-13
FORMULA_NAME CryptoMiner-PT-D03N010-LTLCardinality-14
FORMULA_NAME CryptoMiner-PT-D03N010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680874758919

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D03N010
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2023-04-07 13:39:20] [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]
[2023-04-07 13:39:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 13:39:20] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-04-07 13:39:20] [INFO ] Transformed 12 places.
[2023-04-07 13:39:20] [INFO ] Transformed 12 transitions.
[2023-04-07 13:39:20] [INFO ] Parsed PT model containing 12 places and 12 transitions and 34 arcs in 78 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CryptoMiner-PT-D03N010-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D03N010-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 6 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-07 13:39:20] [INFO ] Computed 1 invariants in 5 ms
[2023-04-07 13:39:20] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-04-07 13:39:20] [INFO ] Invariant cache hit.
[2023-04-07 13:39:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:20] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2023-04-07 13:39:20] [INFO ] Invariant cache hit.
[2023-04-07 13:39:20] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 292 ms. Remains : 12/12 places, 12/12 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-04-07 13:39:21] [INFO ] Flatten gal took : 13 ms
[2023-04-07 13:39:21] [INFO ] Flatten gal took : 3 ms
[2023-04-07 13:39:21] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 23) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 17) seen :6
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
[2023-04-07 13:39:21] [INFO ] Invariant cache hit.
[2023-04-07 13:39:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 13:39:21] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 13:39:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 13:39:21] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-04-07 13:39:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:21] [INFO ] After 2ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2023-04-07 13:39:21] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-07 13:39:21] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (trivial) has 7 edges and 12 vertex of which 4 / 12 are part of one of the 1 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 14 edges and 9 vertex of which 8 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 7 ms. Remains 8 /12 variables (removed 4) and now considering 7/12 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 8/12 places, 7/12 transitions.
Incomplete random walk after 10009 steps, including 1060 resets, run finished after 12 ms. (steps per millisecond=834 ) properties (out of 1) seen :0
Finished Best-First random walk after 328 steps, including 23 resets, run visited all 1 properties in 2 ms. (steps per millisecond=164 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA CryptoMiner-PT-D03N010-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 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&&X(F(p1))))))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:39:21] [INFO ] Invariant cache hit.
[2023-04-07 13:39:21] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 13:39:21] [INFO ] Invariant cache hit.
[2023-04-07 13:39:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:21] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-04-07 13:39:21] [INFO ] Invariant cache hit.
[2023-04-07 13:39:22] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 12/12 places, 12/12 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 338 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D03N010-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(GT (ADD s0 s1 s2 s3) (ADD s4 s5 s6 s7)), p0:(LEQ (ADD s4 s5 s6 s7) (ADD s8 s9 s10 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 1 reset in 253 ms.
Stack based approach found an accepted trace after 87 steps with 11 reset with depth 33 and stack size 33 in 1 ms.
FORMULA CryptoMiner-PT-D03N010-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N010-LTLCardinality-00 finished in 721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(X(F(!p0))||G(p1))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:39:22] [INFO ] Invariant cache hit.
[2023-04-07 13:39:22] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-07 13:39:22] [INFO ] Invariant cache hit.
[2023-04-07 13:39:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:22] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-04-07 13:39:22] [INFO ] Invariant cache hit.
[2023-04-07 13:39:22] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), p0, (AND p0 (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D03N010-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 (ADD s4 s5 s6 s7)), p1:(LEQ (ADD s0 s1 s2 s3) (ADD s8 s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 101 ms.
Stack based approach found an accepted trace after 34 steps with 7 reset with depth 13 and stack size 13 in 0 ms.
FORMULA CryptoMiner-PT-D03N010-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N010-LTLCardinality-01 finished in 428 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 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (trivial) has 7 edges and 12 vertex of which 4 / 12 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 4 ms. Remains 9 /12 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 9 cols
[2023-04-07 13:39:23] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 13:39:23] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 13:39:23] [INFO ] Invariant cache hit.
[2023-04-07 13:39:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:23] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 13:39:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 13:39:23] [INFO ] Invariant cache hit.
[2023-04-07 13:39:23] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/12 places, 9/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 9/12 places, 9/12 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N010-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:(GT 1 (ADD s1 s2 s3 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N010-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N010-LTLCardinality-02 finished in 157 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))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-07 13:39:23] [INFO ] Computed 1 invariants in 0 ms
[2023-04-07 13:39:23] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 13:39:23] [INFO ] Invariant cache hit.
[2023-04-07 13:39:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:23] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-04-07 13:39:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 13:39:23] [INFO ] Invariant cache hit.
[2023-04-07 13:39:23] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, p1, (AND p1 (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D03N010-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(GT 1 (ADD s4 s5 s6 s7)), p0:(LEQ (ADD s4 s5 s6 s7) (ADD s0 s1 s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 103 ms.
Product exploration explored 100000 steps with 0 reset in 153 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 230 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[true, p1, (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) 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 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-04-07 13:39:24] [INFO ] Invariant cache hit.
[2023-04-07 13:39:24] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 13:39:24] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 9 factoid took 322 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 92 ms :[true, (AND p1 (NOT p0)), p1]
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:39:24] [INFO ] Invariant cache hit.
[2023-04-07 13:39:24] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 13:39:24] [INFO ] Invariant cache hit.
[2023-04-07 13:39:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:24] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-04-07 13:39:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 13:39:24] [INFO ] Invariant cache hit.
[2023-04-07 13:39:24] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 12/12 places, 12/12 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 217 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[true, p1, (AND p1 (NOT p0))]
Incomplete random walk after 10005 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 13:39:25] [INFO ] Invariant cache hit.
[2023-04-07 13:39:25] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 13:39:25] [INFO ] After 15ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 9 factoid took 293 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 96 ms :[true, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 95 ms :[true, (AND p1 (NOT p0)), p1]
Product exploration explored 100000 steps with 0 reset in 96 ms.
Product exploration explored 100000 steps with 0 reset in 124 ms.
Built C files in :
/tmp/ltsmin4704789386332849755
[2023-04-07 13:39:25] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2023-04-07 13:39:25] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 13:39:25] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2023-04-07 13:39:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 13:39:25] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2023-04-07 13:39:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 13:39:25] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4704789386332849755
Running compilation step : cd /tmp/ltsmin4704789386332849755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 154 ms.
Running link step : cd /tmp/ltsmin4704789386332849755;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4704789386332849755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13049853024435213110.hoa' '--buchi-type=spotba'
LTSmin run took 236 ms.
FORMULA CryptoMiner-PT-D03N010-LTLCardinality-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D03N010-LTLCardinality-03 finished in 3153 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(p0)) U (G((p0&&X(p0)))||(p0&&X(p0)&&G((p1&&X(G(!p2))))))))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:39:26] [INFO ] Invariant cache hit.
[2023-04-07 13:39:26] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 13:39:26] [INFO ] Invariant cache hit.
[2023-04-07 13:39:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:26] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-04-07 13:39:26] [INFO ] Invariant cache hit.
[2023-04-07 13:39:26] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 245 ms :[true, (OR (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N010-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p1) p2), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1 p2), acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(GT 2 (ADD s0 s1 s2 s3)), p2:(LEQ (ADD s4 s5 s6 s7) (ADD s0 s1 s2 s3)), p0:(GT (ADD s0 s1 s2 s3) (ADD s4 s5 s6 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 126 ms.
Product exploration explored 100000 steps with 0 reset in 130 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[true, (OR (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 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.
[2023-04-07 13:39:27] [INFO ] Invariant cache hit.
[2023-04-07 13:39:27] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-04-07 13:39:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-04-07 13:39:27] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 p1 p2))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p1) p2))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))), (F (AND p1 (NOT p2))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 444 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:39:28] [INFO ] Invariant cache hit.
[2023-04-07 13:39:28] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 13:39:28] [INFO ] Invariant cache hit.
[2023-04-07 13:39:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:28] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-07 13:39:28] [INFO ] Invariant cache hit.
[2023-04-07 13:39:28] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 12/12 places, 12/12 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 6680 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3340 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 74 ms.
Product exploration explored 100000 steps with 0 reset in 83 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:39:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 13:39:29] [INFO ] Invariant cache hit.
[2023-04-07 13:39:29] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27 ms. Remains : 12/12 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin17217905162169914626
[2023-04-07 13:39:29] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17217905162169914626
Running compilation step : cd /tmp/ltsmin17217905162169914626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 72 ms.
Running link step : cd /tmp/ltsmin17217905162169914626;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17217905162169914626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7386376715925748893.hoa' '--buchi-type=spotba'
LTSmin run took 110 ms.
FORMULA CryptoMiner-PT-D03N010-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D03N010-LTLCardinality-04 finished in 3285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (complete) has 29 edges and 12 vertex of which 11 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2023-04-07 13:39:29] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 13:39:29] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-07 13:39:29] [INFO ] Invariant cache hit.
[2023-04-07 13:39:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:29] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-04-07 13:39:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 13:39:29] [INFO ] Invariant cache hit.
[2023-04-07 13:39:29] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 11/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D03N010-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3) (ADD s7 s8 s9 s10)), p1:(GT 1 (ADD s0 s1 s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 82 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA CryptoMiner-PT-D03N010-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N010-LTLCardinality-05 finished in 227 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&&G(!p1)) U (F(p2)||G(!p0)))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-07 13:39:29] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 13:39:29] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 13:39:29] [INFO ] Invariant cache hit.
[2023-04-07 13:39:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:29] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 13:39:29] [INFO ] Invariant cache hit.
[2023-04-07 13:39:29] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p1)]
Running random walk in product with property : CryptoMiner-PT-D03N010-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ 2 (ADD s4 s5 s6 s7)), p0:(GT (ADD s8 s9 s10 s11) (ADD s4 s5 s6 s7)), p1:(LEQ (ADD s0 s1 s2 s3) (ADD s8 s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 99 ms.
Product exploration explored 100000 steps with 2 reset in 106 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0 p1))))]
False Knowledge obtained : [(X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 472 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p1)]
Incomplete random walk after 10004 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 13:39:31] [INFO ] Invariant cache hit.
[2023-04-07 13:39:31] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 13:39:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 13:39:31] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (G (NOT (AND p1 (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (NOT (AND p0 (NOT p2)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 671 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND p0 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0), (NOT p2), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 219 ms :[(AND p0 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0), (NOT p2), (AND (NOT p2) p0)]
[2023-04-07 13:39:32] [INFO ] Invariant cache hit.
[2023-04-07 13:39:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned unsat
Proved EG (AND (NOT p2) p0)
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (G (NOT (AND p1 (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (NOT (AND p0 (NOT p2)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p2))), (G (AND (NOT p2) p0))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p2) p0))
Knowledge based reduction with 6 factoid took 747 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D03N010-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D03N010-LTLCardinality-07 finished in 3143 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)))'
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (trivial) has 7 edges and 12 vertex of which 4 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 2 ms. Remains 9 /12 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 9 cols
[2023-04-07 13:39:33] [INFO ] Computed 1 invariants in 0 ms
[2023-04-07 13:39:33] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 13:39:33] [INFO ] Invariant cache hit.
[2023-04-07 13:39:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:33] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-04-07 13:39:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 13:39:33] [INFO ] Invariant cache hit.
[2023-04-07 13:39:33] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/12 places, 9/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 9/12 places, 9/12 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N010-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N010-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N010-LTLCardinality-08 finished in 174 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 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (trivial) has 7 edges and 12 vertex of which 4 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 26 edges and 9 vertex of which 8 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 1 ms. Remains 8 /12 variables (removed 4) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 8 cols
[2023-04-07 13:39:33] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 13:39:33] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 13:39:33] [INFO ] Invariant cache hit.
[2023-04-07 13:39:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:33] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-04-07 13:39:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 13:39:33] [INFO ] Invariant cache hit.
[2023-04-07 13:39:33] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/12 places, 9/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 8/12 places, 9/12 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N010-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N010-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N010-LTLCardinality-09 finished in 113 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 G((p0&&X(p0)))))'
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2023-04-07 13:39:33] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 13:39:33] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 13:39:33] [INFO ] Invariant cache hit.
[2023-04-07 13:39:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:33] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-04-07 13:39:33] [INFO ] Invariant cache hit.
[2023-04-07 13:39:33] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 11/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N010-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s1)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N010-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N010-LTLCardinality-10 finished in 189 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 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (trivial) has 7 edges and 12 vertex of which 4 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 26 edges and 9 vertex of which 8 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 1 ms. Remains 8 /12 variables (removed 4) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 8 cols
[2023-04-07 13:39:33] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 13:39:33] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-07 13:39:33] [INFO ] Invariant cache hit.
[2023-04-07 13:39:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:33] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-04-07 13:39:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 13:39:33] [INFO ] Invariant cache hit.
[2023-04-07 13:39:33] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/12 places, 9/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68 ms. Remains : 8/12 places, 9/12 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N010-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:(LEQ 3 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N010-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N010-LTLCardinality-12 finished in 117 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 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2023-04-07 13:39:33] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 13:39:33] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 13:39:33] [INFO ] Invariant cache hit.
[2023-04-07 13:39:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:33] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-04-07 13:39:33] [INFO ] Invariant cache hit.
[2023-04-07 13:39:33] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 11/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N010-LTLCardinality-13 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:(LEQ 1 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][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 54 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 0 ms.
FORMULA CryptoMiner-PT-D03N010-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N010-LTLCardinality-13 finished in 261 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 U (p3||G(p2)))))))'
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:39:33] [INFO ] Invariant cache hit.
[2023-04-07 13:39:33] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-04-07 13:39:33] [INFO ] Invariant cache hit.
[2023-04-07 13:39:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:39:33] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-04-07 13:39:33] [INFO ] Invariant cache hit.
[2023-04-07 13:39:33] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 11/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D03N010-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p3) p2) (AND p0 (NOT p3) p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(OR (AND p1 (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2))), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(OR p1 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (LEQ s1 s6) (LEQ 1 s3)), p0:(LEQ s1 s6), p3:(AND (GT s4 s0) (GT s2 s4)), p2:(GT s2 s4)], 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D03N010-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N010-LTLCardinality-14 finished in 341 ms.
All properties solved by simple procedures.
Total runtime 13834 ms.

BK_STOP 1680874775244

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="CryptoMiner-PT-D03N010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is CryptoMiner-PT-D03N010, 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 r517-tall-167987243500155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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