Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.........................
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 346K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is ResAllocation-PT-R003C050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-qhx2-152673584000368
=====================================================================

--------------------
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 ResAllocation-PT-R003C050-CTLFireability-00
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-09
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1527971918198


BK_STOP 1527971971872

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using ResAllocation-PT-R003C050 as instance name.
Using ResAllocation as model name.
Using algorithm or tool voting-classifier.
Model characteristics are: {'Examination': 'CTLFireability', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
/usr/local/lib/python3.6/dist-packages/sklearn/preprocessing/label.py:151: DeprecationWarning: The truth value of an empty array is ambiguous. Returning False, but in future this will result in an error. Use `array.size > 0` to check that an array is not empty.
if diff:
Known tools are: [{'Time': 57848, 'Memory': 3212.73, 'Tool': 'marcie'}, {'Time': 62675, 'Memory': 3213.11, 'Tool': 'marcie'}, {'Time': 2001520, 'Memory': 15952.71, 'Tool': 'lola'}, {'Time': 2092886, 'Memory': 15952.33, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 34.59964043700733x far from the best tool marcie.
CTLFireability lola ResAllocation-PT-R003C050...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
ResAllocation-PT-R003C050: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
ResAllocation-PT-R003C050: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ ResAllocation-PT-R003C050 @ 3538 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 500/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 300 places, 200 transitions, 150 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 350 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R003C050-CTLFireability.task
lola: A (F (NOT(NOT(A (G (FIREABLE(t_10_3))))))) : A (F (A (X (FIREABLE(t_37_0))))) : NOT(E (F (E (F (FIREABLE(t_29_0)))))) : E (G ((NOT(E (X (FIREABLE(t_21_0)))) AND ((NOT FIREABLE(t_41_2) AND NOT FIREABLE(t_20_3)) OR FIREABLE(t_28_3))))) : NOT(NOT(E (G (A (F (FIREABLE(t_33_3))))))) : A (G (A (F (((FIREABLE(t_47_1) AND FIREABLE(t_23_3)) OR NOT FIREABLE(t_17_3)))))) : (NOT FIREABLE(t_21_3) OR (E (F (E (F (FIREABLE(t_4_3))))) AND E ((NOT FIREABLE(t_35_2) U (FIREABLE(t_27_3) OR FIREABLE(t_20_0)))))) : (NOT FIREABLE(t_26_2) AND A (F ((A (G (FIREABLE(t_29_2))) OR A (X (FIREABLE(t_20_2))))))) : (NOT(A (F (E (G (FIREABLE(t_6_2)))))) AND A (F (A ((FIREABLE(t_20_0) U FIREABLE(t_41_0)))))) : A (F ((A (X ((FIREABLE(t_1_1) OR FIREABLE(t_36_0)))) OR A (X ((FIREABLE(t_36_3) AND FIREABLE(t_27_3))))))) : E (G ((FIREABLE(t_39_3) OR ((FIREABLE(t_37_1) OR FIREABLE(t_37_3) OR FIREABLE(t_15_3)) OR A (G (FIREABLE(t_48_2))))))) : A (X ((NOT FIREABLE(t_46_2) AND A (F ((FIREABLE(t_43_1) AND FIREABLE(t_1_0))))))) : (A (G ((NOT FIREABLE(t_10_3) OR NOT FIREABLE(t_20_3) OR NOT FIREABLE(t_34_0) OR (FIREABLE(t_37_2) AND FIREABLE(t_23_0))))) OR ((A (F ((FIREABLE(t_49_0) OR FIREABLE(t_25_1)))) AND (FIREABLE(t_23_3) AND (FIREABLE(t_10_1) OR FIREABLE(t_40_3)) AND FIREABLE(t_12_1))) AND (E (F (NOT FIREABLE(t_1_2))) AND NOT(A (G (FIREABLE(t_10_3))))))) : (((E ((FIREABLE(t_16_2) U FIREABLE(t_14_3))) OR (FIREABLE(t_16_2) AND (FIREABLE(t_28_1) OR FIREABLE(t_26_2) OR FIREABLE(t_41_3)))) OR ((FIREABLE(t_21_1) AND FIREABLE(t_35_3)) AND E (G (FIREABLE(t_46_2))))) OR NOT(E (G (E (F (FIREABLE(t_38_3))))))) : NOT(((((NOT FIREABLE(t_12_0) OR NOT FIREABLE(t_44_0)) AND (NOT FIREABLE(t_19_3) OR NOT FIREABLE(t_40_0))) OR E (G (NOT FIREABLE(t_8_1)))) AND FIREABLE(t_6_0))) : NOT(A (X (A (F ((FIREABLE(t_32_3) OR FIREABLE(t_5_3)))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(NOT(A (G (FIREABLE(t_10_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G (FIREABLE(t_10_3)))))
lola: processed formula: A (F (A (G (FIREABLE(t_10_3)))))
lola: processed formula length: 32
lola: 6 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 100 markings, 101 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (FIREABLE(t_37_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX(FIREABLE(t_37_0)))
lola: processed formula length: 30
lola: 2 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (E (F (FIREABLE(t_29_0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT(E (X (FIREABLE(t_21_0)))) AND ((NOT FIREABLE(t_41_2) AND NOT FIREABLE(t_20_3)) OR FIREABLE(t_28_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(AX(NOT FIREABLE(t_21_0))) OR ((FIREABLE(t_41_2) OR FIREABLE(t_20_3)) AND NOT FIREABLE(t_28_3)))))
lola: processed formula length: 116
lola: 7 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(E (G (A (F (FIREABLE(t_33_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U FIREABLE(t_33_3)))))
lola: processed formula length: 46
lola: 12 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4 markings, 8 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((FIREABLE(t_47_1) AND FIREABLE(t_23_3)) OR NOT FIREABLE(t_17_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U ((FIREABLE(t_47_1) AND FIREABLE(t_23_3)) OR NOT FIREABLE(t_17_3))))))
lola: processed formula length: 96
lola: 2 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 4 markings, 5 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(t_21_3) OR (E (F (E (F (FIREABLE(t_4_3))))) AND E ((NOT FIREABLE(t_35_2) U (FIREABLE(t_27_3) OR FIREABLE(t_20_0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t_21_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t_21_3)
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t_4_3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((NOT FIREABLE(t_35_2) U (FIREABLE(t_27_3) OR FIREABLE(t_20_0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT FIREABLE(t_35_2) U (FIREABLE(t_27_3) OR FIREABLE(t_20_0)))
lola: processed formula length: 65
lola: 2 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(t_26_2) AND A (F ((A (G (FIREABLE(t_29_2))) OR A (X (FIREABLE(t_20_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t_26_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t_26_2)
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G (FIREABLE(t_29_2))) OR A (X (FIREABLE(t_20_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(E(TRUE U NOT FIREABLE(t_29_2))) OR AX(FIREABLE(t_20_2))))
lola: processed formula length: 71
lola: 4 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 4 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (F (E (G (FIREABLE(t_6_2)))))) AND A (F (A ((FIREABLE(t_20_0) U FIREABLE(t_41_0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (NOT FIREABLE(t_6_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U NOT FIREABLE(t_6_2)))))
lola: processed formula length: 49
lola: 7 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4 markings, 8 edges
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A ((FIREABLE(t_20_0) U FIREABLE(t_41_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U A(FIREABLE(t_20_0) U FIREABLE(t_41_0)))
lola: processed formula length: 48
lola: 7 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 4 markings, 12 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X ((FIREABLE(t_1_1) OR FIREABLE(t_36_0)))) OR A (X ((FIREABLE(t_36_3) AND FIREABLE(t_27_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (AX((FIREABLE(t_1_1) OR FIREABLE(t_36_0))) OR AX((FIREABLE(t_36_3) AND FIREABLE(t_27_3)))))
lola: processed formula length: 101
lola: 3 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(t_39_3) OR ((FIREABLE(t_37_1) OR FIREABLE(t_37_3) OR FIREABLE(t_15_3)) OR A (G (FIREABLE(t_48_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT FIREABLE(t_39_3) AND ((NOT FIREABLE(t_37_1) AND NOT FIREABLE(t_37_3) AND NOT FIREABLE(t_15_3)) AND E(TRUE U NOT FIREABLE(t_48_2))))))
lola: processed formula length: 151
lola: 8 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((NOT FIREABLE(t_46_2) AND A (F ((FIREABLE(t_43_1) AND FIREABLE(t_1_0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT FIREABLE(t_46_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (NOT FIREABLE(t_46_2)))
lola: processed formula: A (X (NOT FIREABLE(t_46_2)))
lola: processed formula length: 28
lola: 1 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-CTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
----- Kill lola and sara stderr -----
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 51 markings, 50 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((FIREABLE(t_43_1) AND FIREABLE(t_1_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (FIREABLE(t_43_1) AND FIREABLE(t_1_0))))
lola: processed formula length: 52
lola: 3 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((NOT FIREABLE(t_10_3) OR NOT FIREABLE(t_20_3) OR NOT FIREABLE(t_34_0) OR (FIREABLE(t_37_2) AND FIREABLE(t_23_0))))) OR ((A (F ((FIREABLE(t_49_0) OR FIREABLE(t_25_1)))) AND (FIREABLE(t_23_3) AND (FIREABLE(t_10_1) OR FIREABLE(t_40_3)) AND FIREABLE(t_12_1))) AND (E (F (NOT FIREABLE(t_1_2))) AND NOT(A (G (FIREABLE(t_10_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t_10_3) OR NOT FIREABLE(t_20_3) OR NOT FIREABLE(t_34_0) OR (FIREABLE(t_37_2) AND FIREABLE(t_23_0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t_49_0) OR FIREABLE(t_25_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((FIREABLE(t_49_0) OR FIREABLE(t_25_1))))
lola: processed formula: A (F ((FIREABLE(t_49_0) OR FIREABLE(t_25_1))))
lola: processed formula length: 47
lola: 4 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 9 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E ((FIREABLE(t_16_2) U FIREABLE(t_14_3))) OR (FIREABLE(t_16_2) AND (FIREABLE(t_28_1) OR FIREABLE(t_26_2) OR FIREABLE(t_41_3)))) OR ((FIREABLE(t_21_1) AND FIREABLE(t_35_3)) AND E (G (FIREABLE(t_46_2))))) OR NOT(E (G (E (F (FIREABLE(t_38_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(t_16_2) U FIREABLE(t_14_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(FIREABLE(t_16_2) U FIREABLE(t_14_3))
lola: processed formula length: 38
lola: 9 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t_16_2) AND (FIREABLE(t_28_1) OR FIREABLE(t_26_2) OR FIREABLE(t_41_3)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t_16_2) AND (FIREABLE(t_28_1) OR FIREABLE(t_26_2) OR FIREABLE(t_41_3)))
lola: processed formula length: 83
lola: 8 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3538 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t_21_1) AND FIREABLE(t_35_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t_21_1) AND FIREABLE(t_35_3))
lola: processed formula length: 39
lola: 8 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '\ufffd'
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((((NOT FIREABLE(t_12_0) OR NOT FIREABLE(t_44_0)) AND (NOT FIREABLE(t_19_3) OR NOT FIREABLE(t_40_0))) OR E (G (NOT FIREABLE(t_8_1)))) AND FIREABLE(t_6_0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(t_12_0) AND FIREABLE(t_44_0)) OR (FIREABLE(t_19_3) AND FIREABLE(t_40_0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((FIREABLE(t_12_0) AND FIREABLE(t_44_0)) OR (FIREABLE(t_19_3) AND FIREABLE(t_40_0)))
lola: processed formula length: 85
lola: 7 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3538 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t_8_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(t_8_1)))
lola: processed formula: A (F (FIREABLE(t_8_1)))
lola: processed formula length: 23
lola: 7 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 9 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 9 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '\ufffd'
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3538 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (X (A (F ((FIREABLE(t_32_3) OR FIREABLE(t_5_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U (FIREABLE(t_32_3) OR FIREABLE(t_5_3)))))
lola: processed formula length: 57
lola: 8 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 13 markings, 13 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes yes no yes no no no yes no no unknown unknown yes
FORMULA ResAllocation-PT-R003C050-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

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="ResAllocation-PT-R003C050"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C050.tgz
mv ResAllocation-PT-R003C050 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is ResAllocation-PT-R003C050, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-qhx2-152673584000368"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;