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.r521-tall-167987246300180.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 ltsminxred
Input is CryptoMiner-PT-D05N100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246300180
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 11K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 38K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 277K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Mar 23 15:23 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-D05N100-LTLFireability-00
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-01
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-02
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-03
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-04
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-05
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-06
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-07
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-08
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-09
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-10
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-11
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-12
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-13
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-14
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680887231584

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D05N100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 17:07:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 17:07:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 17:07:13] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-04-07 17:07:13] [INFO ] Transformed 18 places.
[2023-04-07 17:07:13] [INFO ] Transformed 18 transitions.
[2023-04-07 17:07:13] [INFO ] Parsed PT model containing 18 places and 18 transitions and 52 arcs in 128 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-D05N100-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D05N100-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D05N100-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 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 18 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 17:07:13] [INFO ] Computed 0 invariants in 8 ms
[2023-04-07 17:07:13] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-04-07 17:07:13] [INFO ] Invariant cache hit.
[2023-04-07 17:07:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:07:13] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2023-04-07 17:07:13] [INFO ] Invariant cache hit.
[2023-04-07 17:07:13] [INFO ] Dead Transitions using invariants and state equation in 43 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 315 ms. Remains : 17/18 places, 18/18 transitions.
Support contains 10 out of 17 places after structural reductions.
[2023-04-07 17:07:14] [INFO ] Flatten gal took : 14 ms
[2023-04-07 17:07:14] [INFO ] Flatten gal took : 6 ms
[2023-04-07 17:07:14] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 3441 steps, including 1 resets, run visited all 10 properties in 86 ms. (steps per millisecond=40 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(G(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 0 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 17:07:14] [INFO ] Invariant cache hit.
[2023-04-07 17:07:14] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 17:07:14] [INFO ] Invariant cache hit.
[2023-04-07 17:07:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:07:15] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-04-07 17:07:15] [INFO ] Invariant cache hit.
[2023-04-07 17:07:15] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 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 249 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LT s0 1) (LT s1 1) (LT s2 1) (LT s3 1) (LT s4 1) (LT s5 1)), p1:(LT 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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 229 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 1 ms.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLFireability-00 finished in 846 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)&&F(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 5 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 17:07:15] [INFO ] Invariant cache hit.
[2023-04-07 17:07:15] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 17:07:15] [INFO ] Invariant cache hit.
[2023-04-07 17:07:15] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:07:15] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-04-07 17:07:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:07:15] [INFO ] Invariant cache hit.
[2023-04-07 17:07:15] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s16 1), p1:(AND (GEQ s16 1) (OR (LT s0 1) (LT 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 3 reset in 129 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 1 ms.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLFireability-01 finished in 387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||F(!p1))) U X(G(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 17:07:15] [INFO ] Invariant cache hit.
[2023-04-07 17:07:16] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-04-07 17:07:16] [INFO ] Invariant cache hit.
[2023-04-07 17:07:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:07:16] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-04-07 17:07:16] [INFO ] Invariant cache hit.
[2023-04-07 17:07:16] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p1), (NOT p1), false, (AND p1 (NOT p0)), p1]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (LT s0 1) (LT s1 1) (LT s2 1) (LT s3 1) (LT s4 1) (LT s5 1)), p0:(AND (GEQ s0 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 19941 reset in 117 ms.
Product exploration explored 100000 steps with 19971 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.1 ms
Computed a total of 10 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (AND p1 (NOT p0)), p1]
Incomplete random walk after 10040 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=1004 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 17:07:16] [INFO ] Invariant cache hit.
[2023-04-07 17:07:16] [INFO ] After 18ms 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 (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p0) p1))]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D05N100-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D05N100-LTLFireability-02 finished in 1047 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((G(p0)&&X((X(G(p2))&&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 2 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 17:07:16] [INFO ] Invariant cache hit.
[2023-04-07 17:07:17] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-04-07 17:07:17] [INFO ] Invariant cache hit.
[2023-04-07 17:07:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:07:17] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-04-07 17:07:17] [INFO ] Invariant cache hit.
[2023-04-07 17:07:17] [INFO ] Dead Transitions using invariants and state equation in 23 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 305 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={1} source=1 dest: 2}, { cond=p0, acceptance={0, 1} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 1}, { cond=p0, acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={1} source=3 dest: 5}, { cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p2), acceptance={} source=4 dest: 5}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=5 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=6 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p0 p2), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={0} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s11 1)), p1:(AND (GEQ s0 1) (GEQ s11 1)), p2:(LT s16 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 120 ms.
Stack based approach found an accepted trace after 77 steps with 0 reset with depth 78 and stack size 78 in 0 ms.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLFireability-03 finished in 547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&F(G(!p1))))'
Support contains 7 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 17:07:17] [INFO ] Invariant cache hit.
[2023-04-07 17:07:17] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 17:07:17] [INFO ] Invariant cache hit.
[2023-04-07 17:07:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:07:17] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-04-07 17:07:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:07:17] [INFO ] Invariant cache hit.
[2023-04-07 17:07:17] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR p0 p1), p0, p1]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LT s0 1) (LT s1 1) (LT s2 1) (LT s3 1) (LT s4 1) (LT s5 1)), p1:(LT 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 90 ms.
Stack based approach found an accepted trace after 69 steps with 0 reset with depth 70 and stack size 70 in 0 ms.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLFireability-06 finished in 344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 2 out of 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 9 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 17:07:17] [INFO ] Invariant cache hit.
[2023-04-07 17:07:17] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-07 17:07:17] [INFO ] Invariant cache hit.
[2023-04-07 17:07:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:07:17] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-04-07 17:07:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:07:17] [INFO ] Invariant cache hit.
[2023-04-07 17:07:17] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 74 ms :[p0, p0]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLFireability-07 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:(AND (GEQ s0 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4 reset in 65 ms.
Product exploration explored 100000 steps with 1 reset in 142 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 p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[p0, p0]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 175 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[p0, p0]
Stuttering acceptance computed with spot in 82 ms :[p0, p0]
[2023-04-07 17:07:18] [INFO ] Invariant cache hit.
[2023-04-07 17:07:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 17:07:18] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-07 17:07:18] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 17:07:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 17:07:19] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-07 17:07:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:07:19] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-07 17:07:19] [INFO ] Computed and/alt/rep : 15/25/15 causal constraints (skipped 0 transitions) in 5 ms.
[2023-04-07 17:07:19] [INFO ] Added : 0 causal constraints over 0 iterations in 11 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 17:07:19] [INFO ] Invariant cache hit.
[2023-04-07 17:07:19] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 17:07:19] [INFO ] Invariant cache hit.
[2023-04-07 17:07:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:07:19] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-04-07 17:07:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:07:19] [INFO ] Invariant cache hit.
[2023-04-07 17:07:19] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 127 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 p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[p0, p0]
Stuttering acceptance computed with spot in 66 ms :[p0, p0]
[2023-04-07 17:07:19] [INFO ] Invariant cache hit.
[2023-04-07 17:07:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 17:07:19] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-07 17:07:19] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 17:07:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 17:07:19] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-07 17:07:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:07:19] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-07 17:07:19] [INFO ] Computed and/alt/rep : 15/25/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 17:07:19] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 180 ms :[p0, p0]
Product exploration explored 100000 steps with 0 reset in 66 ms.
Product exploration explored 100000 steps with 3 reset in 68 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 17:07:20] [INFO ] Invariant cache hit.
[2023-04-07 17:07:20] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-04-07 17:07:20] [INFO ] Invariant cache hit.
[2023-04-07 17:07:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:07:20] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-04-07 17:07:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:07:20] [INFO ] Invariant cache hit.
[2023-04-07 17:07:20] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 17/17 places, 18/18 transitions.
Treatment of property CryptoMiner-PT-D05N100-LTLFireability-07 finished in 2372 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))||G(p1)))'
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 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 17:07:20] [INFO ] Invariant cache hit.
[2023-04-07 17:07:20] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 17:07:20] [INFO ] Invariant cache hit.
[2023-04-07 17:07:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:07:20] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-04-07 17:07:20] [INFO ] Invariant cache hit.
[2023-04-07 17:07:20] [INFO ] Dead Transitions using invariants and state equation in 26 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 142 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LT s5 1), p0:(LT s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLFireability-08 finished in 244 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((G(F(!p0)) U 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 2 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 17:07:20] [INFO ] Invariant cache hit.
[2023-04-07 17:07:20] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 17:07:20] [INFO ] Invariant cache hit.
[2023-04-07 17:07:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:07:20] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-04-07 17:07:20] [INFO ] Invariant cache hit.
[2023-04-07 17:07:20] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), p0, p0, (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 2}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s11 1)), p0:(LT s16 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 45 reset in 61 ms.
Stack based approach found an accepted trace after 344 steps with 18 reset with depth 24 and stack size 24 in 1 ms.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLFireability-09 finished in 391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X(p1))))'
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 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 17:07:20] [INFO ] Invariant cache hit.
[2023-04-07 17:07:20] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 17:07:20] [INFO ] Invariant cache hit.
[2023-04-07 17:07:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:07:20] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-04-07 17:07:20] [INFO ] Invariant cache hit.
[2023-04-07 17:07:21] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LT s16 1), p1:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLFireability-10 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' '!(((p0||G(!p0)) U (p1&&(!p1 U !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.
Graph (trivial) has 8 edges and 17 vertex of which 6 / 17 are part of one of the 1 SCC in 2 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 17:07:21] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 17:07:21] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-07 17:07:21] [INFO ] Invariant cache hit.
[2023-04-07 17:07:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:07:21] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-04-07 17:07:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:07:21] [INFO ] Invariant cache hit.
[2023-04-07 17:07:21] [INFO ] Dead Transitions using invariants and state equation in 19 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 84 ms. Remains : 12/17 places, 13/18 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p1) p0), p0, true]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LT s11 1), p0:(LT s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 0 ms.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLFireability-11 finished in 169 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&&G(!p1)) U (X(F(!p2))||G(p3))))'
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.
// Phase 1: matrix 18 rows 17 cols
[2023-04-07 17:07:21] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 17:07:21] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 17:07:21] [INFO ] Invariant cache hit.
[2023-04-07 17:07:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:07:21] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-04-07 17:07:21] [INFO ] Invariant cache hit.
[2023-04-07 17:07:21] [INFO ] Dead Transitions using invariants and state equation in 19 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 154 ms :[(AND p2 (NOT p3)), p2, (AND p2 p1), (AND p2 (NOT p3)), (AND p2 (NOT p3))]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p3 p0) (AND p3 p1)), acceptance={} source=0 dest: 4}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p1 p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p3 (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p3 p0 p2) (AND p3 p1 p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 1}, { cond=(AND p3 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (GEQ s1 1) (GEQ s16 1)), p0:(LT s5 1), p1:(LT s1 1), p2:(LT s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 5090 reset in 74 ms.
Stack based approach found an accepted trace after 71 steps with 3 reset with depth 22 and stack size 22 in 0 ms.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLFireability-14 finished in 327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!p0&&(G(!p0)||X(X(G(p1)))))) U !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 6 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 17:07:21] [INFO ] Invariant cache hit.
[2023-04-07 17:07:21] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 17:07:21] [INFO ] Invariant cache hit.
[2023-04-07 17:07:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:07:21] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-04-07 17:07:21] [INFO ] Invariant cache hit.
[2023-04-07 17:07:21] [INFO ] Dead Transitions using invariants and state equation in 22 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 169 ms :[p1, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p0), acceptance={1} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={1} source=2 dest: 3}, { cond=p0, acceptance={0, 1} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LT s13 1), p0:(AND (GEQ s0 1) (GEQ s11 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 98 ms.
Product exploration explored 100000 steps with 0 reset in 196 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 p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 580 ms. Reduced automaton from 5 states, 15 edges and 2 AP (stutter sensitive) to 5 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[p1, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10019 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1431 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 17:07:23] [INFO ] Invariant cache hit.
[2023-04-07 17:07:23] [INFO ] After 26ms 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 p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 662 ms. Reduced automaton from 5 states, 15 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[p1]
Stuttering acceptance computed with spot in 25 ms :[p1]
[2023-04-07 17:07:23] [INFO ] Invariant cache hit.
[2023-04-07 17:07:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 17:07:23] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-07 17:07:23] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 17:07:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 17:07:23] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-04-07 17:07:23] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:07:23] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-07 17:07:23] [INFO ] Computed and/alt/rep : 15/25/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 17:07:23] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG p1
Support contains 1 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 17:07:23] [INFO ] Invariant cache hit.
[2023-04-07 17:07:24] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 17:07:24] [INFO ] Invariant cache hit.
[2023-04-07 17:07:24] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:07:24] [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 17:07:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:07:24] [INFO ] Invariant cache hit.
[2023-04-07 17:07:24] [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 89 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
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/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[p1]
Finished random walk after 204 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=102 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[p1]
Stuttering acceptance computed with spot in 23 ms :[p1]
[2023-04-07 17:07:24] [INFO ] Invariant cache hit.
[2023-04-07 17:07:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 17:07:24] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-04-07 17:07:24] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 17:07:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 17:07:24] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-04-07 17:07:24] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 17:07:24] [INFO ] [Nat]Added 5 Read/Feed constraints in 0 ms returned sat
[2023-04-07 17:07:24] [INFO ] Computed and/alt/rep : 15/25/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 17:07:24] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 44 ms :[p1]
Product exploration explored 100000 steps with 12499 reset in 59 ms.
Stack based approach found an accepted trace after 377 steps with 47 reset with depth 22 and stack size 22 in 1 ms.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLFireability-15 finished in 2915 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)))'
[2023-04-07 17:07:24] [INFO ] Flatten gal took : 7 ms
[2023-04-07 17:07:24] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-07 17:07:24] [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 11633 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1244/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CryptoMiner-PT-D05N100-LTLFireability-07

BK_STOP 1680887246227

--------------------
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
mcc2023
ltl formula name CryptoMiner-PT-D05N100-LTLFireability-07
ltl formula formula --ltl=/tmp/1244/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 17 places, 18 transitions and 51 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1244/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1244/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1244/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1244/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

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-D05N100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CryptoMiner-PT-D05N100, 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 r521-tall-167987246300180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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