Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 884K
-rw-r--r-- 1 mcc users 24K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 28K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 29K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 191K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.3K Mar 23 07:07 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 27K 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-D20N100-LTLCardinality-00
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-01
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-02
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-03
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-04
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-05
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-06
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-07
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-08
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-09
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-10
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-11
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-12
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-13
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-14
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680891680817

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D20N100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 18:21:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 18:21:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:21:25] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2023-04-07 18:21:25] [INFO ] Transformed 63 places.
[2023-04-07 18:21:25] [INFO ] Transformed 63 transitions.
[2023-04-07 18:21:25] [INFO ] Parsed PT model containing 63 places and 63 transitions and 187 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 7 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2023-04-07 18:21:25] [INFO ] Computed 1 invariants in 13 ms
[2023-04-07 18:21:25] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-04-07 18:21:25] [INFO ] Invariant cache hit.
[2023-04-07 18:21:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:21:26] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2023-04-07 18:21:26] [INFO ] Invariant cache hit.
[2023-04-07 18:21:26] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 630 ms. Remains : 63/63 places, 63/63 transitions.
Support contains 63 out of 63 places after structural reductions.
[2023-04-07 18:21:26] [INFO ] Flatten gal took : 40 ms
[2023-04-07 18:21:26] [INFO ] Flatten gal took : 35 ms
[2023-04-07 18:21:26] [INFO ] Input system was already deterministic with 63 transitions.
Incomplete random walk after 10064 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=91 ) properties (out of 26) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :1
Running SMT prover for 9 properties.
[2023-04-07 18:21:27] [INFO ] Invariant cache hit.
[2023-04-07 18:21:27] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 18:21:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 18:21:27] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2023-04-07 18:21:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:21:27] [INFO ] After 50ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :2 sat :7
[2023-04-07 18:21:27] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-04-07 18:21:28] [INFO ] After 447ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 90 ms.
Support contains 10 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 63/63 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 62
Free-agglomeration rule applied 16 times.
Iterating global reduction 1 with 16 rules applied. Total rules applied 17 place count 63 transition count 46
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 47 transition count 46
Applied a total of 33 rules in 36 ms. Remains 47 /63 variables (removed 16) and now considering 46/63 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 47/63 places, 46/63 transitions.
Incomplete random walk after 10066 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=239 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 435324 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 435324 steps, saw 187160 distinct states, run finished after 3004 ms. (steps per millisecond=144 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 46 rows 47 cols
[2023-04-07 18:21:31] [INFO ] Computed 2 invariants in 2 ms
[2023-04-07 18:21:31] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 18:21:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:21:32] [INFO ] After 812ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-07 18:21:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:21:33] [INFO ] After 292ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-07 18:21:33] [INFO ] After 565ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-04-07 18:21:33] [INFO ] After 1764ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 32 ms.
Support contains 10 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 46/46 transitions.
Applied a total of 0 rules in 4 ms. Remains 47 /47 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 47/47 places, 46/46 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 46/46 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2023-04-07 18:21:33] [INFO ] Invariant cache hit.
[2023-04-07 18:21:33] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-04-07 18:21:33] [INFO ] Invariant cache hit.
[2023-04-07 18:21:33] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:21:33] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-04-07 18:21:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:21:33] [INFO ] Invariant cache hit.
[2023-04-07 18:21:33] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 288 ms. Remains : 47/47 places, 46/46 transitions.
Graph (complete) has 66 edges and 47 vertex of which 32 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 32 transition count 29
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 29 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 29 transition count 28
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 28 transition count 28
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 28 transition count 24
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 17 place count 24 transition count 24
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 22 place count 24 transition count 19
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 27 place count 19 transition count 19
Applied a total of 27 rules in 6 ms. Remains 19 /47 variables (removed 28) and now considering 19/46 (removed 27) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 19 rows 19 cols
[2023-04-07 18:21:33] [INFO ] Computed 1 invariants in 6 ms
[2023-04-07 18:21:33] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 18:21:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 18:21:34] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-07 18:21:34] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-07 18:21:34] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 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' '!(X((p0 U G(!p0))))'
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2023-04-07 18:21:34] [INFO ] Computed 1 invariants in 15 ms
[2023-04-07 18:21:34] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-04-07 18:21:34] [INFO ] Invariant cache hit.
[2023-04-07 18:21:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:21:34] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-04-07 18:21:34] [INFO ] Invariant cache hit.
[2023-04-07 18:21:34] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 202 ms. Remains : 63/63 places, 63/63 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 436 ms :[p0, p0, p0, true]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(GT (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 400 ms.
Product exploration explored 100000 steps with 0 reset in 436 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.11 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[true, p0]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2516 ) properties (out of 1) seen :0
Finished Best-First random walk after 204 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=204 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-00 finished in 2203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((G((p0||X(p1))) U !p0) U (!p2 U p3))))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:21:36] [INFO ] Invariant cache hit.
[2023-04-07 18:21:36] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-04-07 18:21:36] [INFO ] Invariant cache hit.
[2023-04-07 18:21:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:21:36] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-04-07 18:21:36] [INFO ] Invariant cache hit.
[2023-04-07 18:21:36] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 269 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 842 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), p0, (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), true, (AND (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=2 dest: 4}, { cond=(NOT p3), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 7}], [{ cond=p0, acceptance={0} source=4 dest: 3}, { cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) p2 p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p3) p2 p0), acceptance={0} source=5 dest: 4}, { cond=(NOT p3), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 9}], [{ cond=(NOT p1), acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=10 dest: 8}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p3:(LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41) (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 507 ms.
Product exploration explored 100000 steps with 0 reset in 519 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) p0 p1), true, (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) p2 p0))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 4 factoid took 314 ms. Reduced automaton from 11 states, 25 edges and 4 AP (stutter sensitive) to 11 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 890 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), p0, (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), true, (AND (NOT p1) (NOT p3)), (NOT p3)]
Incomplete random walk after 10007 steps, including 4 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 18:21:40] [INFO ] Invariant cache hit.
[2023-04-07 18:21:40] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-04-07 18:21:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 56 ms returned sat
[2023-04-07 18:21:40] [INFO ] After 187ms 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 p3 (NOT p2) p0 p1), true, (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) p2 p0)))), (G (NOT (AND p0 p2 (NOT p3)))), (G (NOT (AND (NOT p2) (NOT p3) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (F (AND (NOT p0) p2 (NOT p3))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND p0 (NOT p2) (NOT p3))), (F (NOT p3)), (F (AND p2 (NOT p3) (NOT p1))), (F (AND (NOT p2) (NOT p3))), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 6 factoid took 1105 ms. Reduced automaton from 11 states, 25 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1002 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 920 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 0 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:21:43] [INFO ] Invariant cache hit.
[2023-04-07 18:21:43] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-04-07 18:21:43] [INFO ] Invariant cache hit.
[2023-04-07 18:21:43] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:21:43] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-04-07 18:21:43] [INFO ] Invariant cache hit.
[2023-04-07 18:21:44] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 387 ms. Remains : 63/63 places, 63/63 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p3 p0 (NOT p2) p1), true, (X (X (NOT (AND p0 (NOT p3)))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 3 factoid took 565 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 650 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Incomplete random walk after 10086 steps, including 3 resets, run finished after 2 ms. (steps per millisecond=5043 ) properties (out of 7) seen :5
Finished Best-First random walk after 4501 steps, including 1 resets, run visited all 2 properties in 7 ms. (steps per millisecond=643 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p3 p0 (NOT p2) p1), true, (X (X (NOT (AND p0 (NOT p3)))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (F (AND (NOT p2) (NOT p0) (NOT p3))), (F (AND p2 (NOT p3))), (F (AND (NOT p1) (NOT p3))), (F (NOT p1)), (F (NOT p3)), (F (NOT p0)), (F (AND p0 (NOT p3)))]
Knowledge based reduction with 3 factoid took 777 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 795 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 933 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 996 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 627 ms.
Product exploration explored 100000 steps with 1 reset in 657 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 897 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 12 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:21:51] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 18:21:51] [INFO ] Invariant cache hit.
[2023-04-07 18:21:51] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 63/63 places, 63/63 transitions.
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 0 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:21:51] [INFO ] Invariant cache hit.
[2023-04-07 18:21:51] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-04-07 18:21:51] [INFO ] Invariant cache hit.
[2023-04-07 18:21:51] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:21:51] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2023-04-07 18:21:51] [INFO ] Invariant cache hit.
[2023-04-07 18:21:52] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 264 ms. Remains : 63/63 places, 63/63 transitions.
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-01 finished in 15479 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&&F(!p0)) U G(p1)))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:21:52] [INFO ] Invariant cache hit.
[2023-04-07 18:21:52] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-04-07 18:21:52] [INFO ] Invariant cache hit.
[2023-04-07 18:21:52] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:21:52] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
[2023-04-07 18:21:52] [INFO ] Redundant transitions in 9 ms returned []
[2023-04-07 18:21:52] [INFO ] Invariant cache hit.
[2023-04-07 18:21:53] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 925 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p1), (OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(OR (LEQ (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 542 ms.
Product exploration explored 100000 steps with 0 reset in 269 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 393 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 230 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
Incomplete random walk after 10007 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 18:21:54] [INFO ] Invariant cache hit.
[2023-04-07 18:21:54] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 18:21:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 18:21:54] [INFO ] After 36ms 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 p1), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 15 factoid took 229 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-02 finished in 3085 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)))'
Support contains 21 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 2 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2023-04-07 18:21:55] [INFO ] Computed 0 invariants in 8 ms
[2023-04-07 18:21:55] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-04-07 18:21:55] [INFO ] Invariant cache hit.
[2023-04-07 18:21:55] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:21:55] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-04-07 18:21:55] [INFO ] Invariant cache hit.
[2023-04-07 18:21:55] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 340 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))], 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][false, false]]
Product exploration explored 100000 steps with 0 reset in 151 ms.
Product exploration explored 100000 steps with 0 reset in 261 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.12 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 250 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
[2023-04-07 18:21:56] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 274 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-03 finished in 1976 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((F(!p1)&&F(G(p2)))))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2023-04-07 18:21:57] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 18:21:57] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 18:21:57] [INFO ] Invariant cache hit.
[2023-04-07 18:21:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:21:57] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-04-07 18:21:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 18:21:57] [INFO ] Invariant cache hit.
[2023-04-07 18:21:57] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 229 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 356 ms.
Product exploration explored 100000 steps with 0 reset in 277 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 222 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 257 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3354 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 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 18:21:58] [INFO ] Invariant cache hit.
[2023-04-07 18:21:59] [INFO ] After 71ms SMT Verify possible using all constraints in real 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 (NOT p0) (NOT p2) p1), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 10 factoid took 329 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0)]
[2023-04-07 18:21:59] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 10 factoid took 413 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-05 finished in 2932 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)))'
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:22:00] [INFO ] Invariant cache hit.
[2023-04-07 18:22:00] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-04-07 18:22:00] [INFO ] Invariant cache hit.
[2023-04-07 18:22:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:22:00] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-04-07 18:22:00] [INFO ] Invariant cache hit.
[2023-04-07 18:22:00] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 118 ms :[p0, p0]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41) (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54...], 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][false, false]]
Product exploration explored 100000 steps with 0 reset in 214 ms.
Product exploration explored 100000 steps with 0 reset in 242 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[p0]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[p0]
Stuttering acceptance computed with spot in 41 ms :[p0]
[2023-04-07 18:22:01] [INFO ] Invariant cache hit.
[2023-04-07 18:22:01] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 18:22:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 18:22:01] [INFO ] [Real]Absence check using state equation in 46 ms returned unsat
Proved EG p0
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (G p0)]
Property proved to be false thanks to negative knowledge :(G p0)
Knowledge based reduction with 2 factoid took 164 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-06 finished in 1605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(!p0)))))'
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 2 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2023-04-07 18:22:01] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 18:22:01] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-04-07 18:22:01] [INFO ] Invariant cache hit.
[2023-04-07 18:22:01] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:22:01] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-04-07 18:22:01] [INFO ] Invariant cache hit.
[2023-04-07 18:22:01] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, true, true, p0]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s31 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-08 finished in 468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1&&X(p2)))||G(p3))))'
Support contains 7 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2023-04-07 18:22:02] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 18:22:02] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-04-07 18:22:02] [INFO ] Invariant cache hit.
[2023-04-07 18:22:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:22:02] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-04-07 18:22:02] [INFO ] Invariant cache hit.
[2023-04-07 18:22:02] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 311 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 356 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p2), (NOT p3), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p1), acceptance={} source=2 dest: 4}, { cond=(AND p3 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p3 p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}], [{ cond=(NOT p3), acceptance={} source=5 dest: 3}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=6 dest: 5}]], initial=0, aps=[p0:(GT s17 s55), p3:(LEQ s52 s3), p1:(LEQ s21 s58), p2:(LEQ s33 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, 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 152 steps with 18 reset in 0 ms.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-10 finished in 687 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)))'
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 2 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2023-04-07 18:22:02] [INFO ] Computed 0 invariants in 2 ms
[2023-04-07 18:22:02] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-04-07 18:22:02] [INFO ] Invariant cache hit.
[2023-04-07 18:22:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:22:03] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2023-04-07 18:22:03] [INFO ] Invariant cache hit.
[2023-04-07 18:22:03] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 215 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s39)], 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][false, false]]
Product exploration explored 100000 steps with 0 reset in 161 ms.
Product exploration explored 100000 steps with 0 reset in 202 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Incomplete random walk after 10084 steps, including 3 resets, run finished after 2 ms. (steps per millisecond=5042 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2671092 steps, run timeout after 3001 ms. (steps per millisecond=890 ) properties seen :{}
Probabilistic random walk after 2671092 steps, saw 1340671 distinct states, run finished after 3002 ms. (steps per millisecond=889 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 18:22:06] [INFO ] Invariant cache hit.
[2023-04-07 18:22:06] [INFO ] After 26ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 18:22:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:22:06] [INFO ] After 4ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-04-07 18:22:06] [INFO ] After 11ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-04-07 18:22:06] [INFO ] After 79ms 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 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (trivial) has 41 edges and 62 vertex of which 21 / 62 are part of one of the 1 SCC in 7 ms
Free SCC test removed 20 places
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 79 edges and 42 vertex of which 18 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 18 transition count 17
Applied a total of 15 rules in 9 ms. Remains 18 /62 variables (removed 44) and now considering 17/63 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 18/62 places, 17/63 transitions.
Incomplete random walk after 10074 steps, including 165 resets, run finished after 3 ms. (steps per millisecond=3358 ) properties (out of 1) seen :0
Finished Best-First random walk after 7173 steps, including 410 resets, run visited all 1 properties in 3 ms. (steps per millisecond=2391 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 250 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0)]
[2023-04-07 18:22:07] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 4 factoid took 235 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-11 finished in 4755 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||X(X(F(p1)))))))'
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 1 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:22:07] [INFO ] Invariant cache hit.
[2023-04-07 18:22:07] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-04-07 18:22:07] [INFO ] Invariant cache hit.
[2023-04-07 18:22:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:22:07] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-04-07 18:22:07] [INFO ] Invariant cache hit.
[2023-04-07 18:22:07] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 294 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s44 s9), p1:(LEQ s33 s7)], 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 20019 reset in 172 ms.
Product exploration explored 100000 steps with 19972 reset in 218 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10047 steps, including 6 resets, run finished after 2 ms. (steps per millisecond=5023 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 18:22:08] [INFO ] Invariant cache hit.
[2023-04-07 18:22:09] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 18:22:09] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 18:22:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:22:09] [INFO ] After 12ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 18:22:09] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-07 18:22:09] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 63/63 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 62
Free-agglomeration rule applied 18 times.
Iterating global reduction 1 with 18 rules applied. Total rules applied 19 place count 62 transition count 44
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 44 transition count 44
Applied a total of 37 rules in 8 ms. Remains 44 /62 variables (removed 18) and now considering 44/63 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 44/62 places, 44/63 transitions.
Incomplete random walk after 10082 steps, including 3 resets, run finished after 2 ms. (steps per millisecond=5041 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2525004 steps, run visited all 1 properties in 2269 ms. (steps per millisecond=1112 )
Probabilistic random walk after 2525004 steps, saw 530903 distinct states, run finished after 2294 ms. (steps per millisecond=1100 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 256 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:22:12] [INFO ] Invariant cache hit.
[2023-04-07 18:22:12] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-04-07 18:22:12] [INFO ] Invariant cache hit.
[2023-04-07 18:22:12] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:22:12] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-04-07 18:22:12] [INFO ] Invariant cache hit.
[2023-04-07 18:22:12] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 236 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5032 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 18:22:12] [INFO ] Invariant cache hit.
[2023-04-07 18:22:12] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 18:22:12] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 18:22:12] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:22:12] [INFO ] After 4ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 18:22:12] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-07 18:22:13] [INFO ] After 82ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 63/63 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 62
Free-agglomeration rule applied 18 times.
Iterating global reduction 1 with 18 rules applied. Total rules applied 19 place count 62 transition count 44
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 44 transition count 44
Applied a total of 37 rules in 8 ms. Remains 44 /62 variables (removed 18) and now considering 44/63 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 44/62 places, 44/63 transitions.
Incomplete random walk after 10064 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5032 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2525004 steps, run visited all 1 properties in 1795 ms. (steps per millisecond=1406 )
Probabilistic random walk after 2525004 steps, saw 530903 distinct states, run finished after 1797 ms. (steps per millisecond=1405 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 195 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 20018 reset in 76 ms.
Product exploration explored 100000 steps with 19986 reset in 79 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:22:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 18:22:16] [INFO ] Invariant cache hit.
[2023-04-07 18:22:16] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65 ms. Remains : 62/62 places, 63/63 transitions.
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:22:16] [INFO ] Invariant cache hit.
[2023-04-07 18:22:16] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-04-07 18:22:16] [INFO ] Invariant cache hit.
[2023-04-07 18:22:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:22:16] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-04-07 18:22:16] [INFO ] Invariant cache hit.
[2023-04-07 18:22:16] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 202 ms. Remains : 62/62 places, 63/63 transitions.
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-12 finished in 8835 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(p1)||X(!p0))))))'
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 3 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:22:16] [INFO ] Invariant cache hit.
[2023-04-07 18:22:16] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-04-07 18:22:16] [INFO ] Invariant cache hit.
[2023-04-07 18:22:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:22:16] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-04-07 18:22:16] [INFO ] Invariant cache hit.
[2023-04-07 18:22:16] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 299 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 414 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 5}, { cond=(AND p1 p0), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ s21 s54), p0:(LEQ 1 s29)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24962 reset in 86 ms.
Product exploration explored 100000 steps with 25050 reset in 92 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 7 factoid took 607 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0), true, (NOT p1)]
Incomplete random walk after 10089 steps, including 3 resets, run finished after 2 ms. (steps per millisecond=5044 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-07 18:22:18] [INFO ] Invariant cache hit.
[2023-04-07 18:22:19] [INFO ] After 972ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 18:22:19] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 18:22:19] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:22:19] [INFO ] After 10ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 18:22:19] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-04-07 18:22:19] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (trivial) has 40 edges and 62 vertex of which 21 / 62 are part of one of the 1 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 79 edges and 42 vertex of which 39 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 2 ms. Remains 39 /62 variables (removed 23) and now considering 42/63 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 39/62 places, 42/63 transitions.
Incomplete random walk after 10056 steps, including 85 resets, run finished after 26 ms. (steps per millisecond=386 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 226 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 254 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :0
Finished probabilistic random walk after 24896 steps, run visited all 3 properties in 97 ms. (steps per millisecond=256 )
Probabilistic random walk after 24896 steps, saw 10047 distinct states, run finished after 98 ms. (steps per millisecond=254 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND p1 p0)), (F p0), (F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) p0))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) p0))
Knowledge based reduction with 7 factoid took 703 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-13 finished in 3920 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 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Graph (complete) has 165 edges and 63 vertex of which 62 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 6 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:22:20] [INFO ] Invariant cache hit.
[2023-04-07 18:22:20] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-04-07 18:22:20] [INFO ] Invariant cache hit.
[2023-04-07 18:22:20] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:22:20] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2023-04-07 18:22:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 18:22:20] [INFO ] Invariant cache hit.
[2023-04-07 18:22:20] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 283 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D20N100-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:(GT s34 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 154 ms.
Product exploration explored 100000 steps with 0 reset in 165 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.16 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 224 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0)]
Incomplete random walk after 10049 steps, including 4 resets, run finished after 2 ms. (steps per millisecond=5024 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2407230 steps, run timeout after 3001 ms. (steps per millisecond=802 ) properties seen :{}
Probabilistic random walk after 2407230 steps, saw 1215743 distinct states, run finished after 3001 ms. (steps per millisecond=802 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 18:22:24] [INFO ] Invariant cache hit.
[2023-04-07 18:22:24] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 18:22:24] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 18:22:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:22:24] [INFO ] After 4ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 18:22:24] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-07 18:22:24] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 249 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
[2023-04-07 18:22:24] [INFO ] Invariant cache hit.
[2023-04-07 18:22:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 18:22:25] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-04-07 18:22:25] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 18:22:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 18:22:25] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-04-07 18:22:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:22:25] [INFO ] [Nat]Added 20 Read/Feed constraints in 7 ms returned sat
[2023-04-07 18:22:25] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 4 ms.
[2023-04-07 18:22:25] [INFO ] Added : 57 causal constraints over 12 iterations in 263 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:22:25] [INFO ] Invariant cache hit.
[2023-04-07 18:22:25] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-04-07 18:22:25] [INFO ] Invariant cache hit.
[2023-04-07 18:22:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:22:25] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-04-07 18:22:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:22:25] [INFO ] Invariant cache hit.
[2023-04-07 18:22:25] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 233 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Incomplete random walk after 10067 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=10067 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2598215 steps, run timeout after 3001 ms. (steps per millisecond=865 ) properties seen :{}
Probabilistic random walk after 2598215 steps, saw 1305892 distinct states, run finished after 3001 ms. (steps per millisecond=865 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 18:22:28] [INFO ] Invariant cache hit.
[2023-04-07 18:22:28] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 18:22:28] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 18:22:28] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:22:28] [INFO ] After 4ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 18:22:28] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-07 18:22:29] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
[2023-04-07 18:22:29] [INFO ] Invariant cache hit.
[2023-04-07 18:22:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 18:22:29] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-04-07 18:22:29] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 18:22:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 18:22:29] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-04-07 18:22:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:22:29] [INFO ] [Nat]Added 20 Read/Feed constraints in 8 ms returned sat
[2023-04-07 18:22:29] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 5 ms.
[2023-04-07 18:22:29] [INFO ] Added : 57 causal constraints over 12 iterations in 187 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 80 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 146 ms.
Product exploration explored 100000 steps with 0 reset in 162 ms.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:22:30] [INFO ] Invariant cache hit.
[2023-04-07 18:22:30] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-04-07 18:22:30] [INFO ] Invariant cache hit.
[2023-04-07 18:22:30] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:22:30] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-04-07 18:22:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 18:22:30] [INFO ] Invariant cache hit.
[2023-04-07 18:22:30] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 246 ms. Remains : 62/62 places, 63/63 transitions.
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-14 finished in 10020 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||F(p1)))))'
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Graph (trivial) has 41 edges and 63 vertex of which 21 / 63 are part of one of the 1 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 145 edges and 43 vertex of which 42 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 2 ms. Remains 42 /63 variables (removed 21) and now considering 43/63 (removed 20) transitions.
// Phase 1: matrix 43 rows 42 cols
[2023-04-07 18:22:30] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 18:22:30] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-04-07 18:22:30] [INFO ] Invariant cache hit.
[2023-04-07 18:22:30] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:22:30] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2023-04-07 18:22:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 18:22:30] [INFO ] Invariant cache hit.
[2023-04-07 18:22:30] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/63 places, 43/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 228 ms. Remains : 42/63 places, 43/63 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-15 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 1 s5), p1:(LEQ 3 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-15 finished in 331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((G((p0||X(p1))) U !p0) U (!p2 U p3))))))'
Found a Lengthening insensitive property : CryptoMiner-PT-D20N100-LTLCardinality-01
Stuttering acceptance computed with spot in 699 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), p0, (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), true, (AND (NOT p1) (NOT p3)), (NOT p3)]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2023-04-07 18:22:31] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 18:22:31] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-04-07 18:22:31] [INFO ] Invariant cache hit.
[2023-04-07 18:22:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:22:31] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-04-07 18:22:31] [INFO ] Invariant cache hit.
[2023-04-07 18:22:31] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 238 ms. Remains : 63/63 places, 63/63 transitions.
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=2 dest: 4}, { cond=(NOT p3), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 7}], [{ cond=p0, acceptance={0} source=4 dest: 3}, { cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) p2 p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p3) p2 p0), acceptance={0} source=5 dest: 4}, { cond=(NOT p3), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 9}], [{ cond=(NOT p1), acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=10 dest: 8}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p3:(LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41) (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 394 ms.
Product exploration explored 100000 steps with 2 reset in 395 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) p0 p1), true, (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) p2 p0))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 4 factoid took 341 ms. Reduced automaton from 11 states, 25 edges and 4 AP (stutter sensitive) to 11 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 893 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), p0, (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), true, (AND (NOT p1) (NOT p3)), (NOT p3)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3354 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 18:22:33] [INFO ] Invariant cache hit.
[2023-04-07 18:22:34] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-04-07 18:22:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 18:22:34] [INFO ] After 52ms 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 p3 (NOT p2) p0 p1), true, (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) p2 p0)))), (G (NOT (AND p0 p2 (NOT p3)))), (G (NOT (AND (NOT p2) (NOT p3) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (F (AND (NOT p0) p2 (NOT p3))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND p0 (NOT p2) (NOT p3))), (F (NOT p3)), (F (AND p2 (NOT p3) (NOT p1))), (F (AND (NOT p2) (NOT p3))), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 6 factoid took 742 ms. Reduced automaton from 11 states, 25 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 571 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 630 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 0 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:22:36] [INFO ] Invariant cache hit.
[2023-04-07 18:22:36] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-04-07 18:22:36] [INFO ] Invariant cache hit.
[2023-04-07 18:22:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:22:36] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-04-07 18:22:36] [INFO ] Invariant cache hit.
[2023-04-07 18:22:36] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 236 ms. Remains : 63/63 places, 63/63 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p3 p0 (NOT p2) p1), true, (X (X (NOT (AND p0 (NOT p3)))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 3 factoid took 382 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 749 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Incomplete random walk after 10069 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2013 ) properties (out of 7) seen :5
Finished Best-First random walk after 8654 steps, including 2 resets, run visited all 2 properties in 10 ms. (steps per millisecond=865 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p3 p0 (NOT p2) p1), true, (X (X (NOT (AND p0 (NOT p3)))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (F (AND (NOT p2) (NOT p0) (NOT p3))), (F (AND p2 (NOT p3))), (F (AND (NOT p1) (NOT p3))), (F (NOT p1)), (F (NOT p3)), (F (NOT p0)), (F (AND p0 (NOT p3)))]
Knowledge based reduction with 3 factoid took 661 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 749 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 767 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 648 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 233 ms.
Product exploration explored 100000 steps with 0 reset in 323 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 870 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:22:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 18:22:41] [INFO ] Invariant cache hit.
[2023-04-07 18:22:42] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 63/63 places, 63/63 transitions.
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 0 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:22:42] [INFO ] Invariant cache hit.
[2023-04-07 18:22:42] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-04-07 18:22:42] [INFO ] Invariant cache hit.
[2023-04-07 18:22:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:22:42] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-04-07 18:22:42] [INFO ] Invariant cache hit.
[2023-04-07 18:22:42] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 63/63 places, 63/63 transitions.
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-01 finished in 11551 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||X(X(F(p1)))))))'
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)))'
[2023-04-07 18:22:42] [INFO ] Flatten gal took : 16 ms
[2023-04-07 18:22:42] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-04-07 18:22:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 63 places, 63 transitions and 187 arcs took 0 ms.
Total runtime 78026 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2418/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2418/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2418/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CryptoMiner-PT-D20N100-LTLCardinality-01
Could not compute solution for formula : CryptoMiner-PT-D20N100-LTLCardinality-12
Could not compute solution for formula : CryptoMiner-PT-D20N100-LTLCardinality-14

BK_STOP 1680891764825

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name CryptoMiner-PT-D20N100-LTLCardinality-01
ltl formula formula --ltl=/tmp/2418/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 63 places, 63 transitions and 187 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2418/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2418/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2418/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2418/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 11 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name CryptoMiner-PT-D20N100-LTLCardinality-12
ltl formula formula --ltl=/tmp/2418/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 63 places, 63 transitions and 187 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2418/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2418/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2418/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2418/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name CryptoMiner-PT-D20N100-LTLCardinality-14
ltl formula formula --ltl=/tmp/2418/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 63 places, 63 transitions and 187 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2418/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2418/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2418/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2418/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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