fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r142-qhx2-152673583800189
Last Updated
June 26, 2018

About the Execution of M4M.full for Railroad-PT-020

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1887.010 607313.00 1182296.00 2598.80 FFT??FFFFTTFFFTT 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 420K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 249K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Railroad-PT-020, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-qhx2-152673583800189
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527959259203


BK_STOP 1527959866516

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using Railroad-PT-020 as instance name.
Using Railroad as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': False, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': None, 'Deadlock': False, 'Reversible': None, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 1180149, 'Memory': 10117.05, 'Tool': 'lola'}, {'Time': 1180185, 'Memory': 10111.4, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola Railroad-PT-020...

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


checking for too many tokens
===========================================================================================
Railroad-PT-020: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ Railroad-PT-020 @ 3538 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 724/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 218 places, 506 transitions, 87 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 132 transition conflict sets
lola: TASK
lola: reading formula from Railroad-PT-020-ReachabilityFireability.task
lola: A (G (((FIREABLE(tr_T34_28) OR FIREABLE(tr_T47_45) OR NOT FIREABLE(tr_T50_14) OR FIREABLE(tr_T47_414)) AND (NOT FIREABLE(tr_T47_423) OR NOT FIREABLE(tr_T47_298) OR FIREABLE(tr_T47_432) OR (FIREABLE(tr_T47_268) AND FIREABLE(tr_T47_51)))))) : E (F ((FIREABLE(tr_T47_46) AND (FIREABLE(tr_T47_299) OR FIREABLE(tr_T47_217) OR FIREABLE(tr_T47_70) OR FIREABLE(tr_T47_274) OR FIREABLE(tr_T47_155))))) : E (F (((NOT FIREABLE(tr_T47_77) AND FIREABLE(tr_T47_310)) OR ((NOT FIREABLE(tr_T47_93) OR NOT FIREABLE(tr_T47_205)) AND FIREABLE(tr_T47_79))))) : A (G (((NOT FIREABLE(tr_T47_435) AND NOT FIREABLE(tr_T34_30)) OR (NOT FIREABLE(tr_T47_332) AND NOT FIREABLE(tr_T47_133)) OR FIREABLE(tr_T47_298) OR NOT FIREABLE(tr_T47_438)))) : E (F ((FIREABLE(tr_T47_162) AND ((FIREABLE(tr_T47_333) AND FIREABLE(tr_T47_302) AND FIREABLE(tr_T47_78)) OR (FIREABLE(tr_T47_276) AND FIREABLE(tr_T47_304) AND FIREABLE(tr_T47_335) AND FIREABLE(tr_T47_290)))))) : A (G ((FIREABLE(tr_T50_11) OR FIREABLE(tr_T47_386) OR NOT FIREABLE(tr_T47_370)))) : E (F ((NOT FIREABLE(tr_T47_402) AND FIREABLE(tr_T47_341) AND (NOT FIREABLE(tr_T47_316) OR FIREABLE(tr_T51_1)) AND FIREABLE(tr_T47_190)))) : A (G (NOT FIREABLE(tr_T47_188))) : A (G (NOT FIREABLE(tr_T47_427))) : A (G ((NOT FIREABLE(tr_T47_400) OR NOT FIREABLE(tr_T34_25) OR NOT FIREABLE(tr_T47_208) OR FIREABLE(tr_T47_283) OR (NOT FIREABLE(tr_T12_1) AND NOT FIREABLE(tr_T47_305))))) : E (F (FIREABLE(tr_T47_62))) : A (G ((FIREABLE(tr_T47_393) OR NOT FIREABLE(tr_T47_109) OR FIREABLE(tr_T8_1)))) : E (F ((NOT FIREABLE(tr_T47_157) AND NOT FIREABLE(tr_T47_48) AND FIREABLE(tr_T47_273) AND NOT FIREABLE(tr_T47_382) AND NOT FIREABLE(tr_T47_72) AND FIREABLE(tr_T47_239)))) : E (F (((FIREABLE(tr_T47_60) OR FIREABLE(tr_T47_317)) AND FIREABLE(tr_T47_290) AND FIREABLE(tr_T47_350)))) : E (F (FIREABLE(tr_T47_79))) : E (F (FIREABLE(tr_T47_193)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(tr_T34_28) OR FIREABLE(tr_T47_45) OR NOT FIREABLE(tr_T50_14) OR FIREABLE(tr_T47_414)) AND (NOT FIREABLE(tr_T47_423) OR NOT FIREABLE(tr_T47_298) OR FIREABLE(tr_T47_432) OR (FIREABLE(tr_T47_268) AND FIREABLE(tr_T47_51))))))
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 348 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 80 literals and 12 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 31 markings, 30 edges
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability.sara
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tr_T47_46) AND (FIREABLE(tr_T47_299) OR FIREABLE(tr_T47_217) OR FIREABLE(tr_T47_70) OR FIREABLE(tr_T47_274) OR FIREABLE(tr_T47_155)))))
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 348 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 30 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(tr_T47_77) AND FIREABLE(tr_T47_310)) OR ((NOT FIREABLE(tr_T47_93) OR NOT FIREABLE(tr_T47_205)) AND FIREABLE(tr_T47_79)))))
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 348 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 20 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-2.sara
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(tr_T47_435) AND NOT FIREABLE(tr_T34_30)) OR (NOT FIREABLE(tr_T47_332) AND NOT FIREABLE(tr_T47_133)) OR FIREABLE(tr_T47_298) OR NOT FIREABLE(tr_T47_438))))
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 348 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 80 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 117036 markings, 177204 edges, 23407 markings/sec, 0 secs
lola: sara is running 5 secs || 244114 markings, 377559 edges, 25416 markings/sec, 5 secs
lola: sara is running 10 secs || 370273 markings, 578161 edges, 25232 markings/sec, 10 secs
lola: sara is running 15 secs || 495778 markings, 779521 edges, 25101 markings/sec, 15 secs
lola: sara is running 20 secs || 620594 markings, 978524 edges, 24963 markings/sec, 20 secs
lola: sara is running 25 secs || 745427 markings, 1178643 edges, 24967 markings/sec, 25 secs
lola: sara is running 30 secs || 870628 markings, 1380105 edges, 25040 markings/sec, 30 secs
lola: sara is running 35 secs || 995930 markings, 1585002 edges, 25060 markings/sec, 35 secs
lola: sara is running 40 secs || 1121449 markings, 1788979 edges, 25104 markings/sec, 40 secs
lola: sara is running 45 secs || 1245835 markings, 1994730 edges, 24877 markings/sec, 45 secs
lola: sara is running 50 secs || 1370383 markings, 2200795 edges, 24910 markings/sec, 50 secs
lola: sara is running 55 secs || 1496190 markings, 2407959 edges, 25161 markings/sec, 55 secs
lola: sara is running 60 secs || 1622270 markings, 2615633 edges, 25216 markings/sec, 60 secs
lola: sara is running 65 secs || 1749272 markings, 2825043 edges, 25400 markings/sec, 65 secs
lola: sara is running 70 secs || 1876854 markings, 3038841 edges, 25516 markings/sec, 70 secs
lola: sara is running 75 secs || 2003896 markings, 3250481 edges, 25408 markings/sec, 75 secs
lola: sara is running 80 secs || 2130185 markings, 3461667 edges, 25258 markings/sec, 80 secs
lola: sara is running 85 secs || 2256069 markings, 3672174 edges, 25177 markings/sec, 85 secs
lola: sara is running 90 secs || 2388321 markings, 3894750 edges, 26450 markings/sec, 90 secs
lola: sara is running 95 secs || 2520085 markings, 4118184 edges, 26353 markings/sec, 95 secs
lola: sara is running 100 secs || 2659577 markings, 4346237 edges, 27898 markings/sec, 100 secs
lola: sara is running 105 secs || 2801419 markings, 4589201 edges, 28368 markings/sec, 105 secs
lola: sara is running 110 secs || 2942616 markings, 4841174 edges, 28239 markings/sec, 110 secs
lola: sara is running 115 secs || 3078819 markings, 5081720 edges, 27241 markings/sec, 115 secs
lola: sara is running 120 secs || 3210955 markings, 5305545 edges, 26427 markings/sec, 120 secs
lola: sara is running 125 secs || 3347773 markings, 5558485 edges, 27364 markings/sec, 125 secs
lola: sara is running 130 secs || 3483721 markings, 5804800 edges, 27190 markings/sec, 130 secs
lola: sara is running 135 secs || 3618438 markings, 6058702 edges, 26943 markings/sec, 135 secs
lola: sara is running 140 secs || 3754976 markings, 6303016 edges, 27308 markings/sec, 140 secs
lola: sara is running 145 secs || 3887149 markings, 6534306 edges, 26435 markings/sec, 145 secs
lola: sara is running 150 secs || 4020619 markings, 6760447 edges, 26694 markings/sec, 150 secs
lola: sara is running 155 secs || 4157728 markings, 6998910 edges, 27422 markings/sec, 155 secs
lola: sara is running 160 secs || 4295568 markings, 7255538 edges, 27568 markings/sec, 160 secs
lola: sara is running 165 secs || 4425613 markings, 7480142 edges, 26009 markings/sec, 165 secs
lola: sara is running 170 secs || 4550445 markings, 7692582 edges, 24966 markings/sec, 170 secs
lola: sara is running 175 secs || 4677899 markings, 7911685 edges, 25491 markings/sec, 175 secs
lola: sara is running 180 secs || 4805564 markings, 8128122 edges, 25533 markings/sec, 180 secs
lola: sara is running 185 secs || 4938906 markings, 8360154 edges, 26668 markings/sec, 185 secs
lola: sara is running 190 secs || 5067724 markings, 8581308 edges, 25764 markings/sec, 190 secs
lola: sara is running 195 secs || 5206128 markings, 8838883 edges, 27681 markings/sec, 195 secs
lola: sara is running 200 secs || 5338890 markings, 9090650 edges, 26552 markings/sec, 200 secs
lola: sara is running 205 secs || 5470306 markings, 9333117 edges, 26283 markings/sec, 205 secs
lola: sara is running 210 secs || 5601941 markings, 9572156 edges, 26327 markings/sec, 210 secs
lola: sara is running 215 secs || 5728626 markings, 9790422 edges, 25337 markings/sec, 215 secs
lola: sara is running 220 secs || 5854478 markings, 10005516 edges, 25170 markings/sec, 220 secs
lola: sara is running 225 secs || 5981454 markings, 10226138 edges, 25395 markings/sec, 225 secs
lola: sara is running 230 secs || 6115109 markings, 10461509 edges, 26731 markings/sec, 230 secs
lola: sara is running 235 secs || 6248230 markings, 10708465 edges, 26624 markings/sec, 235 secs
lola: sara is running 240 secs || 6382106 markings, 10967523 edges, 26775 markings/sec, 240 secs
lola: sara is running 245 secs || 6515945 markings, 11221242 edges, 26768 markings/sec, 245 secs
lola: sara is running 250 secs || 6647562 markings, 11466541 edges, 26323 markings/sec, 250 secs
lola: sara is running 255 secs || 6779747 markings, 11723798 edges, 26437 markings/sec, 255 secs
lola: sara is running 260 secs || 6913031 markings, 11966339 edges, 26657 markings/sec, 260 secs
lola: sara is running 265 secs || 7046569 markings, 12226342 edges, 26708 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tr_T47_162) AND ((FIREABLE(tr_T47_333) AND FIREABLE(tr_T47_302) AND FIREABLE(tr_T47_78)) OR (FIREABLE(tr_T47_276) AND FIREABLE(tr_T47_304) AND FIREABLE(tr_T47_335) AND FIREABLE(tr_T47_290))))))
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 348 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 27 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 119372 markings, 304441 edges, 23874 markings/sec, 0 secs
lola: sara is running 5 secs || 244233 markings, 659546 edges, 24972 markings/sec, 5 secs
lola: sara is running 10 secs || 366094 markings, 1013904 edges, 24372 markings/sec, 10 secs
lola: sara is running 15 secs || 488698 markings, 1376409 edges, 24521 markings/sec, 15 secs
lola: sara is running 20 secs || 609728 markings, 1741507 edges, 24206 markings/sec, 20 secs
lola: sara is running 25 secs || 730047 markings, 2106751 edges, 24064 markings/sec, 25 secs
lola: sara is running 30 secs || 849729 markings, 2470163 edges, 23936 markings/sec, 30 secs
lola: sara is running 35 secs || 968751 markings, 2834512 edges, 23804 markings/sec, 35 secs
lola: sara is running 40 secs || 1086873 markings, 3200273 edges, 23624 markings/sec, 40 secs
lola: sara is running 45 secs || 1204739 markings, 3560999 edges, 23573 markings/sec, 45 secs
lola: sara is running 50 secs || 1321750 markings, 3928333 edges, 23402 markings/sec, 50 secs
lola: sara is running 55 secs || 1437692 markings, 4297095 edges, 23188 markings/sec, 55 secs
lola: sara is running 60 secs || 1553818 markings, 4663399 edges, 23225 markings/sec, 60 secs
lola: sara is running 65 secs || 1671058 markings, 5028342 edges, 23448 markings/sec, 65 secs
lola: sara is running 70 secs || 1788165 markings, 5397628 edges, 23421 markings/sec, 70 secs
lola: sara is running 75 secs || 1904864 markings, 5769601 edges, 23340 markings/sec, 75 secs
lola: sara is running 80 secs || 2020960 markings, 6141697 edges, 23219 markings/sec, 80 secs
lola: sara is running 85 secs || 2135134 markings, 6511313 edges, 22835 markings/sec, 85 secs
lola: sara is running 90 secs || 2250957 markings, 6884030 edges, 23165 markings/sec, 90 secs
lola: sara is running 95 secs || 2365551 markings, 7253473 edges, 22919 markings/sec, 95 secs
lola: sara is running 100 secs || 2480668 markings, 7627445 edges, 23023 markings/sec, 100 secs
lola: sara is running 105 secs || 2595388 markings, 7999753 edges, 22944 markings/sec, 105 secs
lola: sara is running 110 secs || 2708986 markings, 8370643 edges, 22720 markings/sec, 110 secs
lola: sara is running 115 secs || 2822744 markings, 8742590 edges, 22752 markings/sec, 115 secs
lola: sara is running 120 secs || 2936259 markings, 9114930 edges, 22703 markings/sec, 120 secs
lola: sara is running 125 secs || 3045901 markings, 9476649 edges, 21928 markings/sec, 125 secs
lola: sara is running 130 secs || 3153988 markings, 9829960 edges, 21617 markings/sec, 130 secs
lola: sara is running 135 secs || 3260065 markings, 10179014 edges, 21215 markings/sec, 135 secs
lola: sara is running 140 secs || 3364101 markings, 10521951 edges, 20807 markings/sec, 140 secs
lola: sara is running 145 secs || 3466385 markings, 10858249 edges, 20457 markings/sec, 145 secs
lola: sara is running 150 secs || 3566067 markings, 11180667 edges, 19936 markings/sec, 150 secs
lola: sara is running 155 secs || 3674344 markings, 11508067 edges, 21655 markings/sec, 155 secs
lola: sara is running 160 secs || 3783042 markings, 11857442 edges, 21740 markings/sec, 160 secs
lola: sara is running 165 secs || 3887339 markings, 12204311 edges, 20859 markings/sec, 165 secs
lola: sara is running 170 secs || 3991298 markings, 12548451 edges, 20792 markings/sec, 170 secs
lola: sara is running 175 secs || 4098377 markings, 12900743 edges, 21416 markings/sec, 175 secs
lola: sara is running 180 secs || 4204596 markings, 13252453 edges, 21244 markings/sec, 180 secs
lola: sara is running 185 secs || 4311434 markings, 13607473 edges, 21368 markings/sec, 185 secs
lola: sara is running 190 secs || 4417445 markings, 13961292 edges, 21202 markings/sec, 190 secs
lola: sara is running 195 secs || 4519561 markings, 14300555 edges, 20423 markings/sec, 195 secs
lola: sara is running 200 secs || 4625203 markings, 14650586 edges, 21128 markings/sec, 200 secs
lola: sara is running 205 secs || 4731652 markings, 15005365 edges, 21290 markings/sec, 205 secs
lola: sara is running 210 secs || 4837663 markings, 15360417 edges, 21202 markings/sec, 210 secs
lola: sara is running 215 secs || 4943158 markings, 15717178 edges, 21099 markings/sec, 215 secs
lola: sara is running 220 secs || 5048395 markings, 16065925 edges, 21047 markings/sec, 220 secs
lola: sara is running 225 secs || 5152036 markings, 16413969 edges, 20728 markings/sec, 225 secs
lola: sara is running 230 secs || 5258591 markings, 16768704 edges, 21311 markings/sec, 230 secs
lola: sara is running 235 secs || 5363539 markings, 17121647 edges, 20990 markings/sec, 235 secs
lola: sara is running 240 secs || 5469085 markings, 17474315 edges, 21109 markings/sec, 240 secs
lola: sara is running 245 secs || 5575493 markings, 17830184 edges, 21282 markings/sec, 245 secs
lola: sara is running 250 secs || 5679973 markings, 18177060 edges, 20896 markings/sec, 250 secs
lola: sara is running 255 secs || 5781999 markings, 18519555 edges, 20405 markings/sec, 255 secs
lola: sara is running 260 secs || 5888960 markings, 18873964 edges, 21392 markings/sec, 260 secs
lola: sara is running 265 secs || 5995993 markings, 19231076 edges, 21407 markings/sec, 265 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 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(tr_T50_11) OR FIREABLE(tr_T47_386) OR NOT FIREABLE(tr_T47_370))))
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 348 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 20 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 40 markings, 39 edges
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-5.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 6 will run for 299 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(tr_T47_402) AND FIREABLE(tr_T47_341) AND (NOT FIREABLE(tr_T47_316) OR FIREABLE(tr_T51_1)) AND FIREABLE(tr_T47_190))))
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 348 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 34 literals and 4 conjunctive subformulas
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-5.sara.
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-6.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 332 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(tr_T47_188)))
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 348 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: ========================================
lola: subprocess 8 will run for 373 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(tr_T47_427)))
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 348 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 46 markings, 45 edges
lola: ========================================
lola: subprocess 9 will run for 427 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(tr_T47_400) OR NOT FIREABLE(tr_T34_25) OR NOT FIREABLE(tr_T47_208) OR FIREABLE(tr_T47_283) OR (NOT FIREABLE(tr_T12_1) AND NOT FIREABLE(tr_T47_305)))))
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 348 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 50 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-9.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 497 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T47_62)))
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 348 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 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-10.sara
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 11 will run for 597 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(tr_T47_393) OR NOT FIREABLE(tr_T47_109) OR FIREABLE(tr_T8_1))))
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 348 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 30 literals and 6 conjunctive subformulas
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-10.sara.
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-11.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 12 will run for 746 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(tr_T47_157) AND NOT FIREABLE(tr_T47_48) AND FIREABLE(tr_T47_273) AND NOT FIREABLE(tr_T47_382) AND NOT FIREABLE(tr_T47_72) AND FIREABLE(tr_T47_239))))
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 348 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
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-11.sara.
lola: state equation: Generated DNF with 160 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-12.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 13 will run for 995 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(tr_T47_60) OR FIREABLE(tr_T47_317)) AND FIREABLE(tr_T47_290) AND FIREABLE(tr_T47_350))))
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 348 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 18 literals and 2 conjunctive subformulas
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-12.sara.
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic


lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1492 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T47_79)))
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 348 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 15 will run for 2984 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T47_193)))
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 348 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 3 literals and 1 conjunctive subformulas
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-14.sara.
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 29 markings, 28 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes unknown unknown no no no no yes yes no no no yes yes
sara: place or transition ordering is non-deterministic

FORMULA Railroad-PT-020-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- 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="Railroad-PT-020"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="mcc4mcc-full"
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/Railroad-PT-020.tgz
mv Railroad-PT-020 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 mcc4mcc-full"
echo " Input is Railroad-PT-020, 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 r142-qhx2-152673583800189"
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 ;