fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r519-tall-167987244800116
Last Updated
May 14, 2023

About the Execution of LoLa+red for CryptoMiner-COL-D05N250

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
407.628 11576.00 18173.00 321.20 FFFFFTTTFFFFTFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r519-tall-167987244800116.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-D05N250, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987244800116
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 9.8K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:06 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-D05N250-LTLFireability-00
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-01
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-02
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-03
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-04
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-05
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-06
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-07
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-08
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-09
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-10
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-11
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-12
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-13
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-14
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680837545819

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-D05N250
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 03:19:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 03:19:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:19: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:19:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 03:19:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 390 ms
[2023-04-07 03:19:07] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 18 PT places and 30.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-04-07 03:19:07] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 4 ms.
[2023-04-07 03:19:07] [INFO ] Skeletonized 6 HLPN properties in 1 ms. Removed 10 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) 6)]] contains successor/predecessor on variables of sort CD
[2023-04-07 03:19:07] [INFO ] Unfolded HLPN to a Petri net with 18 places and 18 transitions 52 arcs in 5 ms.
[2023-04-07 03:19:07] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Initial state reduction rules removed 3 formulas.
FORMULA CryptoMiner-COL-D05N250-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D05N250-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D05N250-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D05N250-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 18
Applied a total of 1 rules in 5 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 17 cols
[2023-04-07 03:19:08] [INFO ] Computed 0 invariants in 7 ms
[2023-04-07 03:19:08] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-04-07 03:19:08] [INFO ] Invariant cache hit.
[2023-04-07 03:19:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:19:08] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-04-07 03:19:08] [INFO ] Invariant cache hit.
[2023-04-07 03:19:08] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17/18 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 17/18 places, 18/18 transitions.
Support contains 12 out of 17 places after structural reductions.
[2023-04-07 03:19:08] [INFO ] Flatten gal took : 41 ms
[2023-04-07 03:19:08] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:19:08] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 256 steps, including 0 resets, run visited all 7 properties in 21 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 42 edges and 17 vertex of which 7 are kept as prefixes of interest. Removing 10 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 U !p1))))'
Support contains 6 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 03:19:08] [INFO ] Invariant cache hit.
[2023-04-07 03:19:08] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 03:19:08] [INFO ] Invariant cache hit.
[2023-04-07 03:19:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:19:08] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-07 03:19:08] [INFO ] Invariant cache hit.
[2023-04-07 03:19:08] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 17/17 places, 18/18 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 240 ms :[p1, p1, true, p1]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s6 1)), p0:(OR (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (AND (GEQ s0 1) (GEQ s6 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 1 ms.
FORMULA CryptoMiner-COL-D05N250-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLFireability-00 finished in 393 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&&X(p1))))'
Support contains 3 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 03:19:09] [INFO ] Invariant cache hit.
[2023-04-07 03:19:09] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 03:19:09] [INFO ] Invariant cache hit.
[2023-04-07 03:19:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:19:09] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-04-07 03:19:09] [INFO ] Invariant cache hit.
[2023-04-07 03:19:09] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GEQ s11 1), p0:(AND (GEQ s0 1) (GEQ s6 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 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D05N250-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLFireability-01 finished in 229 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 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 7 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 03:19:09] [INFO ] Invariant cache hit.
[2023-04-07 03:19:09] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-07 03:19:09] [INFO ] Invariant cache hit.
[2023-04-07 03:19:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:19:09] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-04-07 03:19:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:19:09] [INFO ] Invariant cache hit.
[2023-04-07 03:19:09] [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 95 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 209 ms :[p0]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s6 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 190 ms.
Product exploration explored 100000 steps with 0 reset in 215 ms.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 42 edges and 17 vertex of which 7 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 11 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 160 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 24 ms :[p0]
Finished random walk after 251 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=125 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 153 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[p0]
Stuttering acceptance computed with spot in 31 ms :[p0]
[2023-04-07 03:19:10] [INFO ] Invariant cache hit.
[2023-04-07 03:19:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:19:10] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-07 03:19:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:19:10] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-07 03:19:10] [INFO ] Computed and/alt/rep : 15/25/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 03:19:10] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG p0
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 03:19:10] [INFO ] Invariant cache hit.
[2023-04-07 03:19:10] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 03:19:10] [INFO ] Invariant cache hit.
[2023-04-07 03:19:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:19:10] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-04-07 03:19:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:19:10] [INFO ] Invariant cache hit.
[2023-04-07 03:19:10] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 17/17 places, 18/18 transitions.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 42 edges and 17 vertex of which 7 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Computed a total of 10 stabilizing places and 11 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 148 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 26 ms :[p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 173 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 35 ms :[p0]
Stuttering acceptance computed with spot in 26 ms :[p0]
[2023-04-07 03:19:11] [INFO ] Invariant cache hit.
[2023-04-07 03:19:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:19:11] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-04-07 03:19:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:19:11] [INFO ] [Real]Added 5 Read/Feed constraints in 2 ms returned sat
[2023-04-07 03:19:11] [INFO ] Computed and/alt/rep : 15/25/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-07 03:19:11] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 31 ms :[p0]
Product exploration explored 100000 steps with 0 reset in 111 ms.
Product exploration explored 100000 steps with 0 reset in 190 ms.
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 03:19:11] [INFO ] Invariant cache hit.
[2023-04-07 03:19:11] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 03:19:11] [INFO ] Invariant cache hit.
[2023-04-07 03:19:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:19:11] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-07 03:19:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:19:11] [INFO ] Invariant cache hit.
[2023-04-07 03:19:11] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 17/17 places, 18/18 transitions.
Treatment of property CryptoMiner-COL-D05N250-LTLFireability-02 finished in 2265 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((F(!p1)&&F(G(p2))))))'
Support contains 8 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 03:19:11] [INFO ] Invariant cache hit.
[2023-04-07 03:19:11] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 03:19:11] [INFO ] Invariant cache hit.
[2023-04-07 03:19:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:19:11] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-04-07 03:19:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:19:11] [INFO ] Invariant cache hit.
[2023-04-07 03:19:11] [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 : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s6 1)), p2:(AND (LT s11 1) (LT s0 1) (LT s1 1) (LT s2 1) (LT s3 1) (LT s4 1) (LT s5 1)), p1:(GEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 86 ms.
Stack based approach found an accepted trace after 44 steps with 0 reset with depth 45 and stack size 45 in 0 ms.
FORMULA CryptoMiner-COL-D05N250-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLFireability-03 finished in 301 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((p0||X(G(!p1))))))'
Support contains 3 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 03:19:11] [INFO ] Invariant cache hit.
[2023-04-07 03:19:11] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 03:19:11] [INFO ] Invariant cache hit.
[2023-04-07 03:19:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:19:11] [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 03:19:11] [INFO ] Invariant cache hit.
[2023-04-07 03:19:11] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (GEQ s0 1) (GEQ s6 1)), p1:(GEQ s11 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-COL-D05N250-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLFireability-04 finished in 268 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(((!p1 U p2)||p0))))'
Support contains 12 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 03:19:12] [INFO ] Invariant cache hit.
[2023-04-07 03:19:12] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 03:19:12] [INFO ] Invariant cache hit.
[2023-04-07 03:19:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:19:12] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-04-07 03:19:12] [INFO ] Invariant cache hit.
[2023-04-07 03:19:12] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), 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) (AND (LT s6 1) (LT s7 1) (LT s8 1) (LT s9 1) (LT s10 1))), p2:(GEQ s11 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 88 ms.
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 42 edges and 17 vertex of which 7 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 11 stable transitions
Detected a total of 10/17 stabilizing places and 11/18 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D05N250-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D05N250-LTLFireability-06 finished in 384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1) U (!p1&&(F(p0) U p1)))))'
Support contains 7 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 03:19:12] [INFO ] Invariant cache hit.
[2023-04-07 03:19:12] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 03:19:12] [INFO ] Invariant cache hit.
[2023-04-07 03:19:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:19:12] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-04-07 03:19:12] [INFO ] Invariant cache hit.
[2023-04-07 03:19:12] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, true, (NOT p0), (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1)), p0:(GEQ s11 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 76 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA CryptoMiner-COL-D05N250-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLFireability-08 finished in 401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(p0) U p1)))))'
Support contains 6 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 03:19:12] [INFO ] Invariant cache hit.
[2023-04-07 03:19:12] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-04-07 03:19:12] [INFO ] Invariant cache hit.
[2023-04-07 03:19:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:19:13] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-04-07 03:19:13] [INFO ] Invariant cache hit.
[2023-04-07 03:19:13] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1)), p0:(GEQ s11 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 64 ms.
Stack based approach found an accepted trace after 81 steps with 0 reset with depth 82 and stack size 82 in 0 ms.
FORMULA CryptoMiner-COL-D05N250-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLFireability-09 finished in 403 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 5 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Graph (trivial) has 6 edges and 17 vertex of which 6 / 17 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Applied a total of 1 rules in 7 ms. Remains 12 /17 variables (removed 5) and now considering 13/18 (removed 5) transitions.
// Phase 1: matrix 13 rows 12 cols
[2023-04-07 03:19:13] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 03:19:13] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-07 03:19:13] [INFO ] Invariant cache hit.
[2023-04-07 03:19:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:19:13] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-04-07 03:19:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:19:13] [INFO ] Invariant cache hit.
[2023-04-07 03:19:13] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/17 places, 13/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 12/17 places, 13/18 transitions.
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLFireability-10 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 (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 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 0 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D05N250-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLFireability-10 finished in 171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(!p0))))'
Support contains 5 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Graph (trivial) has 6 edges and 17 vertex of which 6 / 17 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Applied a total of 1 rules in 3 ms. Remains 12 /17 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2023-04-07 03:19:13] [INFO ] Invariant cache hit.
[2023-04-07 03:19:13] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-07 03:19:13] [INFO ] Invariant cache hit.
[2023-04-07 03:19:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:19:13] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-04-07 03:19:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:19:13] [INFO ] Invariant cache hit.
[2023-04-07 03:19:13] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/17 places, 13/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 12/17 places, 13/18 transitions.
Stuttering acceptance computed with spot in 84 ms :[p0, true, p0]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(OR (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-COL-D05N250-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLFireability-11 finished in 187 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 5 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Graph (trivial) has 6 edges and 17 vertex of which 6 / 17 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Applied a total of 1 rules in 3 ms. Remains 12 /17 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2023-04-07 03:19:13] [INFO ] Invariant cache hit.
[2023-04-07 03:19:13] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 03:19:13] [INFO ] Invariant cache hit.
[2023-04-07 03:19:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:19:13] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-04-07 03:19:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:19:13] [INFO ] Invariant cache hit.
[2023-04-07 03:19:13] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/17 places, 13/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 12/17 places, 13/18 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLFireability-13 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 (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 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 6 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D05N250-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLFireability-13 finished in 145 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 U !p1))))'
Support contains 3 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 17 cols
[2023-04-07 03:19:13] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 03:19:13] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 03:19:13] [INFO ] Invariant cache hit.
[2023-04-07 03:19:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:19:13] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-04-07 03:19:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:19:13] [INFO ] Invariant cache hit.
[2023-04-07 03:19:13] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 67 ms :[p1, p1]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s6 1)), p0:(GEQ s11 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 0 reset in 116 ms.
Product exploration explored 100000 steps with 0 reset in 121 ms.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 42 edges and 17 vertex of which 7 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 11 stable transitions
Detected a total of 10/17 stabilizing places and 11/18 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (OR (NOT p1) p0)), (X (NOT (OR (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (OR (NOT p1) p0))), (X (X (NOT (OR (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 356 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[p1, p1]
Incomplete random walk after 10060 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2012 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 03:19:14] [INFO ] Invariant cache hit.
[2023-04-07 03:19:14] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(X (OR (NOT p1) p0)), (X (NOT (OR (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (OR (NOT p1) p0))), (X (X (NOT (OR (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 431 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[p1]
Stuttering acceptance computed with spot in 48 ms :[p1]
[2023-04-07 03:19:15] [INFO ] Invariant cache hit.
[2023-04-07 03:19:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:19:15] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-07 03:19:15] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:19:15] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-07 03:19:15] [INFO ] Computed and/alt/rep : 15/25/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 03:19:15] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG p1
Support contains 2 out of 17 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 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 03:19:15] [INFO ] Invariant cache hit.
[2023-04-07 03:19:15] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 03:19:15] [INFO ] Invariant cache hit.
[2023-04-07 03:19:15] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:19:15] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-04-07 03:19:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:19:15] [INFO ] Invariant cache hit.
[2023-04-07 03:19:15] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 17/17 places, 18/18 transitions.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 42 edges and 17 vertex of which 7 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 11 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 122 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 24 ms :[p1]
Finished random walk after 251 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=251 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 192 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 43 ms :[p1]
Stuttering acceptance computed with spot in 39 ms :[p1]
[2023-04-07 03:19:15] [INFO ] Invariant cache hit.
[2023-04-07 03:19:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:19:15] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-07 03:19:15] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:19:15] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-07 03:19:15] [INFO ] Computed and/alt/rep : 15/25/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 03:19:15] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 36 ms :[p1]
Product exploration explored 100000 steps with 0 reset in 83 ms.
Product exploration explored 100000 steps with 0 reset in 85 ms.
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 03:19:16] [INFO ] Invariant cache hit.
[2023-04-07 03:19:16] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 03:19:16] [INFO ] Invariant cache hit.
[2023-04-07 03:19:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:19:16] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-04-07 03:19:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 03:19:16] [INFO ] Invariant cache hit.
[2023-04-07 03:19:16] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 17/17 places, 18/18 transitions.
Treatment of property CryptoMiner-COL-D05N250-LTLFireability-15 finished in 2362 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' '!(F(G((p0 U !p1))))'
[2023-04-07 03:19:16] [INFO ] Flatten gal took : 14 ms
[2023-04-07 03:19:16] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-07 03:19:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 17 places, 18 transitions and 51 arcs took 0 ms.
Total runtime 9202 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CryptoMiner-COL-D05N250
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

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

FORMULA CryptoMiner-COL-D05N250-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1680837557395

--------------------
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: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
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 # 1 (type EXCL) for 0 CryptoMiner-COL-D05N250-LTLFireability-02
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for CryptoMiner-COL-D05N250-LTLFireability-02
lola: result : false
lola: markings : 7
lola: fired transitions : 8
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 CryptoMiner-COL-D05N250-LTLFireability-15
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for CryptoMiner-COL-D05N250-LTLFireability-15
lola: result : false
lola: markings : 7
lola: fired transitions : 8
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-D05N250-LTLFireability-02: LTL false LTL model checker
CryptoMiner-COL-D05N250-LTLFireability-15: 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-D05N250"
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-D05N250, 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-167987244800116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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