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 196K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 23K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is FlexibleBarrier-PT-04a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998100105
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526631749564

info: Time: 3600 - MCC
===========================================================================================
prep: translating FlexibleBarrier-PT-04a Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating FlexibleBarrier-PT-04a formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ FlexibleBarrier-PT-04a @ 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: 139/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 51
lola: finding significant places
lola: 51 places, 88 transitions, 45 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 88 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-04a-ReachabilityFireability.task
lola: E (F ((FIREABLE(t11) AND FIREABLE(t30) AND FIREABLE(t54)))) : A (G ((NOT FIREABLE(t71) OR NOT FIREABLE(t33) OR (FIREABLE(t7) AND FIREABLE(t3)) OR NOT FIREABLE(t26) OR ((FIREABLE(t26) OR NOT FIREABLE(t81)) AND (FIREABLE(t58) OR FIREABLE(t12) OR NOT FIREABLE(t83)))))) : A (G ((NOT FIREABLE(t38) OR NOT FIREABLE(t23) OR NOT FIREABLE(t22)))) : E (F (((FIREABLE(t9) OR FIREABLE(t35)) AND (FIREABLE(t17) OR FIREABLE(t87)) AND FIREABLE(t69) AND (NOT FIREABLE(t33) OR NOT FIREABLE(t76) OR (FIREABLE(t61) AND NOT FIREABLE(t31)))))) : E (F ((FIREABLE(t75) AND (FIREABLE(t49) OR FIREABLE(t83)) AND FIREABLE(t37)))) : E (F ((FIREABLE(t86) AND ((FIREABLE(t82) AND FIREABLE(t20)) OR FIREABLE(t71) OR (FIREABLE(t40) AND FIREABLE(t82) AND (FIREABLE(t74) OR FIREABLE(t32))))))) : E (F ((NOT FIREABLE(t26) AND (FIREABLE(t60) OR FIREABLE(t51)) AND FIREABLE(t57) AND FIREABLE(t28)))) : E (F ((FIREABLE(t54) AND NOT FIREABLE(t47) AND FIREABLE(t64) AND FIREABLE(t58)))) : E (F ((NOT FIREABLE(t42) AND NOT FIREABLE(t3) AND FIREABLE(t52) AND FIREABLE(t29)))) : E (F ((FIREABLE(t6) AND FIREABLE(t2) AND NOT FIREABLE(t30)))) : A (G ((NOT FIREABLE(t36) OR (FIREABLE(t19) AND FIREABLE(t85)) OR NOT FIREABLE(t27) OR (FIREABLE(t51) AND FIREABLE(t12)) OR (FIREABLE(t14) AND FIREABLE(t60) AND FIREABLE(t68))))) : E (F ((FIREABLE(t3) AND FIREABLE(t36) AND (FIREABLE(t53) OR (FIREABLE(t83) AND FIREABLE(t45)) OR FIREABLE(t26))))) : E (F ((FIREABLE(t71) AND FIREABLE(t3) AND (FIREABLE(t48) OR FIREABLE(t77)) AND (NOT FIREABLE(t55) OR NOT FIREABLE(t76)) AND (FIREABLE(t72) OR FIREABLE(t82) OR (FIREABLE(t10) AND FIREABLE(t67)) OR (NOT FIREABLE(t39) AND (FIREABLE(t69) OR FIREABLE(t26))))))) : E (F (((FIREABLE(t13) OR FIREABLE(t4)) AND (FIREABLE(t41) OR FIREABLE(t50)) AND FIREABLE(t1) AND NOT FIREABLE(t40)))) : E (F ((NOT FIREABLE(t33) AND FIREABLE(t71) AND FIREABLE(t54) AND FIREABLE(t30) AND FIREABLE(t60) AND FIREABLE(t1) AND (FIREABLE(t81) OR FIREABLE(t77) OR (FIREABLE(t56) AND FIREABLE(t79)))))) : A (G ((NOT FIREABLE(t16) OR FIREABLE(t59) OR ((NOT FIREABLE(t76) OR NOT FIREABLE(t12)) AND (NOT FIREABLE(t74) OR NOT FIREABLE(t31))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t11) AND FIREABLE(t30) AND FIREABLE(t54))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t11) AND FIREABLE(t30) AND FIREABLE(t54))))
lola: processed formula length: 59
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-04a-ReachabilityFireability.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:625
lola: formula 0: (FIREABLE(t11) AND FIREABLE(t30) AND FIREABLE(t54))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-04a-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-04a-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t38) OR NOT FIREABLE(t23) OR NOT FIREABLE(t22))))
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 ((NOT FIREABLE(t38) OR NOT FIREABLE(t23) OR NOT FIREABLE(t22))))
lola: processed formula length: 71
lola: 2 rewrites
lola: closed formula file FlexibleBarrier-PT-04a-ReachabilityFireability.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: (FIREABLE(t38) AND FIREABLE(t23) AND FIREABLE(t22))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-04a-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-04a-ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA FlexibleBarrier-PT-04a-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t6) AND FIREABLE(t2) AND NOT FIREABLE(t30))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t6) AND FIREABLE(t2) AND NOT FIREABLE(t30))))
lola: processed formula length: 61
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-04a-ReachabilityFireability.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:625
lola: formula 0: (FIREABLE(t6) AND FIREABLE(t2) AND NOT FIREABLE(t30))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-04a-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-04a-ReachabilityFireability-2-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA FlexibleBarrier-PT-04a-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t54) AND NOT FIREABLE(t47) AND FIREABLE(t64) AND FIREABLE(t58))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t54) AND NOT FIREABLE(t47) AND FIREABLE(t64) AND FIREABLE(t58))))
lola: processed formula length: 81
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-04a-ReachabilityFireability.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:625
lola: formula 0: (FIREABLE(t54) AND NOT FIREABLE(t47) AND FIREABLE(t64) AND FIREABLE(t58))
lola: state equation: Generated DNF with 16 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-04a-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-04a-ReachabilityFireability-3-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA FlexibleBarrier-PT-04a-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t42) AND NOT FIREABLE(t3) AND FIREABLE(t52) AND FIREABLE(t29))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(t42) AND NOT FIREABLE(t3) AND FIREABLE(t52) AND FIREABLE(t29))))
lola: processed formula length: 84
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-04a-ReachabilityFireability.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:625
lola: formula 0: (NOT FIREABLE(t42) AND NOT FIREABLE(t3) AND FIREABLE(t52) AND FIREABLE(t29))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-04a-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-04a-ReachabilityFireability-4-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA FlexibleBarrier-PT-04a-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t75) AND (FIREABLE(t49) OR FIREABLE(t83)) AND FIREABLE(t37))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t75) AND (FIREABLE(t49) OR FIREABLE(t83)) AND FIREABLE(t37))))
lola: processed formula length: 79
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-04a-ReachabilityFireability.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:625
lola: formula 0: (FIREABLE(t75) AND (FIREABLE(t49) OR FIREABLE(t83)) AND FIREABLE(t37))
lola: state equation: Generated DNF with 13 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-04a-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-04a-ReachabilityFireability-5-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA FlexibleBarrier-PT-04a-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t26) AND (FIREABLE(t60) OR FIREABLE(t51)) AND FIREABLE(t57) AND FIREABLE(t28))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(t26) AND (FIREABLE(t60) OR FIREABLE(t51)) AND FIREABLE(t57) AND FIREABLE(t28))))
lola: processed formula length: 101
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-04a-ReachabilityFireability.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:625
lola: formula 0: (NOT FIREABLE(t26) AND (FIREABLE(t60) OR FIREABLE(t51)) AND FIREABLE(t57) AND FIREABLE(t28))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA FlexibleBarrier-PT-04a-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t3) AND FIREABLE(t36) AND (FIREABLE(t53) OR (FIREABLE(t83) AND FIREABLE(t45)) OR FIREABLE(t26)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t3) AND FIREABLE(t36) AND (FIREABLE(t53) OR (FIREABLE(t83) AND FIREABLE(t45)) OR FIREABLE(t26)))))
lola: processed formula length: 116
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-04a-ReachabilityFireability.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:625
lola: formula 0: (FIREABLE(t3) AND FIREABLE(t36) AND (FIREABLE(t53) OR (FIREABLE(t83) AND FIREABLE(t45)) OR FIREABLE(t26)))
lola: state equation: Generated DNF with 15 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-04a-ReachabilityFireability-7-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 52 markings, 53 edges

FORMULA FlexibleBarrier-PT-04a-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t13) OR FIREABLE(t4)) AND (FIREABLE(t41) OR FIREABLE(t50)) AND FIREABLE(t1) AND NOT FIREABLE(t40))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FIREABLE(t13) OR FIREABLE(t4)) AND (FIREABLE(t41) OR FIREABLE(t50)) AND FIREABLE(t1) AND NOT FIREABLE(t40))))
lola: processed formula length: 119
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-04a-ReachabilityFireability.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:625
lola: formula 0: ((FIREABLE(t13) OR FIREABLE(t4)) AND (FIREABLE(t41) OR FIREABLE(t50)) AND FIREABLE(t1) AND NOT FIREABLE(t40))
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-04a-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-04a-ReachabilityFireability-8-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA FlexibleBarrier-PT-04a-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t16) OR FIREABLE(t59) OR ((NOT FIREABLE(t76) OR NOT FIREABLE(t12)) AND (NOT FIREABLE(t74) OR NOT FIREABLE(t31))))))
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 ((NOT FIREABLE(t16) OR FIREABLE(t59) OR ((NOT FIREABLE(t76) OR NOT FIREABLE(t12)) AND (NOT FIREABLE(t74) OR NOT FIREABLE(t31))))))
lola: processed formula length: 139
lola: 2 rewrites
lola: closed formula file FlexibleBarrier-PT-04a-ReachabilityFireability.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: (FIREABLE(t16) AND NOT FIREABLE(t59) AND ((FIREABLE(t76) AND FIREABLE(t12)) OR (FIREABLE(t74) AND FIREABLE(t31))))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-04a-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-04a-ReachabilityFireability-9-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA FlexibleBarrier-PT-04a-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t86) AND ((FIREABLE(t82) AND FIREABLE(t20)) OR FIREABLE(t71) OR (FIREABLE(t40) AND FIREABLE(t82) AND (FIREABLE(t74) OR FIREABLE(t32)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t86) AND ((FIREABLE(t82) AND FIREABLE(t20)) OR FIREABLE(t71) OR (FIREABLE(t40) AND FIREABLE(t82) AND (FIREABLE(t74) OR FIREABLE(t32)))))))
lola: processed formula length: 157
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-04a-ReachabilityFireability.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:625
lola: formula 0: (FIREABLE(t86) AND ((FIREABLE(t82) AND FIREABLE(t20)) OR FIREABLE(t71) OR (FIREABLE(t40) AND FIREABLE(t82) AND (FIREABLE(t74) OR FIREABLE(t32)))))
lola: state equation: Generated DNF with 19 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-04a-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-04a-ReachabilityFireability-10-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA FlexibleBarrier-PT-04a-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t71) OR NOT FIREABLE(t33) OR (FIREABLE(t7) AND FIREABLE(t3)) OR NOT FIREABLE(t26) OR ((FIREABLE(t26) OR NOT FIREABLE(t81)) AND (FIREABLE(t58) OR FIREABLE(t12) OR NOT FIREABLE(t83))))))
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 ((NOT FIREABLE(t71) OR NOT FIREABLE(t33) OR (FIREABLE(t7) AND FIREABLE(t3)) OR NOT FIREABLE(t26) OR ((FIREABLE(t26) OR NOT FIREABLE(t81)) AND (FIREABLE(t58) OR FIREABLE(t12) OR NOT FIREABLE(t83))))))
lola: processed formula length: 211
lola: 2 rewrites
lola: closed formula file FlexibleBarrier-PT-04a-ReachabilityFireability.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: (FIREABLE(t71) AND FIREABLE(t33) AND (NOT FIREABLE(t7) OR NOT FIREABLE(t3)) AND FIREABLE(t26) AND ((NOT FIREABLE(t26) AND FIREABLE(t81)) OR (NOT FIREABLE(t58) AND NOT FIREABLE(t12) AND FIREABLE(t83))))
lola: state equation: Generated DNF with 18 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-04a-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-04a-ReachabilityFireability-11-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA FlexibleBarrier-PT-04a-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t9) OR FIREABLE(t35)) AND (FIREABLE(t17) OR FIREABLE(t87)) AND FIREABLE(t69) AND (NOT FIREABLE(t33) OR NOT FIREABLE(t76) OR (FIREABLE(t61) AND NOT FIREABLE(t31))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FIREABLE(t9) OR FIREABLE(t35)) AND (FIREABLE(t17) OR FIREABLE(t87)) AND FIREABLE(t69) AND (NOT FIREABLE(t33) OR NOT FIREABLE(t76) OR (FIREABLE(t61) AND NOT FIREABLE(t31))))))
lola: processed formula length: 186
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-04a-ReachabilityFireability.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:625
lola: formula 0: ((FIREABLE(t9) OR FIREABLE(t35)) AND (FIREABLE(t17) OR FIREABLE(t87)) AND FIREABLE(t69) AND (NOT FIREABLE(t33) OR NOT FIREABLE(t76) OR (FIREABLE(t61) AND NOT FIREABLE(t31))))
lola: state equation: Generated DNF with 99 literals and 14 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-04a-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-04a-ReachabilityFireability-12-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA FlexibleBarrier-PT-04a-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t36) OR (FIREABLE(t19) AND FIREABLE(t85)) OR NOT FIREABLE(t27) OR (FIREABLE(t51) AND FIREABLE(t12)) OR (FIREABLE(t14) AND FIREABLE(t60) AND FIREABLE(t68)))))
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 ((NOT FIREABLE(t36) OR (FIREABLE(t19) AND FIREABLE(t85)) OR NOT FIREABLE(t27) OR (FIREABLE(t51) AND FIREABLE(t12)) OR (FIREABLE(t14) AND FIREABLE(t60) AND FIREABLE(t68)))))
lola: processed formula length: 181
lola: 2 rewrites
lola: closed formula file FlexibleBarrier-PT-04a-ReachabilityFireability.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: (FIREABLE(t36) AND (NOT FIREABLE(t19) OR NOT FIREABLE(t85)) AND FIREABLE(t27) AND (NOT FIREABLE(t51) OR NOT FIREABLE(t12)) AND (NOT FIREABLE(t14) OR NOT FIREABLE(t60) OR NOT FIREABLE(t68)))
lola: state equation: Generated DNF with 144 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-04a-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-04a-ReachabilityFireability-13-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA FlexibleBarrier-PT-04a-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t33) AND FIREABLE(t71) AND FIREABLE(t54) AND FIREABLE(t30) AND FIREABLE(t60) AND FIREABLE(t1) AND (FIREABLE(t81) OR FIREABLE(t77) OR (FIREABLE(t56) AND FIREABLE(t79))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(t33) AND FIREABLE(t71) AND FIREABLE(t54) AND FIREABLE(t30) AND FIREABLE(t60) AND FIREABLE(t1) AND (FIREABLE(t81) OR FIREABLE(t77) OR (FIREABLE(t56) AND FIREABLE(t79))))))
lola: processed formula length: 192
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-04a-ReachabilityFireability.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:625
lola: formula 0: (NOT FIREABLE(t33) AND FIREABLE(t71) AND FIREABLE(t54) AND FIREABLE(t30) AND FIREABLE(t60) AND FIREABLE(t1) AND (FIREABLE(t81) OR FIREABLE(t77) OR (FIREABLE(t56) AND FIREABLE(t79))))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA FlexibleBarrier-PT-04a-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t71) AND FIREABLE(t3) AND (FIREABLE(t48) OR FIREABLE(t77)) AND (NOT FIREABLE(t55) OR NOT FIREABLE(t76)) AND (FIREABLE(t72) OR FIREABLE(t82) OR (FIREABLE(t10) AND FIREABLE(t67)) OR (NOT FIREABLE(t39) AND (FIREABLE(t69) OR FIREABLE(t26)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t71) AND FIREABLE(t3) AND (FIREABLE(t48) OR FIREABLE(t77)) AND (NOT FIREABLE(t55) OR NOT FIREABLE(t76)) AND (FIREABLE(t72) OR FIREABLE(t82) OR (FIREABLE(t10) AND FIREABLE(t67)) OR (NOT FIREABLE(t39) AND (FIREABLE(t69) OR FIREABLE(t26)))))))
lola: processed formula length: 262
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-04a-ReachabilityFireability.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:625
lola: formula 0: (FIREABLE(t71) AND FIREABLE(t3) AND (FIREABLE(t48) OR FIREABLE(t77)) AND (NOT FIREABLE(t55) OR NOT FIREABLE(t76)) AND (FIREABLE(t72) OR FIREABLE(t82) OR (FIREABLE(t10) AND FIREABLE(t67)) OR (NOT FIREABLE(t39) AND (FIREABLE(t69) OR FIREABLE(t26)))))
lola: state equation: Generated DNF with 213 literals and 21 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-04a-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-04a-ReachabilityFireability-15-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.

FORMULA FlexibleBarrier-PT-04a-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no no no no no no no yes yes no no no yes
lola:
preliminary result: yes yes yes no no no no no no no yes yes no no no yes
lola: memory consumption: 14660 KB
lola: time consumption: 1 seconds

BK_STOP 1526631750129

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