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 300K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 7.9K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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 141K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is FlexibleBarrier-PT-06b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r090-blw7-152650001100126
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1527056399035


BK_STOP 1527057098867

--------------------
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 FlexibleBarrier-PT-06b as instance name.
Using FlexibleBarrier 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': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 675, 'Memory': 111.41, 'Tool': 'lola'}, {'Time': 20020, 'Memory': 919.88, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola FlexibleBarrier-PT-06b...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-06b: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityFireability @ FlexibleBarrier-PT-06b @ 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: 1163/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 542 places, 621 transitions, 534 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 635 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-06b-ReachabilityFireability.task
lola: A (G (NOT FIREABLE(t318))) : E (F (((NOT FIREABLE(t198) OR NOT FIREABLE(t597)) AND FIREABLE(t267) AND NOT FIREABLE(t535)))) : E (F ((FIREABLE(t478) AND FIREABLE(t437) AND (FIREABLE(t386) OR FIREABLE(t552)) AND (FIREABLE(t90) OR FIREABLE(t7) OR NOT FIREABLE(t103)) AND (NOT FIREABLE(t499) OR NOT FIREABLE(t378) OR FIREABLE(t100))))) : A (G ((NOT FIREABLE(t350) AND NOT FIREABLE(t379)))) : E (F (((NOT FIREABLE(t135) OR FIREABLE(t252)) AND FIREABLE(t341)))) : A (G ((NOT FIREABLE(t103) OR NOT FIREABLE(t19) OR NOT FIREABLE(t17) OR (NOT FIREABLE(t272) AND NOT FIREABLE(t140))))) : A (G (((FIREABLE(t548) AND FIREABLE(t397)) OR NOT FIREABLE(t357)))) : A (G ((((NOT FIREABLE(t364) AND NOT FIREABLE(t4)) OR (NOT FIREABLE(t331) AND NOT FIREABLE(t458))) AND (NOT FIREABLE(t468) OR FIREABLE(t233))))) : E (F ((NOT FIREABLE(t335) AND FIREABLE(t531)))) : A (G ((NOT FIREABLE(t282) OR NOT FIREABLE(t329) OR NOT FIREABLE(t396) OR (NOT FIREABLE(t614) AND (NOT FIREABLE(t318) OR NOT FIREABLE(t200)))))) : E (F (FIREABLE(t268))) : E (F (FIREABLE(t470))) : A (G (NOT FIREABLE(t368))) : A (G ((NOT FIREABLE(t41) OR NOT FIREABLE(t75) OR FIREABLE(t398) OR (NOT FIREABLE(t318) AND NOT FIREABLE(t339) AND NOT FIREABLE(t165))))) : E (F (FIREABLE(t73))) : E (F (((FIREABLE(t73) OR FIREABLE(t12)) AND (FIREABLE(t325) OR FIREABLE(t491)))))
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 (NOT FIREABLE(t318)))
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 68 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 24 markings, 23 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t198) OR NOT FIREABLE(t597)) AND FIREABLE(t267) AND NOT FIREABLE(t535))))
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 68 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 24 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-06b-ReachabilityFireability.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 34 markings, 33 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t478) AND FIREABLE(t437) AND (FIREABLE(t386) OR FIREABLE(t552)) AND (FIREABLE(t90) OR FIREABLE(t7) OR NOT FIREABLE(t103)) AND (NOT FIREABLE(t499) OR NOT FIREABLE(t378) OR FIREABLE(t100)))))
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 68 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 99 literals and 18 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-06b-ReachabilityFireability-2.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 44 markings, 43 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t350) AND NOT FIREABLE(t379))))
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 68 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-06b-ReachabilityFireability-3.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 24 markings, 23 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t135) OR FIREABLE(t252)) AND FIREABLE(t341))))
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 68 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-06b-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 226 markings, 225 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t103) OR NOT FIREABLE(t19) OR NOT FIREABLE(t17) OR (NOT FIREABLE(t272) AND NOT FIREABLE(t140)))))
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 68 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-06b-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-06b-ReachabilityFireability-5.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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t548) AND FIREABLE(t397)) OR NOT FIREABLE(t357))))
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 68 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-06b-ReachabilityFireability-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(t364) AND NOT FIREABLE(t4)) OR (NOT FIREABLE(t331) AND NOT FIREABLE(t458))) AND (NOT FIREABLE(t468) OR FIREABLE(t233)))))
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 68 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-06b-ReachabilityFireability-7.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 32 markings, 31 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t335) AND FIREABLE(t531))))
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 68 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
sara: try reading problem file FlexibleBarrier-PT-06b-ReachabilityFireability-7.sara.
lola: state equation: write sara problem file to FlexibleBarrier-PT-06b-ReachabilityFireability-8.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 184 markings, 183 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t282) OR NOT FIREABLE(t329) OR NOT FIREABLE(t396) OR (NOT FIREABLE(t614) AND (NOT FIREABLE(t318) OR NOT FIREABLE(t200))))))
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 68 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 9 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-06b-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-06b-ReachabilityFireability-9.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: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t268)))
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 68 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-06b-ReachabilityFireability-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 35 markings, 34 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t470)))
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 68 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-06b-ReachabilityFireability-11.sara
sara: try reading problem file FlexibleBarrier-PT-06b-ReachabilityFireability-10.sara.
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-06b-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 31 markings, 30 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t368)))
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 68 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-06b-ReachabilityFireability-12.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 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t41) OR NOT FIREABLE(t75) OR FIREABLE(t398) OR (NOT FIREABLE(t318) AND NOT FIREABLE(t339) AND NOT FIREABLE(t165)))))
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 68 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-06b-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-06b-ReachabilityFireability-13.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: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t73)))
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 68 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-06b-ReachabilityFireability-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t73) OR FIREABLE(t12)) AND (FIREABLE(t325) OR FIREABLE(t491)))))
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 68 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-06b-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-06b-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic

sara: warning, failure of lp_solve (at job 377)
lola: sara is running 0 secs || 567700 markings, 1294463 edges, 113540 markings/sec, 0 secs
lola: sara is running 5 secs || 1131409 markings, 2615447 edges, 112742 markings/sec, 5 secs
lola: sara is running 10 secs || 1656152 markings, 3955660 edges, 104949 markings/sec, 10 secs
lola: sara is running 15 secs || 2090899 markings, 5325943 edges, 86949 markings/sec, 15 secs
lola: sara is running 20 secs || 2646266 markings, 6683117 edges, 111073 markings/sec, 20 secs
lola: sara is running 25 secs || 3198197 markings, 7983350 edges, 110386 markings/sec, 25 secs
lola: sara is running 30 secs || 3738872 markings, 9334820 edges, 108135 markings/sec, 30 secs
lola: sara is running 35 secs || 4174263 markings, 10705744 edges, 87078 markings/sec, 35 secs
lola: sara is running 40 secs || 4725670 markings, 12070469 edges, 110281 markings/sec, 40 secs
lola: sara is running 45 secs || 5285095 markings, 13388737 edges, 111885 markings/sec, 45 secs
lola: sara is running 50 secs || 5811192 markings, 14686290 edges, 105219 markings/sec, 50 secs
lola: sara is running 55 secs || 6190808 markings, 15671990 edges, 75923 markings/sec, 55 secs
lola: sara is running 60 secs || 6690091 markings, 17086796 edges, 99857 markings/sec, 60 secs
lola: sara is running 65 secs || 7250911 markings, 18391654 edges, 112164 markings/sec, 65 secs
lola: sara is running 70 secs || 7778143 markings, 19770913 edges, 105446 markings/sec, 70 secs
lola: sara is running 75 secs || 8255299 markings, 21134225 edges, 95431 markings/sec, 75 secs
lola: sara is running 80 secs || 8812201 markings, 22450408 edges, 111380 markings/sec, 80 secs
lola: sara is running 85 secs || 9357470 markings, 23796936 edges, 109054 markings/sec, 85 secs
lola: sara is running 90 secs || 9806205 markings, 25185262 edges, 89747 markings/sec, 90 secs
lola: sara is running 95 secs || 10363143 markings, 26503588 edges, 111388 markings/sec, 95 secs
lola: sara is running 100 secs || 10922680 markings, 27811257 edges, 111907 markings/sec, 100 secs
lola: sara is running 105 secs || 11436959 markings, 29153839 edges, 102856 markings/sec, 105 secs
lola: sara is running 110 secs || 11929735 markings, 30466725 edges, 98555 markings/sec, 110 secs
lola: sara is running 115 secs || 12479837 markings, 31671062 edges, 110020 markings/sec, 115 secs
lola: sara is running 120 secs || 13018963 markings, 32854809 edges, 107825 markings/sec, 120 secs
lola: sara is running 125 secs || 13551301 markings, 34091929 edges, 106468 markings/sec, 125 secs
lola: sara is running 130 secs || 14047974 markings, 35326504 edges, 99335 markings/sec, 130 secs
lola: sara is running 135 secs || 14617845 markings, 36538624 edges, 113974 markings/sec, 135 secs
lola: sara is running 140 secs || 15183910 markings, 37701046 edges, 113213 markings/sec, 140 secs
lola: sara is running 145 secs || 15740241 markings, 38900544 edges, 111266 markings/sec, 145 secs
lola: sara is running 150 secs || 16281829 markings, 40108796 edges, 108318 markings/sec, 150 secs
lola: sara is running 155 secs || 16778173 markings, 41317000 edges, 99269 markings/sec, 155 secs
lola: sara is running 160 secs || 17335554 markings, 42523144 edges, 111476 markings/sec, 160 secs
lola: sara is running 165 secs || 17882695 markings, 43717212 edges, 109428 markings/sec, 165 secs
lola: sara is running 170 secs || 18443819 markings, 45030620 edges, 112225 markings/sec, 170 secs
lola: sara is running 175 secs || 18997104 markings, 46343335 edges, 110657 markings/sec, 175 secs
lola: sara is running 180 secs || 19528918 markings, 47603387 edges, 106363 markings/sec, 180 secs
lola: sara is running 185 secs || 20051938 markings, 48885895 edges, 104604 markings/sec, 185 secs
lola: sara is running 190 secs || 20554747 markings, 50121176 edges, 100562 markings/sec, 190 secs
lola: sara is running 195 secs || 21066674 markings, 51421612 edges, 102385 markings/sec, 195 secs
lola: sara is running 200 secs || 21503402 markings, 52540728 edges, 87346 markings/sec, 200 secs
lola: sara is running 205 secs || 21970191 markings, 53721964 edges, 93358 markings/sec, 205 secs
lola: sara is running 210 secs || 22472965 markings, 54889262 edges, 100555 markings/sec, 210 secs
lola: sara is running 215 secs || 22964888 markings, 56085886 edges, 98385 markings/sec, 215 secs
lola: sara is running 220 secs || 23439139 markings, 57394261 edges, 94850 markings/sec, 220 secs
lola: sara is running 225 secs || 23899948 markings, 58766016 edges, 92162 markings/sec, 225 secs
lola: sara is running 230 secs || 24329584 markings, 60115220 edges, 85927 markings/sec, 230 secs
lola: sara is running 235 secs || 24818118 markings, 61451727 edges, 97707 markings/sec, 235 secs
lola: sara is running 240 secs || 25304714 markings, 62716622 edges, 97319 markings/sec, 240 secs
lola: sara is running 245 secs || 25767223 markings, 64060644 edges, 92502 markings/sec, 245 secs
lola: sara is running 250 secs || 26245061 markings, 65414137 edges, 95568 markings/sec, 250 secs
lola: sara is running 255 secs || 26728233 markings, 66804888 edges, 96634 markings/sec, 255 secs
lola: sara is running 260 secs || 27224097 markings, 68207464 edges, 99173 markings/sec, 260 secs
lola: sara is running 265 secs || 27696498 markings, 69564352 edges, 94480 markings/sec, 265 secs
lola: sara is running 270 secs || 28092483 markings, 70825210 edges, 79197 markings/sec, 270 secs
lola: sara is running 275 secs || 28488473 markings, 72060963 edges, 79198 markings/sec, 275 secs
lola: sara is running 280 secs || 29029682 markings, 73240104 edges, 108242 markings/sec, 280 secs
lola: sara is running 285 secs || 29577290 markings, 74490122 edges, 109522 markings/sec, 285 secs
lola: sara is running 290 secs || 30138254 markings, 75803111 edges, 112193 markings/sec, 290 secs
lola: sara is running 295 secs || 30671986 markings, 77058507 edges, 106746 markings/sec, 295 secs
lola: sara is running 300 secs || 31205172 markings, 78357198 edges, 106637 markings/sec, 300 secs
lola: sara is running 305 secs || 31703084 markings, 79601986 edges, 99582 markings/sec, 305 secs
lola: sara is running 310 secs || 32223714 markings, 80883424 edges, 104126 markings/sec, 310 secs
lola: sara is running 315 secs || 32697008 markings, 82090031 edges, 94659 markings/sec, 315 secs
lola: sara is running 320 secs || 33152655 markings, 83264569 edges, 91129 markings/sec, 320 secs
lola: sara is running 325 secs || 33642913 markings, 84444382 edges, 98052 markings/sec, 325 secs
lola: sara is running 330 secs || 34142713 markings, 85603989 edges, 99960 markings/sec, 330 secs
lola: sara is running 335 secs || 34627680 markings, 86886900 edges, 96993 markings/sec, 335 secs
lola: sara is running 340 secs || 35078107 markings, 88235408 edges, 90085 markings/sec, 340 secs
lola: sara is running 345 secs || 35525386 markings, 89581926 edges, 89456 markings/sec, 345 secs
lola: sara is running 350 secs || 35981070 markings, 90912237 edges, 91137 markings/sec, 350 secs
lola: sara is running 355 secs || 36475550 markings, 92199820 edges, 98896 markings/sec, 355 secs
lola: sara is running 360 secs || 36936514 markings, 93498058 edges, 92193 markings/sec, 360 secs
lola: sara is running 365 secs || 37413315 markings, 94864120 edges, 95360 markings/sec, 365 secs
lola: sara is running 370 secs || 37882157 markings, 96212963 edges, 93768 markings/sec, 370 secs
lola: sara is running 375 secs || 38382710 markings, 97622441 edges, 100111 markings/sec, 375 secs
lola: sara is running 380 secs || 38863449 markings, 98986439 edges, 96148 markings/sec, 380 secs
lola: sara is running 385 secs || 39299807 markings, 100304812 edges, 87272 markings/sec, 385 secs
lola: sara is running 390 secs || 39655335 markings, 101533925 edges, 71106 markings/sec, 390 secs
lola: sara is running 395 secs || 40170095 markings, 102725041 edges, 102952 markings/sec, 395 secs
lola: sara is running 400 secs || 40706092 markings, 103939982 edges, 107199 markings/sec, 400 secs
lola: sara is running 405 secs || 41263074 markings, 105246937 edges, 111396 markings/sec, 405 secs
lola: sara is running 410 secs || 41809848 markings, 106504197 edges, 109355 markings/sec, 410 secs
lola: sara is running 415 secs || 42345251 markings, 107807254 edges, 107081 markings/sec, 415 secs
lola: sara is running 420 secs || 42854046 markings, 109067442 edges, 101759 markings/sec, 420 secs
lola: sara is running 425 secs || 43370798 markings, 110329637 edges, 103350 markings/sec, 425 secs
lola: sara is running 430 secs || 43868523 markings, 111610137 edges, 99545 markings/sec, 430 secs
lola: sara is running 435 secs || 44333256 markings, 112782636 edges, 92947 markings/sec, 435 secs
lola: sara is running 440 secs || 44801358 markings, 113967550 edges, 93620 markings/sec, 440 secs
lola: sara is running 445 secs || 45308535 markings, 115095379 edges, 101435 markings/sec, 445 secs
lola: sara is running 450 secs || 45789546 markings, 116351794 edges, 96202 markings/sec, 450 secs
lola: sara is running 455 secs || 46252923 markings, 117656907 edges, 92675 markings/sec, 455 secs
lola: sara is running 460 secs || 46706579 markings, 119020291 edges, 90731 markings/sec, 460 secs
lola: sara is running 465 secs || 47145830 markings, 120348539 edges, 87850 markings/sec, 465 secs
lola: sara is running 470 secs || 47634549 markings, 121686694 edges, 97744 markings/sec, 470 secs
lola: sara is running 475 secs || 48113457 markings, 122969238 edges, 95782 markings/sec, 475 secs
lola: sara is running 480 secs || 48594159 markings, 124341426 edges, 96140 markings/sec, 480 secs
lola: sara is running 485 secs || 49052392 markings, 125660105 edges, 91647 markings/sec, 485 secs
lola: sara is running 490 secs || 49555593 markings, 127082924 edges, 100640 markings/sec, 490 secs
lola: sara is running 495 secs || 50049868 markings, 128484193 edges, 98855 markings/sec, 495 secs
lola: sara is running 500 secs || 50507876 markings, 129819123 edges, 91602 markings/sec, 500 secs
lola: sara is running 505 secs || 50886168 markings, 131034179 edges, 75658 markings/sec, 505 secs
lola: sara is running 510 secs || 51311815 markings, 132248428 edges, 85129 markings/sec, 510 secs
lola: sara is running 515 secs || 51853688 markings, 133432086 edges, 108375 markings/sec, 515 secs
lola: sara is running 520 secs || 52411210 markings, 134723375 edges, 111504 markings/sec, 520 secs
lola: sara is running 525 secs || 52973168 markings, 136052513 edges, 112392 markings/sec, 525 secs
lola: sara is running 530 secs || 53505768 markings, 137292785 edges, 106520 markings/sec, 530 secs
lola: sara is running 535 secs || 54020544 markings, 138564462 edges, 102955 markings/sec, 535 secs
lola: sara is running 540 secs || 54438030 markings, 139605916 edges, 83497 markings/sec, 540 secs
lola: sara is running 545 secs || 54961146 markings, 140899208 edges, 104623 markings/sec, 545 secs
lola: sara is running 550 secs || 55432579 markings, 142095990 edges, 94287 markings/sec, 550 secs
lola: sara is running 555 secs || 55891232 markings, 143270057 edges, 91731 markings/sec, 555 secs
lola: sara is running 560 secs || 56383885 markings, 144442612 edges, 98531 markings/sec, 560 secs
lola: sara is running 565 secs || 56878226 markings, 145618558 edges, 98868 markings/sec, 565 secs
lola: sara is running 570 secs || 57365292 markings, 146897101 edges, 97413 markings/sec, 570 secs
lola: sara is running 575 secs || 57815497 markings, 148262915 edges, 90041 markings/sec, 575 secs
lola: sara is running 580 secs || 58255183 markings, 149613625 edges, 87937 markings/sec, 580 secs
lola: sara is running 585 secs || 58729628 markings, 150945200 edges, 94889 markings/sec, 585 secs
lola: sara is running 590 secs || 59223130 markings, 152226740 edges, 98700 markings/sec, 590 secs
lola: sara is running 595 secs || 59676260 markings, 153530723 edges, 90626 markings/sec, 595 secs
lola: sara is running 600 secs || 60152106 markings, 154892739 edges, 95169 markings/sec, 600 secs
lola: sara is running 605 secs || 60618664 markings, 156233945 edges, 93312 markings/sec, 605 secs
lola: sara is running 610 secs || 61117476 markings, 157640191 edges, 99762 markings/sec, 610 secs
lola: sara is running 615 secs || 61593109 markings, 158995294 edges, 95127 markings/sec, 615 secs
lola: sara is running 620 secs || 62029891 markings, 160310618 edges, 87356 markings/sec, 620 secs
lola: sara is running 625 secs || 62373835 markings, 161511828 edges, 68789 markings/sec, 625 secs
lola: sara is running 630 secs || 62873366 markings, 162675851 edges, 99906 markings/sec, 630 secs
lola: sara is running 635 secs || 63423217 markings, 163840747 edges, 109970 markings/sec, 635 secs
lola: sara is running 640 secs || 63947297 markings, 164958966 edges, 104816 markings/sec, 640 secs
lola: sara is running 645 secs || 64446262 markings, 166144940 edges, 99793 markings/sec, 645 secs
lola: sara is running 650 secs || 64997465 markings, 167312107 edges, 110241 markings/sec, 650 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 65114949 markings, 167557388 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no yes yes no no yes yes yes yes no yes yes yes
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-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 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="FlexibleBarrier-PT-06b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="irma4mcc-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/FlexibleBarrier-PT-06b.tgz
mv FlexibleBarrier-PT-06b 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 irma4mcc-full"
echo " Input is FlexibleBarrier-PT-06b, 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 r090-blw7-152650001100126"
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 ;