fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r070-smll-152649743100311
Last Updated
June 26, 2018

About the Execution of M4M.full for DNAwalker-PT-13ringRLLarge

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2093.430 550170.00 514382.00 1846.40 TFFFTTTTT?FFTFTF 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 304K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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.8K 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 14 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 135K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is DNAwalker-PT-13ringRLLarge, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-smll-152649743100311
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526766025828


BK_STOP 1526766575998

--------------------
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 DNAwalker-PT-13ringRLLarge as instance name.
Using DNAwalker as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': None, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': None, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 138932, 'Memory': 9671.25, 'Tool': 'marcie'}, {'Time': 143622, 'Memory': 9671.41, 'Tool': 'marcie'}, {'Time': 306618, 'Memory': 2846.91, 'Tool': 'itstools'}, {'Time': 314640, 'Memory': 2857.11, 'Tool': 'itstools'}, {'Time': 1332653, 'Memory': 7152.3, 'Tool': 'lola'}, {'Time': 1332740, 'Memory': 7175.24, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 9.592124204646877x far from the best tool marcie.
CTLCardinality lola DNAwalker-PT-13ringRLLarge...

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


checking for too many tokens
===========================================================================================
DNAwalker-PT-13ringRLLarge: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ DNAwalker-PT-13ringRLLarge @ 3540 seconds
----- Start make result stderr -----
----- 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: 345/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 33 places, 312 transitions, 33 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 197 transition conflict sets
lola: TASK
lola: reading formula from DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: E (F ((((2 <= A22) OR (A27 <= B5) OR (A27 <= A16)) AND E (G ((1 <= B18)))))) : (A (F (A (X ((3 <= A4))))) AND E (F (A (F ((B18 <= A14)))))) : A (F (A (F (((A17 <= B16) AND (1 <= A17)))))) : A (X ((A (G ((1 <= A24))) OR ((B16 + 1 <= A23) OR (A4 <= 0))))) : NOT(NOT(E (G (((A18 <= A12) OR (1 <= A6)))))) : E (G ((E (X ((A23 <= A2))) OR A (F ((A22 <= A18)))))) : E (X (E (G ((B16 <= 0))))) : NOT(A (G (A (F ((2 <= A11)))))) : (E (G (((A23 <= 2) OR (A18 + 1 <= A19)))) OR (B4 <= A17)) : (NOT(E (((1 <= A3) U (2 <= A5)))) OR E ((((1 <= A7) OR (A20 <= B17)) U ((1 <= A1) AND (2 <= A2))))) : (A (F (A (G ((3 <= A11))))) AND E (G (A (F ((A23 <= A11)))))) : E (X (A (F ((3 <= A22))))) : (E ((((2 <= A7) OR (3 <= B16)) U (A4 <= A19))) AND NOT(A (F (((2 <= A21) OR (A24 <= A5)))))) : A ((E (X ((1 <= A2))) U A (X ((2 <= A17))))) : NOT(A (F ((2 <= A5)))) : (A (F (((A10 <= 0) AND (A13 + 1 <= A10)))) AND ((A17 <= A12) OR (2 <= A2)))
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 ((((2 <= A22) OR (A27 <= B5) OR (A27 <= A16)) AND E (G ((1 <= B18))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (((2 <= A22) OR (A27 <= B5) OR (A27 <= A16)) AND NOT(A(TRUE U (B18 <= 0)))))
lola: processed formula length: 87
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 19 markings, 20 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (X ((3 <= A4))))) AND E (F (A (F ((B18 <= A14))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((3 <= A4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((3 <= A4)))
lola: processed formula length: 23
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 13 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (F (((A17 <= B16) AND (1 <= A17))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((A17 <= B16) AND (1 <= A17))))
lola: processed formula: A (F (((A17 <= B16) AND (1 <= A17))))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((A (G ((1 <= A24))) OR ((B16 + 1 <= A23) OR (A4 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((A (G ((1 <= A24))) OR ((B16 + 1 <= A23) OR (A4 <= 0)))))
lola: processed formula: A (X ((A (G ((1 <= A24))) OR ((B16 + 1 <= A23) OR (A4 <= 0)))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 38 markings, 38 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(E (G (((A18 <= A12) OR (1 <= A6))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((A12 + 1 <= A18) AND (A6 <= 0))))
lola: processed formula length: 47
lola: 8 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (X ((A23 <= A2))) OR A (F ((A22 <= A18))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(EX((A23 <= A2))) AND NOT(A(TRUE U (A22 <= A18))))))
lola: processed formula length: 69
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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 2 significant temporal operators and needs 9 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((B16 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U (1 <= B16))))
lola: processed formula length: 29
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 34 markings, 34 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (A (F ((2 <= A11))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (2 <= A11))))
lola: processed formula length: 35
lola: 8 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 13 markings, 14 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((A23 <= 2) OR (A18 + 1 <= A19)))) OR (B4 <= A17))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((A23 <= 2) OR (A18 + 1 <= A19))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((3 <= A23) AND (A19 <= A18))))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 13 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (((1 <= A3) U (2 <= A5)))) OR E ((((1 <= A7) OR (A20 <= B17)) U ((1 <= A1) AND (2 <= A2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((A3 <= 0) R (A5 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((A3 <= 0) R (A5 <= 1)))
lola: processed formula: A (((A3 <= 0) R (A5 <= 1)))
lola: processed formula length: 27
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 159331 markings, 406606 edges, 31866 markings/sec, 0 secs
lola: 292619 markings, 819857 edges, 26658 markings/sec, 5 secs
lola: 435703 markings, 1240089 edges, 28617 markings/sec, 10 secs
lola: 577914 markings, 1694234 edges, 28442 markings/sec, 15 secs
lola: 727481 markings, 2079666 edges, 29913 markings/sec, 20 secs
lola: 863390 markings, 2460065 edges, 27182 markings/sec, 25 secs
lola: 994232 markings, 2916461 edges, 26168 markings/sec, 30 secs
lola: 1141884 markings, 3327241 edges, 29530 markings/sec, 35 secs
lola: 1289307 markings, 3701591 edges, 29485 markings/sec, 40 secs
lola: 1428726 markings, 4103646 edges, 27884 markings/sec, 45 secs
lola: 1568637 markings, 4517863 edges, 27982 markings/sec, 50 secs
lola: 1708818 markings, 4955866 edges, 28036 markings/sec, 55 secs
lola: 1858628 markings, 5341857 edges, 29962 markings/sec, 60 secs
lola: 1996313 markings, 5713605 edges, 27537 markings/sec, 65 secs
lola: 2128454 markings, 6144159 edges, 26428 markings/sec, 70 secs
lola: 2269388 markings, 6571960 edges, 28187 markings/sec, 75 secs
lola: 2419366 markings, 6946816 edges, 29996 markings/sec, 80 secs
lola: 2555305 markings, 7349569 edges, 27188 markings/sec, 85 secs
lola: 2696509 markings, 7748158 edges, 28241 markings/sec, 90 secs
lola: 2832025 markings, 8157558 edges, 27103 markings/sec, 95 secs
lola: 2976176 markings, 8577174 edges, 28830 markings/sec, 100 secs
lola: 3116530 markings, 8932499 edges, 28071 markings/sec, 105 secs
lola: 3246593 markings, 9314263 edges, 26013 markings/sec, 110 secs
lola: 3373320 markings, 9773409 edges, 25345 markings/sec, 115 secs
lola: 3528548 markings, 10154631 edges, 31046 markings/sec, 120 secs
lola: 3672503 markings, 10528982 edges, 28791 markings/sec, 125 secs
lola: 3809860 markings, 10923260 edges, 27471 markings/sec, 130 secs
lola: 3947797 markings, 11330783 edges, 27587 markings/sec, 135 secs
lola: 4083006 markings, 11753449 edges, 27042 markings/sec, 140 secs
lola: 4221279 markings, 12193378 edges, 27655 markings/sec, 145 secs
lola: 4348634 markings, 12656095 edges, 25471 markings/sec, 150 secs
lola: 4496214 markings, 13012597 edges, 29516 markings/sec, 155 secs
lola: 4649846 markings, 13391450 edges, 30726 markings/sec, 160 secs
lola: 4787491 markings, 13776421 edges, 27529 markings/sec, 165 secs
lola: 4927526 markings, 14185815 edges, 28007 markings/sec, 170 secs
lola: 5066318 markings, 14580773 edges, 27758 markings/sec, 175 secs
lola: 5207517 markings, 15008937 edges, 28240 markings/sec, 180 secs
lola: 5349327 markings, 15356206 edges, 28362 markings/sec, 185 secs
lola: 5478654 markings, 15723456 edges, 25865 markings/sec, 190 secs
lola: 5604863 markings, 16171235 edges, 25242 markings/sec, 195 secs
lola: 5753755 markings, 16562003 edges, 29778 markings/sec, 200 secs
lola: 5900506 markings, 16924830 edges, 29350 markings/sec, 205 secs
lola: 6036755 markings, 17319178 edges, 27250 markings/sec, 210 secs
lola: 6177730 markings, 17713547 edges, 28195 markings/sec, 215 secs
lola: 6313144 markings, 18113149 edges, 27083 markings/sec, 220 secs
lola: 6452889 markings, 18539883 edges, 27949 markings/sec, 225 secs
lola: 6596047 markings, 18891942 edges, 28632 markings/sec, 230 secs
lola: 6727964 markings, 19261750 edges, 26383 markings/sec, 235 secs
lola: 6854513 markings, 19689169 edges, 25310 markings/sec, 240 secs
lola: 6993545 markings, 20092137 edges, 27806 markings/sec, 245 secs
lola: 7142060 markings, 20453605 edges, 29703 markings/sec, 250 secs
lola: 7277932 markings, 20828692 edges, 27174 markings/sec, 255 secs
lola: 7417983 markings, 21228786 edges, 28010 markings/sec, 260 secs
lola: 7551051 markings, 21616485 edges, 26614 markings/sec, 265 secs
lola: 7689260 markings, 22034499 edges, 27642 markings/sec, 270 secs
lola: 7831230 markings, 22410208 edges, 28394 markings/sec, 275 secs
lola: 7963578 markings, 22769211 edges, 26470 markings/sec, 280 secs
lola: 8093009 markings, 23142208 edges, 25886 markings/sec, 285 secs
lola: 8210011 markings, 23574647 edges, 23400 markings/sec, 290 secs
lola: 8355964 markings, 23937873 edges, 29191 markings/sec, 295 secs
lola: 8496966 markings, 24294575 edges, 28200 markings/sec, 300 secs
lola: 8628942 markings, 24671792 edges, 26395 markings/sec, 305 secs
lola: 8762705 markings, 25064554 edges, 26753 markings/sec, 310 secs
lola: 8894300 markings, 25454255 edges, 26319 markings/sec, 315 secs
lola: 9024926 markings, 25875373 edges, 26125 markings/sec, 320 secs
lola: 9159162 markings, 26316169 edges, 26847 markings/sec, 325 secs
lola: 9282577 markings, 26815345 edges, 24683 markings/sec, 330 secs
lola: 9422434 markings, 27181080 edges, 27971 markings/sec, 335 secs
lola: 9546237 markings, 27610004 edges, 24761 markings/sec, 340 secs
lola: 9666548 markings, 28077060 edges, 24062 markings/sec, 345 secs
lola: 9782661 markings, 28550185 edges, 23223 markings/sec, 350 secs
lola: 9902104 markings, 29067686 edges, 23889 markings/sec, 355 secs
lola: 10021126 markings, 29553329 edges, 23804 markings/sec, 360 secs
lola: 10132926 markings, 30072917 edges, 22360 markings/sec, 365 secs
lola: 10245492 markings, 30590973 edges, 22513 markings/sec, 370 secs
lola: 10354876 markings, 31110877 edges, 21877 markings/sec, 375 secs
lola: 10474160 markings, 31587584 edges, 23857 markings/sec, 380 secs
lola: 10587480 markings, 32059137 edges, 22664 markings/sec, 385 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10622689 markings, 32162933 edges
lola: ========================================
lola: subprocess 10 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= A7) OR (A20 <= B17)) U ((1 <= A1) AND (2 <= A2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((1 <= A7) OR (A20 <= B17)) U ((1 <= A1) AND (2 <= A2)))
lola: processed formula length: 59
lola: 5 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: 877810 markings, 3113552 edges, 2169980068221157376 markings/sec, 0 secs
lola: 1664549 markings, 5984287 edges, 157348 markings/sec, 5 secs
lola: 2410796 markings, 8707088 edges, 149249 markings/sec, 10 secs
lola: 3134785 markings, 11486289 edges, 144798 markings/sec, 15 secs
lola: 3840289 markings, 14081023 edges, 141101 markings/sec, 20 secs
lola: 4537620 markings, 16753333 edges, 139466 markings/sec, 25 secs
lola: 5232075 markings, 19322113 edges, 138891 markings/sec, 30 secs
lola: 5910149 markings, 22023153 edges, 135615 markings/sec, 35 secs
lola: 6617834 markings, 24533905 edges, 141537 markings/sec, 40 secs
lola: 7300342 markings, 27028481 edges, 136502 markings/sec, 45 secs
lola: 7988776 markings, 29568658 edges, 137687 markings/sec, 50 secs
lola: 8648669 markings, 32083791 edges, 131979 markings/sec, 55 secs
lola: 9269698 markings, 34619589 edges, 124206 markings/sec, 60 secs
lola: 9931751 markings, 37057650 edges, 132411 markings/sec, 65 secs
lola: 10559847 markings, 39457359 edges, 125619 markings/sec, 70 secs
lola: 11198507 markings, 41983572 edges, 127732 markings/sec, 75 secs
lola: 11800839 markings, 44439373 edges, 120466 markings/sec, 80 secs
lola: 12518970 markings, 47342907 edges, 143626 markings/sec, 85 secs
lola: 13174678 markings, 50397854 edges, 131142 markings/sec, 90 secs
lola: 13822382 markings, 53533342 edges, 129541 markings/sec, 95 secs
lola: 14429068 markings, 56629615 edges, 121337 markings/sec, 100 secs
lola: 14983835 markings, 59504621 edges, 110953 markings/sec, 105 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (G ((3 <= A11))))) AND E (G (A (F ((A23 <= A11))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((3 <= A11)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((3 <= A11)))))
lola: processed formula: A (F (A (G ((3 <= A11)))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 607 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((3 <= A22)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (3 <= A22)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 274 markings, 303 edges
lola: ========================================
lola: subprocess 12 will run for 758 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((2 <= A7) OR (3 <= B16)) U (A4 <= A19))) AND NOT(A (F (((2 <= A21) OR (A24 <= A5))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 758 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((2 <= A7) OR (3 <= B16)) U (A4 <= A19)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((2 <= A7) OR (3 <= B16)) U (A4 <= A19))
lola: processed formula length: 43
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1011 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((A21 <= 1) AND (A5 + 1 <= A24))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= A21) OR (A24 <= A5))))
lola: processed formula length: 43
lola: 5 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 23 markings, 23 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1011 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (X ((1 <= A2))) U A (X ((2 <= A17)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(EX((1 <= A2)) U AX((2 <= A17)))
lola: processed formula length: 33
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 14 will run for 1517 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((2 <= A5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= A5)))
lola: processed formula length: 24
lola: 5 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 15 will run for 3035 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((A10 <= 0) AND (A13 + 1 <= A10)))) AND ((A17 <= A12) OR (2 <= A2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3035 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((A10 <= 0) AND (A13 + 1 <= A10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((A10 <= 0) AND (A13 + 1 <= A10))))
lola: processed formula: A (F (((A10 <= 0) AND (A13 + 1 <= A10))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes yes yes yes yes unknown no no yes no yes no
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

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="DNAwalker-PT-13ringRLLarge"
export BK_EXAMINATION="CTLCardinality"
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/DNAwalker-PT-13ringRLLarge.tgz
mv DNAwalker-PT-13ringRLLarge 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 DNAwalker-PT-13ringRLLarge, 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 r070-smll-152649743100311"
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 ;