Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r519-tall-167987244900179.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is CryptoMiner-PT-D05N100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987244900179
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 11K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 38K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 277K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K 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 7.8K 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-D05N100-LTLCardinality-00
FORMULA_NAME CryptoMiner-PT-D05N100-LTLCardinality-01
FORMULA_NAME CryptoMiner-PT-D05N100-LTLCardinality-02
FORMULA_NAME CryptoMiner-PT-D05N100-LTLCardinality-03
FORMULA_NAME CryptoMiner-PT-D05N100-LTLCardinality-04
FORMULA_NAME CryptoMiner-PT-D05N100-LTLCardinality-05
FORMULA_NAME CryptoMiner-PT-D05N100-LTLCardinality-06
FORMULA_NAME CryptoMiner-PT-D05N100-LTLCardinality-07
FORMULA_NAME CryptoMiner-PT-D05N100-LTLCardinality-08
FORMULA_NAME CryptoMiner-PT-D05N100-LTLCardinality-09
FORMULA_NAME CryptoMiner-PT-D05N100-LTLCardinality-10
FORMULA_NAME CryptoMiner-PT-D05N100-LTLCardinality-11
FORMULA_NAME CryptoMiner-PT-D05N100-LTLCardinality-12
FORMULA_NAME CryptoMiner-PT-D05N100-LTLCardinality-13
FORMULA_NAME CryptoMiner-PT-D05N100-LTLCardinality-14
FORMULA_NAME CryptoMiner-PT-D05N100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680843423750

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D05N100
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 04:57:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 04:57:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 04:57:05] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-04-07 04:57:05] [INFO ] Transformed 18 places.
[2023-04-07 04:57:05] [INFO ] Transformed 18 transitions.
[2023-04-07 04:57:05] [INFO ] Parsed PT model containing 18 places and 18 transitions and 52 arcs in 74 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA CryptoMiner-PT-D05N100-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D05N100-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D05N100-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D05N100-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D05N100-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D05N100-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D05N100-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 5 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 18 cols
[2023-04-07 04:57:05] [INFO ] Computed 1 invariants in 5 ms
[2023-04-07 04:57:05] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-04-07 04:57:05] [INFO ] Invariant cache hit.
[2023-04-07 04:57:05] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:57:05] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-04-07 04:57:05] [INFO ] Invariant cache hit.
[2023-04-07 04:57:05] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 18/18 places, 18/18 transitions.
Support contains 18 out of 18 places after structural reductions.
[2023-04-07 04:57:05] [INFO ] Flatten gal took : 13 ms
[2023-04-07 04:57:05] [INFO ] Flatten gal took : 3 ms
[2023-04-07 04:57:05] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10070 steps, including 5 resets, run finished after 32 ms. (steps per millisecond=314 ) properties (out of 21) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :1
Incomplete Best-First 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 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-04-07 04:57:05] [INFO ] Invariant cache hit.
[2023-04-07 04:57:06] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 04:57:06] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 04:57:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2023-04-07 04:57:06] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-04-07 04:57:06] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:57:06] [INFO ] After 4ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-04-07 04:57:06] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-04-07 04:57:06] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 18/18 transitions.
Graph (trivial) has 11 edges and 18 vertex of which 6 / 18 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Applied a total of 1 rules in 7 ms. Remains 13 /18 variables (removed 5) and now considering 11/18 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 13/18 places, 11/18 transitions.
Incomplete random walk after 10000 steps, including 185 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 696 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 695 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 13 cols
[2023-04-07 04:57:06] [INFO ] Computed 2 invariants in 1 ms
[2023-04-07 04:57:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 04:57:06] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 04:57:06] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:57:06] [INFO ] After 3ms SMT Verify possible using 5 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-04-07 04:57:06] [INFO ] After 12ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-07 04:57:06] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 13 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13/13 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 13/13 places, 11/11 transitions.
Incomplete random walk after 10058 steps, including 178 resets, run finished after 5 ms. (steps per millisecond=2011 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 701 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 415 steps, run visited all 1 properties in 10 ms. (steps per millisecond=41 )
Probabilistic random walk after 415 steps, saw 210 distinct states, run finished after 10 ms. (steps per millisecond=41 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CryptoMiner-PT-D05N100-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 45 edges and 18 vertex of which 7 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 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 12 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Graph (trivial) has 6 edges and 18 vertex of which 6 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Applied a total of 1 rules in 2 ms. Remains 13 /18 variables (removed 5) and now considering 13/18 (removed 5) transitions.
// Phase 1: matrix 13 rows 13 cols
[2023-04-07 04:57:06] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 04:57:06] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 04:57:06] [INFO ] Invariant cache hit.
[2023-04-07 04:57:06] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:57:06] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-04-07 04:57:06] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 04:57:06] [INFO ] Invariant cache hit.
[2023-04-07 04:57:06] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/18 places, 13/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 13/18 places, 13/18 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 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLCardinality-01 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:(GT 3 (ADD s7 s8 s9 s10 s11 s12)), p1:(GT (ADD s7 s8 s9 s10 s11 s12) (ADD s1 s2 s3 s4 s5 s6))], 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 153 ms.
Product exploration explored 100000 steps with 0 reset in 79 ms.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 40 edges and 13 vertex of which 1 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Detected a total of 13/13 stabilizing places and 12/13 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 5 factoid took 246 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10053 steps, including 152 resets, run finished after 10 ms. (steps per millisecond=1005 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 481 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:57:07] [INFO ] Invariant cache hit.
[2023-04-07 04:57:07] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 04:57:07] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:57:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 04:57:07] [INFO ] After 30ms 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D05N100-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D05N100-LTLCardinality-01 finished in 1099 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1&&G(p2)&&F(p3)))))'
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 18 cols
[2023-04-07 04:57:07] [INFO ] Computed 1 invariants in 5 ms
[2023-04-07 04:57:07] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 04:57:07] [INFO ] Invariant cache hit.
[2023-04-07 04:57:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:57:07] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-04-07 04:57:07] [INFO ] Invariant cache hit.
[2023-04-07 04:57:07] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 18/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 332 ms :[true, (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p3), acceptance={0} source=1 dest: 5}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2 p3), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND p0 p1 p2 p3), acceptance={} source=4 dest: 7}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=4 dest: 8}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND p0 p2 p3), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 5}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=3, aps=[p2:(OR (LEQ 2 (ADD s6 s7 s8 s9 s10 s11)) (LEQ (ADD s0 s1 s2 s3 s4 s5) (ADD s12 s13 s14 s15 s16 s17))), p3:(LEQ 2 (ADD s6 s7 s8 s9 s10 s11)), p1:(LEQ 1 (AD...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D05N100-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLCardinality-02 finished in 459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((G(F(p1)) U G(!p2)))))'
Support contains 12 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 18
Applied a total of 1 rules in 1 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 17 cols
[2023-04-07 04:57:08] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 04:57:08] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 04:57:08] [INFO ] Invariant cache hit.
[2023-04-07 04:57:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:57:08] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-04-07 04:57:08] [INFO ] Invariant cache hit.
[2023-04-07 04:57:08] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17/18 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 17/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 131 ms :[p2, p2, (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(OR (AND (LEQ (ADD s11 s12 s13 s14 s15 s16) (ADD s0 s1 s2 s3 s4 s5)) (LEQ 1 (ADD s11 s12 s13 s14 s15 s16))) (LEQ (ADD s11 s12 s13 s14 s15 s16) (ADD s0 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 261 ms.
Stack based approach found an accepted trace after 63 steps with 0 reset with depth 64 and stack size 64 in 0 ms.
FORMULA CryptoMiner-PT-D05N100-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLCardinality-03 finished in 488 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(p1))||((p2 U G(p1))&&G(p3)))))'
Support contains 12 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 18 cols
[2023-04-07 04:57:08] [INFO ] Computed 1 invariants in 2 ms
[2023-04-07 04:57:08] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-07 04:57:08] [INFO ] Invariant cache hit.
[2023-04-07 04:57:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:57:08] [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 04:57:08] [INFO ] Invariant cache hit.
[2023-04-07 04:57:08] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 18/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 381 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={0, 1} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p1 p3) (AND (NOT p0) p2 p3)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={1} source=0 dest: 3}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={1} source=0 dest: 4}, { cond=(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p3))), acceptance={0, 1} source=0 dest: 4}, { cond=(AND p0 p1 p2 p3), acceptance={1} source=0 dest: 5}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={0, 1} source=0 dest: 5}, { cond=(OR (AND p0 p1 p3) (AND p0 p2 p3)), acceptance={0} source=0 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=1 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=1 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 4}, { cond=(AND p0 p1 p2), acceptance={1} source=1 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={0, 1} source=2 dest: 4}, { cond=(AND p0 p3), acceptance={0} source=2 dest: 6}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 (NOT p3))), acceptance={1} source=3 dest: 3}, { cond=(OR (AND p0 p1 (NOT p2)) (AND p0 p1 (NOT p3))), acceptance={1} source=3 dest: 4}, { cond=(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), acceptance={0, 1} source=3 dest: 4}, { cond=(AND p0 p1 p2 p3), acceptance={1} source=3 dest: 5}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={0, 1} source=3 dest: 5}, { cond=(AND p0 p1 p2 p3), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={0} source=3 dest: 6}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=3 dest: 7}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={0} source=4 dest: 2}, { cond=(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={0, 1} source=4 dest: 5}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={0} source=6 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p0 (NOT p1) p3), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={1} source=7 dest: 3}, { cond=(AND p0 p1 (NOT p3)), acceptance={1} source=7 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0, 1} source=7 dest: 4}, { cond=(AND p0 p1 p3), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1) p3), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5)), p1:(LEQ 2 (ADD s6 s7 s8 s9 s10 s11)), p2:(LEQ 3 (ADD s0 s1 s2 s3 s4 s5)), p3:(LEQ 3 (ADD s6 s7 s8 s9 s10 s11))], nbAcceptance=2, 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 1 reset in 222 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 28 in 0 ms.
FORMULA CryptoMiner-PT-D05N100-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLCardinality-04 finished in 709 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 12 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 04:57:09] [INFO ] Invariant cache hit.
[2023-04-07 04:57:09] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-04-07 04:57:09] [INFO ] Invariant cache hit.
[2023-04-07 04:57:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:57:09] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-04-07 04:57:09] [INFO ] Invariant cache hit.
[2023-04-07 04:57:09] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 18/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ (ADD s0 s1 s2 s3 s4 s5) (ADD s6 s7 s8 s9 s10 s11)), p0:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 91 ms.
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 45 edges and 18 vertex of which 7 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D05N100-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D05N100-LTLCardinality-07 finished in 448 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 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Graph (complete) has 45 edges and 18 vertex of which 17 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 1 rules in 5 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 17 cols
[2023-04-07 04:57:09] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 04:57:09] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-07 04:57:09] [INFO ] Invariant cache hit.
[2023-04-07 04:57:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:57:09] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-04-07 04:57:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 04:57:09] [INFO ] Invariant cache hit.
[2023-04-07 04:57:09] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/18 places, 18/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 17/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLCardinality-09 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:(OR (LEQ s0 s15) (LEQ 1 s8))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 21 reset in 73 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA CryptoMiner-PT-D05N100-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLCardinality-09 finished in 241 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((G(p1)||p0)) U X(p2)))'
Support contains 5 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 18 cols
[2023-04-07 04:57:09] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 04:57:10] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 04:57:10] [INFO ] Invariant cache hit.
[2023-04-07 04:57:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:57:10] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-04-07 04:57:10] [INFO ] Invariant cache hit.
[2023-04-07 04:57:10] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 18/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D05N100-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=(OR p0 p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (LEQ 2 s6) (GT s4 s16) (LEQ 1 s5)), p1:(LEQ 1 s10), p2:(LEQ s4 s16)], 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][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 85 ms.
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 45 edges and 18 vertex of which 7 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/18 stabilizing places and 11/18 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X p2), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 21 factoid took 21 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D05N100-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D05N100-LTLCardinality-10 finished in 561 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 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Graph (trivial) has 11 edges and 18 vertex of which 6 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Applied a total of 1 rules in 2 ms. Remains 13 /18 variables (removed 5) and now considering 13/18 (removed 5) transitions.
// Phase 1: matrix 13 rows 13 cols
[2023-04-07 04:57:10] [INFO ] Computed 1 invariants in 0 ms
[2023-04-07 04:57:10] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 04:57:10] [INFO ] Invariant cache hit.
[2023-04-07 04:57:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:57:10] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-04-07 04:57:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 04:57:10] [INFO ] Invariant cache hit.
[2023-04-07 04:57:10] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/18 places, 13/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78 ms. Remains : 13/18 places, 13/18 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLCardinality-14 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 s1)], 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 1 ms.
FORMULA CryptoMiner-PT-D05N100-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLCardinality-14 finished in 123 ms.
All properties solved by simple procedures.
Total runtime 5536 ms.
ITS solved all properties within timeout

BK_STOP 1680843431737

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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-D05N100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is CryptoMiner-PT-D05N100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r519-tall-167987244900179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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