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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 8.2K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.4K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 13K 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-COL-D20N100-LTLFireability-00
FORMULA_NAME CryptoMiner-COL-D20N100-LTLFireability-01
FORMULA_NAME CryptoMiner-COL-D20N100-LTLFireability-02
FORMULA_NAME CryptoMiner-COL-D20N100-LTLFireability-03
FORMULA_NAME CryptoMiner-COL-D20N100-LTLFireability-04
FORMULA_NAME CryptoMiner-COL-D20N100-LTLFireability-05
FORMULA_NAME CryptoMiner-COL-D20N100-LTLFireability-06
FORMULA_NAME CryptoMiner-COL-D20N100-LTLFireability-07
FORMULA_NAME CryptoMiner-COL-D20N100-LTLFireability-08
FORMULA_NAME CryptoMiner-COL-D20N100-LTLFireability-09
FORMULA_NAME CryptoMiner-COL-D20N100-LTLFireability-10
FORMULA_NAME CryptoMiner-COL-D20N100-LTLFireability-11
FORMULA_NAME CryptoMiner-COL-D20N100-LTLFireability-12
FORMULA_NAME CryptoMiner-COL-D20N100-LTLFireability-13
FORMULA_NAME CryptoMiner-COL-D20N100-LTLFireability-14
FORMULA_NAME CryptoMiner-COL-D20N100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680839585851

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-COL-D20N100
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 03:53:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 03:53:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:53:07] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-04-07 03:53:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 03:53:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 383 ms
[2023-04-07 03:53:07] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 63 PT places and 105.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-04-07 03:53:07] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 4 ms.
[2023-04-07 03:53:07] [INFO ] Skeletonized 7 HLPN properties in 0 ms. Removed 9 properties that had guard overlaps.
Computed a total of 3 stabilizing places and 3 stable transitions
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Arc [0:1*[(MOD (ADD $x 1) 21)]] contains successor/predecessor on variables of sort CD
[2023-04-07 03:53:07] [INFO ] Unfolded HLPN to a Petri net with 63 places and 63 transitions 187 arcs in 12 ms.
[2023-04-07 03:53:07] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Initial state reduction rules removed 6 formulas.
FORMULA CryptoMiner-COL-D20N100-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D20N100-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D20N100-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D20N100-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D20N100-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D20N100-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 8 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2023-04-07 03:53:08] [INFO ] Computed 0 invariants in 12 ms
[2023-04-07 03:53:08] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-04-07 03:53:08] [INFO ] Invariant cache hit.
[2023-04-07 03:53:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:53:08] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2023-04-07 03:53:08] [INFO ] Invariant cache hit.
[2023-04-07 03:53:08] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 294 ms. Remains : 62/63 places, 63/63 transitions.
Support contains 42 out of 62 places after structural reductions.
[2023-04-07 03:53:08] [INFO ] Flatten gal took : 18 ms
[2023-04-07 03:53:08] [INFO ] Flatten gal took : 8 ms
[2023-04-07 03:53:08] [INFO ] Input system was already deterministic with 63 transitions.
Incomplete random walk after 10064 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=296 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 03:53:08] [INFO ] Invariant cache hit.
[2023-04-07 03:53:08] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-04-07 03:53:08] [INFO ] After 57ms 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.
FORMULA CryptoMiner-COL-D20N100-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
FORMULA CryptoMiner-COL-D20N100-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D20N100-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:53:08] [INFO ] Invariant cache hit.
[2023-04-07 03:53:08] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-04-07 03:53:08] [INFO ] Invariant cache hit.
[2023-04-07 03:53:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:53:09] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-04-07 03:53:09] [INFO ] Invariant cache hit.
[2023-04-07 03:53:09] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 304 ms. Remains : 62/62 places, 63/63 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 356 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s21 1)), p1:(LT s41 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CryptoMiner-COL-D20N100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D20N100-LTLFireability-01 finished in 715 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 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 10 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:53:09] [INFO ] Invariant cache hit.
[2023-04-07 03:53:09] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-04-07 03:53:09] [INFO ] Invariant cache hit.
[2023-04-07 03:53:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:53:09] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-04-07 03:53:09] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 03:53:09] [INFO ] Invariant cache hit.
[2023-04-07 03:53:09] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 221 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(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 0 reset in 258 ms.
Product exploration explored 100000 steps with 0 reset in 365 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
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 175 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 68 ms :[p0, 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 192 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 70 ms :[p0, p0]
Stuttering acceptance computed with spot in 66 ms :[p0, p0]
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 15 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:53:11] [INFO ] Invariant cache hit.
[2023-04-07 03:53:11] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-04-07 03:53:11] [INFO ] Invariant cache hit.
[2023-04-07 03:53:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:53:11] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-04-07 03:53:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 03:53:11] [INFO ] Invariant cache hit.
[2023-04-07 03:53:11] [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 155 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 182 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 87 ms :[p0, 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 161 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 63 ms :[p0, p0]
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Stuttering acceptance computed with spot in 65 ms :[p0, p0]
Product exploration explored 100000 steps with 0 reset in 153 ms.
Product exploration explored 100000 steps with 0 reset in 187 ms.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:53:12] [INFO ] Invariant cache hit.
[2023-04-07 03:53:12] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-04-07 03:53:12] [INFO ] Invariant cache hit.
[2023-04-07 03:53:12] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:53:12] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-04-07 03:53:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:53:12] [INFO ] Invariant cache hit.
[2023-04-07 03:53:12] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 148 ms. Remains : 62/62 places, 63/63 transitions.
Treatment of property CryptoMiner-COL-D20N100-LTLFireability-02 finished in 2874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 21 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:53:12] [INFO ] Invariant cache hit.
[2023-04-07 03:53:12] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 03:53:12] [INFO ] Invariant cache hit.
[2023-04-07 03:53:12] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:53:12] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-04-07 03:53:12] [INFO ] Invariant cache hit.
[2023-04-07 03:53:12] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(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) (GEQ s11 1) (GEQ s12 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 159 ms.
Product exploration explored 100000 steps with 0 reset in 215 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.5 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0)), true]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[true, (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 : [p0, (X p0), (X (X p0)), true]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLFireability-04 finished in 822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 21 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:53:13] [INFO ] Invariant cache hit.
[2023-04-07 03:53:13] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-04-07 03:53:13] [INFO ] Invariant cache hit.
[2023-04-07 03:53:13] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:53:13] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-04-07 03:53:13] [INFO ] Invariant cache hit.
[2023-04-07 03:53:13] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (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) (GEQ s11 1) (GEQ s12 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLFireability-07 finished in 500 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 (G(!p0)||(!p0&&G(!p1))))))'
Support contains 41 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:53:13] [INFO ] Invariant cache hit.
[2023-04-07 03:53:13] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-04-07 03:53:13] [INFO ] Invariant cache hit.
[2023-04-07 03:53:13] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:53:13] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-04-07 03:53:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:53:13] [INFO ] Invariant cache hit.
[2023-04-07 03:53:13] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 79 ms :[p0, (AND p1 p0)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s40 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GE...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 336 ms.
Product exploration explored 100000 steps with 0 reset in 297 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 298 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[p0, (AND p0 p1)]
Finished random walk after 1355 steps, including 1 resets, run visited all 5 properties in 3 ms. (steps per millisecond=451 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 304 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 72 ms :[p0, (AND p0 p1)]
[2023-04-07 03:53:15] [INFO ] Invariant cache hit.
Proved EG p0
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (G p0)]
Property proved to be false thanks to negative knowledge :(G p0)
Knowledge based reduction with 12 factoid took 337 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLFireability-09 finished in 2122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(!p0)||X(F(!p1)))))))'
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:53:15] [INFO ] Invariant cache hit.
[2023-04-07 03:53:15] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-04-07 03:53:15] [INFO ] Invariant cache hit.
[2023-04-07 03:53:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:53:15] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-04-07 03:53:15] [INFO ] Invariant cache hit.
[2023-04-07 03:53:16] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 213 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(LT s41 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, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 720 reset in 123 ms.
Product exploration explored 100000 steps with 726 reset in 104 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Finished random walk after 2343 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=781 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 207 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 227 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:53:17] [INFO ] Invariant cache hit.
[2023-04-07 03:53:17] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-04-07 03:53:17] [INFO ] Invariant cache hit.
[2023-04-07 03:53:17] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:53:17] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-04-07 03:53:17] [INFO ] Invariant cache hit.
[2023-04-07 03:53:17] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Finished random walk after 121 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=40 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 182 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 217 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 720 reset in 91 ms.
Product exploration explored 100000 steps with 717 reset in 125 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 197 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:53:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:53:19] [INFO ] Invariant cache hit.
[2023-04-07 03:53:19] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 62/62 places, 63/63 transitions.
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:53:19] [INFO ] Invariant cache hit.
[2023-04-07 03:53:19] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 03:53:19] [INFO ] Invariant cache hit.
[2023-04-07 03:53:19] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:53:19] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-04-07 03:53:19] [INFO ] Invariant cache hit.
[2023-04-07 03:53:19] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 62/62 places, 63/63 transitions.
Treatment of property CryptoMiner-COL-D20N100-LTLFireability-10 finished in 3607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:53:19] [INFO ] Invariant cache hit.
[2023-04-07 03:53:19] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 03:53:19] [INFO ] Invariant cache hit.
[2023-04-07 03:53:19] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:53:19] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-04-07 03:53:19] [INFO ] Invariant cache hit.
[2023-04-07 03:53:19] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s41 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X 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 4 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLFireability-14 finished in 524 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(!p0)||X(F(!p1)))))))'
[2023-04-07 03:53:20] [INFO ] Flatten gal took : 10 ms
[2023-04-07 03:53:20] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-07 03:53:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 62 places, 63 transitions and 186 arcs took 0 ms.
Total runtime 12939 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CryptoMiner-COL-D20N100
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA CryptoMiner-COL-D20N100-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CryptoMiner-COL-D20N100-LTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1680839601359

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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: 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-COL-D20N100-LTLFireability-10
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for CryptoMiner-COL-D20N100-LTLFireability-10
lola: result : false
lola: markings : 1051
lola: fired transitions : 1051
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 CryptoMiner-COL-D20N100-LTLFireability-02
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for CryptoMiner-COL-D20N100-LTLFireability-02
lola: result : false
lola: markings : 2042
lola: fired transitions : 2042
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CryptoMiner-COL-D20N100-LTLFireability-02: LTL false LTL model checker
CryptoMiner-COL-D20N100-LTLFireability-10: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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-COL-D20N100"
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-COL-D20N100, 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-167987244900140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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