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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 20K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 149K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 24K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 141K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 7.8K Mar 31 16:48 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CryptoMiner-PT-D05N250-LTLFireability-00
FORMULA_NAME CryptoMiner-PT-D05N250-LTLFireability-01
FORMULA_NAME CryptoMiner-PT-D05N250-LTLFireability-02
FORMULA_NAME CryptoMiner-PT-D05N250-LTLFireability-03
FORMULA_NAME CryptoMiner-PT-D05N250-LTLFireability-04
FORMULA_NAME CryptoMiner-PT-D05N250-LTLFireability-05
FORMULA_NAME CryptoMiner-PT-D05N250-LTLFireability-06
FORMULA_NAME CryptoMiner-PT-D05N250-LTLFireability-07
FORMULA_NAME CryptoMiner-PT-D05N250-LTLFireability-08
FORMULA_NAME CryptoMiner-PT-D05N250-LTLFireability-09
FORMULA_NAME CryptoMiner-PT-D05N250-LTLFireability-10
FORMULA_NAME CryptoMiner-PT-D05N250-LTLFireability-11
FORMULA_NAME CryptoMiner-PT-D05N250-LTLFireability-12
FORMULA_NAME CryptoMiner-PT-D05N250-LTLFireability-13
FORMULA_NAME CryptoMiner-PT-D05N250-LTLFireability-14
FORMULA_NAME CryptoMiner-PT-D05N250-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680843690868

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D05N250
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 05:01:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 05:01:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 05:01:32] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-04-07 05:01:32] [INFO ] Transformed 18 places.
[2023-04-07 05:01:32] [INFO ] Transformed 18 transitions.
[2023-04-07 05:01:32] [INFO ] Parsed PT model containing 18 places and 18 transitions and 52 arcs in 73 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CryptoMiner-PT-D05N250-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D05N250-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-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 20 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 05:01:32] [INFO ] Computed 0 invariants in 7 ms
[2023-04-07 05:01:32] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-04-07 05:01:32] [INFO ] Invariant cache hit.
[2023-04-07 05:01:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 05:01:32] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-04-07 05:01:32] [INFO ] Invariant cache hit.
[2023-04-07 05:01:32] [INFO ] Dead Transitions using invariants and state equation in 32 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 280 ms. Remains : 17/18 places, 18/18 transitions.
Support contains 12 out of 17 places after structural reductions.
[2023-04-07 05:01:33] [INFO ] Flatten gal took : 14 ms
[2023-04-07 05:01:33] [INFO ] Flatten gal took : 3 ms
[2023-04-07 05:01:33] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10074 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=592 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:01:33] [INFO ] Invariant cache hit.
[2023-04-07 05:01:33] [INFO ] After 34ms 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.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA CryptoMiner-PT-D05N250-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 05:01:33] [INFO ] Invariant cache hit.
[2023-04-07 05:01:33] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 05:01:33] [INFO ] Invariant cache hit.
[2023-04-07 05:01:33] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 05:01:33] [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 05:01:33] [INFO ] Invariant cache hit.
[2023-04-07 05:01:33] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 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 234 ms :[p1, p1, true, p1]
Running random walk in product with property : CryptoMiner-PT-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 s11 1)), p0:(OR (GEQ s15 1) (GEQ s11 1) (GEQ s12 1) (GEQ s13 1) (GEQ s14 1) (AND (GEQ s0 1) (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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA CryptoMiner-PT-D05N250-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLFireability-00 finished in 355 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 05:01:33] [INFO ] Invariant cache hit.
[2023-04-07 05:01:33] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 05:01:33] [INFO ] Invariant cache hit.
[2023-04-07 05:01:33] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 05:01:33] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-04-07 05:01:33] [INFO ] Invariant cache hit.
[2023-04-07 05:01:33] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : CryptoMiner-PT-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 s16 1), p0:(AND (GEQ s0 1) (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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D05N250-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLFireability-01 finished in 223 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 8 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 05:01:34] [INFO ] Invariant cache hit.
[2023-04-07 05:01:34] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-04-07 05:01:34] [INFO ] Invariant cache hit.
[2023-04-07 05:01:34] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 05:01:34] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-04-07 05:01:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 05:01:34] [INFO ] Invariant cache hit.
[2023-04-07 05:01:34] [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 109 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 49 ms :[p0]
Running random walk in product with property : CryptoMiner-PT-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 s11 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 204 ms.
Product exploration explored 100000 steps with 0 reset in 239 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.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 225 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 27 ms :[p0]
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 : [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 165 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[p0]
Stuttering acceptance computed with spot in 31 ms :[p0]
[2023-04-07 05:01:35] [INFO ] Invariant cache hit.
[2023-04-07 05:01:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:01:35] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-07 05:01:35] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:01:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:01:35] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-04-07 05:01:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 05:01:35] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-07 05:01:35] [INFO ] Computed and/alt/rep : 15/25/15 causal constraints (skipped 0 transitions) in 5 ms.
[2023-04-07 05:01:35] [INFO ] Added : 0 causal constraints over 0 iterations in 10 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 05:01:35] [INFO ] Invariant cache hit.
[2023-04-07 05:01:35] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 05:01:35] [INFO ] Invariant cache hit.
[2023-04-07 05:01:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 05:01:35] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-07 05:01:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:01:35] [INFO ] Invariant cache hit.
[2023-04-07 05:01:35] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 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 180 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 :[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 179 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 27 ms :[p0]
Stuttering acceptance computed with spot in 29 ms :[p0]
[2023-04-07 05:01:35] [INFO ] Invariant cache hit.
[2023-04-07 05:01:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:01:35] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-07 05:01:35] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:01:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:01:35] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-04-07 05:01:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 05:01:35] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-07 05:01:35] [INFO ] Computed and/alt/rep : 15/25/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 05:01:35] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 32 ms :[p0]
Product exploration explored 100000 steps with 0 reset in 96 ms.
Product exploration explored 100000 steps with 0 reset in 174 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 05:01:36] [INFO ] Invariant cache hit.
[2023-04-07 05:01:36] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 05:01:36] [INFO ] Invariant cache hit.
[2023-04-07 05:01:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 05:01:36] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-04-07 05:01:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:01:36] [INFO ] Invariant cache hit.
[2023-04-07 05:01:36] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 17/17 places, 18/18 transitions.
Treatment of property CryptoMiner-PT-D05N250-LTLFireability-02 finished in 2363 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 05:01:36] [INFO ] Invariant cache hit.
[2023-04-07 05:01:36] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 05:01:36] [INFO ] Invariant cache hit.
[2023-04-07 05:01:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 05:01:36] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-04-07 05:01:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:01:36] [INFO ] Invariant cache hit.
[2023-04-07 05:01:36] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Running random walk in product with property : CryptoMiner-PT-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 s11 1)), p2:(AND (LT s16 1) (LT s0 1) (LT s1 1) (LT s2 1) (LT s3 1) (LT s4 1) (LT s5 1)), p1:(GEQ s16 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 95 ms.
Stack based approach found an accepted trace after 113 steps with 0 reset with depth 114 and stack size 114 in 1 ms.
FORMULA CryptoMiner-PT-D05N250-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLFireability-03 finished in 337 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 05:01:36] [INFO ] Invariant cache hit.
[2023-04-07 05:01:36] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 05:01:36] [INFO ] Invariant cache hit.
[2023-04-07 05:01:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 05:01:36] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-04-07 05:01:36] [INFO ] Invariant cache hit.
[2023-04-07 05:01:36] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : CryptoMiner-PT-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 s11 1)), p1:(GEQ s16 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 0 ms.
FORMULA CryptoMiner-PT-D05N250-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLFireability-04 finished in 275 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 05:01:37] [INFO ] Invariant cache hit.
[2023-04-07 05:01:37] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 05:01:37] [INFO ] Invariant cache hit.
[2023-04-07 05:01:37] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 05:01:37] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-07 05:01:37] [INFO ] Invariant cache hit.
[2023-04-07 05:01:37] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CryptoMiner-PT-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 s15 1) (LT s11 1) (LT s12 1) (LT s13 1) (LT s14 1))), p2:(GEQ s16 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 86 ms.
Product exploration explored 100000 steps with 50000 reset in 87 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.0 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 17 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-PT-D05N250-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D05N250-LTLFireability-06 finished in 368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 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 05:01:37] [INFO ] Invariant cache hit.
[2023-04-07 05:01:37] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-07 05:01:37] [INFO ] Invariant cache hit.
[2023-04-07 05:01:37] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 05:01:37] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-04-07 05:01:37] [INFO ] Invariant cache hit.
[2023-04-07 05:01:37] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 12502 reset in 61 ms.
Stack based approach found an accepted trace after 124 steps with 15 reset with depth 31 and stack size 31 in 0 ms.
FORMULA CryptoMiner-PT-D05N250-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLFireability-08 finished in 248 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(((X(p0) U p1)&&p2))))))'
Support contains 4 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 05:01:37] [INFO ] Invariant cache hit.
[2023-04-07 05:01:37] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 05:01:37] [INFO ] Invariant cache hit.
[2023-04-07 05:01:37] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 05:01:37] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 05:01:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 05:01:37] [INFO ] Invariant cache hit.
[2023-04-07 05:01:37] [INFO ] Dead Transitions using invariants and state equation in 20 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 137 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p1) p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LT s15 1), p1:(GEQ s3 1), p0:(AND (GEQ s0 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 8787 reset in 67 ms.
Stack based approach found an accepted trace after 197 steps with 13 reset with depth 16 and stack size 16 in 0 ms.
FORMULA CryptoMiner-PT-D05N250-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLFireability-09 finished in 309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((F((!p0&&F(p1)))&&X(F(p2)))||G((F(p1)&&F(!p0)))))))'
Support contains 4 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 05:01:37] [INFO ] Invariant cache hit.
[2023-04-07 05:01:37] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 05:01:37] [INFO ] Invariant cache hit.
[2023-04-07 05:01:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 05:01:38] [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 05:01:38] [INFO ] Invariant cache hit.
[2023-04-07 05:01:38] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 384 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), p0, (AND p0 (NOT p2))]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 6}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=p0, acceptance={0} source=7 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(GEQ s4 1), p0:(GEQ s3 1), p2:(AND (GEQ s0 1) (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, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7898 reset in 68 ms.
Stack based approach found an accepted trace after 26392 steps with 2071 reset with depth 105 and stack size 105 in 18 ms.
FORMULA CryptoMiner-PT-D05N250-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLFireability-10 finished in 578 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(F(!p0)))))'
Support contains 2 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 05:01:38] [INFO ] Invariant cache hit.
[2023-04-07 05:01:38] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 05:01:38] [INFO ] Invariant cache hit.
[2023-04-07 05:01:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 05:01:38] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-04-07 05:01:38] [INFO ] Invariant cache hit.
[2023-04-07 05:01:38] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 154 ms :[p0, p0, p0, p0]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s0 1) (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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 17830 reset in 50 ms.
Stack based approach found an accepted trace after 1758 steps with 316 reset with depth 12 and stack size 12 in 2 ms.
FORMULA CryptoMiner-PT-D05N250-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLFireability-12 finished in 311 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)||G(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.
[2023-04-07 05:01:38] [INFO ] Invariant cache hit.
[2023-04-07 05:01:38] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 05:01:38] [INFO ] Invariant cache hit.
[2023-04-07 05:01:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 05:01:38] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-04-07 05:01:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:01:38] [INFO ] Invariant cache hit.
[2023-04-07 05:01:38] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND p0 (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s11 1)), p1:(AND (OR (LT s0 1) (LT s11 1)) (LT s4 1))], nbAcceptance=2, 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 104 ms.
Product exploration explored 100000 steps with 0 reset in 117 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 : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 243 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(AND p0 (NOT p1))]
Incomplete random walk after 10067 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=1438 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:01:39] [INFO ] Invariant cache hit.
[2023-04-07 05:01:39] [INFO ] After 16ms 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 p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 419 ms. Reduced automaton from 1 states, 4 edges and 2 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 25 ms :[p0]
[2023-04-07 05:01:39] [INFO ] Invariant cache hit.
[2023-04-07 05:01:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:01:40] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-07 05:01:40] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:01:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:01:40] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-04-07 05:01:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 05:01:40] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-07 05:01:40] [INFO ] Computed and/alt/rep : 15/25/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 05:01:40] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG p0
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 05:01:40] [INFO ] Invariant cache hit.
[2023-04-07 05:01:40] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 05:01:40] [INFO ] Invariant cache hit.
[2023-04-07 05:01:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 05:01:40] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-04-07 05:01:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:01:40] [INFO ] Invariant cache hit.
[2023-04-07 05:01:40] [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 78 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 140 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 1 ms. (steps per millisecond=1 )
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 125 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 32 ms :[p0]
Stuttering acceptance computed with spot in 32 ms :[p0]
[2023-04-07 05:01:40] [INFO ] Invariant cache hit.
[2023-04-07 05:01:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:01:40] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-07 05:01:40] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:01:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:01:40] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-04-07 05:01:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 05:01:40] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-07 05:01:40] [INFO ] Computed and/alt/rep : 15/25/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 05:01:40] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 34 ms :[p0]
Product exploration explored 100000 steps with 0 reset in 73 ms.
Product exploration explored 100000 steps with 0 reset in 150 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 05:01:40] [INFO ] Invariant cache hit.
[2023-04-07 05:01:40] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 05:01:40] [INFO ] Invariant cache hit.
[2023-04-07 05:01:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 05:01:40] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-04-07 05:01:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:01:40] [INFO ] Invariant cache hit.
[2023-04-07 05:01:40] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 17/17 places, 18/18 transitions.
Treatment of property CryptoMiner-PT-D05N250-LTLFireability-13 finished in 2156 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 X(p0)))))'
Support contains 1 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 05:01:40] [INFO ] Invariant cache hit.
[2023-04-07 05:01:41] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 05:01:41] [INFO ] Invariant cache hit.
[2023-04-07 05:01:41] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 05:01:41] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-07 05:01:41] [INFO ] Invariant cache hit.
[2023-04-07 05:01:41] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 61 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 0 ms.
FORMULA CryptoMiner-PT-D05N250-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLFireability-15 finished in 230 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)||G(p1))))'
[2023-04-07 05:01:41] [INFO ] Flatten gal took : 8 ms
[2023-04-07 05:01:41] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-04-07 05:01:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 17 places, 18 transitions and 51 arcs took 1 ms.
Total runtime 9139 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CryptoMiner-PT-D05N250
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

BK_STOP 1680843722653

--------------------
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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 4 (type EXCL) for 3 CryptoMiner-PT-D05N250-LTLFireability-13
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-PT-D05N250-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CryptoMiner-PT-D05N250-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1800 24/32 CryptoMiner-PT-D05N250-LTLFireability-13 3515938 m, 703187 m/sec, 6973330 t fired, .

Time elapsed: 5 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for CryptoMiner-PT-D05N250-LTLFireability-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-PT-D05N250-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CryptoMiner-PT-D05N250-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 10 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 CryptoMiner-PT-D05N250-LTLFireability-02
lola: time limit : 3590 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-PT-D05N250-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
CryptoMiner-PT-D05N250-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3590 28/32 CryptoMiner-PT-D05N250-LTLFireability-02 4227697 m, 845539 m/sec, 6400346 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-PT-D05N250-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
CryptoMiner-PT-D05N250-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CryptoMiner-PT-D05N250-LTLFireability-02: LTL unknown AGGR
CryptoMiner-PT-D05N250-LTLFireability-13: LTL unknown AGGR


Time elapsed: 20 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CryptoMiner-PT-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-PT-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-167987244900188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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