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.r167-tall-167838852600156.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 Eratosthenes-PT-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838852600156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.6K Feb 25 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 11:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 11:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 50K Mar 5 18:22 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 Eratosthenes-PT-050-LTLFireability-00
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-01
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-02
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-03
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-04
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-05
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-06
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-07
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-08
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-09
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-10
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-11
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-12
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-13
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-14
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678445777947

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=Eratosthenes-PT-050
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 10:56:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 10:56:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 10:56:19] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2023-03-10 10:56:19] [INFO ] Transformed 49 places.
[2023-03-10 10:56:19] [INFO ] Transformed 108 transitions.
[2023-03-10 10:56:19] [INFO ] Parsed PT model containing 49 places and 108 transitions and 324 arcs in 96 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 8 formulas.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA Eratosthenes-PT-050-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 80/80 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 32 transition count 78
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 32 transition count 78
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 0 with 46 rules applied. Total rules applied 50 place count 32 transition count 32
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 63 place count 19 transition count 19
Iterating global reduction 0 with 13 rules applied. Total rules applied 76 place count 19 transition count 19
Applied a total of 76 rules in 13 ms. Remains 19 /34 variables (removed 15) and now considering 19/80 (removed 61) transitions.
// Phase 1: matrix 19 rows 19 cols
[2023-03-10 10:56:19] [INFO ] Computed 0 place invariants in 12 ms
[2023-03-10 10:56:19] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-10 10:56:19] [INFO ] Invariant cache hit.
[2023-03-10 10:56:19] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-10 10:56:19] [INFO ] Invariant cache hit.
[2023-03-10 10:56:19] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/34 places, 19/80 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 218 ms. Remains : 19/34 places, 19/80 transitions.
Support contains 18 out of 19 places after structural reductions.
[2023-03-10 10:56:20] [INFO ] Flatten gal took : 13 ms
[2023-03-10 10:56:20] [INFO ] Flatten gal took : 3 ms
[2023-03-10 10:56:20] [INFO ] Input system was already deterministic with 19 transitions.
Finished random walk after 18 steps, including 0 resets, run visited all 19 properties in 11 ms. (steps per millisecond=1 )
FORMULA Eratosthenes-PT-050-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 19 stabilizing places and 19 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 19
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((p0&&F(p1)))&&(p0||(p2 U !p3)))))'
Support contains 4 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 19/19 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 5 transition count 5
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 5 transition count 5
Applied a total of 28 rules in 1 ms. Remains 5 /19 variables (removed 14) and now considering 5/19 (removed 14) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-10 10:56:20] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:56:20] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-10 10:56:20] [INFO ] Invariant cache hit.
[2023-03-10 10:56:20] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2023-03-10 10:56:20] [INFO ] Invariant cache hit.
[2023-03-10 10:56:20] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/19 places, 5/19 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 5/19 places, 5/19 transitions.
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) p3) (AND (NOT p1) p3)), (NOT p1), (OR (AND (NOT p0) p3) (AND (NOT p1) p3)), (AND (NOT p1) p3)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(OR p0 (NOT p3) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p3 p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p3 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p3 p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p3 p2 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s2 1), p3:(OR (GEQ s2 1) (GEQ s3 1)), p2:(GEQ s4 1), p1:(GEQ s1 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 3 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-02 finished in 504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 19/19 transitions.
Graph (complete) has 0 edges and 19 vertex of which 2 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Applied a total of 1 rules in 3 ms. Remains 2 /19 variables (removed 17) and now considering 2/19 (removed 17) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-10 10:56:20] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 10:56:20] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-10 10:56:20] [INFO ] Invariant cache hit.
[2023-03-10 10:56:20] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-03-10 10:56:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 10:56:20] [INFO ] Invariant cache hit.
[2023-03-10 10:56:20] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/19 places, 2/19 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64 ms. Remains : 2/19 places, 2/19 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-04 finished in 113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0 U (G(p0)||(p0&&(!p1 U (p2||G(!p1))))))))))'
Support contains 5 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 19/19 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 6 transition count 6
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 6 transition count 6
Applied a total of 26 rules in 3 ms. Remains 6 /19 variables (removed 13) and now considering 6/19 (removed 13) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-10 10:56:21] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 10:56:21] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-10 10:56:21] [INFO ] Invariant cache hit.
[2023-03-10 10:56:21] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-10 10:56:21] [INFO ] Invariant cache hit.
[2023-03-10 10:56:21] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6/19 places, 6/19 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 6/19 places, 6/19 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p2:(AND (NOT (AND (GEQ s1 1) (GEQ s4 1))) (NOT (AND (GEQ s2 1) (GEQ s3 1)))), p1:(AND (GEQ s2 1) (GEQ s3 1)), p0:(LT s5 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 16417 reset in 192 ms.
Product exploration explored 100000 steps with 16511 reset in 131 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (F (G p2)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 189 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-050-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-050-LTLFireability-06 finished in 790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0) U (!p0 U p1)))))'
Support contains 2 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 19/19 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 3 transition count 3
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 3 transition count 3
Applied a total of 32 rules in 1 ms. Remains 3 /19 variables (removed 16) and now considering 3/19 (removed 16) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-10 10:56:21] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 10:56:21] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-10 10:56:21] [INFO ] Invariant cache hit.
[2023-03-10 10:56:21] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-10 10:56:21] [INFO ] Invariant cache hit.
[2023-03-10 10:56:21] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/19 places, 3/19 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 3/19 places, 3/19 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), false, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 0}]], initial=0, aps=[p1:(GEQ s2 1), p0:(GEQ s1 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 13754 reset in 58 ms.
Product exploration explored 100000 steps with 13602 reset in 59 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), true, (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 486 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), true, (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 5 factoid took 515 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Graph (complete) has 0 edges and 3 vertex of which 2 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 0 ms. Remains 2 /3 variables (removed 1) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-10 10:56:23] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:56:23] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-10 10:56:23] [INFO ] Invariant cache hit.
[2023-03-10 10:56:23] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-10 10:56:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 10:56:23] [INFO ] Invariant cache hit.
[2023-03-10 10:56:23] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/3 places, 2/3 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69 ms. Remains : 2/3 places, 2/3 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 9 factoid took 456 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 9 factoid took 449 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-08 finished in 3497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(G(F(p1)) U !p0)&&X(G(p2)))))'
Support contains 3 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 19/19 transitions.
Graph (complete) has 0 edges and 19 vertex of which 3 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 6 ms. Remains 3 /19 variables (removed 16) and now considering 3/19 (removed 16) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-10 10:56:25] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:56:25] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-10 10:56:25] [INFO ] Invariant cache hit.
[2023-03-10 10:56:25] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-10 10:56:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 10:56:25] [INFO ] Invariant cache hit.
[2023-03-10 10:56:25] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/19 places, 3/19 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71 ms. Remains : 3/19 places, 3/19 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p1), (NOT p1), p0, (NOT p2)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=p0, acceptance={0} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 2}, { cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s2 1), p1:(LT s1 1), p2:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 47 steps with 13 reset in 0 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-09 finished in 304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0 U X(G(p1))))) U (!p0&&X(!p0))))'
Support contains 2 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 19/19 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 3 transition count 3
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 3 transition count 3
Applied a total of 32 rules in 2 ms. Remains 3 /19 variables (removed 16) and now considering 3/19 (removed 16) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-10 10:56:25] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:56:25] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-10 10:56:25] [INFO ] Invariant cache hit.
[2023-03-10 10:56:25] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-10 10:56:25] [INFO ] Invariant cache hit.
[2023-03-10 10:56:25] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/19 places, 3/19 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 3/19 places, 3/19 transitions.
Stuttering acceptance computed with spot in 224 ms :[p0, (NOT p1), p0, (NOT p1), (NOT p1), true]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s2 1), p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 3 reset in 1 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-10 finished in 306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((!p0 U p1)||X((X(p1)||G(p2))))))))'
Support contains 3 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 19/19 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 4 transition count 4
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 4 transition count 4
Applied a total of 30 rules in 1 ms. Remains 4 /19 variables (removed 15) and now considering 4/19 (removed 15) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-10 10:56:25] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 10:56:25] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-10 10:56:25] [INFO ] Invariant cache hit.
[2023-03-10 10:56:25] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-10 10:56:25] [INFO ] Invariant cache hit.
[2023-03-10 10:56:25] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/19 places, 4/19 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 4/19 places, 4/19 transitions.
Stuttering acceptance computed with spot in 400 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p1), (AND (NOT p2) (NOT p1) p0), (NOT p2)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 5}, { cond=p2, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 9}], [{ cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 10}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=9 dest: 10}], [{ cond=(NOT p2), acceptance={} source=10 dest: 7}, { cond=p2, acceptance={} source=10 dest: 10}]], initial=0, aps=[p1:(GEQ s3 1), p0:(LT s2 1), p2:(GEQ s1 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, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-14 finished in 500 ms.
All properties solved by simple procedures.
Total runtime 7062 ms.
ITS solved all properties within timeout

BK_STOP 1678445787951

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="Eratosthenes-PT-050"
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 Eratosthenes-PT-050, 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 r167-tall-167838852600156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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