fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r112-csrt-152666469100158
Last Updated
June 26, 2018

About the Execution of LoLA for MAPK-PT-008

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1509.310 514631.00 534438.00 79.80 FTTFFFFTFTFFTFTF normal

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 192K
-rw-r--r-- 1 mcc users 3.5K 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.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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 5.9K 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.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 102 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 340 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 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 25K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is MAPK-PT-008, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469100158
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527019635540

info: Time: 3600 - MCC
===========================================================================================
prep: translating MAPK-PT-008 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating MAPK-PT-008 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ MAPK-PT-008 @ 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: 52/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 30 transitions, 15 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from MAPK-PT-008-CTLFireability.task
lola: A (G ((NOT FIREABLE(k10) OR NOT FIREABLE(k6) OR NOT FIREABLE(k20) OR NOT FIREABLE(k8)))) : E (((NOT FIREABLE(k16) OR NOT FIREABLE(k29) OR NOT FIREABLE(k21)) U A (X ((FIREABLE(k24) AND FIREABLE(k7)))))) : A (G (E (X ((FIREABLE(k3) OR FIREABLE(k13) OR FIREABLE(k4)))))) : E (F ((E (G ((FIREABLE(k4) AND FIREABLE(k20)))) AND A (G ((FIREABLE(k24) OR FIREABLE(k29))))))) : E (G (E (F (A (G (FIREABLE(k25))))))) : E (F (A (G (E (G (FIREABLE(k12))))))) : (A (F (FIREABLE(k8))) OR E (((FIREABLE(k16) OR NOT FIREABLE(k4)) U A (F (FIREABLE(k10)))))) : A (G (E (F (((FIREABLE(k17) AND FIREABLE(k28)) OR (FIREABLE(k1) AND FIREABLE(k30))))))) : A (X (E ((NOT FIREABLE(k21) U (FIREABLE(k25) AND FIREABLE(k15)))))) : (FIREABLE(k7) OR (A (G (E (F (FIREABLE(k30))))) OR E (G (((FIREABLE(k14) AND FIREABLE(k23)) OR (FIREABLE(k16) AND FIREABLE(k10))))))) : E (F (NOT((E (F (FIREABLE(k12))) OR E (G (FIREABLE(k22))))))) : E ((E (G (NOT FIREABLE(k7))) U E ((FIREABLE(k9) U FIREABLE(k8))))) : A (G (E (F ((NOT FIREABLE(k24) AND NOT FIREABLE(k12)))))) : (FIREABLE(k2) OR FIREABLE(k16)) : ((FIREABLE(k3) OR (E (X ((FIREABLE(k25) AND FIREABLE(k20)))) AND FIREABLE(k8))) OR E (F (E (X ((FIREABLE(k28) OR FIREABLE(k30))))))) : NOT(NOT(E (G (E (X (FIREABLE(k28)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:395
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(k2) OR FIREABLE(k16))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(k2) OR FIREABLE(k16))
lola: processed formula length: 32
lola: 20 rewrites
lola: closed formula file MAPK-PT-008-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: ========================================

FORMULA MAPK-PT-008-CTLFireability-13 FALSE 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 (E (X ((FIREABLE(k3) OR FIREABLE(k13) OR FIREABLE(k4))))))
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((FIREABLE(k3) OR FIREABLE(k13) OR FIREABLE(k4))))))
lola: processed formula length: 73
lola: 22 rewrites
lola: closed formula file MAPK-PT-008-CTLFireability.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: 1830258 markings, 5181883 edges, 366052 markings/sec, 0 secs
lola: 3288756 markings, 10169956 edges, 291700 markings/sec, 5 secs
lola: 4625133 markings, 14938747 edges, 267275 markings/sec, 10 secs
lola: 5877660 markings, 19700603 edges, 250505 markings/sec, 15 secs
lola: 6104261 markings, 24861197 edges, 45320 markings/sec, 20 secs
lola: 6106186 markings, 30001986 edges, 385 markings/sec, 25 secs
lola: 6107350 markings, 35174186 edges, 233 markings/sec, 30 secs
lola: 6108182 markings, 40380178 edges, 166 markings/sec, 35 secs
lola: 6108882 markings, 45621272 edges, 140 markings/sec, 40 secs
lola: 6109473 markings, 50681640 edges, 118 markings/sec, 45 secs
lola: 6110008 markings, 55821014 edges, 107 markings/sec, 50 secs
lola: 6110370 markings, 60998740 edges, 72 markings/sec, 55 secs
lola: 6110500 markings, 66211368 edges, 26 markings/sec, 60 secs
lola: 6110611 markings, 71683078 edges, 22 markings/sec, 65 secs
lola: 6110643 markings, 77608106 edges, 6 markings/sec, 70 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6110643 markings, 78948888 edges
lola: ========================================

FORMULA MAPK-PT-008-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E ((NOT FIREABLE(k21) U (FIREABLE(k25) AND FIREABLE(k15))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(E(NOT FIREABLE(k21) U (FIREABLE(k25) AND FIREABLE(k15))))
lola: processed formula length: 60
lola: 22 rewrites
lola: closed formula file MAPK-PT-008-CTLFireability.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: 24524 markings, 154132 edges
lola: ========================================

FORMULA MAPK-PT-008-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((NOT FIREABLE(k16) OR NOT FIREABLE(k29) OR NOT FIREABLE(k21)) U A (X ((FIREABLE(k24) AND FIREABLE(k7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E((NOT FIREABLE(k16) OR NOT FIREABLE(k29) OR NOT FIREABLE(k21)) U AX((FIREABLE(k24) AND FIREABLE(k7))))
lola: processed formula length: 105
lola: 22 rewrites
lola: closed formula file MAPK-PT-008-CTLFireability.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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 26256 markings, 57086 edges
lola: ========================================

FORMULA MAPK-PT-008-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(k3) OR ((E (X ((FIREABLE(k25) AND FIREABLE(k20)))) AND FIREABLE(k8)) OR E (X (E (F ((FIREABLE(k28) OR FIREABLE(k30))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(k3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(k3)
lola: processed formula length: 12
lola: 20 rewrites
lola: closed formula file MAPK-PT-008-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 5 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(k8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(k8)
lola: processed formula length: 12
lola: 20 rewrites
lola: closed formula file MAPK-PT-008-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 6 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((FIREABLE(k28) OR FIREABLE(k30))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (FIREABLE(k28) OR FIREABLE(k30))
lola: processed formula length: 33
lola: 21 rewrites
lola: closed formula file MAPK-PT-008-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--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 /EXEF
lola: The predicate is reachable from some successor.
lola: 8 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA MAPK-PT-008-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (FIREABLE(k28)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(EX(FIREABLE(k28)))))
lola: processed formula length: 37
lola: 22 rewrites
lola: closed formula file MAPK-PT-008-CTLFireability.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: 1 markings, 0 edges
lola: ========================================

FORMULA MAPK-PT-008-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(k10) OR NOT FIREABLE(k6) OR NOT FIREABLE(k20) OR NOT FIREABLE(k8))))
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(k10) OR NOT FIREABLE(k6) OR NOT FIREABLE(k20) OR NOT FIREABLE(k8))))
lola: processed formula length: 91
lola: 22 rewrites
lola: closed formula file MAPK-PT-008-CTLFireability.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 27 markings, 38 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (FIREABLE(k10) AND FIREABLE(k6) AND FIREABLE(k20) AND FIREABLE(k8))
FORMULA MAPK-PT-008-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 7 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (FIREABLE(k12)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(k12)
lola: processed formula length: 17
lola: 22 rewrites
lola: closed formula file MAPK-PT-008-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 2366517 markings, 7211427 edges, 473303 markings/sec, 0 secs
lola: 4130210 markings, 13491062 edges, 352739 markings/sec, 5 secs
lola: 4543603 markings, 20241924 edges, 82679 markings/sec, 10 secs
lola: 4743401 markings, 26904860 edges, 39960 markings/sec, 15 secs
lola: 4953072 markings, 33981704 edges, 41934 markings/sec, 20 secs
lola: 5168724 markings, 41024896 edges, 43130 markings/sec, 25 secs
lola: 5392723 markings, 48263206 edges, 44800 markings/sec, 30 secs
lola: 5624338 markings, 55916488 edges, 46323 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not possibly invariant.
lola: 5675649 markings, 57248748 edges
lola: ========================================

FORMULA MAPK-PT-008-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((NOT FIREABLE(k24) AND NOT FIREABLE(k12))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (NOT FIREABLE(k24) AND NOT FIREABLE(k12))
lola: processed formula length: 41
lola: 21 rewrites
lola: closed formula file MAPK-PT-008-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 2321794 markings, 6949327 edges, 464359 markings/sec, 0 secs
lola: 3546874 markings, 13958979 edges, 245016 markings/sec, 5 secs
lola: 3884687 markings, 20824550 edges, 67563 markings/sec, 10 secs
lola: 4244081 markings, 27675348 edges, 71879 markings/sec, 15 secs
lola: 4634035 markings, 34780439 edges, 77991 markings/sec, 20 secs
lola: 5039986 markings, 42044376 edges, 81190 markings/sec, 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 5202708 markings, 44827410 edges
lola: ========================================

FORMULA MAPK-PT-008-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((FIREABLE(k17) AND FIREABLE(k28)) OR (FIREABLE(k1) AND FIREABLE(k30)))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: ((FIREABLE(k17) AND FIREABLE(k28)) OR (FIREABLE(k1) AND FIREABLE(k30)))
lola: processed formula length: 72
lola: 21 rewrites
lola: closed formula file MAPK-PT-008-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 2142137 markings, 5889637 edges, 428427 markings/sec, 0 secs
lola: 3701480 markings, 10941283 edges, 311869 markings/sec, 5 secs
lola: 5014644 markings, 15846956 edges, 262633 markings/sec, 10 secs
lola: 5995951 markings, 20982468 edges, 196261 markings/sec, 15 secs
lola: 6050523 markings, 26076350 edges, 10914 markings/sec, 20 secs
lola: 6062129 markings, 31316291 edges, 2321 markings/sec, 25 secs
lola: 6069354 markings, 36672617 edges, 1445 markings/sec, 30 secs
lola: 6074231 markings, 42127309 edges, 975 markings/sec, 35 secs
lola: 6077470 markings, 47709051 edges, 648 markings/sec, 40 secs
lola: 6079765 markings, 53391709 edges, 459 markings/sec, 45 secs
lola: 6081549 markings, 59184531 edges, 357 markings/sec, 50 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 6082113 markings, 64709796 edges

FORMULA MAPK-PT-008-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (A (G (FIREABLE(k25)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U NOT(E(TRUE U NOT FIREABLE(k25)))))))
lola: processed formula length: 62
lola: 24 rewrites
lola: closed formula file MAPK-PT-008-CTLFireability.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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1571136 markings, 6390836 edges, 314227 markings/sec, 0 secs
lola: 2683461 markings, 11823135 edges, 222465 markings/sec, 5 secs
lola: 3693051 markings, 17021995 edges, 201918 markings/sec, 10 secs
lola: 4648218 markings, 22052380 edges, 191033 markings/sec, 15 secs
lola: 5525774 markings, 26880563 edges, 175511 markings/sec, 20 secs
lola: 6101561 markings, 31690407 edges, 115157 markings/sec, 25 secs
lola: 6105355 markings, 36764967 edges, 759 markings/sec, 30 secs
lola: 6106736 markings, 41802480 edges, 276 markings/sec, 35 secs
lola: 6107704 markings, 46819340 edges, 194 markings/sec, 40 secs
lola: 6108406 markings, 51935636 edges, 140 markings/sec, 45 secs
lola: 6109110 markings, 57147886 edges, 141 markings/sec, 50 secs
lola: 6109702 markings, 62292575 edges, 118 markings/sec, 55 secs
lola: 6110162 markings, 67507615 edges, 92 markings/sec, 60 secs
lola: 6110430 markings, 72727241 edges, 54 markings/sec, 65 secs
lola: 6110553 markings, 78151340 edges, 25 markings/sec, 70 secs
lola: 6110627 markings, 83789429 edges, 15 markings/sec, 75 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6110643 markings, 88570242 edges
lola: ========================================

FORMULA MAPK-PT-008-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 655 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G (NOT FIREABLE(k12))) AND A (F (NOT FIREABLE(k22))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: E(TRUE U (NOT(E(TRUE U FIREABLE(k12))) AND A(TRUE U NOT FIREABLE(k22))))
lola: processed formula length: 72
lola: 24 rewrites
lola: closed formula file MAPK-PT-008-CTLFireability.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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1353041 markings, 6266058 edges, 270608 markings/sec, 0 secs
lola: 2451621 markings, 11745677 edges, 219716 markings/sec, 5 secs
lola: 3480789 markings, 17091283 edges, 205834 markings/sec, 10 secs
lola: 4472501 markings, 22306844 edges, 198342 markings/sec, 15 secs
lola: 5397374 markings, 27304275 edges, 184975 markings/sec, 20 secs
lola: 6100558 markings, 32235832 edges, 140637 markings/sec, 25 secs
lola: 6105225 markings, 37396616 edges, 933 markings/sec, 30 secs
lola: 6106636 markings, 42529680 edges, 282 markings/sec, 35 secs
lola: 6107668 markings, 47601468 edges, 206 markings/sec, 40 secs
lola: 6108375 markings, 52758017 edges, 141 markings/sec, 45 secs
lola: 6109088 markings, 58011852 edges, 143 markings/sec, 50 secs
lola: 6109696 markings, 63185921 edges, 122 markings/sec, 55 secs
lola: 6110149 markings, 68416363 edges, 91 markings/sec, 60 secs
lola: 6110430 markings, 73674680 edges, 56 markings/sec, 65 secs
lola: 6110553 markings, 79040705 edges, 25 markings/sec, 70 secs
lola: 6110623 markings, 84631518 edges, 14 markings/sec, 75 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6110643 markings, 89617471 edges
lola: ========================================

FORMULA MAPK-PT-008-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 798 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (G (NOT FIREABLE(k7))) U E ((FIREABLE(k9) U FIREABLE(k8)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(NOT(A(TRUE U FIREABLE(k7))) U E(FIREABLE(k9) U FIREABLE(k8)))
lola: processed formula length: 63
lola: 24 rewrites
lola: closed formula file MAPK-PT-008-CTLFireability.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 3 significant temporal operators and needs 13 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: 5 markings, 21 edges
lola: ========================================

FORMULA MAPK-PT-008-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1064 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((FIREABLE(k4) AND FIREABLE(k20)))) AND A (G ((FIREABLE(k24) OR FIREABLE(k29)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(TRUE U (NOT(A(TRUE U (NOT FIREABLE(k4) OR NOT FIREABLE(k20)))) AND NOT(E(TRUE U (NOT FIREABLE(k24) AND NOT FIREABLE(k29))))))
lola: processed formula length: 128
lola: 25 rewrites
lola: closed formula file MAPK-PT-008-CTLFireability.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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1457978 markings, 6351999 edges, 291596 markings/sec, 0 secs
lola: 2633933 markings, 12027931 edges, 235191 markings/sec, 5 secs
lola: 3748668 markings, 17533278 edges, 222947 markings/sec, 10 secs
lola: 4821282 markings, 22888790 edges, 214523 markings/sec, 15 secs
lola: 5852291 markings, 28124094 edges, 206202 markings/sec, 20 secs
lola: 6104019 markings, 33199866 edges, 50346 markings/sec, 25 secs
lola: 6105969 markings, 38212418 edges, 390 markings/sec, 30 secs
lola: 6107178 markings, 43153572 edges, 242 markings/sec, 35 secs
lola: 6107986 markings, 48019838 edges, 162 markings/sec, 40 secs
lola: 6108685 markings, 53061600 edges, 140 markings/sec, 45 secs
lola: 6109316 markings, 58110447 edges, 126 markings/sec, 50 secs
lola: 6109877 markings, 63262334 edges, 112 markings/sec, 55 secs
lola: 6110289 markings, 68393009 edges, 82 markings/sec, 60 secs
lola: 6110467 markings, 73543928 edges, 36 markings/sec, 65 secs
lola: 6110584 markings, 78940804 edges, 23 markings/sec, 70 secs
lola: 6110639 markings, 84655114 edges, 11 markings/sec, 75 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6110643 markings, 87788058 edges
lola: ========================================

FORMULA MAPK-PT-008-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1555 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (FIREABLE(k8))) OR E (((FIREABLE(k16) OR NOT FIREABLE(k4)) U A (F (FIREABLE(k10))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: (A(TRUE U FIREABLE(k8)) OR E((FIREABLE(k16) OR NOT FIREABLE(k4)) U A(TRUE U FIREABLE(k10))))
lola: processed formula length: 93
lola: 23 rewrites
lola: closed formula file MAPK-PT-008-CTLFireability.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 3 significant temporal operators and needs 13 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: 10 markings, 26 edges
lola: ========================================

FORMULA MAPK-PT-008-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3110 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(k7) OR (A (G (E (F (FIREABLE(k30))))) OR E (G (((FIREABLE(k14) AND FIREABLE(k23)) OR (FIREABLE(k16) AND FIREABLE(k10)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3110 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(k7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(k7)
lola: processed formula length: 12
lola: 20 rewrites
lola: closed formula file MAPK-PT-008-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
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (FIREABLE(k30)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: FIREABLE(k30)
lola: processed formula length: 13
lola: 21 rewrites
lola: closed formula file MAPK-PT-008-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no yes yes no no no no yes no unknown no no yes no yes no
lola: memory consumption: 90000 KB
lola: time consumption: 461 seconds
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: (FIREABLE(k7) OR (A (G (E (F (FIREABLE(k30))))) OR E (G (((FIREABLE(k14) AND FIREABLE(k23)) OR (FIREABLE(k16) AND FIREABLE(k10)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: FIREABLE(k7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(k7)
lola: processed formula length: 12
lola: 20 rewrites
lola: closed formula file MAPK-PT-008-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: ========================================
lola: ...considering subproblem: E (G (((FIREABLE(k14) AND FIREABLE(k23)) OR (FIREABLE(k16) AND FIREABLE(k10)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((FIREABLE(k14) AND FIREABLE(k23)) OR (FIREABLE(k16) AND FIREABLE(k10)))))
lola: processed formula length: 81
lola: 20 rewrites
lola: closed formula file MAPK-PT-008-CTLFireability.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 is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (F (FIREABLE(k30)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: FIREABLE(k30)
lola: processed formula length: 13
lola: 21 rewrites
lola: closed formula file MAPK-PT-008-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 2512464 markings, 6883712 edges, 502493 markings/sec, 0 secs
lola: 4375812 markings, 12947619 edges, 372670 markings/sec, 5 secs
lola: 5861918 markings, 18792281 edges, 297221 markings/sec, 10 secs
lola: 6002861 markings, 25058129 edges, 28189 markings/sec, 15 secs
lola: 6012479 markings, 30335411 edges, 1924 markings/sec, 20 secs
lola: 6018190 markings, 36152506 edges, 1142 markings/sec, 25 secs
lola: 6020446 markings, 42154369 edges, 451 markings/sec, 30 secs
lola: 6021118 markings, 48200494 edges, 134 markings/sec, 35 secs
lola: 6021321 markings, 54127232 edges, 41 markings/sec, 40 secs
lola: 6021347 markings, 60168334 edges, 5 markings/sec, 45 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 6021347 markings, 65283837 edges
lola: SUBRESULT
lola: result: yes
lola: ========================================
lola: The Boolean predicate is true.
lola: ========================================

FORMULA MAPK-PT-008-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no no no no yes no yes no no yes no yes no
lola:
preliminary result: no yes yes no no no no yes no yes no no yes no yes no
lola: memory consumption: 14496 KB
lola: time consumption: 515 seconds

BK_STOP 1527020150171

--------------------
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="MAPK-PT-008"
export BK_EXAMINATION="CTLFireability"
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/MAPK-PT-008.tgz
mv MAPK-PT-008 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 MAPK-PT-008, 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 r112-csrt-152666469100158"
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 ;