fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r188-blw3-149581034400180
Last Updated
June 27, 2017

About the Execution of LoLA for FlexibleBarrier-PT-22b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
784.360 758787.00 1517130.00 347.50 TTFTFTFFFT?FTTTT 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)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is FlexibleBarrier-PT-22b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-blw3-149581034400180
=====================================================================


--------------------
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-22b-ReachabilityFireability-0
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-1
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-15
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-2
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-3
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-4
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-5
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-6
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-7
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-8
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-9

=== Now, execution of the tool begins

BK_START 1496501719781


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


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-22b: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ FlexibleBarrier-PT-22b @ 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: 13947/65536 symbol table entries, 4218 collisions
lola: preprocessing...
lola: finding significant places
lola: 6478 places, 7469 transitions, 6454 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 7515 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-22b-ReachabilityFireability.task
lola: E (F ((NOT FIREABLE(t954) AND (FIREABLE(t6036) OR FIREABLE(t887)) AND FIREABLE(t608) AND FIREABLE(t3627)))) : E (F ((NOT FIREABLE(t7406) AND NOT FIREABLE(t4170) AND FIREABLE(t7225) AND (FIREABLE(t4162) OR FIREABLE(t2750) OR (FIREABLE(t1564) AND FIREABLE(t4846) AND FIREABLE(t5322)))))) : A (G (NOT FIREABLE(t608))) : E (F ((NOT FIREABLE(t6812) AND NOT FIREABLE(t6101) AND FIREABLE(t1641) AND NOT FIREABLE(t5694)))) : E (F (FIREABLE(t922))) : A (G (((NOT FIREABLE(t1057) OR NOT FIREABLE(t6818) OR FIREABLE(t6624)) AND NOT FIREABLE(t3456)))) : E (F (((FIREABLE(t6107) AND FIREABLE(t4897)) OR ((FIREABLE(t65) OR FIREABLE(t3952) OR FIREABLE(t4073) OR FIREABLE(t817)) AND FIREABLE(t2075))))) : E (F (FIREABLE(t7161))) : A (G (((FIREABLE(t4720) AND FIREABLE(t1563)) OR NOT FIREABLE(t1784) OR (NOT FIREABLE(t648) AND FIREABLE(t7171)) OR FIREABLE(t134)))) : A (G ((NOT FIREABLE(t7372) OR FIREABLE(t2560) OR NOT FIREABLE(t1467)))) : A (G ((NOT FIREABLE(t7038) AND NOT FIREABLE(t1123) AND NOT FIREABLE(t5043) AND (FIREABLE(t4486) OR FIREABLE(t2526) OR FIREABLE(t7345) OR NOT FIREABLE(t2103))))) : E (F (((NOT FIREABLE(t7204) OR NOT FIREABLE(t4335)) AND FIREABLE(t6255) AND FIREABLE(t4208)))) : A (G (((NOT FIREABLE(t3265) OR NOT FIREABLE(t3664)) AND (NOT FIREABLE(t1836) OR NOT FIREABLE(t3661) OR NOT FIREABLE(t3860))))) : E (F (((FIREABLE(t3307) OR FIREABLE(t4967)) AND (NOT FIREABLE(t2748) OR (NOT FIREABLE(t2309) AND NOT FIREABLE(t1457)))))) : A (G ((NOT FIREABLE(t7198) OR NOT FIREABLE(t2606) OR FIREABLE(t2625) OR NOT FIREABLE(t2727)))) : A (G ((FIREABLE(t4878) OR NOT FIREABLE(t2863) OR (NOT FIREABLE(t4285) AND FIREABLE(t4307)) OR FIREABLE(t7221))))
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 FIREABLE(t954) AND (FIREABLE(t6036) OR FIREABLE(t887)) AND FIREABLE(t608) AND FIREABLE(t3627))))
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 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability.sara.
lola: sara is running 0 secs || 27678 markings, 52563 edges, 5536 markings/sec, 0 secs
lola: sara is running 5 secs || 53598 markings, 104565 edges, 5184 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 79412 markings, 156730 edges, 5163 markings/sec, 10 secs
lola: sara is running 15 secs || 107109 markings, 209523 edges, 5539 markings/sec, 15 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t7406) AND NOT FIREABLE(t4170) AND FIREABLE(t7225) AND (FIREABLE(t4162) OR FIREABLE(t2750) OR (FIREABLE(t1564) AND FIREABLE(t4846) AND FIREABLE(t5322))))))
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 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 42 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability.sara.
lola: sara is running 0 secs || 28129 markings, 53564 edges, 5626 markings/sec, 0 secs
lola: sara is running 5 secs || 54376 markings, 106212 edges, 5249 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 80839 markings, 159351 edges, 5293 markings/sec, 10 secs
lola: sara is running 15 secs || 107684 markings, 211662 edges, 5369 markings/sec, 15 secs
lola: sara is running 20 secs || 133754 markings, 275773 edges, 5214 markings/sec, 20 secs

lola: sara is running 25 secs || 159938 markings, 328294 edges, 5237 markings/sec, 25 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 249 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t608)))
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 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 268 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t6812) AND NOT FIREABLE(t6101) AND FIREABLE(t1641) AND NOT FIREABLE(t5694))))
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 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-3.sara.
lola: sara is running 0 secs || 27294 markings, 52151 edges, 5459 markings/sec, 0 secs
lola: sara is running 5 secs || 53084 markings, 103570 edges, 5158 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 78877 markings, 155314 edges, 5159 markings/sec, 10 secs
lola: sara is running 15 secs || 106402 markings, 207728 edges, 5505 markings/sec, 15 secs
lola: sara is running 20 secs || 131947 markings, 259010 edges, 5109 markings/sec, 20 secs
lola: sara is running 25 secs || 151611 markings, 311726 edges, 3933 markings/sec, 25 secs
lola: sara is running 30 secs || 178468 markings, 364408 edges, 5371 markings/sec, 30 secs
lola: sara is running 35 secs || 204390 markings, 416104 edges, 5184 markings/sec, 35 secs
lola: sara is running 40 secs || 230173 markings, 468355 edges, 5157 markings/sec, 40 secs
lola: sara is running 45 secs || 257666 markings, 521038 edges, 5499 markings/sec, 45 secs
lola: sara is running 50 secs || 283577 markings, 572721 edges, 5182 markings/sec, 50 secs
lola: sara is running 55 secs || 309508 markings, 624900 edges, 5186 markings/sec, 55 secs
lola: sara is running 60 secs || 337168 markings, 677821 edges, 5532 markings/sec, 60 secs
lola: sara is running 65 secs || 361242 markings, 726135 edges, 4815 markings/sec, 65 secs
lola: sara is running 70 secs || 387127 markings, 777770 edges, 5177 markings/sec, 70 secs
lola: sara is running 75 secs || 412985 markings, 829736 edges, 5172 markings/sec, 75 secs
lola: sara is running 80 secs || 440509 markings, 882953 edges, 5505 markings/sec, 80 secs
lola: sara is running 85 secs || 466516 markings, 934831 edges, 5201 markings/sec, 85 secs
lola: sara is running 90 secs || 486858 markings, 1011504 edges, 4068 markings/sec, 90 secs
lola: sara is running 95 secs || 506696 markings, 1094672 edges, 3968 markings/sec, 95 secs
lola: sara is running 100 secs || 526623 markings, 1178263 edges, 3985 markings/sec, 100 secs
lola: sara is running 105 secs || 542623 markings, 1244957 edges, 3200 markings/sec, 105 secs
lola: sara is running 110 secs || 562848 markings, 1328981 edges, 4045 markings/sec, 110 secs
lola: sara is running 115 secs || 583133 markings, 1413921 edges, 4057 markings/sec, 115 secs
lola: sara is running 120 secs || 603420 markings, 1498823 edges, 4057 markings/sec, 120 secs
lola: sara is running 125 secs || 622121 markings, 1591715 edges, 3740 markings/sec, 125 secs
lola: sara is running 130 secs || 641393 markings, 1675163 edges, 3854 markings/sec, 130 secs
lola: sara is running 135 secs || 660944 markings, 1756969 edges, 3910 markings/sec, 135 secs
lola: sara is running 140 secs || 680342 markings, 1841076 edges, 3880 markings/sec, 140 secs
lola: sara is running 145 secs || 699975 markings, 1923365 edges, 3927 markings/sec, 145 secs
lola: sara is running 150 secs || 718008 markings, 2020061 edges, 3607 markings/sec, 150 secs
lola: sara is running 155 secs || 736745 markings, 2101787 edges, 3747 markings/sec, 155 secs
lola: sara is running 160 secs || 756954 markings, 2170107 edges, 4042 markings/sec, 160 secs
lola: sara is running 165 secs || 777180 markings, 2231128 edges, 4045 markings/sec, 165 secs

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: E (F (FIREABLE(t922)))
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 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-4.sara.
lola: sara is running 0 secs || 28037 markings, 53477 edges, 5607 markings/sec, 0 secs
lola: sara is running 5 secs || 54283 markings, 106111 edges, 5249 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 80712 markings, 159218 edges, 5286 markings/sec, 10 secs
lola: sara is running 15 secs || 108409 markings, 212623 edges, 5539 markings/sec, 15 secs
lola: sara is running 20 secs || 134337 markings, 264545 edges, 5186 markings/sec, 20 secs
lola: sara is running 25 secs || 157219 markings, 309831 edges, 4576 markings/sec, 25 secs
lola: sara is running 30 secs || 183591 markings, 362986 edges, 5274 markings/sec, 30 secs
lola: sara is running 35 secs || 211358 markings, 416385 edges, 5553 markings/sec, 35 secs
lola: sara is running 40 secs || 237571 markings, 468936 edges, 5243 markings/sec, 40 secs
lola: sara is running 45 secs || 264473 markings, 522395 edges, 5380 markings/sec, 45 secs
lola: sara is running 50 secs || 291858 markings, 575810 edges, 5477 markings/sec, 50 secs
lola: sara is running 55 secs || 318069 markings, 628366 edges, 5242 markings/sec, 55 secs
lola: sara is running 60 secs || 345206 markings, 681645 edges, 5427 markings/sec, 60 secs
lola: sara is running 65 secs || 371997 markings, 734442 edges, 5358 markings/sec, 65 secs
lola: sara is running 70 secs || 398203 markings, 786979 edges, 5241 markings/sec, 70 secs
lola: sara is running 75 secs || 424772 markings, 839653 edges, 5314 markings/sec, 75 secs
lola: sara is running 80 secs || 451540 markings, 891788 edges, 5354 markings/sec, 80 secs
lola: sara is running 85 secs || 472276 markings, 940648 edges, 4147 markings/sec, 85 secs
lola: sara is running 90 secs || 492291 markings, 1024525 edges, 4003 markings/sec, 90 secs
lola: sara is running 95 secs || 512373 markings, 1108624 edges, 4016 markings/sec, 95 secs
lola: sara is running 100 secs || 532710 markings, 1193764 edges, 4067 markings/sec, 100 secs
lola: sara is running 105 secs || 553348 markings, 1280026 edges, 4128 markings/sec, 105 secs
lola: sara is running 110 secs || 570495 markings, 1351675 edges, 3429 markings/sec, 110 secs
lola: sara is running 115 secs || 590084 markings, 1433927 edges, 3918 markings/sec, 115 secs
lola: sara is running 120 secs || 610317 markings, 1520213 edges, 4047 markings/sec, 120 secs
lola: sara is running 125 secs || 629086 markings, 1614356 edges, 3754 markings/sec, 125 secs
lola: sara is running 130 secs || 648824 markings, 1698429 edges, 3948 markings/sec, 130 secs
lola: sara is running 135 secs || 668625 markings, 1782423 edges, 3960 markings/sec, 135 secs
lola: sara is running 140 secs || 688512 markings, 1865725 edges, 3977 markings/sec, 140 secs
lola: sara is running 145 secs || 708090 markings, 1950725 edges, 3916 markings/sec, 145 secs
lola: sara is running 150 secs || 726982 markings, 2043552 edges, 3778 markings/sec, 150 secs
lola: sara is running 155 secs || 746700 markings, 2123541 edges, 3944 markings/sec, 155 secs
lola: sara is running 160 secs || 767721 markings, 2188868 edges, 4204 markings/sec, 160 secs
lola: sara is running 165 secs || 792384 markings, 2246698 edges, 4933 markings/sec, 165 secs
lola: sara is running 170 secs || 818712 markings, 2299490 edges, 5266 markings/sec, 170 secs
lola: sara is running 175 secs || 844724 markings, 2351559 edges, 5202 markings/sec, 175 secs
lola: sara is running 180 secs || 871479 markings, 2404200 edges, 5351 markings/sec, 180 secs
lola: sara is running 185 secs || 898331 markings, 2456974 edges, 5370 markings/sec, 185 secs
lola: sara is running 190 secs || 924415 markings, 2509230 edges, 5217 markings/sec, 190 secs
lola: sara is running 195 secs || 951395 markings, 2562583 edges, 5396 markings/sec, 195 secs
lola: sara is running 200 secs || 978669 markings, 2616031 edges, 5455 markings/sec, 200 secs
lola: sara is running 205 secs || 1005071 markings, 2668986 edges, 5280 markings/sec, 205 secs
lola: sara is running 210 secs || 1032555 markings, 2722284 edges, 5497 markings/sec, 210 secs
lola: sara is running 215 secs || 1059415 markings, 2775993 edges, 5372 markings/sec, 215 secs
lola: sara is running 220 secs || 1085731 markings, 2828753 edges, 5263 markings/sec, 220 secs
lola: sara is running 225 secs || 1113454 markings, 2882081 edges, 5545 markings/sec, 225 secs
lola: sara is running 230 secs || 1139717 markings, 2934978 edges, 5253 markings/sec, 230 secs
lola: sara is running 235 secs || 1165983 markings, 2987635 edges, 5253 markings/sec, 235 secs
lola: sara is running 240 secs || 1193893 markings, 3041532 edges, 5582 markings/sec, 240 secs
lola: sara is running 245 secs || 1220330 markings, 3094648 edges, 5287 markings/sec, 245 secs
lola: sara is running 250 secs || 1246545 markings, 3147307 edges, 5243 markings/sec, 250 secs
lola: sara is running 255 secs || 1266758 markings, 3230033 edges, 4043 markings/sec, 255 secs
lola: sara is running 260 secs || 1287014 markings, 3314819 edges, 4051 markings/sec, 260 secs
lola: sara is running 265 secs || 1307495 markings, 3400472 edges, 4096 markings/sec, 265 secs
lola: sara is running 270 secs || 1324599 markings, 3472010 edges, 3421 markings/sec, 270 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t1057) OR NOT FIREABLE(t6818) OR FIREABLE(t6624)) AND NOT FIREABLE(t3456))))
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 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 303 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t6107) AND FIREABLE(t4897)) OR ((FIREABLE(t65) OR FIREABLE(t3952) OR FIREABLE(t4073) OR FIREABLE(t817)) AND FIREABLE(t2075)))))
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 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-6.sara.
lola: sara is running 0 secs || 28499 markings, 53939 edges, 5700 markings/sec, 0 secs
lola: sara is running 5 secs || 54658 markings, 106378 edges, 5232 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 81284 markings, 160766 edges, 5325 markings/sec, 10 secs
lola: sara is running 15 secs || 109581 markings, 214489 edges, 5659 markings/sec, 15 secs
lola: sara is running 20 secs || 136048 markings, 267600 edges, 5293 markings/sec, 20 secs
lola: sara is running 25 secs || 162523 markings, 321624 edges, 5295 markings/sec, 25 secs
lola: sara is running 30 secs || 190864 markings, 375443 edges, 5668 markings/sec, 30 secs
lola: sara is running 35 secs || 217040 markings, 427918 edges, 5235 markings/sec, 35 secs
lola: sara is running 40 secs || 243212 markings, 481404 edges, 5234 markings/sec, 40 secs
lola: sara is running 45 secs || 271154 markings, 534269 edges, 5588 markings/sec, 45 secs
lola: sara is running 50 secs || 297156 markings, 586360 edges, 5200 markings/sec, 50 secs
lola: sara is running 55 secs || 323350 markings, 638870 edges, 5239 markings/sec, 55 secs
lola: sara is running 60 secs || 350381 markings, 692284 edges, 5406 markings/sec, 60 secs
lola: sara is running 65 secs || 377061 markings, 744330 edges, 5336 markings/sec, 65 secs
lola: sara is running 70 secs || 403379 markings, 797112 edges, 5264 markings/sec, 70 secs
lola: sara is running 75 secs || 430090 markings, 851362 edges, 5342 markings/sec, 75 secs

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 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t7161)))
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 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-7.sara.
lola: sara is running 0 secs || 27996 markings, 53398 edges, 5599 markings/sec, 0 secs
lola: sara is running 5 secs || 54236 markings, 105983 edges, 5248 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 10 secs || 80786 markings, 159298 edges, 5310 markings/sec, 10 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t4720) AND FIREABLE(t1563)) OR NOT FIREABLE(t1784) OR (NOT FIREABLE(t648) AND FIREABLE(t7171)) OR FIREABLE(t134))))
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 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 419 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t7372) OR FIREABLE(t2560) OR NOT FIREABLE(t1467))))
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 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-9.sara.
lola: sara is running 0 secs || 27891 markings, 53403 edges, 5578 markings/sec, 0 secs
lola: sara is running 5 secs || 54221 markings, 105976 edges, 5266 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 80131 markings, 158495 edges, 5182 markings/sec, 10 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 486 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t7038) AND NOT FIREABLE(t1123) AND NOT FIREABLE(t5043) AND (FIREABLE(t4486) OR FIREABLE(t2526) OR FIREABLE(t7345) OR NOT FIREABLE(t2103)))))
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 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 17 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 583 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t7204) OR NOT FIREABLE(t4335)) AND FIREABLE(t6255) AND FIREABLE(t4208))))
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 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-11.sara.
lola: sara is running 0 secs || 27693 markings, 53000 edges, 5539 markings/sec, 0 secs
lola: sara is running 5 secs || 53641 markings, 104746 edges, 5190 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 79635 markings, 157004 edges, 5199 markings/sec, 10 secs
lola: sara is running 15 secs || 107142 markings, 210176 edges, 5501 markings/sec, 15 secs
lola: sara is running 20 secs || 132164 markings, 259967 edges, 5004 markings/sec, 20 secs
lola: sara is running 25 secs || 157957 markings, 311412 edges, 5159 markings/sec, 25 secs
lola: sara is running 30 secs || 184120 markings, 363550 edges, 5233 markings/sec, 30 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 720 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t3265) OR NOT FIREABLE(t3664)) AND (NOT FIREABLE(t1836) OR NOT FIREABLE(t3661) OR NOT FIREABLE(t3860)))))
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 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 960 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t3307) OR FIREABLE(t4967)) AND (NOT FIREABLE(t2748) OR (NOT FIREABLE(t2309) AND NOT FIREABLE(t1457))))))
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 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1440 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t7198) OR NOT FIREABLE(t2606) OR FIREABLE(t2625) OR NOT FIREABLE(t2727))))
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 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 2880 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t4878) OR NOT FIREABLE(t2863) OR (NOT FIREABLE(t4285) AND FIREABLE(t4307)) OR FIREABLE(t7221))))
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 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 24 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-15.sara.
lola: sara is running 0 secs || 28089 markings, 53790 edges, 5618 markings/sec, 0 secs
lola: sara is running 5 secs || 54360 markings, 106237 edges, 5254 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 80975 markings, 159510 edges, 5323 markings/sec, 10 secs
lola: sara is running 15 secs || 108405 markings, 212793 edges, 5486 markings/sec, 15 secs
lola: sara is running 20 secs || 134618 markings, 266307 edges, 5243 markings/sec, 20 secs
lola: sara is running 25 secs || 159965 markings, 328314 edges, 5069 markings/sec, 25 secs
lola: sara is running 30 secs || 187823 markings, 381774 edges, 5572 markings/sec, 30 secs
lola: sara is running 35 secs || 213996 markings, 434852 edges, 5235 markings/sec, 35 secs
lola: sara is running 40 secs || 240210 markings, 487190 edges, 5243 markings/sec, 40 secs
lola: sara is running 45 secs || 268182 markings, 540874 edges, 5594 markings/sec, 45 secs
lola: sara is running 50 secs || 294597 markings, 594452 edges, 5283 markings/sec, 50 secs
lola: sara is running 55 secs || 320986 markings, 647615 edges, 5278 markings/sec, 55 secs
lola: sara is running 60 secs || 349010 markings, 701778 edges, 5605 markings/sec, 60 secs
lola: sara is running 65 secs || 375619 markings, 754957 edges, 5322 markings/sec, 65 secs
lola: sara is running 70 secs || 401939 markings, 808353 edges, 5264 markings/sec, 70 secs
lola: sara is running 75 secs || 429857 markings, 861918 edges, 5584 markings/sec, 75 secs
lola: sara is running 80 secs || 456268 markings, 914655 edges, 5282 markings/sec, 80 secs
lola: sara is running 85 secs || 479629 markings, 981331 edges, 4672 markings/sec, 85 secs
lola: sara is running 90 secs || 499569 markings, 1064883 edges, 3988 markings/sec, 90 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes unknown no yes yes yes yes no yes no yes no no
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496502478568

--------------------
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="FlexibleBarrier-PT-22b"
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-22b.tgz
mv FlexibleBarrier-PT-22b 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 FlexibleBarrier-PT-22b, 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 r188-blw3-149581034400180"
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 ;