MCC'2023- Execution of r519-tall-167987244900203

About the Execution of LoLa+red for CryptoMiner-PT-D10N100

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1867.976	91913.00	109406.00	852.50	TF?TFF?TTFFT?TFF	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 13K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 32K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 30K Mar 23 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 214K Mar 23 15:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K 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 15K 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-D10N100-LTLCardinality-00
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-01
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-02
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-03
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-04
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-05
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-06
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-07
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-08
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-09
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-10
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-11
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-12
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-13
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-14
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680844726766

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D10N100
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 05:18:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 05:18:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 05:18:48] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2023-04-07 05:18:48] [INFO ] Transformed 33 places.
[2023-04-07 05:18:48] [INFO ] Transformed 33 transitions.
[2023-04-07 05:18:48] [INFO ] Parsed PT model containing 33 places and 33 transitions and 97 arcs in 80 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 6 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 33 cols
[2023-04-07 05:18:48] [INFO ] Computed 1 invariants in 8 ms
[2023-04-07 05:18:48] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-04-07 05:18:48] [INFO ] Invariant cache hit.
[2023-04-07 05:18:48] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:18:48] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-04-07 05:18:48] [INFO ] Invariant cache hit.
[2023-04-07 05:18:48] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 259 ms. Remains : 33/33 places, 33/33 transitions.
Support contains 33 out of 33 places after structural reductions.
[2023-04-07 05:18:48] [INFO ] Flatten gal took : 16 ms
[2023-04-07 05:18:48] [INFO ] Flatten gal took : 5 ms
[2023-04-07 05:18:48] [INFO ] Input system was already deterministic with 33 transitions.
Incomplete random walk after 10059 steps, including 3 resets, run finished after 53 ms. (steps per millisecond=189 ) properties (out of 22) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-04-07 05:18:49] [INFO ] Invariant cache hit.
[2023-04-07 05:18:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 05:18:49] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 05:18:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-04-07 05:18:49] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-04-07 05:18:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:18:49] [INFO ] After 13ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-04-07 05:18:49] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-04-07 05:18:49] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 33/33 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 33 transition count 32
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 9 place count 33 transition count 24
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 25 transition count 24
Applied a total of 17 rules in 8 ms. Remains 25 /33 variables (removed 8) and now considering 24/33 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 25/33 places, 24/33 transitions.
Incomplete random walk after 10034 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1003 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 24 rows 25 cols
[2023-04-07 05:18:49] [INFO ] Computed 2 invariants in 1 ms
[2023-04-07 05:18:49] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 05:18:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 05:18:49] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 05:18:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:18:49] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 05:18:49] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-07 05:18:49] [INFO ] After 82ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 25/25 places, 24/24 transitions.
Incomplete random walk after 10034 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1672 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 2910522 steps, run timeout after 3001 ms. (steps per millisecond=969 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 2910522 steps, saw 606519 distinct states, run finished after 3002 ms. (steps per millisecond=969 ) properties seen :2
Running SMT prover for 1 properties.
[2023-04-07 05:18:52] [INFO ] Invariant cache hit.
[2023-04-07 05:18:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 05:18:52] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:18:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 05:18:53] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:18:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:18:53] [INFO ] After 3ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:18:53] [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 2 ms.
[2023-04-07 05:18:53] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 24/24 transitions.
Graph (trivial) has 13 edges and 25 vertex of which 3 / 25 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 42 edges and 23 vertex of which 14 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 14 transition count 13
Applied a total of 7 rules in 5 ms. Remains 14 /25 variables (removed 11) and now considering 13/24 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 14/25 places, 13/24 transitions.
Incomplete random walk after 10000 steps, including 173 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :0
Finished Best-First random walk after 1465 steps, including 82 resets, run visited all 1 properties in 2 ms. (steps per millisecond=732 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 11 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 85 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 05:18:53] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 05:18:53] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-04-07 05:18:53] [INFO ] Invariant cache hit.
[2023-04-07 05:18:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:18:53] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-04-07 05:18:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 05:18:53] [INFO ] Invariant cache hit.
[2023-04-07 05:18:53] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167 ms. Remains : 32/33 places, 33/33 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 167 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 245 ms.
Stack based approach found an accepted trace after 4538 steps with 0 reset with depth 4539 and stack size 4539 in 8 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-01 finished in 634 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 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 85 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
[2023-04-07 05:18:54] [INFO ] Invariant cache hit.
[2023-04-07 05:18:54] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-04-07 05:18:54] [INFO ] Invariant cache hit.
[2023-04-07 05:18:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:18:54] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-04-07 05:18:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:18:54] [INFO ] Invariant cache hit.
[2023-04-07 05:18:54] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31))], 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 182 ms.
Product exploration explored 100000 steps with 0 reset in 241 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 3446 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=689 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 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 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Support contains 22 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 5 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 05:18:55] [INFO ] Invariant cache hit.
[2023-04-07 05:18:55] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 05:18:55] [INFO ] Invariant cache hit.
[2023-04-07 05:18:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:18:55] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-04-07 05:18:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 05:18:55] [INFO ] Invariant cache hit.
[2023-04-07 05:18:55] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 32/32 places, 33/33 transitions.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 199 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 52 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 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 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 150 ms.
Product exploration explored 100000 steps with 0 reset in 243 ms.
Support contains 22 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 05:18:56] [INFO ] Invariant cache hit.
[2023-04-07 05:18:56] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-04-07 05:18:56] [INFO ] Invariant cache hit.
[2023-04-07 05:18:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:18:56] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-04-07 05:18:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:18:56] [INFO ] Invariant cache hit.
[2023-04-07 05:18:56] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 32/32 places, 33/33 transitions.
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-02 finished in 2241 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((X((G(p0) U p1))&&F(!p0))))'
Support contains 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 33 cols
[2023-04-07 05:18:56] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 05:18:56] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-04-07 05:18:56] [INFO ] Invariant cache hit.
[2023-04-07 05:18:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:18:56] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-04-07 05:18:56] [INFO ] Invariant cache hit.
[2023-04-07 05:18:56] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) p0), (NOT p1), p0]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21)), p1:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Product exploration explored 100000 steps with 50000 reset in 167 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-03 finished in 623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 85 edges and 33 vertex of which 32 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 4 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 05:18:57] [INFO ] Computed 0 invariants in 2 ms
[2023-04-07 05:18:57] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-04-07 05:18:57] [INFO ] Invariant cache hit.
[2023-04-07 05:18:57] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:18:57] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-04-07 05:18:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 05:18:57] [INFO ] Invariant cache hit.
[2023-04-07 05:18:57] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31)) (LEQ 1 (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 155 ms.
Stack based approach found an accepted trace after 15403 steps with 0 reset with depth 15404 and stack size 15404 in 25 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-04 finished in 384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0||X(F((p1||G(p2)||G(!p0)))))))'
Support contains 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 33 cols
[2023-04-07 05:18:57] [INFO ] Computed 1 invariants in 0 ms
[2023-04-07 05:18:57] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-04-07 05:18:57] [INFO ] Invariant cache hit.
[2023-04-07 05:18:57] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:18:57] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-04-07 05:18:57] [INFO ] Invariant cache hit.
[2023-04-07 05:18:57] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p1:(GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p2:(GT (ADD 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], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 285 ms.
Stack based approach found an accepted trace after 1912 steps with 0 reset with depth 1913 and stack size 1913 in 4 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-05 finished in 563 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) U G(!p1)) U (F(G(p2))||(F(!p1)&&X(!p0)))))'
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 05:18:58] [INFO ] Invariant cache hit.
[2023-04-07 05:18:58] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 05:18:58] [INFO ] Invariant cache hit.
[2023-04-07 05:18:58] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:18:58] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-04-07 05:18:58] [INFO ] Invariant cache hit.
[2023-04-07 05:18:58] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 325 ms :[(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND p1 p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p1)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GT (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32) (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21)), p2:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 ...], 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 0 reset in 111 ms.
Product exploration explored 100000 steps with 1 reset in 205 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : [(X (AND p2 (NOT p1) p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 537 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p2)]
Incomplete random walk after 10044 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3348 ) properties (out of 1) seen :0
Finished Best-First random walk after 400 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=200 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : [(X (AND p2 (NOT p1) p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p2))]
Knowledge based reduction with 8 factoid took 711 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 34 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p2)]
Support contains 11 out of 33 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 05:19:00] [INFO ] Invariant cache hit.
[2023-04-07 05:19:00] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-04-07 05:19:00] [INFO ] Invariant cache hit.
[2023-04-07 05:19:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:19:00] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-04-07 05:19:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:19:00] [INFO ] Invariant cache hit.
[2023-04-07 05:19:00] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 210 ms. Remains : 33/33 places, 33/33 transitions.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 202 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 40 ms :[(NOT p2)]
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 : [p2, (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 186 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 87 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p2)]
Product exploration explored 100000 steps with 0 reset in 105 ms.
Product exploration explored 100000 steps with 0 reset in 224 ms.
Support contains 11 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 85 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 05:19:01] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 05:19:01] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-04-07 05:19:01] [INFO ] Invariant cache hit.
[2023-04-07 05:19:01] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:19:01] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-04-07 05:19:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:19:01] [INFO ] Invariant cache hit.
[2023-04-07 05:19:01] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 32/33 places, 33/33 transitions.
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-06 finished in 3638 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(F(!p0)) U (p1||G(!p1)))))'
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 33 cols
[2023-04-07 05:19:01] [INFO ] Computed 1 invariants in 3 ms
[2023-04-07 05:19:01] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-04-07 05:19:01] [INFO ] Invariant cache hit.
[2023-04-07 05:19:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:19:02] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2023-04-07 05:19:02] [INFO ] Invariant cache hit.
[2023-04-07 05:19:02] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 511 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 177 ms :[p0, false, false, (AND p0 p1)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32)), p1:(GT 2 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 62 ms.
Product exploration explored 100000 steps with 50000 reset in 63 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-07 finished in 867 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||(!p1 U p2)))))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 4 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 05:19:02] [INFO ] Invariant cache hit.
[2023-04-07 05:19:02] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-04-07 05:19:02] [INFO ] Invariant cache hit.
[2023-04-07 05:19:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:19:02] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-04-07 05:19:02] [INFO ] Invariant cache hit.
[2023-04-07 05:19:02] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 287 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(LEQ s12 s2), p2:(LEQ s11 s0), p0:(LEQ s10 s32)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 88 ms.
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 20 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-08 finished in 586 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(F(p0))||(F(p0)&&F(G(p1))))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 33
Applied a total of 1 rules in 5 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 05:19:03] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 05:19:03] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-04-07 05:19:03] [INFO ] Invariant cache hit.
[2023-04-07 05:19:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:19:03] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-04-07 05:19:03] [INFO ] Invariant cache hit.
[2023-04-07 05:19:03] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT s1 s14), p1:(LEQ 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 149 reset in 86 ms.
Product exploration explored 100000 steps with 215 reset in 101 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 268 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 203 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=203 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 338 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-04-07 05:19:04] [INFO ] Invariant cache hit.
[2023-04-07 05:19:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:19:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-04-07 05:19:04] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:19:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:19:05] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-04-07 05:19:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:19:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-04-07 05:19:05] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-07 05:19:05] [INFO ] Added : 21 causal constraints over 5 iterations in 33 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 05:19:05] [INFO ] Invariant cache hit.
[2023-04-07 05:19:05] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 05:19:05] [INFO ] Invariant cache hit.
[2023-04-07 05:19:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:19:05] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-04-07 05:19:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:19:05] [INFO ] Invariant cache hit.
[2023-04-07 05:19:05] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 32/32 places, 33/33 transitions.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 222 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 204 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=204 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 454 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-04-07 05:19:06] [INFO ] Invariant cache hit.
[2023-04-07 05:19:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:19:07] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2023-04-07 05:19:07] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:19:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:19:07] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-07 05:19:07] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:19:07] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-04-07 05:19:07] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-07 05:19:07] [INFO ] Added : 21 causal constraints over 5 iterations in 38 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 189 reset in 111 ms.
Product exploration explored 100000 steps with 248 reset in 114 ms.
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 05:19:08] [INFO ] Invariant cache hit.
[2023-04-07 05:19:08] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 05:19:08] [INFO ] Invariant cache hit.
[2023-04-07 05:19:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:19:08] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-04-07 05:19:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:19:08] [INFO ] Invariant cache hit.
[2023-04-07 05:19:08] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 32/32 places, 33/33 transitions.
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-10 finished in 5180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p1)||p0)))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 85 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
[2023-04-07 05:19:08] [INFO ] Invariant cache hit.
[2023-04-07 05:19:08] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 05:19:08] [INFO ] Invariant cache hit.
[2023-04-07 05:19:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:19:08] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-04-07 05:19:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:19:08] [INFO ] Invariant cache hit.
[2023-04-07 05:19:08] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-12 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 p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(GT 3 s17), p0:(OR (LEQ s5 s24) (LEQ s15 s28))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 142 ms.
Product exploration explored 100000 steps with 0 reset in 229 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Detected a total of 20/32 stabilizing places and 21/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 142 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10034 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1254 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
[2023-04-07 05:19:09] [INFO ] Invariant cache hit.
[2023-04-07 05:19:09] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 05:19:09] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 05:19:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:19:09] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 05:19:09] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-07 05:19:09] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 33/33 transitions.
Graph (complete) has 50 edges and 32 vertex of which 24 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 24 transition count 21
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 20 transition count 21
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 17 place count 20 transition count 17
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 21 place count 16 transition count 17
Applied a total of 21 rules in 8 ms. Remains 16 /32 variables (removed 16) and now considering 17/33 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 16/32 places, 17/33 transitions.
Incomplete random walk after 10034 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2508 ) properties (out of 2) seen :0
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
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1598475 steps, run timeout after 3001 ms. (steps per millisecond=532 ) properties seen :{}
Probabilistic random walk after 1598475 steps, saw 334471 distinct states, run finished after 3002 ms. (steps per millisecond=532 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 17 rows 16 cols
[2023-04-07 05:19:12] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 05:19:12] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 05:19:12] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 05:19:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 05:19:12] [INFO ] After 3ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 05:19:12] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-07 05:19:12] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 16/16 places, 17/17 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2023-04-07 05:19:12] [INFO ] Invariant cache hit.
[2023-04-07 05:19:12] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-04-07 05:19:12] [INFO ] Invariant cache hit.
[2023-04-07 05:19:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 05:19:12] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-04-07 05:19:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:19:12] [INFO ] Invariant cache hit.
[2023-04-07 05:19:12] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 16/16 places, 17/17 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 16 transition count 16
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 15 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 14 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 14 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 13 transition count 14
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 9 place count 13 transition count 11
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 12 place count 10 transition count 11
Applied a total of 12 rules in 5 ms. Remains 10 /16 variables (removed 6) and now considering 11/17 (removed 6) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 10 cols
[2023-04-07 05:19:12] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 05:19:12] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 05:19:12] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 05:19:12] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-07 05:19:12] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 11 factoid took 300 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 05:19:13] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 05:19:13] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-04-07 05:19:13] [INFO ] Invariant cache hit.
[2023-04-07 05:19:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:19:13] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-04-07 05:19:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 05:19:13] [INFO ] Invariant cache hit.
[2023-04-07 05:19:13] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 168 ms. Remains : 32/32 places, 33/33 transitions.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Detected a total of 20/32 stabilizing places and 21/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 170 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10046 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=456 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
[2023-04-07 05:19:14] [INFO ] Invariant cache hit.
[2023-04-07 05:19:14] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 05:19:14] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 05:19:14] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:19:14] [INFO ] After 29ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 05:19:14] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-04-07 05:19:14] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 33/33 transitions.
Graph (complete) has 50 edges and 32 vertex of which 24 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 24 transition count 21
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 20 transition count 21
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 17 place count 20 transition count 17
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 21 place count 16 transition count 17
Applied a total of 21 rules in 5 ms. Remains 16 /32 variables (removed 16) and now considering 17/33 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 16/32 places, 17/33 transitions.
Incomplete random walk after 10028 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3342 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1240607 steps, run timeout after 3001 ms. (steps per millisecond=413 ) properties seen :{}
Probabilistic random walk after 1240607 steps, saw 266508 distinct states, run finished after 3004 ms. (steps per millisecond=412 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 17 rows 16 cols
[2023-04-07 05:19:17] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 05:19:17] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 05:19:17] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 05:19:17] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 05:19:17] [INFO ] After 14ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 05:19:17] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-07 05:19:17] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 16/16 places, 17/17 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2023-04-07 05:19:17] [INFO ] Invariant cache hit.
[2023-04-07 05:19:17] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 05:19:17] [INFO ] Invariant cache hit.
[2023-04-07 05:19:17] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 05:19:17] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-07 05:19:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:19:17] [INFO ] Invariant cache hit.
[2023-04-07 05:19:17] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 16/16 places, 17/17 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 16 transition count 16
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 15 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 14 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 14 transition count 14
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 13 transition count 14
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 9 place count 13 transition count 11
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 12 place count 10 transition count 11
Applied a total of 12 rules in 14 ms. Remains 10 /16 variables (removed 6) and now considering 11/17 (removed 6) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 10 cols
[2023-04-07 05:19:17] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 05:19:17] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 05:19:17] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 05:19:17] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-07 05:19:17] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 11 factoid took 222 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 106 ms.
Product exploration explored 100000 steps with 0 reset in 177 ms.
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 05:19:18] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 05:19:18] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-04-07 05:19:18] [INFO ] Invariant cache hit.
[2023-04-07 05:19:18] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:19:18] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-04-07 05:19:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:19:18] [INFO ] Invariant cache hit.
[2023-04-07 05:19:18] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116 ms. Remains : 32/32 places, 33/33 transitions.
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-12 finished in 10130 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 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 33
Applied a total of 1 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
[2023-04-07 05:19:18] [INFO ] Invariant cache hit.
[2023-04-07 05:19:19] [INFO ] Implicit Places using invariants in 555 ms returned []
[2023-04-07 05:19:19] [INFO ] Invariant cache hit.
[2023-04-07 05:19:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:19:19] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2023-04-07 05:19:19] [INFO ] Invariant cache hit.
[2023-04-07 05:19:19] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 655 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 2 s6) (LEQ s9 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 50000 reset in 61 ms.
Product exploration explored 100000 steps with 50000 reset in 63 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-13 finished in 862 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(G(p1))) U X(X(G(p2)))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 33
Applied a total of 1 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
[2023-04-07 05:19:19] [INFO ] Invariant cache hit.
[2023-04-07 05:19:19] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-04-07 05:19:19] [INFO ] Invariant cache hit.
[2023-04-07 05:19:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:19:19] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-04-07 05:19:19] [INFO ] Invariant cache hit.
[2023-04-07 05:19:19] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 1}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 6}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p2:(GT s17 s21), p0:(OR (LEQ s17 s21) (LEQ 1 s2)), p1:(LEQ s24 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 86 ms.
Product exploration explored 100000 steps with 0 reset in 118 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Detected a total of 20/32 stabilizing places and 21/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 229 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Incomplete random walk after 10045 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1255 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-04-07 05:19:20] [INFO ] Invariant cache hit.
[2023-04-07 05:19:20] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 05:19:20] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 05:19:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:19:20] [INFO ] After 7ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 05:19:20] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-04-07 05:19:20] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 33/33 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 32 transition count 32
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 10 place count 32 transition count 23
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 23 transition count 23
Applied a total of 19 rules in 4 ms. Remains 23 /32 variables (removed 9) and now considering 23/33 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 23/32 places, 23/33 transitions.
Incomplete random walk after 10044 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=2511 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Finished probabilistic random walk after 24327 steps, run visited all 4 properties in 84 ms. (steps per millisecond=289 )
Probabilistic random walk after 24327 steps, saw 7624 distinct states, run finished after 84 ms. (steps per millisecond=289 ) properties seen :4
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 (NOT p2)))), (F p2), (F (AND p0 p2)), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 552 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 381 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 249 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
[2023-04-07 05:19:22] [INFO ] Invariant cache hit.
[2023-04-07 05:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:19:22] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-04-07 05:19:22] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:19:22] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-04-07 05:19:22] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:19:22] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 (NOT p2)))), (F p2), (F (AND p0 p2)), (F (NOT p0)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 11 factoid took 566 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-14 finished in 3392 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 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 33
Applied a total of 1 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
[2023-04-07 05:19:22] [INFO ] Invariant cache hit.
[2023-04-07 05:19:22] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 05:19:22] [INFO ] Invariant cache hit.
[2023-04-07 05:19:22] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:19:22] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-04-07 05:19:22] [INFO ] Invariant cache hit.
[2023-04-07 05:19:22] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-15 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 s14 s23)], 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 83 ms.
Stack based approach found an accepted trace after 5338 steps with 0 reset with depth 5339 and stack size 5339 in 5 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-15 finished in 267 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)))'
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) U G(!p1)) U (F(G(p2))||(F(!p1)&&X(!p0)))))'
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(F(p0))||(F(p0)&&F(G(p1))))))'
Found a Shortening insensitive property : CryptoMiner-PT-D10N100-LTLCardinality-10
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 85 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
[2023-04-07 05:19:23] [INFO ] Invariant cache hit.
[2023-04-07 05:19:23] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 05:19:23] [INFO ] Invariant cache hit.
[2023-04-07 05:19:23] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:19:23] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 05:19:23] [INFO ] Invariant cache hit.
[2023-04-07 05:19:23] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 85 ms. Remains : 32/33 places, 33/33 transitions.
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT s1 s14), p1:(LEQ 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 180 reset in 83 ms.
Product exploration explored 100000 steps with 144 reset in 101 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 316 steps, including 1 resets, run visited all 3 properties in 1 ms. (steps per millisecond=316 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 213 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-04-07 05:19:24] [INFO ] Invariant cache hit.
[2023-04-07 05:19:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:19:24] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-07 05:19:24] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:19:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:19:24] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-04-07 05:19:24] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:19:24] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-04-07 05:19:24] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-07 05:19:24] [INFO ] Added : 21 causal constraints over 5 iterations in 20 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 05:19:24] [INFO ] Invariant cache hit.
[2023-04-07 05:19:24] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-07 05:19:24] [INFO ] Invariant cache hit.
[2023-04-07 05:19:24] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:19:24] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-04-07 05:19:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:19:24] [INFO ] Invariant cache hit.
[2023-04-07 05:19:24] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 32/32 places, 33/33 transitions.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 335 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 316 steps, including 1 resets, run visited all 3 properties in 1 ms. (steps per millisecond=316 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 534 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 280 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-04-07 05:19:26] [INFO ] Invariant cache hit.
[2023-04-07 05:19:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:19:26] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-04-07 05:19:26] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:19:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:19:26] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-04-07 05:19:26] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:19:26] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-04-07 05:19:26] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 05:19:26] [INFO ] Added : 21 causal constraints over 5 iterations in 28 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 329 reset in 83 ms.
Product exploration explored 100000 steps with 363 reset in 119 ms.
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 05:19:27] [INFO ] Invariant cache hit.
[2023-04-07 05:19:27] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 05:19:27] [INFO ] Invariant cache hit.
[2023-04-07 05:19:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:19:27] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-04-07 05:19:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:19:27] [INFO ] Invariant cache hit.
[2023-04-07 05:19:27] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 32/32 places, 33/33 transitions.
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-10 finished in 3889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p1)||p0)))'
[2023-04-07 05:19:27] [INFO ] Flatten gal took : 5 ms
[2023-04-07 05:19:27] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 12 ms.
[2023-04-07 05:19:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 33 places, 33 transitions and 97 arcs took 1 ms.
Total runtime 39223 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CryptoMiner-PT-D10N100
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality

FORMULA CryptoMiner-PT-D10N100-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1680844818679

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 CryptoMiner-PT-D10N100-LTLCardinality-02
lola: time limit : 900 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-PT-D10N100-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
CryptoMiner-PT-D10N100-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CryptoMiner-PT-D10N100-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CryptoMiner-PT-D10N100-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/900 12/32 CryptoMiner-PT-D10N100-LTLCardinality-02 1676110 m, 335222 m/sec, 5815831 t fired, .

Time elapsed: 5 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-PT-D10N100-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
CryptoMiner-PT-D10N100-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CryptoMiner-PT-D10N100-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CryptoMiner-PT-D10N100-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/900 22/32 CryptoMiner-PT-D10N100-LTLCardinality-02 3060986 m, 276975 m/sec, 10979423 t fired, .

Time elapsed: 10 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-PT-D10N100-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
CryptoMiner-PT-D10N100-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CryptoMiner-PT-D10N100-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CryptoMiner-PT-D10N100-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/900 31/32 CryptoMiner-PT-D10N100-LTLCardinality-02 4391137 m, 266030 m/sec, 16014609 t fired, .

Time elapsed: 15 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for CryptoMiner-PT-D10N100-LTLCardinality-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-PT-D10N100-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
CryptoMiner-PT-D10N100-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
CryptoMiner-PT-D10N100-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
CryptoMiner-PT-D10N100-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 7 (type EXCL) for 6 CryptoMiner-PT-D10N100-LTLCardinality-10
lola: time limit : 1193 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for CryptoMiner-PT-D10N100-LTLCardinality-10
lola: result : false
lola: markings : 4723
lola: fired transitions : 8923
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 CryptoMiner-PT-D10N100-LTLCardinality-06
lola: time limit : 1790 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CryptoMiner-PT-D10N100-LTLCardinality-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-PT-D10N100-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
CryptoMiner-PT-D10N100-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
CryptoMiner-PT-D10N100-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1790 12/32 CryptoMiner-PT-D10N100-LTLCardinality-06 1731629 m, 346325 m/sec, 6001437 t fired, .

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CryptoMiner-PT-D10N100-LTLCardinality-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-PT-D10N100-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
CryptoMiner-PT-D10N100-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
CryptoMiner-PT-D10N100-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1790 22/32 CryptoMiner-PT-D10N100-LTLCardinality-06 3110680 m, 275810 m/sec, 11112555 t fired, .

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CryptoMiner-PT-D10N100-LTLCardinality-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-PT-D10N100-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
CryptoMiner-PT-D10N100-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
CryptoMiner-PT-D10N100-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1790 31/32 CryptoMiner-PT-D10N100-LTLCardinality-06 4426513 m, 263166 m/sec, 16105862 t fired, .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 4 (type EXCL) for CryptoMiner-PT-D10N100-LTLCardinality-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CryptoMiner-PT-D10N100-LTLCardinality-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-PT-D10N100-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
CryptoMiner-PT-D10N100-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0
CryptoMiner-PT-D10N100-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 10 (type EXCL) for 9 CryptoMiner-PT-D10N100-LTLCardinality-12
lola: time limit : 3560 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CryptoMiner-PT-D10N100-LTLCardinality-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-PT-D10N100-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
CryptoMiner-PT-D10N100-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0
CryptoMiner-PT-D10N100-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/3560 20/32 CryptoMiner-PT-D10N100-LTLCardinality-12 2796095 m, 559219 m/sec, 4369387 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 10 (type EXCL) for CryptoMiner-PT-D10N100-LTLCardinality-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CryptoMiner-PT-D10N100-LTLCardinality-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-PT-D10N100-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
CryptoMiner-PT-D10N100-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0
CryptoMiner-PT-D10N100-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CryptoMiner-PT-D10N100-LTLCardinality-02: LTL unknown AGGR
CryptoMiner-PT-D10N100-LTLCardinality-06: LTL unknown AGGR
CryptoMiner-PT-D10N100-LTLCardinality-10: LTL false LTL model checker
CryptoMiner-PT-D10N100-LTLCardinality-12: LTL unknown AGGR

Time elapsed: 50 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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