Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
............
=====================================================================
Generated by BenchKit 2-2979
Executing tool lola
Input is S_PhilosophersDyn-PT-20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170kn-ebro-146433134401020
=====================================================================

--------------------
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 PhilosophersDyn-COL-20-CTLCardinality-0
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-1
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-10
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-11
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-12
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-13
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-14
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-15
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-2
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-3
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-4
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-5
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-6
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-7
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-8
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1464496655709

bkconf 3600
===========================================================================================
===========================================================================================
S_PhilosophersDyn-PT-20: translating Petri net model.pnml into LoLA format
S_PhilosophersDyn-PT-20: translating formula CTLCardinality into LoLA format
===========================================================================================
/home/mcc/BenchKit/bin/pnml2lola.py model.pnml > model.pnml.lola
===========================================================================================
/home/mcc/BenchKit/bin/formula2lola.py CTLCardinality.xml
touch formulae;


in benchkit_head lolaszeit 3065
CTLCardinality @ S_PhilosophersDyn-PT-20
FORMULA PhilosophersDyn-COL-20-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-CTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-CTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-CTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-CTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-CTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-CTLCardinality-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3065 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 17760/65536 symbol table entries, 1877 collisions
lola: preprocessing...
lola: finding significant places
lola: 540 places, 17220 transitions, 461 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 33431 transition conflict sets
lola: TASK
lola: reading formula from PhilosophersDyn-COL-20-CTLCardinality.task
lola: read: A(AF (1 <= Outside_15 + Outside_6 + Outside_19 + Outside_12 + Outside_5 + Outside_18 + Outside_13 + Outside_4 + Outside_1 + Outside_10 + Outside_20 + Outside_11 + Outside_9 + Outside_2 + Outside_16 + Outside_3 + Outside_17 + Outside_8 + Outside_14 + Outside_7) U AF (1 <= WaitLeft_9 + WaitLeft_18 + WaitLeft_5 + WaitLeft_19 + WaitLeft_12 + WaitLeft_11 + WaitLeft_6 + WaitLeft_20 + WaitLeft_3 + WaitLe... (shortened)
lola: formula length: 115091
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(AF (-Outside_1 + -Outside_2 + -Outside_10 + -Outside_11 + -Outside_12 + -Outside_20 + -Outside_19 + -Outside_18 + -Outside_17 + -Outside_16 + -Outside_15 + -Outside_14 + -Outside_13 + -Outside_9 + -Outside_8 + -Outside_7 + -Outside_6 + -Outside_5 + -Outside_4 + -Outside_3 <= -1) U AF (-WaitLeft_9 + -WaitLeft_8 + -WaitLeft_7 + -WaitLeft_6 + -WaitLeft_5 + -WaitLeft_4 + -WaitLeft_3 + -WaitLeft_2 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U -Outside_1 + -Outside_2 + -Outside_10 + -Outside_11 + -Outside_12 + -Outside_20 + -Outside_19 + -Outside_18 + -Outside_17 + -Outside_16 + -Outside_15 + -Outside_14 + -Outside_13 + -Outside_9 + -Outside_8 + -Outside_7 + -Outside_6 + -Outside_5 + -Outside_4 + -Outside_3 <= -1) U A(TRUE U -WaitLeft_9 + -WaitLeft_8 + -WaitLeft_7 + -WaitLeft_6 + -WaitLeft_5 + -WaitLeft_4 + -WaitLeft_3 + -Wai... (shortened)
lola: processed formula length: 594
lola: 1508449 rewrites
lola: formula mentions 40 of 540 places; total mentions: 40
lola: closed formula file PhilosophersDyn-COL-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1844 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 1 will run for 201 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((AF (-WaitRight_20 + -WaitRight_19 + -WaitRight_18 + -WaitRight_17 + -WaitRight_16 + -WaitRight_15 + -WaitRight_14 + -WaitRight_13 + -WaitRight_12 + -WaitRight_11 + -WaitRight_10 + -WaitRight_9 + -WaitRight_8 + -WaitRight_7 + -WaitRight_6 + -WaitRight_5 + -WaitRight_4 + -WaitRight_3 + -WaitRight_2 + -WaitRight_1 <= -1) AND AF (-Outside_1 + -Outside_2 + Neighbourhood_5_20 + Neighbourhood_6_9 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (A(TRUE U -WaitRight_20 + -WaitRight_19 + -WaitRight_18 + -WaitRight_17 + -WaitRight_16 + -WaitRight_15 + -WaitRight_14 + -WaitRight_13 + -WaitRight_12 + -WaitRight_11 + -WaitRight_10 + -WaitRight_9 + -WaitRight_8 + -WaitRight_7 + -WaitRight_6 + -WaitRight_5 + -WaitRight_4 + -WaitRight_3 + -WaitRight_2 + -WaitRight_1 <= -1) AND A(TRUE U -Outside_1 + -Outside_2 + Neighbourhood_5_20 + Neigh... (shortened)
lola: processed formula length: 9064
lola: 1508449 rewrites
lola: formula mentions 440 of 540 places; total mentions: 440
lola: closed formula file PhilosophersDyn-COL-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1844 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 2 will run for 214 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EF ((-WaitRight_20 + -WaitRight_19 + -WaitRight_18 + -WaitRight_17 + -WaitRight_16 + -WaitRight_15 + -WaitRight_14 + -WaitRight_13 + -WaitRight_12 + -WaitRight_11 + -WaitRight_10 + -WaitRight_9 + -WaitRight_8 + -WaitRight_7 + -WaitRight_6 + -WaitRight_5 + -WaitRight_4 + -WaitRight_3 + -WaitRight_2 + -WaitRight_1 <= -1 AND -Forks_1 + -Forks_2 + -Forks_3 + -Forks_4 + -Forks_5 + -Forks_20 + -Fork... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E(TRUE U (-WaitRight_20 + -WaitRight_19 + -WaitRight_18 + -WaitRight_17 + -WaitRight_16 + -WaitRight_15 + -WaitRight_14 + -WaitRight_13 + -WaitRight_12 + -WaitRight_11 + -WaitRight_10 + -WaitRight_9 + -WaitRight_8 + -WaitRight_7 + -WaitRight_6 + -WaitRight_5 + -WaitRight_4 + -WaitRight_3 + -WaitRight_2 + -WaitRight_1 <= -1 AND -Forks_1 + -Forks_2 + -Forks_3 + -Forks_4 + -Forks_5 + -Fo... (shortened)
lola: processed formula length: 581
lola: 1508448 rewrites
lola: formula mentions 40 of 540 places; total mentions: 40
lola: closed formula file PhilosophersDyn-COL-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1844 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 3 will run for 230 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (WaitLeft_9 + WaitLeft_8 + WaitLeft_7 + WaitLeft_6 + WaitLeft_5 + WaitLeft_4 + WaitLeft_3 + WaitLeft_2 + WaitLeft_1 + -Forks_1 + -Forks_2 + -Forks_3 + -Forks_4 + -Forks_5 + -Forks_20 + -Forks_19 + -Forks_18 + -Forks_17 + -Forks_16 + -Forks_15 + -Forks_14 + -Forks_13 + -Forks_12 + -Forks_11 + -Forks_10 + -Forks_6 + -Forks_7 + -Forks_8 + -Forks_9 + WaitLeft_20 + WaitLeft_19 + WaitLeft_18 + WaitLe... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1844 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (AX (-HasRight_1 + -HasRight_2 + -HasRight_3 + -HasRight_4 + -HasRight_5 + -HasRight_6 + -HasRight_7 + -HasRight_8 + -HasRight_9 + -HasRight_20 + -HasRight_19 + -HasRight_18 + -HasRight_17 + -HasRight_16 + -HasRight_15 + -HasRight_14 + -HasRight_13 + -HasRight_12 + -HasRight_11 + -HasRight_10 > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(AX(-HasRight_1 + -HasRight_2 + -HasRight_3 + -HasRight_4 + -HasRight_5 + -HasRight_6 + -HasRight_7 + -HasRight_8 + -HasRight_9 + -HasRight_20 + -HasRight_19 + -HasRight_18 + -HasRight_17 + -HasRight_16 + -HasRight_15 + -HasRight_14 + -HasRight_13 + -HasRight_12 + -HasRight_11 + -HasRight_10 > -2))
lola: processed formula length: 301
lola: 1508448 rewrites
lola: formula mentions 20 of 540 places; total mentions: 20
lola: closed formula file PhilosophersDyn-COL-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1844 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 5 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((AX (-Neighbourhood_5_20 + -Neighbourhood_6_9 + -Neighbourhood_13_9 + -Neighbourhood_7_9 + -Neighbourhood_19_9 + -Neighbourhood_19_8 + -Neighbourhood_19_7 + -Neighbourhood_19_6 + -Neighbourhood_19_5 + -Neighbourhood_19_4 + -Neighbourhood_19_3 + -Neighbourhood_19_2 + -Neighbourhood_19_1 + -Neighbourhood_20_20 + -Neighbourhood_20_19 + -Neighbourhood_20_18 + -Neighbourhood_20_17 + -Neighbourhood_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((AX(-Neighbourhood_5_20 + -Neighbourhood_6_9 + -Neighbourhood_13_9 + -Neighbourhood_7_9 + -Neighbourhood_19_9 + -Neighbourhood_19_8 + -Neighbourhood_19_7 + -Neighbourhood_19_6 + -Neighbourhood_19_5 + -Neighbourhood_19_4 + -Neighbourhood_19_3 + -Neighbourhood_19_2 + -Neighbourhood_19_1 + -Neighbourhood_20_20 + -Neighbourhood_20_19 + -Neighbourhood_20_18 + -Neighbourhood_20_17 + -Neighb... (shortened)
lola: processed formula length: 10452
lola: 1508448 rewrites
lola: formula mentions 500 of 540 places; total mentions: 520
lola: closed formula file PhilosophersDyn-COL-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1844 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 6 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + Neighbourhood_5_20 + Neighbourhood_6_9 + Neighbourhood_13_9 + Neighbourhood_7_9 + Neighbourhood_19_9 + Neighbourhood_19_8 + Neighbourhood_19_7 + Neighbourhood_19_6 + Neighbourhood_19_5 + Neighbourhood_19_4 + Neighbourhood_19_3 + Neighbourhood_19_2 + Neighbourhood_19_1 + -Think_20 + -Think_19 + -Thi... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + Neighbourhood_5_20 + Neighbourhood_6_9 + Neighbourhood_13_9 + Neighbourhood_7_9 + Neighbourhood_19_9 + Neighbourhood_19_8 + Neighbourhood_19_7 + Neighbourhood_19_6 + Neighbourhood_19_5 + Neighbourhood_19_4 + Neighbourhood_19_3 + Neighbourhood_19_2 + Neighbourhood_19_1 + -Think_20 + -Think_19 + -Thin... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file PhilosophersDyn-COL-20-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Neighbourhood_5_20 + -Neighbourhood_6_9 + -Neighbourhood_13_9 + -Neighbourhood_7_9 + -Neighbourhood_19_9 + -Neighbourhood_19_8 + -Neighbourhood_19_7 + -Neighbourhood_19_6 + -Neighbourhood_19_5 + -Neighbourhood_19_4 + -Neighbourhood_19_3 + -Neighbourhood_19_2 + -Neighbourhood_19_1 + -Neighbourhood_20_20 + -Neighbourhood_20_19 + -Neighbourhood_20_18 + -Neighbourhood_20_17 + -Neighbourhood_20_16 + -... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PhilosophersDyn-COL-20-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-Neighbourhood_5_20 + -Neighbourhood_6_9 + -Neighbourhood_13_9 + -Neighbourhood_7_9 + -Neighbourhood_19_9 + -Neighbourhood_19_8 + -Neighbourhood_19_7 + -Neighbourhood_19_6 + -Neighbourhood_19_5 + -Neighbourhood_19_4 + -Neighbourhood_19_3 + -Neighbourhood_19_2 + -Neighbourhood_19_1 + -Neighbourhood_20_20 + -Neighbourhood_20_19 + -Neighbourhood_20_18 + -Neighbourhood_20_17 + -Neighbourhood_20_16... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -Neighbourhood_5_20 + -Neighbourhood_6_9 + -Neighbourhood_13_9 + -Neighbourhood_7_9 + -Neighbourhood_19_9 + -Neighbourhood_19_8 + -Neighbourhood_19_7 + -Neighbourhood_19_6 + -Neighbourhood_19_5 + -Neighbourhood_19_4 + -Neighbourhood_19_3 + -Neighbourhood_19_2 + -Neighbourhood_19_1 + -Neighbourhood_20_20 + -Neighbourhood_20_19 + -Neighbourhood_20_18 + -Neighbourhood_20_17 + -Neighbourhood_... (shortened)
lola: processed formula length: 9062
lola: 1508447 rewrites
lola: formula mentions 420 of 540 places; total mentions: 420
lola: closed formula file PhilosophersDyn-COL-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1844 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AG (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + Outside_1 + Outside_2 + Outside_10 + Outside_11 + Outside_12 + -Think_20 + -Think_19 + -Think_18 + -Think_17 + -Think_16 + -Think_15 + -Think_14 + -Think_13 + -Think_12 + -Think_11 + -Think_10 + Outside_20 + Outside_19 + Outside_18 + Outside_17 + Outside_16 + Outside_15 + Outside_14 + Outside... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(E(TRUE U !(-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + Outside_1 + Outside_2 + Outside_10 + Outside_11 + Outside_12 + -Think_20 + -Think_19 + -Think_18 + -Think_17 + -Think_16 + -Think_15 + -Think_14 + -Think_13 + -Think_12 + -Think_11 + -Think_10 + Outside_20 + Outside_19 + Outside_18 + Outside_17 + Outside_16 + Outside_15 + Outsid... (shortened)
lola: processed formula length: 510
lola: 1508448 rewrites
lola: formula mentions 40 of 540 places; total mentions: 40
lola: closed formula file PhilosophersDyn-COL-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1844 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (A(Forks_1 + Forks_2 + Forks_3 + Forks_4 + Forks_5 + Forks_20 + Forks_19 + Forks_18 + Forks_17 + Forks_16 + Forks_15 + Forks_14 + Forks_13 + Forks_12 + Forks_11 + Forks_10 + Forks_6 + Forks_7 + -WaitRight_20 + -WaitRight_19 + -WaitRight_18 + -WaitRight_17 + -WaitRight_16 + -WaitRight_15 + -WaitRight_14 + -WaitRight_13 + -WaitRight_12 + -WaitRight_11 + -WaitRight_10 + Forks_8 + Forks_9 + -WaitRi... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(A(Forks_1 + Forks_2 + Forks_3 + Forks_4 + Forks_5 + Forks_20 + Forks_19 + Forks_18 + Forks_17 + Forks_16 + Forks_15 + Forks_14 + Forks_13 + Forks_12 + Forks_11 + Forks_10 + Forks_6 + Forks_7 + -WaitRight_20 + -WaitRight_19 + -WaitRight_18 + -WaitRight_17 + -WaitRight_16 + -WaitRight_15 + -WaitRight_14 + -WaitRight_13 + -WaitRight_12 + -WaitRight_11 + -WaitRight_10 + Forks_8 + Forks_9 ... (shortened)
lola: processed formula length: 1050
lola: 1508448 rewrites
lola: formula mentions 60 of 540 places; total mentions: 80
lola: closed formula file PhilosophersDyn-COL-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1844 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 428 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EF (-HasRight_1 + -HasRight_2 + -HasRight_3 + -HasRight_4 + -HasRight_5 + -HasRight_6 + -HasRight_7 + -HasRight_8 + -HasRight_9 + -HasRight_20 + -HasRight_19 + -HasRight_18 + -HasRight_17 + -HasRight_16 + -HasRight_15 + -HasRight_14 + -HasRight_13 + -HasRight_12 + -HasRight_11 + -HasRight_10 > -3) AND (EG (Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_1 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 428 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-HasRight_1 + -HasRight_2 + -HasRight_3 + -HasRight_4 + -HasRight_5 + -HasRight_6 + -HasRight_7 + -HasRight_8 + -HasRight_9 + -HasRight_20 + -HasRight_19 + -HasRight_18 + -HasRight_17 + -HasRight_16 + -HasRight_15 + -HasRight_14 + -HasRight_13 + -HasRight_12 + -HasRight_11 + -HasRight_10 > -3)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1844 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 499 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_1 + -Neighbourhood_5_20 + -Neighbourhood_6_9 + -Neighbourhood_13_9 + -Neighbourhood_7_9 + -Neighbourhood_19_9 + -Neighbourhood_19_8 + -Neighbourhood_19_7 + -Neighbourhood_19_6 + -Neighbourhood_19_5 + -Neighbourhood_19_4 + -Neighbourhood_19_3 + -Neighbourhood_19_2 + -Neighbourhood_19_1 + Think_20 + Think_19 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_1 + -Neighbourhood_5_20 + -Neighbourhood_6_9 + -Neighbourhood_13_9 + -Neighbourhood_7_9 + -Neighbourhood_19_9 + -Neighbourhood_19_8 + -Neighbourhood_19_7 + -Neighbourhood_19_6 + -Neighbourhood_19_5 + -Neighbourhood_19_4 + -Neighbourhood_19_3 + -Neighbourhood_19_2 + -Neighbourhood_19_1 + Think_20 + Th... (shortened)
lola: processed formula length: 9069
lola: 1508447 rewrites
lola: formula mentions 420 of 540 places; total mentions: 420
lola: closed formula file PhilosophersDyn-COL-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1844 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 599 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 + HasRight_20 + HasRight_19 + HasRight_18 + HasRight_17 + HasRight_16 + HasRight_15 + HasRight_14 + HasRight_13 + HasRight_12 + HasRight_11 + HasRight_10 + -WaitRight_20 + -WaitRight_19 + -WaitRight_18 + -WaitRight_17 + -WaitRight_16 + -WaitRight_15 + -WaitRight_14 + -WaitRight_13... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 + HasRight_20 + HasRight_19 + HasRight_18 + HasRight_17 + HasRight_16 + HasRight_15 + HasRight_14 + HasRight_13 + HasRight_12 + HasRight_11 + HasRight_10 + -WaitRight_20 + -WaitRight_19 + -WaitRight_18 + -WaitRight_17 + -WaitRight_16 + -WaitRight_15 + -WaitRight_14 + -WaitRight_13 ... (shortened)
lola: processed formula length: 588
lola: 1508447 rewrites
lola: formula mentions 40 of 540 places; total mentions: 40
lola: closed formula file PhilosophersDyn-COL-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1844 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 499 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file PhilosophersDyn-COL-20-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 599 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EF ((Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_1 + Think_20 + Think_19 + Think_18 + Think_17 + Think_16 + Think_15 + Think_14 + Think_13 + Think_12 + Think_11 + Think_10 + -Forks_1 + -Forks_2 + -Forks_3 + -Forks_4 + -Forks_5 + -Forks_20 + -Forks_19 + -Forks_18 + -Forks_17 + -Forks_16 + -Forks_15 + -Forks_14 + -Forks_13 + -Forks_12 + -Forks_11 + -Fork... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_1 + Think_20 + Think_19 + Think_18 + Think_17 + Think_16 + Think_15 + Think_14 + Think_13 + Think_12 + Think_11 + Think_10 + -Forks_1 + -Forks_2 + -Forks_3 + -Forks_4 + -Forks_5 + -Forks_20 + -Forks_19 + -Forks_18 + -Forks_17 + -Forks_16 + -Forks_15 + -Forks_14 + -Forks_13 + -Forks_12 + -Forks_... (shortened)
lola: processed formula length: 785
lola: 1508448 rewrites
lola: formula mentions 60 of 540 places; total mentions: 60
lola: closed formula file PhilosophersDyn-COL-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1844 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 12 will run for 748 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-WaitLeft_9 + -WaitLeft_8 + -WaitLeft_7 + -WaitLeft_6 + -WaitLeft_5 + -WaitLeft_4 + -WaitLeft_3 + -WaitLeft_2 + -WaitLeft_1 + WaitRight_20 + WaitRight_19 + WaitRight_18 + WaitRight_17 + WaitRight_16 + WaitRight_15 + WaitRight_14 + WaitRight_13 + WaitRight_12 + WaitRight_11 + WaitRight_10 + WaitRight_9 + WaitRight_8 + WaitRight_7 + WaitRight_6 + WaitRight_5 + WaitRight_4 + WaitRight_3 + WaitRig... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1844 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 998 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (-Forks_1 + -Forks_2 + -Forks_3 + -Forks_4 + -Forks_5 + -Forks_20 + -Forks_19 + -Forks_18 + -Forks_17 + -Forks_16 + -Forks_15 + -Forks_14 + -Forks_13 + -Forks_12 + -Forks_11 + -Forks_10 + -Forks_6 + -Forks_7 + -Forks_8 + -Forks_9 <= -3) OR AG ((-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_20 + -Think_19 + -Think_18 + -Think_17 + -Thi... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 998 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-Forks_1 + -Forks_2 + -Forks_3 + -Forks_4 + -Forks_5 + -Forks_20 + -Forks_19 + -Forks_18 + -Forks_17 + -Forks_16 + -Forks_15 + -Forks_14 + -Forks_13 + -Forks_12 + -Forks_11 + -Forks_10 + -Forks_6 + -Forks_7 + -Forks_8 + -Forks_9 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -Forks_1 + -Forks_2 + -Forks_3 + -Forks_4 + -Forks_5 + -Forks_20 + -Forks_19 + -Forks_18 + -Forks_17 + -Forks_16 + -Forks_15 + -Forks_14 + -Forks_13 + -Forks_12 + -Forks_11 + -Forks_10 + -Forks_6 + -Forks_7 + -Forks_8 + -Forks_9 <= -3)
lola: processed formula length: 244
lola: 1508447 rewrites
lola: formula mentions 20 of 540 places; total mentions: 20
lola: closed formula file PhilosophersDyn-COL-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1844 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 14 will run for 1497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_20 + -Think_19 + -Think_18 + -Think_17 + -Think_16 + -Think_15 + -Think_14 + -Think_13 + -Think_12 + -Think_11 + -Think_10 <= -3 OR (Outside_1 + Outside_2 + Outside_10 + Outside_11 + Outside_12 + -HasRight_1 + -HasRight_2 + -HasRight_3 + -HasRight_4 + -HasRight_5 + -HasRight_6 + -HasRight... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1844 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (AX ((-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_20 + -Think_19 + -Think_18 + -Think_17 + -Think_16 + -Think_15 + -Think_14 + -Think_13 + -Think_12 + -Think_11 + -Think_10 <= -1 AND -HasLeft_10 + -HasLeft_11 + -HasLeft_12 + -HasLeft_13 + -HasLeft_14 + -HasLeft_15 + -HasLeft_16 + -HasLeft_17 + -HasLeft_18 + -HasLeft_19 + -HasLeft_20 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX((-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_20 + -Think_19 + -Think_18 + -Think_17 + -Think_16 + -Think_15 + -Think_14 + -Think_13 + -Think_12 + -Think_11 + -Think_10 <= -1 AND -HasLeft_10 + -HasLeft_11 + -HasLeft_12 + -HasLeft_13 + -HasLeft_14 + -HasLeft_15 + -HasLeft_16 + -HasLeft_17 + -HasLeft_18 + -HasLeft_19 + -HasLeft_20 + ... (shortened)
lola: processed formula length: 523
lola: 1508448 rewrites
lola: formula mentions 40 of 540 places; total mentions: 40
lola: closed formula file PhilosophersDyn-COL-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1844 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 2995 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (((-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_20 + -Think_19 + -Think_18 + -Think_17 + -Think_16 + -Think_15 + -Think_14 + -Think_13 + -Think_12 + -Think_11 + -Think_10 + WaitLeft_9 + WaitLeft_8 + WaitLeft_7 + WaitLeft_6 + WaitLeft_5 + WaitLeft_4 + WaitLeft_3 + WaitLeft_2 + WaitLeft_1 + WaitLeft_20 + WaitLeft_19 + WaitLeft_18 + Wait... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_20 + -Think_19 + -Think_18 + -Think_17 + -Think_16 + -Think_15 + -Think_14 + -Think_13 + -Think_12 + -Think_11 + -Think_10 + WaitLeft_9 + WaitLeft_8 + WaitLeft_7 + WaitLeft_6 + WaitLeft_5 + WaitLeft_4 + WaitLeft_3 + WaitLeft_2 + WaitLeft_1 + WaitLeft_20 + WaitLeft_19 + WaitLeft_18 +... (shortened)
lola: processed formula length: 18227
lola: 1508448 rewrites
lola: formula mentions 440 of 540 places; total mentions: 840
lola: closed formula file PhilosophersDyn-COL-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1844 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: RESULT
lola: summary: yes yes yes no yes yes no no yes yes yes yes no no no no

BK_STOP 1464497200995

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

parsing of model.pnml complete

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="S_PhilosophersDyn-PT-20"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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/S_PhilosophersDyn-PT-20.tgz
mv S_PhilosophersDyn-PT-20 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is S_PhilosophersDyn-PT-20, 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 r170kn-ebro-146433134401020"
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 ;