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 208K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K 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 7.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 42K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Peterson-COL-2, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469600514
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527040136282

info: Time: 3600 - MCC
===========================================================================================
prep: translating Peterson-COL-2 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating Peterson-COL-2 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking CTLCardinality @ Peterson-COL-2 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 246/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 108
lola: finding significant places
lola: 108 places, 138 transitions, 97 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 213 transition conflict sets
lola: TASK
lola: reading formula from Peterson-COL-2-CTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (p98 + p97 + p96 + p100 + p101 + p94 + p93 + p92 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99 <= p45 + p46 + p48 + p49 + p50 + p47)
lola: after: (p98 + p97 + p96 + p100 + p101 + p94 + p93 + p92 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99 <= 2)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p0 + p2 + p4 + p5 + p3 + p1)
lola: after: (0 <= 0)
lola: always true
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 <= p0 + p2 + p4 + p5 + p3 + p1)
lola: after: (p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 <= 3)
lola: LP says that atomic proposition is always true: (p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 <= 3)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p0 + p2 + p4 + p5 + p3 + p1)
lola: after: (0 <= 2)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= p0 + p2 + p4 + p5 + p3 + p1)
lola: after: (p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= 3)
lola: LP says that atomic proposition is always true: (p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= 3)
lola: place invariant simplifies atomic proposition
lola: before: (p102 + p103 + p104 + p105 + p106 + p107 <= p0 + p2 + p4 + p5 + p3 + p1)
lola: after: (p102 + p103 + p104 + p105 + p106 + p107 <= 3)
lola: LP says that atomic proposition is always true: (p102 + p103 + p104 + p105 + p106 + p107 <= 3)
lola: place invariant simplifies atomic proposition
lola: before: (p0 + p2 + p4 + p5 + p3 + p1 <= p57 + p58 + p59 + p60 + p61 + p62)
lola: after: (3 <= p57 + p58 + p59 + p60 + p61 + p62)
lola: place invariant simplifies atomic proposition
lola: before: (p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 <= p0 + p2 + p4 + p5 + p3 + p1)
lola: after: (p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 <= 3)
lola: LP says that atomic proposition is always true: (p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 <= 3)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p45 + p46 + p48 + p49 + p50 + p47)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p44 + p43 + p42 <= p0 + p2 + p4 + p5 + p3 + p1)
lola: after: (p44 + p43 + p42 <= 3)
lola: LP says that atomic proposition is always true: (p44 + p43 + p42 <= 3)
lola: A (G (A (F (((p98 + p97 + p96 + p100 + p101 + p94 + p93 + p92 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99 <= 2) AND (1 <= p98 + p97 + p96 + p100 + p101 + p94 + p93 + p92 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99)))))) : ((NOT(A (F ((p63 + p64 + p65 <= p57 + p58 + p59 + p60 + p61 + p62)))) AND (2 <= p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83)) OR A (G (()))) : E ((E (F (TRUE)) U (3 <= p57 + p58 + p59 + p60 + p61 + p62))) : E (F (())) : NOT((E (((p63 + p64 + p65 <= p44 + p43 + p42) U (3 <= p57 + p58 + p59 + p60 + p61 + p62))) AND A (((3 <= p51 + p52 + p53 + p54 + p55 + p56) U (2 <= p44 + p43 + p42))))) : A (F ((p44 + p43 + p42 <= p102 + p103 + p104 + p105 + p106 + p107))) : NOT(A (G (TRUE))) : A (F (((p57 + p58 + p59 + p60 + p61 + p62 <= 2) AND (1 <= p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83)))) : A (G ((E (F (TRUE)) OR E (G ((p98 + p97 + p96 + p100 + p101 + p94 + p93 + p92 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99 <= p44 + p43 + p42)))))) : E (F (((p44 + p43 + p42 + 1 <= p63 + p64 + p65) AND (p98 + p97 + p96 + p100 + p101 + p94 + p93 + p92 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99 + 1 <= p57 + p58 + p59 + p60 + p61 + p62) AND ((p98 + p97 + p96 + p100 + p101 + p94 + p93 + p92 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99 <= 0) OR (p44 + p43 + p42 <= 0))))) : (A ((((p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23) AND (p98 + p97 + p96 + p100 + p101 + p94 + p93 + p92 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99 <= p63 + p64 + p65)) U (1 <= p57 + p58 + p59 + p60 + p61 + p62))) OR A (G (TRUE))) : E ((E (X ((2 <= p44 + p43 + p42))) U ((3 <= p98 + p97 + p96 + p100 + p101 + p94 + p93 + p92 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99) AND (2 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23) AND ((2 <= p102 + p103 + p104 + p105 + p106 + p107) OR (1 <= p98 + p97 + p96 + p100 + p101 + p94 + p93 + p92 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99))))) : E (X (E (G (((p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 <= p63 + p64 + p65) OR (3 <= p51 + p52 + p53 + p54 + p55 + p56)))))) : E (F (E (((3 <= p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41) U (3 <= p63 + p64 + p65))))) : NOT(E (((p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 <= 0) U (p44 + p43 + p42 + 1 <= p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41)))) : NOT(A (F ((p44 + p43 + p42 <= p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:446
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 45 rewrites
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Peterson-COL-2-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 45 rewrites
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Peterson-COL-2-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 45 rewrites
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges

FORMULA Peterson-COL-2-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 45 rewrites
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Peterson-COL-2-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 45 rewrites
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges

FORMULA Peterson-COL-2-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (X ((2 <= p44 + p43 + p42))) U ((3 <= p98 + p97 + p96 + p100 + p101 + p94 + p93 + p92 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99) AND (2 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23) AND ((2 <= p102 + p103 + p104 + p105 + p106 + p107) OR (1 <= p98 + p97 + p96 + p100 + p101 + p94 + p93 + p92 + p91 + p90 + p84 + p85 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(EX((2 <= p44 + p43 + p42)) U ((3 <= p98 + p97 + p96 + p100 + p101 + p94 + p93 + p92 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99) AND (2 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23) AND ((2 <= p102 + p103 + p104 + p105 + p106 + p107) OR (1 <= p98 + p97 + p96 + p100 + p101 + p94 + p93 + p92 + p91 + p90 + p84 + p85 + p86 ... (shortened)
lola: processed formula length: 433
lola: 47 rewrites
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 618 markings, 693 edges
lola: ========================================

FORMULA Peterson-COL-2-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (((p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 <= p63 + p64 + p65) OR (3 <= p51 + p52 + p53 + p54 + p55 + p56))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:627
lola: processed formula: ((p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 <= p63 + p64 + p65) OR (3 <= p51 + p52 + p53 + p54 + p55 + p56))
lola: processed formula length: 173
lola: 46 rewrites
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 39 markings, 47 edges

FORMULA Peterson-COL-2-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p63 + p64 + p65)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((3 <= p63 + p64 + p65)))
lola: processed formula length: 30
lola: 46 rewrites
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (3 <= p63 + p64 + p65)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Peterson-COL-2-CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Peterson-COL-2-CTLCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 20754 markings, 62262 edges
lola: ========================================

FORMULA Peterson-COL-2-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p57 + p58 + p59 + p60 + p61 + p62)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((3 <= p57 + p58 + p59 + p60 + p61 + p62)))
lola: processed formula length: 48
lola: 46 rewrites
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (3 <= p57 + p58 + p59 + p60 + p61 + p62)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Peterson-COL-2-CTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Peterson-COL-2-CTLCardinality-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 19689 markings, 58640 edges
lola: ========================================

FORMULA Peterson-COL-2-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p44 + p43 + p42 + 1 <= p63 + p64 + p65) AND (p98 + p97 + p96 + p100 + p101 + p94 + p93 + p92 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99 + 1 <= p57 + p58 + p59 + p60 + p61 + p62) AND ((p98 + p97 + p96 + p100 + p101 + p94 + p93 + p92 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99 <= 0) OR (p44 + p43 + p42 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((p44 + p43 + p42 + 1 <= p63 + p64 + p65) AND (p98 + p97 + p96 + p100 + p101 + p94 + p93 + p92 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99 + 1 <= p57 + p58 + p59 + p60 + p61 + p62) AND ((p98 + p97 + p96 + p100 + p101 + p94 + p93 + p92 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99 <= 0) OR (p44 + p43 + p42 <= 0)))))
lola: processed formula length: 353
lola: 46 rewrites
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((p44 + p43 + p42 + 1 <= p63 + p64 + p65) AND (p98 + p97 + p96 + p100 + p101 + p94 + p93 + p92 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99 + 1 <= p57 + p58 + p59 + p60 + p61 + p62) AND ((p98 + p97 + p96 + p100 + p101 + p94 + p93 + p92 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99 <= 0) OR (p44 + p43 + p42 <= 0)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Peterson-COL-2-CTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Peterson-COL-2-CTLCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6976 markings, 20867 edges
lola: ========================================

FORMULA Peterson-COL-2-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p44 + p43 + p42 <= p102 + p103 + p104 + p105 + p106 + p107)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p102 + p103 + p104 + p105 + p106 + p107 + 1 <= p44 + p43 + p42)
lola: processed formula length: 64
lola: 47 rewrites
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 46 markings, 46 edges
lola: ========================================

FORMULA Peterson-COL-2-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((p98 + p97 + p96 + p100 + p101 + p94 + p93 + p92 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99 <= 2) AND (1 <= p98 + p97 + p96 + p100 + p101 + p94 + p93 + p92 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((3 <= p98 + p97 + p96 + p100 + p101 + p94 + p93 + p92 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99) OR (p98 + p97 + p96 + p100 + p101 + p94 + p93 + p92 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99 <= 0))
lola: processed formula length: 235
lola: 47 rewrites
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate eventually occurs from all states.
lola: 10655 markings, 25057 edges
lola: ========================================
FORMULA Peterson-COL-2-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + 1 <= p44 + p43 + p42)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + 1 <= p44 + p43 + p42)))
lola: processed formula length: 138
lola: 45 rewrites
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 426 markings, 543 edges
lola: ========================================

FORMULA Peterson-COL-2-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p57 + p58 + p59 + p60 + p61 + p62 <= 2) AND (1 <= p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((3 <= p57 + p58 + p59 + p60 + p61 + p62) OR (p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 <= 0))
lola: processed formula length: 159
lola: 47 rewrites
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 167 markings, 267 edges
lola: ========================================

FORMULA Peterson-COL-2-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((p44 + p43 + p42 + 1 <= p63 + p64 + p65) R (p57 + p58 + p59 + p60 + p61 + p62 <= 2))) OR E (((p51 + p52 + p53 + p54 + p55 + p56 <= 2) R (p44 + p43 + p42 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p51 + p52 + p53 + p54 + p55 + p56 <= 2) R (p44 + p43 + p42 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:646
lola: rewrite Frontend/Parser/formula_rewrite.k:610
lola: processed formula: E (((p51 + p52 + p53 + p54 + p55 + p56 <= 2) R (p44 + p43 + p42 <= 1)))
lola: processed formula length: 71
lola: 47 rewrites
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: There is no path where Predicate Phi releases Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p44 + p43 + p42 + 1 <= p63 + p64 + p65) R (p57 + p58 + p59 + p60 + p61 + p62 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:647
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (((p44 + p43 + p42 + 1 <= p63 + p64 + p65) R (p57 + p58 + p59 + p60 + p61 + p62 <= 2)))
lola: processed formula length: 89
lola: 51 rewrites
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (3 <= p57 + p58 + p59 + p60 + p61 + p62)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Peterson-COL-2-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Peterson-COL-2-CTLCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 20265 markings, 60255 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA Peterson-COL-2-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83) R (p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= p44 + p43 + p42)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:647
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (((1 <= p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83) R (p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= p44 + p43 + p42)))
lola: processed formula length: 247
lola: 51 rewrites
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (p44 + p43 + p42 + 1 <= p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Peterson-COL-2-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 464 markings, 924 edges
lola: ========================================

FORMULA Peterson-COL-2-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no no yes no no no yes yes yes no yes no yes yes
lola:
preliminary result: yes yes no no yes no no no yes yes yes no yes no yes yes
lola: memory consumption: 22112 KB
lola: time consumption: 1 seconds

BK_STOP 1527040137413

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-COL-2"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
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/Peterson-COL-2.tgz
mv Peterson-COL-2 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 lola"
echo " Input is Peterson-COL-2, 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 r112-csrt-152666469600514"
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 ;