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-167987244900204.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987244900204
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME CryptoMiner-PT-D10N100-LTLFireability-01
FORMULA_NAME CryptoMiner-PT-D10N100-LTLFireability-02
FORMULA_NAME CryptoMiner-PT-D10N100-LTLFireability-03
FORMULA_NAME CryptoMiner-PT-D10N100-LTLFireability-04
FORMULA_NAME CryptoMiner-PT-D10N100-LTLFireability-05
FORMULA_NAME CryptoMiner-PT-D10N100-LTLFireability-06
FORMULA_NAME CryptoMiner-PT-D10N100-LTLFireability-07
FORMULA_NAME CryptoMiner-PT-D10N100-LTLFireability-08
FORMULA_NAME CryptoMiner-PT-D10N100-LTLFireability-09
FORMULA_NAME CryptoMiner-PT-D10N100-LTLFireability-10
FORMULA_NAME CryptoMiner-PT-D10N100-LTLFireability-11
FORMULA_NAME CryptoMiner-PT-D10N100-LTLFireability-12
FORMULA_NAME CryptoMiner-PT-D10N100-LTLFireability-13
FORMULA_NAME CryptoMiner-PT-D10N100-LTLFireability-14
FORMULA_NAME CryptoMiner-PT-D10N100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680844827879

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=LTLFireability
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:20:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 05:20:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 05:20:29] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2023-04-07 05:20:29] [INFO ] Transformed 33 places.
[2023-04-07 05:20:29] [INFO ] Transformed 33 transitions.
[2023-04-07 05:20:29] [INFO ] Parsed PT model containing 33 places and 33 transitions and 97 arcs in 77 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D10N100-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 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 9 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:20:29] [INFO ] Computed 0 invariants in 7 ms
[2023-04-07 05:20:29] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-04-07 05:20:29] [INFO ] Invariant cache hit.
[2023-04-07 05:20:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:20:29] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-04-07 05:20:29] [INFO ] Invariant cache hit.
[2023-04-07 05:20:29] [INFO ] Dead Transitions using invariants and state equation in 29 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 245 ms. Remains : 32/33 places, 33/33 transitions.
Support contains 22 out of 32 places after structural reductions.
[2023-04-07 05:20:29] [INFO ] Flatten gal took : 14 ms
[2023-04-07 05:20:29] [INFO ] Flatten gal took : 6 ms
[2023-04-07 05:20:29] [INFO ] Input system was already deterministic with 33 transitions.
Finished random walk after 3450 steps, including 1 resets, run visited all 15 properties in 13 ms. (steps per millisecond=265 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CryptoMiner-PT-D10N100-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 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:20:30] [INFO ] Invariant cache hit.
[2023-04-07 05:20:30] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-07 05:20:30] [INFO ] Invariant cache hit.
[2023-04-07 05:20:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:20:30] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-04-07 05:20:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:20:30] [INFO ] Invariant cache hit.
[2023-04-07 05:20:30] [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.
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 147 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s21 1))], 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 234 ms.
Product exploration explored 100000 steps with 0 reset in 287 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 : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 176 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 p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 307 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 p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-04-07 05:20:31] [INFO ] Invariant cache hit.
[2023-04-07 05:20:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:20:31] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-04-07 05:20:31] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:20:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:20:31] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-04-07 05:20:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:20:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 8 ms returned sat
[2023-04-07 05:20:31] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 4 ms.
[2023-04-07 05:20:31] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 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:20:31] [INFO ] Invariant cache hit.
[2023-04-07 05:20:31] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 05:20:31] [INFO ] Invariant cache hit.
[2023-04-07 05:20:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:20:32] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-04-07 05:20:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:20:32] [INFO ] Invariant cache hit.
[2023-04-07 05:20:32] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133 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 : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 159 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 42 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-04-07 05:20:32] [INFO ] Invariant cache hit.
[2023-04-07 05:20:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:20:32] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-07 05:20:32] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:20:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:20:32] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-04-07 05:20:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:20:32] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-04-07 05:20:32] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 4 ms.
[2023-04-07 05:20:32] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 142 ms.
Product exploration explored 100000 steps with 0 reset in 132 ms.
Support contains 2 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:20:32] [INFO ] Invariant cache hit.
[2023-04-07 05:20:32] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 05:20:32] [INFO ] Invariant cache hit.
[2023-04-07 05:20:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:20:32] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-04-07 05:20:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:20:32] [INFO ] Invariant cache hit.
[2023-04-07 05:20:33] [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 120 ms. Remains : 32/32 places, 33/33 transitions.
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-00 finished in 2735 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 10 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Graph (trivial) has 11 edges and 32 vertex of which 11 / 32 are part of one of the 1 SCC in 2 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Applied a total of 1 rules in 5 ms. Remains 22 /32 variables (removed 10) and now considering 23/33 (removed 10) transitions.
// Phase 1: matrix 23 rows 22 cols
[2023-04-07 05:20:33] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 05:20:33] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 05:20:33] [INFO ] Invariant cache hit.
[2023-04-07 05:20:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:20:33] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-04-07 05:20:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:20:33] [INFO ] Invariant cache hit.
[2023-04-07 05:20:33] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/32 places, 23/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 22/32 places, 23/33 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-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:(OR (GEQ s21 1) (GEQ s11 1) (GEQ s12 1) (GEQ s14 1) (GEQ s15 1) (GEQ s16 1) (GEQ s17 1) (GEQ s18 1) (GEQ s19 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-01 finished in 174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&X(p1)))||X(G((F(G(p0))&&p2)))))'
Support contains 12 out of 32 places. Attempting structural reductions.
Starting structural reductions in 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.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 05:20:33] [INFO ] Computed 0 invariants in 5 ms
[2023-04-07 05:20:33] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 05:20:33] [INFO ] Invariant cache hit.
[2023-04-07 05:20:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:20:33] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-04-07 05:20:33] [INFO ] Invariant cache hit.
[2023-04-07 05:20:33] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1)), p2:(AND (GEQ s0 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-02 finished in 312 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)&&(G(p0)||X(X(p1)))))))'
Support contains 21 out of 32 places. Attempting structural reductions.
Starting structural reductions in 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:20:33] [INFO ] Invariant cache hit.
[2023-04-07 05:20:33] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 05:20:33] [INFO ] Invariant cache hit.
[2023-04-07 05:20:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:20:33] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-04-07 05:20:33] [INFO ] Invariant cache hit.
[2023-04-07 05:20:33] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 270 ms :[p0, (NOT p1), (OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 8}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={0} source=8 dest: 8}]], initial=7, aps=[p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1)), p1:(OR (GEQ s31 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 143 ms.
Stack based approach found an accepted trace after 1415 steps with 0 reset with depth 1416 and stack size 1416 in 2 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-03 finished in 526 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||G(F(p0)))))))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in 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:20:34] [INFO ] Invariant cache hit.
[2023-04-07 05:20:34] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 05:20:34] [INFO ] Invariant cache hit.
[2023-04-07 05:20:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:20:34] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-07 05:20:34] [INFO ] Invariant cache hit.
[2023-04-07 05:20:34] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LT s23 1)], 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 159 ms.
Product exploration explored 100000 steps with 33333 reset in 93 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/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N100-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-05 finished in 491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Graph (trivial) has 20 edges and 32 vertex of which 11 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Applied a total of 1 rules in 4 ms. Remains 22 /32 variables (removed 10) and now considering 23/33 (removed 10) transitions.
// Phase 1: matrix 23 rows 22 cols
[2023-04-07 05:20:34] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 05:20:34] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 05:20:34] [INFO ] Invariant cache hit.
[2023-04-07 05:20:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:20:34] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-04-07 05:20:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:20:34] [INFO ] Invariant cache hit.
[2023-04-07 05:20:34] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/32 places, 23/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116 ms. Remains : 22/32 places, 23/33 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-07 finished in 167 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) U F(((!G(X(p1))&&X(p0)) U p1))))'
Support contains 1 out of 32 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 : 32/32 places, 33/33 transitions.
Graph (trivial) has 19 edges and 32 vertex of which 11 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Applied a total of 1 rules in 1 ms. Remains 22 /32 variables (removed 10) and now considering 23/33 (removed 10) transitions.
[2023-04-07 05:20:34] [INFO ] Invariant cache hit.
[2023-04-07 05:20:34] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-07 05:20:34] [INFO ] Invariant cache hit.
[2023-04-07 05:20:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:20:34] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-04-07 05:20:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:20:34] [INFO ] Invariant cache hit.
[2023-04-07 05:20:34] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/32 places, 23/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 22/32 places, 23/33 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-09 finished in 132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||G(!p1))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in 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.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 05:20:34] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 05:20:34] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 05:20:34] [INFO ] Invariant cache hit.
[2023-04-07 05:20:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:20:34] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-04-07 05:20:34] [INFO ] Invariant cache hit.
[2023-04-07 05:20:34] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (AND p1 p0), p1, (AND p1 p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LT s23 1), p0:(OR (LT s0 1) (LT s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 1 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-10 finished in 217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1)&&(!p0||G(p2)))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in 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:20:35] [INFO ] Invariant cache hit.
[2023-04-07 05:20:35] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 05:20:35] [INFO ] Invariant cache hit.
[2023-04-07 05:20:35] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:20:35] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-04-07 05:20:35] [INFO ] Invariant cache hit.
[2023-04-07 05:20:35] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), (NOT p1), true, (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 3}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(GEQ s0 1), p1:(GEQ s24 1), p2:(LT s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-11 finished in 314 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||G(p1)))))'
Support contains 2 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:20:35] [INFO ] Invariant cache hit.
[2023-04-07 05:20:35] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 05:20:35] [INFO ] Invariant cache hit.
[2023-04-07 05:20:35] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:20:35] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-04-07 05:20:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:20:35] [INFO ] Invariant cache hit.
[2023-04-07 05:20:35] [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 103 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s23 1), p0:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1 reset in 94 ms.
Product exploration explored 100000 steps with 2 reset in 96 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 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 116 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1121 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=373 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 204 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 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.
[2023-04-07 05:20:36] [INFO ] Invariant cache hit.
[2023-04-07 05:20:36] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 05:20:36] [INFO ] Invariant cache hit.
[2023-04-07 05:20:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:20:36] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-04-07 05:20:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:20:36] [INFO ] Invariant cache hit.
[2023-04-07 05:20:36] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 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 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 203 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 111 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=55 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 269 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4 reset in 83 ms.
Product exploration explored 100000 steps with 3 reset in 106 ms.
Support contains 2 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:20:37] [INFO ] Invariant cache hit.
[2023-04-07 05:20:37] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-04-07 05:20:37] [INFO ] Invariant cache hit.
[2023-04-07 05:20:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:20:37] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-04-07 05:20:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 05:20:37] [INFO ] Invariant cache hit.
[2023-04-07 05:20:37] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 32/32 places, 33/33 transitions.
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-13 finished in 2084 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||X((X(X(X((p1||X(p2))))) U (!p0&&X(X(X((p1||X(p2))))))))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 05:20:37] [INFO ] Invariant cache hit.
[2023-04-07 05:20:37] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 05:20:37] [INFO ] Invariant cache hit.
[2023-04-07 05:20:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:20:37] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-04-07 05:20:37] [INFO ] Invariant cache hit.
[2023-04-07 05:20:37] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 489 ms :[p0, p0, (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=p0, acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}, { cond=p0, acceptance={0} source=3 dest: 6}], [{ cond=p0, acceptance={0} source=4 dest: 6}, { cond=true, acceptance={} source=4 dest: 7}], [{ cond=(NOT p1), acceptance={} source=5 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 9}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 9}, { cond=(NOT p1), acceptance={} source=6 dest: 10}], [{ cond=(NOT p1), acceptance={} source=7 dest: 11}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 12}], [{ cond=(NOT p2), acceptance={} source=8 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=9 dest: 1}, { cond=(NOT p2), acceptance={} source=9 dest: 2}], [{ cond=(NOT p2), acceptance={} source=10 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=10 dest: 4}], [{ cond=(NOT p2), acceptance={} source=11 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=11 dest: 6}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=12 dest: 6}, { cond=(NOT p2), acceptance={} source=12 dest: 7}]], initial=0, aps=[p0:(LT s23 1), p1:(GEQ s22 1), p2:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10608 reset in 76 ms.
Product exploration explored 100000 steps with 10602 reset in 69 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.2 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 p0 (NOT p1) (NOT p2)), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 467 ms. Reduced automaton from 13 states, 26 edges and 3 AP (stutter sensitive) to 42 states, 160 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1914 ms :[p0, p0, (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), false, (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]
Incomplete random walk after 10058 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=324 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) 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 3) seen :1
Running SMT prover for 2 properties.
[2023-04-07 05:20:40] [INFO ] Invariant cache hit.
[2023-04-07 05:20:40] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-04-07 05:20:40] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND p1 (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (OR p1 p2)), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p0 p2)), (F (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2)))), (F (AND (NOT p1) (NOT p0) p2)), (F (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))), (F (AND p1 p0 p2)), (F (OR p1 (NOT p0) p2)), (F (OR (AND p1 p0) (AND p0 p2))), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F (AND p1 p0 (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 8 factoid took 2263 ms. Reduced automaton from 42 states, 160 edges and 3 AP (stutter insensitive) to 30 states, 135 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1327 ms :[(OR p0 p1), (OR p1 p0), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (AND p1 (NOT p0) (NOT p2)), false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false]
Stuttering acceptance computed with spot in 1315 ms :[(OR p0 p1), (OR p1 p0), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (AND p1 (NOT p0) (NOT p2)), false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false]
[2023-04-07 05:20:45] [INFO ] Invariant cache hit.
[2023-04-07 05:20:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:20:45] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-07 05:20:45] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:20:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:20:45] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-04-07 05:20:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:20:45] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2023-04-07 05:20:45] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 5 ms.
[2023-04-07 05:20:45] [INFO ] Added : 23 causal constraints over 5 iterations in 43 ms. Result :sat
Could not prove EG p0
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:20:45] [INFO ] Invariant cache hit.
[2023-04-07 05:20:45] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 05:20:45] [INFO ] Invariant cache hit.
[2023-04-07 05:20:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:20:45] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-07 05:20:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:20:45] [INFO ] Invariant cache hit.
[2023-04-07 05:20:45] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 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 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2))))), (X (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2))), (X (OR p1 (AND p0 p2))), (X (NOT (OR p1 (AND p0 p2)))), (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (OR p1 p2)), (X (NOT (OR p1 p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))))), (X (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2)))), (X (AND (NOT p1) p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (OR (AND p1 p0) p2)), (X (NOT (OR (AND p1 p0) p2))), (X (X (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2)))))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2)))), (X (X (OR p1 (AND p0 p2)))), (X (X (NOT (OR p1 (AND p0 p2))))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p0) p2))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR p1 p2))), (X (X (NOT (OR p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2)))))), (X (X (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (OR (AND p1 p0) p2))), (X (X (NOT (OR (AND p1 p0) p2))))]
Knowledge based reduction with 15 factoid took 6124 ms. Reduced automaton from 30 states, 135 edges and 3 AP (stutter insensitive) to 30 states, 135 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1315 ms :[(OR p0 p1), (OR p1 p0), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (AND p1 (NOT p0) (NOT p2)), false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false]
Incomplete random walk after 10034 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=716 ) properties (out of 19) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 05:20:53] [INFO ] Invariant cache hit.
[2023-04-07 05:20:53] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-04-07 05:20:53] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND p1 (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2))))), (X (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2))), (X (OR p1 (AND p0 p2))), (X (NOT (OR p1 (AND p0 p2)))), (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (OR p1 p2)), (X (NOT (OR p1 p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))))), (X (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2)))), (X (AND (NOT p1) p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (OR (AND p1 p0) p2)), (X (NOT (OR (AND p1 p0) p2))), (X (X (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2)))))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2)))), (X (X (OR p1 (AND p0 p2)))), (X (X (NOT (OR p1 (AND p0 p2))))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p0) p2))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR p1 p2))), (X (X (NOT (OR p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2)))))), (X (X (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (OR (AND p1 p0) p2))), (X (X (NOT (OR (AND p1 p0) p2)))), (F (OR p1 p2)), (F (AND (NOT p0) p2)), (F (AND (NOT p1) p0 p2)), (F (OR (AND (NOT p1) p2) (AND (NOT p0) p2))), (F (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2))), (F (OR (AND p1 p0) p2)), (F (AND (NOT p1) (NOT p0) p2)), (F (AND p1 p2)), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2)), (F (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2)))), (F (AND (NOT p1) p2)), (F (OR p1 (AND p0 p2))), (F (AND p1 p0 (NOT p2))), (F (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))))), (F (AND p1 p0 p2)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 17 factoid took 11128 ms. Reduced automaton from 30 states, 135 edges and 3 AP (stutter insensitive) to 30 states, 135 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1299 ms :[(OR p0 p1), (OR p1 p0), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (AND p1 (NOT p0) (NOT p2)), false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false]
Stuttering acceptance computed with spot in 1376 ms :[(OR p0 p1), (OR p1 p0), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (AND p1 (NOT p0) (NOT p2)), false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false]
[2023-04-07 05:21:07] [INFO ] Invariant cache hit.
[2023-04-07 05:21:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:21:07] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-04-07 05:21:07] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:21:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:21:07] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-04-07 05:21:07] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:21:07] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-04-07 05:21:07] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 05:21:07] [INFO ] Added : 23 causal constraints over 5 iterations in 21 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 1358 ms :[(OR p0 p1), (OR p1 p0), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (AND p1 (NOT p0) (NOT p2)), false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false]
Product exploration explored 100000 steps with 9439 reset in 151 ms.
Stack based approach found an accepted trace after 44247 steps with 4095 reset with depth 23 and stack size 23 in 65 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-14 finished in 31643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 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.
[2023-04-07 05:21:09] [INFO ] Invariant cache hit.
[2023-04-07 05:21:09] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 05:21:09] [INFO ] Invariant cache hit.
[2023-04-07 05:21:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:21:09] [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:21:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 05:21:09] [INFO ] Invariant cache hit.
[2023-04-07 05:21:09] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-15 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:(AND (GEQ s4 1) (OR (LT s0 1) (LT s21 1)))], 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 8396 reset in 59 ms.
Product exploration explored 100000 steps with 8351 reset in 70 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.2 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 544 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=544 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2023-04-07 05:21:09] [INFO ] Invariant cache hit.
[2023-04-07 05:21:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:21:09] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-07 05:21:09] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:21:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:21:09] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-04-07 05:21:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:21:09] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-04-07 05:21:09] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-07 05:21:09] [INFO ] Added : 23 causal constraints over 5 iterations in 21 ms. Result :sat
Could not prove EG (NOT p0)
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:21:09] [INFO ] Invariant cache hit.
[2023-04-07 05:21:09] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 05:21:09] [INFO ] Invariant cache hit.
[2023-04-07 05:21:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:21:09] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-04-07 05:21:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:21:09] [INFO ] Invariant cache hit.
[2023-04-07 05:21:09] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Finished random walk after 207 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=207 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
[2023-04-07 05:21:10] [INFO ] Invariant cache hit.
[2023-04-07 05:21:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:21:10] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-07 05:21:10] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:21:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:21:10] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-07 05:21:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:21:10] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-04-07 05:21:10] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-07 05:21:10] [INFO ] Added : 23 causal constraints over 5 iterations in 20 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8307 reset in 58 ms.
Product exploration explored 100000 steps with 8402 reset in 70 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:21:10] [INFO ] Invariant cache hit.
[2023-04-07 05:21:10] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 05:21:10] [INFO ] Invariant cache hit.
[2023-04-07 05:21:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:21:10] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-04-07 05:21:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:21:10] [INFO ] Invariant cache hit.
[2023-04-07 05:21:10] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 32/32 places, 33/33 transitions.
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-15 finished in 1585 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(F((p0||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-04-07 05:21:11] [INFO ] Flatten gal took : 9 ms
[2023-04-07 05:21:11] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-07 05:21:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 33 transitions and 96 arcs took 0 ms.
Total runtime 41785 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CryptoMiner-PT-D10N100
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA CryptoMiner-PT-D10N100-LTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CryptoMiner-PT-D10N100-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1680844882009

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
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: LAUNCH task # 4 (type EXCL) for 3 CryptoMiner-PT-D10N100-LTLFireability-13
lola: time limit : 1200 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-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CryptoMiner-PT-D10N100-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
CryptoMiner-PT-D10N100-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1200 25/32 CryptoMiner-PT-D10N100-LTLFireability-13 3772026 m, 754405 m/sec, 5243655 t fired, .

Time elapsed: 5 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for CryptoMiner-PT-D10N100-LTLFireability-13 (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-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CryptoMiner-PT-D10N100-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
CryptoMiner-PT-D10N100-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 10 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 1 (type EXCL) for 0 CryptoMiner-PT-D10N100-LTLFireability-00
lola: time limit : 1795 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for CryptoMiner-PT-D10N100-LTLFireability-00
lola: result : false
lola: markings : 12
lola: fired transitions : 13
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 CryptoMiner-PT-D10N100-LTLFireability-15
lola: time limit : 3590 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for CryptoMiner-PT-D10N100-LTLFireability-15
lola: result : false
lola: markings : 12
lola: fired transitions : 12
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CryptoMiner-PT-D10N100-LTLFireability-00: LTL false LTL model checker
CryptoMiner-PT-D10N100-LTLFireability-13: LTL unknown AGGR
CryptoMiner-PT-D10N100-LTLFireability-15: LTL false LTL model checker


Time elapsed: 10 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="LTLFireability"
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 LTLFireability"
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-167987244900204"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;