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 2.4M
-rw-r--r-- 1 mcc users 7.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 62K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 209K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 38K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 60K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 193K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.5K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 1.7M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SafeBus-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-smll-152685547200241
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527030306719

info: Time: 3600 - MCC
===========================================================================================
prep: translating SafeBus-PT-10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SafeBus-PT-10 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ SafeBus-PT-10 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1947/65536 symbol table entries, 197 collisions
lola: preprocessing...
lola: Size of bit vector: 10112
lola: finding significant places
lola: 316 places, 1631 transitions, 261 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 983 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-PT-10-CTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (ACK <= Cpt2_10 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9)
lola: after: (ACK <= 1)
lola: LP says that atomic proposition is always true: (ACK <= 1)
lola: LP says that atomic proposition is always false: (3 <= cable_free)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= Cpt2_10 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9)
lola: after: (2 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (3 <= R_tout)
lola: place invariant simplifies atomic proposition
lola: before: (Cpt2_10 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9 <= RMC_10 + RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9)
lola: after: (1 <= RMC_10 + RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9)
lola: LP says that atomic proposition is always false: (2 <= FMCb)
lola: LP says that atomic proposition is always false: (2 <= FMCb)
lola: place invariant simplifies atomic proposition
lola: before: (Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10 <= wait_cable_10 + wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6 + wait_cable_7 + wait_cable_8 + wait_cable_9)
lola: after: (1 <= wait_cable_10 + wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6 + wait_cable_7 + wait_cable_8 + wait_cable_9)
lola: LP says that atomic proposition is always false: (2 <= MSG_10)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= msgl_6)
lola: after: (1 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (2 <= wait_cable_2)
lola: LP says that atomic proposition is always false: (2 <= loop_em_10)
lola: always true
lola: LP says that atomic proposition is always false: (2 <= AMC_6_10)
lola: LP says that atomic proposition is always false: (2 <= wait_ack_2_3)
lola: LP says that atomic proposition is always false: (2 <= Cpt1_9)
lola: LP says that atomic proposition is always false: (3 <= AMC_6_5)
lola: LP says that atomic proposition is always true: (AMC_2_10 <= wait_cable_2)
lola: LP says that atomic proposition is always false: (2 <= FMCb)
lola: LP says that atomic proposition is always false: (2 <= wait_ack_6_10)
lola: E (X (A (G (TRUE)))) : NOT(E (G (A (F (FALSE))))) : NOT((() OR NOT(E (G ((RMC_10 + RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9 <= wait_msg_10 + wait_msg_1 + wait_msg_2 + wait_msg_3 + wait_msg_4 + wait_msg_5 + wait_msg_6 + wait_msg_7 + wait_msg_8 + wait_msg_9)))))) : (A (G ((loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 + loop_em_10 <= RMC_10 + RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9))) OR (R_tout + 1 <= AMC_8_10 + AMC_2_10 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6 + AMC_1_7 + AMC_1_8 + AMC_1_9 + AMC_7_10 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_2_7 + AMC_2_8 + AMC_2_9 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_3_7 + AMC_3_8 + AMC_3_9 + AMC_1_10 + AMC_10_10 + AMC_4_1 + AMC_4_2 + AMC_4_3 + AMC_4_4 + AMC_4_5 + AMC_4_6 + AMC_4_7 + AMC_4_8 + AMC_4_9 + AMC_6_10 + AMC_5_1 + AMC_5_2 + AMC_5_3 + AMC_5_4 + AMC_5_5 + AMC_5_6 + AMC_5_7 + AMC_5_8 + AMC_5_9 + AMC_6_1 + AMC_6_2 + AMC_6_3 + AMC_6_4 + AMC_6_5 + AMC_6_6 + AMC_6_7 + AMC_6_8 + AMC_6_9 + AMC_10_1 + AMC_10_2 + AMC_10_3 + AMC_10_4 + AMC_10_5 + AMC_10_6 + AMC_10_7 + AMC_10_8 + AMC_7_1 + AMC_7_2 + AMC_7_3 + AMC_7_4 + AMC_7_5 + AMC_7_6 + AMC_7_7 + AMC_7_8 + AMC_7_9 + AMC_5_10 + AMC_8_1 + AMC_8_2 + AMC_8_3 + AMC_8_4 + AMC_8_5 + AMC_8_6 + AMC_8_7 + AMC_8_8 + AMC_8_9 + AMC_9_8 + AMC_9_7 + AMC_9_6 + AMC_9_5 + AMC_9_4 + AMC_9_1 + AMC_9_2 + AMC_9_3 + AMC_9_9 + AMC_4_10 + AMC_10_9 + AMC_9_10 + AMC_3_10)) : A (F (E (G (((1 <= RMC_10 + RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9) AND (1 <= FMCb)))))) : (TRUE AND A (F (A (F ((1 <= S_tout)))))) : A ((E (F (FALSE)) U (1 <= FMC_10 + FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9))) : A ((A (F ((2 <= wait_cable_10 + wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6 + wait_cable_7 + wait_cable_8 + wait_cable_9))) U (1 <= wait_cable_10 + wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6 + wait_cable_7 + wait_cable_8 + wait_cable_9))) : (E (X (E (F (FALSE)))) AND A (((loop_em_8 <= AMC_3_3) U (Cpt1_9 <= AMC_7_4)))) : A ((((AMC_7_4 + 1 <= wait_ack_1_7) OR (wait_ack_1_10 <= 0)) U E (X ((1 <= AMC_4_6))))) : (E (X (E (G ((cable_used_9 <= wait_msg_8))))) OR (((wait_cable_7 <= AMC_7_7) AND (1 <= Cpt1_2) AND ((wait_ack_9_6 <= PMC_3) OR (1 <= wait_ack_8_10)) AND (RMC_3 <= AMC_9_10)) OR E (G (TRUE)))) : A (F ((((wait_ack_5_7 + 1 <= AMC_8_4))))) : A ((() U FALSE)) : (E (G (())) OR (E (G (((AMC_4_4 <= wait_ack_10_1) OR (1 <= wait_cable_3)))) AND E (G ((Cpt1_9 <= loop_em_1))))) : (A (G (A (G (TRUE)))) OR E (((wait_cable_9 + 1 <= wait_ack_4_5) U FALSE))) : A (G ((E (X ((AMC_7_4 <= AMC_7_1))) OR ())))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 55 rewrites
lola: closed formula file SafeBus-PT-10-CTLCardinality.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: ========================================

FORMULA SafeBus-PT-10-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 55 rewrites
lola: closed formula file SafeBus-PT-10-CTLCardinality.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: ========================================

FORMULA SafeBus-PT-10-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= FMC_10 + FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= FMC_10 + FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9)
lola: processed formula length: 85
lola: 55 rewrites
lola: closed formula file SafeBus-PT-10-CTLCardinality.task
lola: processed formula with 1 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:
FORMULA SafeBus-PT-10-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 55 rewrites
lola: closed formula file SafeBus-PT-10-CTLCardinality.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: ========================================

FORMULA SafeBus-PT-10-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 55 rewrites
lola: closed formula file SafeBus-PT-10-CTLCardinality.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: ========================================

FORMULA SafeBus-PT-10-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 55 rewrites
lola: closed formula file SafeBus-PT-10-CTLCardinality.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: ========================================

FORMULA SafeBus-PT-10-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 55 rewrites
lola: closed formula file SafeBus-PT-10-CTLCardinality.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: ========================================

FORMULA SafeBus-PT-10-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 55 rewrites
lola: closed formula file SafeBus-PT-10-CTLCardinality.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: ========================================

FORMULA SafeBus-PT-10-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((AMC_7_4 + 1 <= wait_ack_1_7) OR (wait_ack_1_10 <= 0)) U E (X ((1 <= AMC_4_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: A(((AMC_7_4 + 1 <= wait_ack_1_7) OR (wait_ack_1_10 <= 0)) U EX((1 <= AMC_4_6)))
lola: processed formula length: 80
lola: 57 rewrites
lola: closed formula file SafeBus-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 137 markings, 137 edges
lola: ========================================

FORMULA SafeBus-PT-10-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 502 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((AMC_7_4 <= AMC_7_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX((AMC_7_4 <= AMC_7_1)))))
lola: processed formula length: 44
lola: 57 rewrites
lola: closed formula file SafeBus-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 2321 markings, 3348 edges
lola: ========================================

FORMULA SafeBus-PT-10-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 586 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= S_tout)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (S_tout <= 0)
lola: processed formula length: 13
lola: 57 rewrites
lola: closed formula file SafeBus-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 120 markings, 120 edges
lola: ========================================

FORMULA SafeBus-PT-10-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 703 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((wait_ack_5_7 + 1 <= AMC_8_4)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (((AMC_8_4 <= wait_ack_5_7)))
lola: processed formula length: 29
lola: 57 rewrites
lola: closed formula file SafeBus-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 153 markings, 153 edges
lola: ========================================

FORMULA SafeBus-PT-10-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 879 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((RMC_10 + RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9 <= wait_msg_10 + wait_msg_1 + wait_msg_2 + wait_msg_3 + wait_msg_4 + wait_msg_5 + wait_msg_6 + wait_msg_7 + wait_msg_8 + wait_msg_9)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((RMC_10 + RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9 <= wait_msg_10 + wait_msg_1 + wait_msg_2 + wait_msg_3 + wait_msg_4 + wait_msg_5 + wait_msg_6 + wait_msg_7 + wait_msg_8 + wait_msg_9)))
lola: processed formula length: 220
lola: 55 rewrites
lola: closed formula file SafeBus-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 1145 markings, 1430 edges
lola: ========================================

FORMULA SafeBus-PT-10-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1172 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((2 <= wait_cable_10 + wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6 + wait_cable_7 + wait_cable_8 + wait_cable_9))) U (1 <= wait_cable_10 + wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6 + wait_cable_7 + wait_cable_8 + wait_cable_9)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: A(A(TRUE U (2 <= wait_cable_10 + wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6 + wait_cable_7 + wait_cable_8 + wait_cable_9)) U (1 <= wait_cable_10 + wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6 + wait_cable_7 + wait_cable_8 + wait_cable_9))
lola: processed formula length: 326
lola: 57 rewrites
lola: closed formula file SafeBus-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 398 markings, 399 edges
lola: ========================================

FORMULA SafeBus-PT-10-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1759 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((1 <= RMC_10 + RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9) AND (1 <= FMCb))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U NOT(A(TRUE U ((RMC_10 + RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9 <= 0) OR (FMCb <= 0)))))
lola: processed formula length: 128
lola: 58 rewrites
lola: closed formula file SafeBus-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 288496 markings, 1002201 edges, 57699 markings/sec, 0 secs
lola: 544470 markings, 2091776 edges, 51195 markings/sec, 5 secs
lola: 814161 markings, 3129219 edges, 53938 markings/sec, 10 secs
lola: 1076157 markings, 4161700 edges, 52399 markings/sec, 15 secs
lola: 1322410 markings, 5342230 edges, 49251 markings/sec, 20 secs
lola: 1619650 markings, 6282530 edges, 59448 markings/sec, 25 secs
lola: 1874100 markings, 7376064 edges, 50890 markings/sec, 30 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1901509 markings, 7548500 edges
lola: ========================================

FORMULA SafeBus-PT-10-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3482 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 + loop_em_10 <= RMC_10 + RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9))) OR (R_tout + 1 <= AMC_8_10 + AMC_2_10 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6 + AMC_1_7 + AMC_1_8 + AMC_1_9 + AMC_7_10 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3482 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 + loop_em_10 <= RMC_10 + RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 + loop_em_10 <= RMC_10 + RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9)))
lola: processed formula length: 210
lola: 57 rewrites
lola: closed formula file SafeBus-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (RMC_10 + RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9 + 1 <= loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 + loop_em_10)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-PT-10-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30 markings, 29 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G ((loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 + loop_em_10 <= RMC_10 + RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9))) OR (R_tout + 1 <= AMC_8_10 + AMC_2_10 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6 + AMC_1_7 + AMC_1_8 + AMC_1_9 + AMC_7_10 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G ((loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 + loop_em_10 <= RMC_10 + RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 + loop_em_10 <= RMC_10 + RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9)))
lola: processed formula length: 210
lola: 57 rewrites
lola: closed formula file SafeBus-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (RMC_10 + RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9 + 1 <= loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 + loop_em_10)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-PT-10-CTLCardinality-16-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30 markings, 29 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (R_tout + 1 <= AMC_8_10 + AMC_2_10 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6 + AMC_1_7 + AMC_1_8 + AMC_1_9 + AMC_7_10 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_2_7 + AMC_2_8 + AMC_2_9 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_3_7 + AMC_3_8 + AMC_3_9 + AMC_1_10 + AMC_10_10 + AMC_4_1 + AMC_4_2 + AMC_4_3 + AMC_4_4 + AMC_4_5 + AMC_4_6 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (R_tout + 1 <= AMC_8_10 + AMC_2_10 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6 + AMC_1_7 + AMC_1_8 + AMC_1_9 + AMC_7_10 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_2_7 + AMC_2_8 + AMC_2_9 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_3_7 + AMC_3_8 + AMC_3_9 + AMC_1_10 + AMC_10_10 + AMC_4_1 + AMC_4_2 + AMC_4_3 + AMC_4_4 + AMC_4_5 + AMC_4_6 +... (shortened)
lola: processed formula length: 1033
lola: 55 rewrites
lola: closed formula file SafeBus-PT-10-CTLCardinality.task
lola: processed formula with 1 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA SafeBus-PT-10-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes no no no no no no no yes no no yes yes no
lola:
preliminary result: yes yes yes no no no no no no no yes no no yes yes no
lola: memory consumption: 31588 KB
lola: time consumption: 88 seconds

BK_STOP 1527030395694

--------------------
content from 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="SafeBus-PT-10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
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/SafeBus-PT-10.tgz
mv SafeBus-PT-10 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 lola"
echo " Input is SafeBus-PT-10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r148-smll-152685547200241"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;