About the Execution of M4M.struct for FlexibleBarrier-PT-06b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6873.590 | 696089.00 | 1330324.00 | 222.20 | FTTFTTFFTTTTFTTT | 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.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.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.5K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 26 09:26 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 mcc4mcc-structural
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 r095-blw7-152650007000126
=====================================================================
--------------------
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 1527585154047
BK_STOP 1527585850136
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-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...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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 stdout -----
----- Start make result stderr -----
ReachabilityFireability @ FlexibleBarrier-PT-06b @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 34 markings, 33 edges
lola: ========================================
lola: state equation: calling and running sara
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
sara: try reading problem file FlexibleBarrier-PT-06b-ReachabilityFireability.sara.
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 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
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: lola: 32 markings, 31 edges
state equation: calling and running sara
lola: ========================================
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
lola: state equation: write sara problem file to FlexibleBarrier-PT-06b-ReachabilityFireability-8.sara
sara: try reading problem file FlexibleBarrier-PT-06b-ReachabilityFireability-7.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: 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
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: 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
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 || 573622 markings, 1316564 edges, 114724 markings/sec, 0 secs
lola: sara is running 5 secs || 1140426 markings, 2635038 edges, 113361 markings/sec, 5 secs
lola: sara is running 10 secs || 1674779 markings, 4005029 edges, 106871 markings/sec, 10 secs
lola: sara is running 15 secs || 2115181 markings, 5382808 edges, 88080 markings/sec, 15 secs
lola: sara is running 20 secs || 2674058 markings, 6747230 edges, 111775 markings/sec, 20 secs
lola: sara is running 25 secs || 3226930 markings, 8043767 edges, 110574 markings/sec, 25 secs
lola: sara is running 30 secs || 3761586 markings, 9399553 edges, 106931 markings/sec, 30 secs
lola: sara is running 35 secs || 4199434 markings, 10770266 edges, 87570 markings/sec, 35 secs
lola: sara is running 40 secs || 4746528 markings, 12115521 edges, 109419 markings/sec, 40 secs
lola: sara is running 45 secs || 5304235 markings, 13429617 edges, 111541 markings/sec, 45 secs
lola: sara is running 50 secs || 5845326 markings, 14780975 edges, 108218 markings/sec, 50 secs
lola: sara is running 55 secs || 6287337 markings, 16139593 edges, 88402 markings/sec, 55 secs
lola: sara is running 60 secs || 6845834 markings, 17454124 edges, 111699 markings/sec, 60 secs
lola: sara is running 65 secs || 7409454 markings, 18782687 edges, 112724 markings/sec, 65 secs
lola: sara is running 70 secs || 7919248 markings, 20125109 edges, 101959 markings/sec, 70 secs
lola: sara is running 75 secs || 8416720 markings, 21525083 edges, 99494 markings/sec, 75 secs
lola: sara is running 80 secs || 8976122 markings, 22831169 edges, 111880 markings/sec, 80 secs
lola: sara is running 85 secs || 9506524 markings, 24216164 edges, 106080 markings/sec, 85 secs
lola: sara is running 90 secs || 9980827 markings, 25583772 edges, 94861 markings/sec, 90 secs
lola: sara is running 95 secs || 10537788 markings, 26897879 edges, 111392 markings/sec, 95 secs
lola: sara is running 100 secs || 11088675 markings, 28239974 edges, 110177 markings/sec, 100 secs
lola: sara is running 105 secs || 11546671 markings, 29620659 edges, 91599 markings/sec, 105 secs
lola: sara is running 110 secs || 12112114 markings, 30874996 edges, 113089 markings/sec, 110 secs
lola: sara is running 115 secs || 12657741 markings, 32070424 edges, 109125 markings/sec, 115 secs
lola: sara is running 120 secs || 13208359 markings, 33269070 edges, 110124 markings/sec, 120 secs
lola: sara is running 125 secs || 13710972 markings, 34497489 edges, 100523 markings/sec, 125 secs
lola: sara is running 130 secs || 14226729 markings, 35737894 edges, 103151 markings/sec, 130 secs
lola: sara is running 135 secs || 14804414 markings, 36948875 edges, 115537 markings/sec, 135 secs
lola: sara is running 140 secs || 15371635 markings, 38095519 edges, 113444 markings/sec, 140 secs
lola: sara is running 145 secs || 15918477 markings, 39300467 edges, 109368 markings/sec, 145 secs
lola: sara is running 150 secs || 16446530 markings, 40503706 edges, 105611 markings/sec, 150 secs
lola: sara is running 155 secs || 16955226 markings, 41718678 edges, 101739 markings/sec, 155 secs
lola: sara is running 160 secs || 17519874 markings, 42918904 edges, 112930 markings/sec, 160 secs
lola: sara is running 165 secs || 18067003 markings, 44151322 edges, 109426 markings/sec, 165 secs
lola: sara is running 170 secs || 18612886 markings, 45429638 edges, 109177 markings/sec, 170 secs
lola: sara is running 175 secs || 19157641 markings, 46693397 edges, 108951 markings/sec, 175 secs
lola: sara is running 180 secs || 19671974 markings, 47955516 edges, 102867 markings/sec, 180 secs
lola: sara is running 185 secs || 20173024 markings, 49194021 edges, 100210 markings/sec, 185 secs
lola: sara is running 190 secs || 20694296 markings, 50478590 edges, 104254 markings/sec, 190 secs
lola: sara is running 195 secs || 21189733 markings, 51747299 edges, 99087 markings/sec, 195 secs
lola: sara is running 200 secs || 21655015 markings, 52921601 edges, 93056 markings/sec, 200 secs
lola: sara is running 205 secs || 22126667 markings, 54108261 edges, 94330 markings/sec, 205 secs
lola: sara is running 210 secs || 22637608 markings, 55253714 edges, 102188 markings/sec, 210 secs
lola: sara is running 215 secs || 23126894 markings, 56541861 edges, 97857 markings/sec, 215 secs
lola: sara is running 220 secs || 23596786 markings, 57878168 edges, 93978 markings/sec, 220 secs
lola: sara is running 225 secs || 24053110 markings, 59239375 edges, 91265 markings/sec, 225 secs
lola: sara is running 230 secs || 24495453 markings, 60571969 edges, 88469 markings/sec, 230 secs
lola: sara is running 235 secs || 24985566 markings, 61903570 edges, 98023 markings/sec, 235 secs
lola: sara is running 240 secs || 25461603 markings, 63186739 edges, 95207 markings/sec, 240 secs
lola: sara is running 245 secs || 25948537 markings, 64573955 edges, 97387 markings/sec, 245 secs
lola: sara is running 250 secs || 26406672 markings, 65896491 edges, 91627 markings/sec, 250 secs
lola: sara is running 255 secs || 26912311 markings, 67324742 edges, 101128 markings/sec, 255 secs
lola: sara is running 260 secs || 27409879 markings, 68734938 edges, 99514 markings/sec, 260 secs
lola: sara is running 265 secs || 27868294 markings, 70071928 edges, 91683 markings/sec, 265 secs
lola: sara is running 270 secs || 28232525 markings, 71306479 edges, 72846 markings/sec, 270 secs
lola: sara is running 275 secs || 28695756 markings, 72500791 edges, 92646 markings/sec, 275 secs
lola: sara is running 280 secs || 29233158 markings, 73675620 edges, 107480 markings/sec, 280 secs
lola: sara is running 285 secs || 29788799 markings, 74976793 edges, 111128 markings/sec, 285 secs
lola: sara is running 290 secs || 30341854 markings, 76288152 edges, 110611 markings/sec, 290 secs
lola: sara is running 295 secs || 30874523 markings, 77552051 edges, 106534 markings/sec, 295 secs
lola: sara is running 300 secs || 31397791 markings, 78834594 edges, 104654 markings/sec, 300 secs
lola: sara is running 305 secs || 31897023 markings, 80063054 edges, 99846 markings/sec, 305 secs
lola: sara is running 310 secs || 32411173 markings, 81360664 edges, 102830 markings/sec, 310 secs
lola: sara is running 315 secs || 32869653 markings, 82544839 edges, 91696 markings/sec, 315 secs
lola: sara is running 320 secs || 33337472 markings, 83724422 edges, 93564 markings/sec, 320 secs
lola: sara is running 325 secs || 33837977 markings, 84883385 edges, 100101 markings/sec, 325 secs
lola: sara is running 330 secs || 34327397 markings, 86076410 edges, 97884 markings/sec, 330 secs
lola: sara is running 335 secs || 34799072 markings, 87383772 edges, 94335 markings/sec, 335 secs
lola: sara is running 340 secs || 35258589 markings, 88746765 edges, 91903 markings/sec, 340 secs
lola: sara is running 345 secs || 35684035 markings, 90084060 edges, 85089 markings/sec, 345 secs
lola: sara is running 350 secs || 36169198 markings, 91412993 edges, 97033 markings/sec, 350 secs
lola: sara is running 355 secs || 36654374 markings, 92675219 edges, 97035 markings/sec, 355 secs
lola: sara is running 360 secs || 37116571 markings, 94017758 edges, 92439 markings/sec, 360 secs
lola: sara is running 365 secs || 37593303 markings, 95368589 edges, 95346 markings/sec, 365 secs
lola: sara is running 370 secs || 38074280 markings, 96752939 edges, 96195 markings/sec, 370 secs
lola: sara is running 375 secs || 38568641 markings, 98150405 edges, 98872 markings/sec, 375 secs
lola: sara is running 380 secs || 39039324 markings, 99500088 edges, 94137 markings/sec, 380 secs
lola: sara is running 385 secs || 39435897 markings, 100757488 edges, 79315 markings/sec, 385 secs
lola: sara is running 390 secs || 39820299 markings, 101984053 edges, 76880 markings/sec, 390 secs
lola: sara is running 395 secs || 40362805 markings, 103165037 edges, 108501 markings/sec, 395 secs
lola: sara is running 400 secs || 40913234 markings, 104423212 edges, 110086 markings/sec, 400 secs
lola: sara is running 405 secs || 41476723 markings, 105733949 edges, 112698 markings/sec, 405 secs
lola: sara is running 410 secs || 42013631 markings, 106991416 edges, 107382 markings/sec, 410 secs
lola: sara is running 415 secs || 42550022 markings, 108303231 edges, 107278 markings/sec, 415 secs
lola: sara is running 420 secs || 43050025 markings, 109553139 edges, 100001 markings/sec, 420 secs
lola: sara is running 425 secs || 43572199 markings, 110838404 edges, 104435 markings/sec, 425 secs
lola: sara is running 430 secs || 44046648 markings, 112047683 edges, 94890 markings/sec, 430 secs
lola: sara is running 435 secs || 44504958 markings, 113230313 edges, 91662 markings/sec, 435 secs
lola: sara is running 440 secs || 44995072 markings, 114407964 edges, 98023 markings/sec, 440 secs
lola: sara is running 445 secs || 45491080 markings, 115558288 edges, 99202 markings/sec, 445 secs
lola: sara is running 450 secs || 45975256 markings, 116839889 edges, 96835 markings/sec, 450 secs
lola: sara is running 455 secs || 46425787 markings, 118188727 edges, 90106 markings/sec, 455 secs
lola: sara is running 460 secs || 46875338 markings, 119540407 edges, 89910 markings/sec, 460 secs
lola: sara is running 465 secs || 47335080 markings, 120878787 edges, 91948 markings/sec, 465 secs
lola: sara is running 470 secs || 47831665 markings, 122172304 edges, 99317 markings/sec, 470 secs
lola: sara is running 475 secs || 48295846 markings, 123481626 edges, 92836 markings/sec, 475 secs
lola: sara is running 480 secs || 48775038 markings, 124860358 edges, 95838 markings/sec, 480 secs
lola: sara is running 485 secs || 49246390 markings, 126211797 edges, 94270 markings/sec, 485 secs
lola: sara is running 490 secs || 49748235 markings, 127624265 edges, 100369 markings/sec, 490 secs
lola: sara is running 495 secs || 50227365 markings, 128991004 edges, 95826 markings/sec, 495 secs
lola: sara is running 500 secs || 50670064 markings, 130322520 edges, 88540 markings/sec, 500 secs
lola: sara is running 505 secs || 51021344 markings, 131544986 edges, 70256 markings/sec, 505 secs
lola: sara is running 510 secs || 51543307 markings, 132741364 edges, 104393 markings/sec, 510 secs
lola: sara is running 515 secs || 52085730 markings, 133961790 edges, 108485 markings/sec, 515 secs
lola: sara is running 520 secs || 52648638 markings, 135271042 edges, 112582 markings/sec, 520 secs
lola: sara is running 525 secs || 53195714 markings, 136538727 edges, 109415 markings/sec, 525 secs
lola: sara is running 530 secs || 53733706 markings, 137861024 edges, 107598 markings/sec, 530 secs
lola: sara is running 535 secs || 54241942 markings, 139111256 edges, 101647 markings/sec, 535 secs
lola: sara is running 540 secs || 54760481 markings, 140395063 edges, 103708 markings/sec, 540 secs
lola: sara is running 545 secs || 55253541 markings, 141663733 edges, 98612 markings/sec, 545 secs
lola: sara is running 550 secs || 55721810 markings, 142842026 edges, 93654 markings/sec, 550 secs
lola: sara is running 555 secs || 56196198 markings, 144033316 edges, 94878 markings/sec, 555 secs
lola: sara is running 560 secs || 56709433 markings, 145171893 edges, 102647 markings/sec, 560 secs
lola: sara is running 565 secs || 57195300 markings, 146473297 edges, 97173 markings/sec, 565 secs
lola: sara is running 570 secs || 57660043 markings, 147799842 edges, 92949 markings/sec, 570 secs
lola: sara is running 575 secs || 58116614 markings, 149157174 edges, 91314 markings/sec, 575 secs
lola: sara is running 580 secs || 58559967 markings, 150492818 edges, 88671 markings/sec, 580 secs
lola: sara is running 585 secs || 59053116 markings, 151819628 edges, 98630 markings/sec, 585 secs
lola: sara is running 590 secs || 59526772 markings, 153104497 edges, 94731 markings/sec, 590 secs
lola: sara is running 595 secs || 60009541 markings, 154486761 edges, 96554 markings/sec, 595 secs
lola: sara is running 600 secs || 60468130 markings, 155811828 edges, 91718 markings/sec, 600 secs
lola: sara is running 605 secs || 60973998 markings, 157232672 edges, 101174 markings/sec, 605 secs
lola: sara is running 610 secs || 61467309 markings, 158631849 edges, 98662 markings/sec, 610 secs
lola: sara is running 615 secs || 61922467 markings, 159969086 edges, 91032 markings/sec, 615 secs
lola: sara is running 620 secs || 62285891 markings, 161201683 edges, 72685 markings/sec, 620 secs
lola: sara is running 625 secs || 62737564 markings, 162368204 edges, 90335 markings/sec, 625 secs
lola: sara is running 630 secs || 63283562 markings, 163537888 edges, 109200 markings/sec, 630 secs
lola: sara is running 635 secs || 63803464 markings, 164676862 edges, 103980 markings/sec, 635 secs
lola: sara is running 640 secs || 64316964 markings, 165831465 edges, 102700 markings/sec, 640 secs
lola: sara is running 645 secs || 64849711 markings, 167004921 edges, 106549 markings/sec, 645 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 65114949 markings, 167557388 edges
lola: RESULT
lola:
SUMMARY: no yes yes no yes yes no no yes yes yes yes no yes yes yes
lola: ========================================
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="mcc4mcc-structural"
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 mcc4mcc-structural"
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 r095-blw7-152650007000126"
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 '
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 ;