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)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_Angiogenesis-PT-25, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074100138
=====================================================================

--------------------
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 Angiogenesis-PT-25-CTLCardinality-0
FORMULA_NAME Angiogenesis-PT-25-CTLCardinality-1
FORMULA_NAME Angiogenesis-PT-25-CTLCardinality-10
FORMULA_NAME Angiogenesis-PT-25-CTLCardinality-11
FORMULA_NAME Angiogenesis-PT-25-CTLCardinality-12
FORMULA_NAME Angiogenesis-PT-25-CTLCardinality-13
FORMULA_NAME Angiogenesis-PT-25-CTLCardinality-14
FORMULA_NAME Angiogenesis-PT-25-CTLCardinality-15
FORMULA_NAME Angiogenesis-PT-25-CTLCardinality-2
FORMULA_NAME Angiogenesis-PT-25-CTLCardinality-3
FORMULA_NAME Angiogenesis-PT-25-CTLCardinality-4
FORMULA_NAME Angiogenesis-PT-25-CTLCardinality-5
FORMULA_NAME Angiogenesis-PT-25-CTLCardinality-6
FORMULA_NAME Angiogenesis-PT-25-CTLCardinality-7
FORMULA_NAME Angiogenesis-PT-25-CTLCardinality-8
FORMULA_NAME Angiogenesis-PT-25-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496333315414


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


checking for too many tokens
===========================================================================================
S_Angiogenesis-PT-25: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_Angiogenesis-PT-25 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 103/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 39 places, 64 transitions, 31 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 54 transition conflict sets
lola: TASK
lola: reading formula from Angiogenesis-PT-25-CTLCardinality.task
lola: E (F (NOT(E (X ((KdStarGP3 <= Akt)))))) : E (((((3 <= KdStarGStarP3kStar) OR (PtP3P2 <= KdStarGStarPgStarP2)) AND (KdStarPg <= KdStarGStar)) U ((DAG + 1 <= KdStarG) AND (Pip2 + 1 <= KdStarGStarPgStarP3)))) : ((1 <= AktP3) OR NOT(E (F ((P3k + 1 <= KdStarPgStar))))) : E (F (((2 <= KdStarGP3) AND (KdStarGStarPg <= KdStarGStarP3kStarP3)))) : A (G (((2 <= P3k) AND ((KdStarGStarP3kStar <= Akt) OR (KdStarGStarPgP3 <= Pten)) AND ((KdStarGStarPgStarP2 + 1 <= KdStar) OR ((KdStarGStarP3kStarP2 <= KdStarGStarP3) AND (3 <= KdStarPg)))))) : A (G ((AktStar <= KdStarGStarPgStarP3))) : NOT(A (G (((1 <= KdStarGStarPg) OR (Pip2 <= AktP3) OR (KdStarPgStarP2 <= P3k))))) : E (F (A (G ((DAG <= KdStarGStarPg))))) : (NOT(A (G (((3 <= PtP2) OR (GStarPgP3 <= Gab1))))) OR ((E (X ((KdStarGStarPgStar <= Enz))) AND ((Pg + 1 <= KdStarGStarPgStarP3P2) OR ((3 <= KdStarGStarP3kStar) AND (3 <= PtP3P2)))) AND (1 <= KdStarGStarPgStarP3))) : E (F (A (((KdStarPgStar <= KdStarGStarPgStar) U (3 <= KdStarGStarP3))))) : E (((((2 <= DAG) AND (2 <= KdStarGStar)) OR (1 <= Pg)) U (((2 <= KdStarGP3) AND (2 <= KdStarGP3)) OR ((3 <= Pip3))))) : E (F ((((KdStarGStarP3kStarP3P2 <= KdStarPgStarP2) OR (Pg <= KdStarGStarPgStarP2)) AND (2 <= Pip3)))) : E (F ((A (G ((2 <= GStarP3kP3))) AND E (G (TRUE))))) : E ((A (G ((KdStarGStarP3kP3 <= Akt))) U (KdStar + 1 <= Enz))) : (NOT((((3 <= KdStarGStarP3kStarP3) OR (3 <= KdStarPgStar) OR ((2 <= KdStarGStarP3kStarP3P2) AND (KdStarGStarP3kP3 <= DAGE))) OR A (X ((PtP2 <= KdStarGStarP3kStar))))) AND NOT((((KdStarGStarP3 <= 1) OR ((PtP2 <= KdStarGP3) AND (KdStarGStarPgStarP3P2 <= Gab1))) AND E (F ((Akt <= Pip3)))))) : E (F (((Akt <= 1) OR (AktStar + 1 <= KdStarGStarP3kP3))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(E (X ((KdStarGP3 <= Akt))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((Akt + 1 <= KdStarGP3)))
lola: processed formula length: 36
lola: 5 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-25-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3003168 markings, 6217336 edges, 3544663584862633984 markings/sec, 0 secs
lola: 5538722 markings, 11595247 edges, 507111 markings/sec, 5 secs
lola: 8046309 markings, 16918165 edges, 501517 markings/sec, 10 secs
lola: 10660667 markings, 22488217 edges, 522872 markings/sec, 15 secs
lola: 13069915 markings, 27534529 edges, 481850 markings/sec, 20 secs
lola: 15503425 markings, 32658588 edges, 486702 markings/sec, 25 secs
lola: 17785143 markings, 37589905 edges, 456344 markings/sec, 30 secs
lola: 20087498 markings, 42525053 edges, 460471 markings/sec, 35 secs
lola: 22542478 markings, 47593274 edges, 490996 markings/sec, 40 secs
lola: 24921981 markings, 52591724 edges, 475901 markings/sec, 45 secs
lola: 27215512 markings, 57447555 edges, 458706 markings/sec, 50 secs
lola: 29583423 markings, 62436312 edges, 473582 markings/sec, 55 secs
lola: 31902824 markings, 67375100 edges, 463880 markings/sec, 60 secs
lola: 34205349 markings, 72285577 edges, 460505 markings/sec, 65 secs
lola: 36592329 markings, 77467048 edges, 477396 markings/sec, 70 secs
lola: 38992460 markings, 82610958 edges, 480026 markings/sec, 75 secs
lola: 41464601 markings, 87859277 edges, 494428 markings/sec, 80 secs
lola: 43868794 markings, 93001066 edges, 480839 markings/sec, 85 secs
lola: 46210273 markings, 98026906 edges, 468296 markings/sec, 90 secs
lola: 48633716 markings, 103231335 edges, 484689 markings/sec, 95 secs
lola: 51034543 markings, 108280117 edges, 480165 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 228 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((((3 <= KdStarGStarP3kStar) OR (PtP3P2 <= KdStarGStarPgStarP2)) AND (KdStarPg <= KdStarGStar)) U ((DAG + 1 <= KdStarG) AND (Pip2 + 1 <= KdStarGStarPgStarP3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((((3 <= KdStarGStarP3kStar) OR (PtP3P2 <= KdStarGStarPgStarP2)) AND (KdStarPg <= KdStarGStar)) U ((DAG + 1 <= KdStarG) AND (Pip2 + 1 <= KdStarGStarPgStarP3)))
lola: processed formula length: 161
lola: 1 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-25-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3552195 markings, 7219991 edges, 2659691964433170432 markings/sec, 0 secs
lola: 7023075 markings, 14558606 edges, 694176 markings/sec, 5 secs
lola: 10413752 markings, 21743913 edges, 678135 markings/sec, 10 secs
lola: 13756590 markings, 28819720 edges, 668568 markings/sec, 15 secs
lola: 17212366 markings, 36126560 edges, 691155 markings/sec, 20 secs
lola: 20468280 markings, 43021272 edges, 651183 markings/sec, 25 secs
lola: 23613616 markings, 49671951 edges, 629067 markings/sec, 30 secs
lola: 26761505 markings, 56361515 edges, 629578 markings/sec, 35 secs
lola: 29737503 markings, 62546319 edges, 595200 markings/sec, 40 secs
lola: 32565012 markings, 68620518 edges, 565502 markings/sec, 45 secs
lola: 35349361 markings, 74360282 edges, 556870 markings/sec, 50 secs
lola: 37926861 markings, 79842259 edges, 515500 markings/sec, 55 secs
lola: 40638494 markings, 85471588 edges, 542327 markings/sec, 60 secs
lola: 43293195 markings, 91058183 edges, 530940 markings/sec, 65 secs
lola: 45924960 markings, 96655196 edges, 526353 markings/sec, 70 secs
lola: 48604844 markings, 102317542 edges, 535977 markings/sec, 75 secs
lola: 51293301 markings, 108034468 edges, 537691 markings/sec, 80 secs
lola: 53979008 markings, 113713660 edges, 537141 markings/sec, 85 secs
lola: 56641214 markings, 119341977 edges, 532441 markings/sec, 90 secs
lola: 59360187 markings, 125133304 edges, 543795 markings/sec, 95 secs
lola: 62063457 markings, 130844619 edges, 540654 markings/sec, 100 secs
lola: 64773202 markings, 136670571 edges, 541949 markings/sec, 105 secs
lola: 66811960 markings, 140929524 edges, 407752 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= AktP3) OR NOT(E (F ((P3k + 1 <= KdStarPgStar)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= AktP3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= AktP3)
lola: processed formula length: 12
lola: 3 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-25-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: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((KdStarPgStar <= P3k)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= KdStarGP3) AND (KdStarGStarPg <= KdStarGStarP3kStarP3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-25-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Angiogenesis-PT-25-CTLCardinality-3.sara.

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= P3k) AND ((KdStarGStarP3kStar <= Akt) OR (KdStarGStarPgP3 <= Pten)) AND ((KdStarGStarPgStarP2 + 1 <= KdStar) OR ((KdStarGStarP3kStarP2 <= KdStarGStarP3) AND (3 <= KdStarPg))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 7 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-25-CTLCardinality-4.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((AktStar <= KdStarGStarPgStarP3)))
lola: ========================================
lola: SUBTASK
state equation: calling and running sara
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to Angiogenesis-PT-25-CTLCardinality-5.sara
lola: The predicate is not invariant.
lola: lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=-1)
========================================
lola: ========================================
lola: ...considering subproblem: NOT(A (G (((1 <= KdStarGStarPg) OR (Pip2 <= AktP3) OR (KdStarPgStarP2 <= P3k)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state equation: calling and running sara
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: sara: RUNNING
try reading problem file Angiogenesis-PT-25-CTLCardinality-4.sara.
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-25-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Angiogenesis-PT-25-CTLCardinality-6.sara.
sara: try reading problem file Angiogenesis-PT-25-CTLCardinality-5.sara.

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((DAG <= KdStarGStarPg)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (KdStarGStarPg + 1 <= DAG))))
lola: processed formula length: 51
lola: 3 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-25-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).


lola: 1964574 markings, 8151620 edges, 392905 markings/sec, 0 secs
lola: 3751361 markings, 15972478 edges, 357357 markings/sec, 5 secs
lola: 5416298 markings, 23187384 edges, 332987 markings/sec, 10 secs
lola: 6968373 markings, 30012104 edges, 310415 markings/sec, 15 secs
lola: 8618817 markings, 36932267 edges, 330089 markings/sec, 20 secs
lola: 10113193 markings, 43489033 edges, 298875 markings/sec, 25 secs
lola: 11563252 markings, 49907521 edges, 290012 markings/sec, 30 secs
lola: 13017964 markings, 56373406 edges, 290942 markings/sec, 35 secs
lola: 14485884 markings, 62895273 edges, 293584 markings/sec, 40 secs
lola: 15944670 markings, 69391833 edges, 291757 markings/sec, 45 secs
lola: 17321911 markings, 75386063 edges, 275448 markings/sec, 50 secs
lola: 18706092 markings, 81377420 edges, 276836 markings/sec, 55 secs
lola: 20127234 markings, 87462551 edges, 284228 markings/sec, 60 secs
lola: 21572425 markings, 93953087 edges, 289038 markings/sec, 65 secs
lola: 22982410 markings, 100285836 edges, 281997 markings/sec, 70 secs
lola: 24389355 markings, 106528565 edges, 281389 markings/sec, 75 secs
lola: 25713840 markings, 112259506 edges, 264897 markings/sec, 80 secs
lola: 27123378 markings, 118492887 edges, 281908 markings/sec, 85 secs
lola: 28697378 markings, 125246381 edges, 314800 markings/sec, 90 secs
lola: 30150812 markings, 131703803 edges, 290687 markings/sec, 95 secs
lola: 31637832 markings, 138294252 edges, 297404 markings/sec, 100 secs
lola: 33088115 markings, 144758565 edges, 290057 markings/sec, 105 secs
lola: 34641735 markings, 151262896 edges, 310724 markings/sec, 110 secs
lola: 36093183 markings, 157644749 edges, 290290 markings/sec, 115 secs
lola: 37535372 markings, 163879595 edges, 288438 markings/sec, 120 secs
lola: 38950836 markings, 170035724 edges, 283093 markings/sec, 125 secs
lola: 40380424 markings, 176448573 edges, 285918 markings/sec, 130 secs
lola: 41808753 markings, 182659569 edges, 285666 markings/sec, 135 secs
lola: 43114756 markings, 188467308 edges, 261201 markings/sec, 140 secs
lola: 44407681 markings, 194251173 edges, 258585 markings/sec, 145 secs
lola: 45730135 markings, 200072109 edges, 264491 markings/sec, 150 secs
lola: 47020762 markings, 205873454 edges, 258125 markings/sec, 155 secs
lola: 48319926 markings, 211764255 edges, 259833 markings/sec, 160 secs
lola: 49651577 markings, 217712541 edges, 266330 markings/sec, 165 secs
lola: 51030237 markings, 223721340 edges, 275732 markings/sec, 170 secs
lola: 52451543 markings, 230169029 edges, 284261 markings/sec, 175 secs
lola: 53927678 markings, 236804529 edges, 295227 markings/sec, 180 secs
lola: 55293690 markings, 242724325 edges, 273202 markings/sec, 185 secs
lola: 56698898 markings, 248926683 edges, 281042 markings/sec, 190 secs
lola: 57972054 markings, 254515540 edges, 254631 markings/sec, 195 secs
lola: 59217574 markings, 260101248 edges, 249104 markings/sec, 200 secs
lola: 60446165 markings, 265685194 edges, 245718 markings/sec, 205 secs
lola: 61797783 markings, 271611958 edges, 270324 markings/sec, 210 secs
lola: 63279587 markings, 277757784 edges, 296361 markings/sec, 215 secs
lola: 64651877 markings, 283708997 edges, 274458 markings/sec, 220 secs
lola: 66069637 markings, 289696549 edges, 283552 markings/sec, 225 secs
lola: 67187531 markings, 294470136 edges, 223579 markings/sec, 230 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 384 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (G (((3 <= PtP2) OR (GStarPgP3 <= Gab1))))) OR ((E (X ((KdStarGStarPgStar <= Enz))) AND ((Pg + 1 <= KdStarGStarPgStarP3P2) OR ((3 <= KdStarGStarP3kStar) AND (3 <= PtP3P2)))) AND (1 <= KdStarGStarPgStarP3)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 384 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((PtP2 <= 2) AND (Gab1 + 1 <= GStarPgP3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: lola: ========================================The Boolean predicate is true.

lola: ========================================
lola: subprocess 9 will run for 439 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (((KdStarPgStar <= KdStarGStarPgStar) U (3 <= KdStarGStarP3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A((KdStarPgStar <= KdStarGStarPgStar) U (3 <= KdStarGStarP3)))
lola: processed formula length: 71
lola: 2 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-25-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2581976 markings, 8120207 edges, 2243966068215250944 markings/sec, 0 secs
lola: 4657596 markings, 16451650 edges, 415124 markings/sec, 5 secs
lola: 6637643 markings, 24426654 edges, 396009 markings/sec, 10 secs
lola: 8666188 markings, 32602771 edges, 405709 markings/sec, 15 secs
lola: 10745552 markings, 40976424 edges, 415873 markings/sec, 20 secs
lola: 12815210 markings, 49321087 edges, 413932 markings/sec, 25 secs
lola: 14990776 markings, 58086692 edges, 435113 markings/sec, 30 secs
lola: 17172205 markings, 66880545 edges, 436286 markings/sec, 35 secs
lola: 19298131 markings, 75446450 edges, 425185 markings/sec, 40 secs
lola: 21406050 markings, 83939492 edges, 421584 markings/sec, 45 secs
lola: 23417816 markings, 92023453 edges, 402353 markings/sec, 50 secs
lola: 25343692 markings, 99667953 edges, 385175 markings/sec, 55 secs
lola: 27046099 markings, 106454465 edges, 340481 markings/sec, 60 secs
lola: 28763501 markings, 113236202 edges, 343480 markings/sec, 65 secs
lola: 30582974 markings, 120362907 edges, 363895 markings/sec, 70 secs
lola: 32377584 markings, 127453275 edges, 358922 markings/sec, 75 secs
lola: 34197342 markings, 134598639 edges, 363952 markings/sec, 80 secs
lola: 35966065 markings, 141546870 edges, 353745 markings/sec, 85 secs
lola: 37678588 markings, 148209058 edges, 342505 markings/sec, 90 secs
lola: 39451189 markings, 155234219 edges, 354520 markings/sec, 95 secs
lola: 41153097 markings, 161861102 edges, 340382 markings/sec, 100 secs
lola: 42859508 markings, 168617938 edges, 341282 markings/sec, 105 secs
lola: 44587021 markings, 175353461 edges, 345503 markings/sec, 110 secs
lola: 46268967 markings, 181959070 edges, 336389 markings/sec, 115 secs
lola: 47941801 markings, 188520668 edges, 334567 markings/sec, 120 secs
lola: 49596328 markings, 195049073 edges, 330905 markings/sec, 125 secs
lola: 51278980 markings, 201572764 edges, 336530 markings/sec, 130 secs
lola: 52890612 markings, 207672771 edges, 322326 markings/sec, 135 secs
lola: 54494851 markings, 213930075 edges, 320848 markings/sec, 140 secs
lola: 56074788 markings, 219967118 edges, 315987 markings/sec, 145 secs
lola: 57672577 markings, 226345657 edges, 319558 markings/sec, 150 secs
lola: 59252615 markings, 232620289 edges, 316008 markings/sec, 155 secs
lola: 60962547 markings, 239228052 edges, 341986 markings/sec, 160 secs
lola: 62604869 markings, 245756076 edges, 328464 markings/sec, 165 secs
lola: 64229308 markings, 252182185 edges, 324888 markings/sec, 170 secs
lola: 64435943 markings, 252993287 edges, 41327 markings/sec, 175 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 10 will run for 481 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((((2 <= DAG) AND (2 <= KdStarGStar)) OR (1 <= Pg)) U (((2 <= KdStarGP3) AND (2 <= KdStarGP3)) OR ((3 <= Pip3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((((2 <= DAG) AND (2 <= KdStarGStar)) OR (1 <= Pg)) U (((2 <= KdStarGP3) AND (2 <= KdStarGP3)) OR ((3 <= Pip3))))
lola: processed formula length: 116
lola: 1 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-25-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3485420 markings, 7237991 edges, 2040949629922574336 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 577 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((KdStarGStarP3kStarP3P2 <= KdStarPgStarP2) OR (Pg <= KdStarGStarPgStarP2)) AND (2 <= Pip3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 721 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((2 <= GStarP3kP3))) AND E (G (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (GStarP3kP3 <= 1))))
lola: processed formula length: 42
lola: 7 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-25-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2759924 markings, 8011908 edges, 551975 markings/sec, 0 secs
lola: 5460303 markings, 16191191 edges, 540076 markings/sec, 5 secs
lola: 8082968 markings, 24136887 edges, 524533 markings/sec, 10 secs
lola: 10778106 markings, 32293960 edges, 539028 markings/sec, 15 secs
lola: 13439574 markings, 40361440 edges, 532294 markings/sec, 20 secs
lola: 16049571 markings, 48267863 edges, 521999 markings/sec, 25 secs
lola: 18790586 markings, 56575056 edges, 548203 markings/sec, 30 secs
lola: 21490045 markings, 64757496 edges, 539892 markings/sec, 35 secs
lola: 23978727 markings, 72336414 edges, 497736 markings/sec, 40 secs
lola: 26279228 markings, 79298692 edges, 460100 markings/sec, 45 secs
lola: 28635703 markings, 86419833 edges, 471295 markings/sec, 50 secs
lola: 30858448 markings, 93177056 edges, 444549 markings/sec, 55 secs
lola: 33096030 markings, 99942663 edges, 447516 markings/sec, 60 secs
lola: 35484915 markings, 107073794 edges, 477777 markings/sec, 65 secs
lola: 37733894 markings, 113840936 edges, 449796 markings/sec, 70 secs
lola: 39948968 markings, 120577372 edges, 443015 markings/sec, 75 secs
lola: 42067693 markings, 127109158 edges, 423745 markings/sec, 80 secs
lola: 44308458 markings, 133800215 edges, 448153 markings/sec, 85 secs
lola: 46502853 markings, 140335326 edges, 438879 markings/sec, 90 secs
lola: 48656691 markings, 146786646 edges, 430768 markings/sec, 95 secs
lola: 50781115 markings, 153142479 edges, 424885 markings/sec, 100 secs
lola: 52694348 markings, 159265798 edges, 382647 markings/sec, 105 secs
lola: 54583643 markings, 165281791 edges, 377859 markings/sec, 110 secs
lola: 56520311 markings, 171373149 edges, 387334 markings/sec, 115 secs
lola: 58554618 markings, 177561447 edges, 406861 markings/sec, 120 secs
lola: 60484888 markings, 183580082 edges, 386054 markings/sec, 125 secs
lola: 62562346 markings, 189870615 edges, 415492 markings/sec, 130 secs
lola: 64682691 markings, 196198240 edges, 424069 markings/sec, 135 secs
lola: 66735970 markings, 202623234 edges, 410656 markings/sec, 140 secs
lola: 68734716 markings, 208715519 edges, 399749 markings/sec, 145 secs
lola: 70682938 markings, 214686997 edges, 389644 markings/sec, 150 secs
lola: 72582132 markings, 220700417 edges, 379839 markings/sec, 155 secs
lola: 74555117 markings, 226644175 edges, 394597 markings/sec, 160 secs
lola: 76482901 markings, 232745475 edges, 385557 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 903 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (G ((KdStarGStarP3kP3 <= Akt))) U (KdStar + 1 <= Enz)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(E(TRUE U (Akt + 1 <= KdStarGStarP3kP3))) U (KdStar + 1 <= Enz))
lola: processed formula length: 69
lola: 3 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-25-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3410018 markings, 7079932 edges, 2013102024047984640 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: subprocess 14 will run for 1352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((((3 <= KdStarGStarP3kStarP3) OR (3 <= KdStarPgStar) OR ((2 <= KdStarGStarP3kStarP3P2) AND (KdStarGStarP3kP3 <= DAGE))) OR A (X ((PtP2 <= KdStarGStarP3kStar))))) AND NOT((((KdStarGStarP3 <= 1) OR ((PtP2 <= KdStarGP3) AND (KdStarGStarPgStarP3P2 <= Gab1))) AND E (F ((Akt <= Pip3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((KdStarGStarP3kStarP3 <= 2) AND (KdStarPgStar <= 2) AND ((KdStarGStarP3kStarP3P2 <= 1) OR (DAGE + 1 <= KdStarGStarP3kP3)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: ========================================
lola: processed formula: ((KdStarGStarP3kStarP3 <= 2) AND (KdStarPgStar <= 2) AND ((KdStarGStarP3kStarP3P2 <= 1) OR (DAGE + 1 <= KdStarGStarP3kP3)))
lola: processed formula length: 124
lola: 11 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-25-CTLCardinality.task
lola: processed formula with 4 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: ========================================
lola: subprocess 15 will run for 2705 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((KdStarGStarP3kStar + 1 <= PtP2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((KdStarGStarP3kStar + 1 <= PtP2))
lola: processed formula length: 36
lola: 12 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-25-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 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: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Pip3 + 1 <= Akt)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 2705 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Akt <= 1) OR (AktStar + 1 <= KdStarGStarP3kP3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: RESULT
lola:
SUMMARY: unknown unknown no yes no no yes unknown yes yes yes yes unknown no unknown yes
lola: ========================================
FORMULA Angiogenesis-PT-25-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496334150938

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_Angiogenesis-PT-25"
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/S_Angiogenesis-PT-25.tgz
mv S_Angiogenesis-PT-25 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_Angiogenesis-PT-25, 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 r088-csrt-149441074100138"
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 ;