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-3254
Executing tool lola
Input is S_GlobalResAllocation-COL-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612400439
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496374613256


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_GlobalResAllocation-COL-05: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_GlobalResAllocation-COL-05: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
ReachabilityCardinality @ S_GlobalResAllocation-COL-05 @ 3459 seconds
----- Start make result stdout -----
lola: LoLA will run for 3459 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 56180/65536 symbol table entries, 38797 collisions
lola: preprocessing...
lola: finding significant places
lola: 75 places, 56105 transitions, 55 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2220 transition conflict sets
lola: TASK
lola: reading formula from GlobalResAllocation-COL-05-ReachabilityCardinality.task
lola: A (G (((p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p44 + p34 + p24 + p14 + 1 <= p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74) OR (p59 + p58 + p57 + p56 + p55 <= 1) OR (p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p44 + p34 + p24 + p14 + 1 <= p59 + p58 + p57 + p56 + p55)))) : E (F (((p59 + p58 + p57 + p56 + p55 <= 2) AND (p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 <= 2) AND ((2 <= p0 + p1 + p2 + p3 + p4) OR (2 <= p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74)) AND ((p59 + p58 + p57 + p56 + p55 <= p0 + p1 + p2 + p3 + p4) OR (2 <= p59 + p58 + p57 + p56 + p55))))) : A (G (((2 <= p0 + p1 + p2 + p3 + p4) OR (p0 + p1 + p2 + p3 + p4 <= p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74)))) : A (G (((p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p44 + p34 + p24 + p14 + 1 <= p59 + p58 + p57 + p56 + p55) OR (p60 + p61 + p62 + p63 + p64 <= 2) OR (p60 + p61 + p62 + p63 + p64 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p44 + p34 + p24 + p14) OR (1 <= p60 + p61 + p62 + p63 + p64)))) : A (G (((p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p44 + p34 + p24 + p14 <= 2) OR ((2 <= p60 + p61 + p62 + p63 + p64) AND (3 <= p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74) AND (p60 + p61 + p62 + p63 + p64 <= p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74))))) : A (G (((p0 + p1 + p2 + p3 + p4 + 1 <= p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74) OR (p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 <= 0) OR (3 <= p60 + p61 + p62 + p63 + p64)))) : A (G ((((2 <= p0 + p1 + p2 + p3 + p4) AND (1 <= p60 + p61 + p62 + p63 + p64)) OR ((3 <= p0 + p1 + p2 + p3 + p4) AND (2 <= p60 + p61 + p62 + p63 + p64)) OR (2 <= p60 + p61 + p62 + p63 + p64) OR (p60 + p61 + p62 + p63 + p64 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p44 + p34 + p24 + p14) OR (p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 <= 2)))) : A (G ((1 <= p60 + p61 + p62 + p63 + p64))) : A (G (((p59 + p58 + p57 + p56 + p55 <= 2) OR (p0 + p1 + p2 + p3 + p4 <= 2) OR (p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 <= 0)))) : A (G ((2 <= p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74))) : A (G ((2 <= p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74))) : E (F (())) : E (F (((p59 + p58 + p57 + p56 + p55 + 1 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p44 + p34 + p24 + p14) AND (p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 <= p0 + p1 + p2 + p3 + p4) AND ((p0 + p1 + p2 + p3 + p4 + 1 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p44 + p34 + p24 + p14) OR ((3 <= p0 + p1 + p2 + p3 + p4) AND (p60 + p61 + p62 + p63 + p64 <= p59 + p58 + p57 + p56 + p55)))))) : A (G (TRUE)) : E (F (((p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 <= 2) AND ((1 <= p0 + p1 + p2 + p3 + p4) OR (3 <= p59 + p58 + p57 + p56 + p55)) AND (3 <= p0 + p1 + p2 + p3 + p4)))) : A (G (()))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 216 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p44 + p34 + p24 + p14 + 1 <= p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74) OR (p59 + p58 + p57 + p56 + p55 ... (shortened)
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 220 bytes per marking, with 0 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 GlobalResAllocation-COL-05-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 230 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p59 + p58 + p57 + p56 + p55 <= 2) AND (p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 <= 2) AND ((2 <= p0 + p1 + p2 + p3 + p4) OR (2 <= p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74)) AND ((p59 + p58 + p57 + p56 + p55 <= p0 + p1 + p2 + p3 + p4) OR (2 <= p59 + p58 + p57 + p56 + p55)))))
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 220 bytes per marking, with 0 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 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 246 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p0 + p1 + p2 + p3 + p4) OR (p0 + p1 + p2 + p3 + p4 <= p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74))))
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 220 bytes per marking, with 0 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 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 43 markings, 50 edges, 9 markings/sec, 0 secs
lola: sara is running 5 secs || 177 markings, 260 edges, 27 markings/sec, 5 secs
lola: sara is running 10 secs || 359 markings, 564 edges, 36 markings/sec, 10 secs
lola: sara is running 15 secs || 583 markings, 962 edges, 45 markings/sec, 15 secs
lola: sara is running 20 secs || 726 markings, 1237 edges, 29 markings/sec, 20 secs
lola: sara is running 25 secs || 999 markings, 1721 edges, 55 markings/sec, 25 secs
lola: sara is running 30 secs || 1147 markings, 2007 edges, 30 markings/sec, 30 secs
lola: sara is running 35 secs || 1360 markings, 2415 edges, 43 markings/sec, 35 secs
lola: sara is running 40 secs || 1698 markings, 2970 edges, 68 markings/sec, 40 secs
lola: sara is running 45 secs || 2060 markings, 3607 edges, 72 markings/sec, 45 secs
lola: sara is running 50 secs || 2248 markings, 3983 edges, 38 markings/sec, 50 secs
lola: sara is running 55 secs || 2440 markings, 4347 edges, 38 markings/sec, 55 secs
lola: sara is running 60 secs || 2723 markings, 4840 edges, 57 markings/sec, 60 secs
lola: sara is running 65 secs || 3095 markings, 5453 edges, 74 markings/sec, 65 secs
lola: sara is running 70 secs || 3484 markings, 6151 edges, 78 markings/sec, 70 secs
lola: sara is running 75 secs || 3823 markings, 6761 edges, 68 markings/sec, 75 secs
lola: sara is running 80 secs || 4211 markings, 7465 edges, 78 markings/sec, 80 secs
lola: sara is running 85 secs || 4512 markings, 8007 edges, 60 markings/sec, 85 secs
lola: sara is running 90 secs || 4941 markings, 8750 edges, 86 markings/sec, 90 secs
lola: sara is running 95 secs || 5252 markings, 9274 edges, 62 markings/sec, 95 secs
lola: sara is running 100 secs || 5674 markings, 10003 edges, 84 markings/sec, 100 secs
lola: sara is running 105 secs || 6063 markings, 10706 edges, 78 markings/sec, 105 secs
lola: sara is running 110 secs || 6431 markings, 11357 edges, 74 markings/sec, 110 secs
lola: sara is running 115 secs || 6648 markings, 11794 edges, 43 markings/sec, 115 secs
lola: sara is running 120 secs || 7069 markings, 12519 edges, 84 markings/sec, 120 secs
lola: sara is running 125 secs || 7506 markings, 13312 edges, 87 markings/sec, 125 secs
lola: sara is running 130 secs || 7937 markings, 14054 edges, 86 markings/sec, 130 secs
lola: sara is running 135 secs || 8390 markings, 14862 edges, 91 markings/sec, 135 secs
lola: sara is running 140 secs || 8815 markings, 15653 edges, 85 markings/sec, 140 secs
lola: sara is running 145 secs || 9282 markings, 16455 edges, 93 markings/sec, 145 secs
lola: sara is running 150 secs || 9779 markings, 17416 edges, 99 markings/sec, 150 secs
lola: sara is running 155 secs || 10078 markings, 17916 edges, 60 markings/sec, 155 secs
lola: sara is running 160 secs || 10530 markings, 18686 edges, 90 markings/sec, 160 secs
lola: sara is running 165 secs || 10967 markings, 19524 edges, 87 markings/sec, 165 secs
lola: sara is running 170 secs || 11337 markings, 20294 edges, 74 markings/sec, 170 secs
lola: sara is running 175 secs || 11608 markings, 20757 edges, 54 markings/sec, 175 secs
lola: sara is running 180 secs || 12027 markings, 21565 edges, 84 markings/sec, 180 secs
lola: sara is running 185 secs || 12498 markings, 22468 edges, 94 markings/sec, 185 secs
lola: sara is running 190 secs || 12926 markings, 23292 edges, 86 markings/sec, 190 secs
lola: sara is running 195 secs || 13321 markings, 24056 edges, 79 markings/sec, 195 secs
lola: sara is running 200 secs || 13779 markings, 24932 edges, 92 markings/sec, 200 secs
lola: sara is running 205 secs || 14238 markings, 25804 edges, 92 markings/sec, 205 secs
lola: sara is running 210 secs || 14636 markings, 26627 edges, 80 markings/sec, 210 secs
lola: sara is running 215 secs || 15083 markings, 27452 edges, 89 markings/sec, 215 secs
lola: sara is running 220 secs || 15523 markings, 28268 edges, 88 markings/sec, 220 secs
lola: sara is running 225 secs || 16021 markings, 29191 edges, 100 markings/sec, 225 secs
lola: sara is running 230 secs || 16516 markings, 30093 edges, 99 markings/sec, 230 secs
lola: sara is running 235 secs || 16952 markings, 30971 edges, 87 markings/sec, 235 secs
lola: sara is running 240 secs || 17260 markings, 31609 edges, 62 markings/sec, 240 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 246 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p44 + p34 + p24 + p14 + 1 <= p59 + p58 + p57 + p56 + p55) OR (p60 + p61 + p62 + p63 + p64 <= 2) OR (p60 + p61 + p62 + p... (shortened)
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 220 bytes per marking, with 0 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 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 526 markings, 769 edges, 105 markings/sec, 0 secs
lola: sara is running 5 secs || 1359 markings, 1992 edges, 167 markings/sec, 5 secs
lola: sara is running 10 secs || 2161 markings, 3174 edges, 160 markings/sec, 10 secs
lola: sara is running 15 secs || 2984 markings, 4389 edges, 165 markings/sec, 15 secs
lola: sara is running 20 secs || 3806 markings, 5601 edges, 164 markings/sec, 20 secs
lola: sara is running 25 secs || 4592 markings, 6709 edges, 157 markings/sec, 25 secs
lola: sara is running 30 secs || 5427 markings, 7934 edges, 167 markings/sec, 30 secs
lola: sara is running 35 secs || 6211 markings, 9079 edges, 157 markings/sec, 35 secs
lola: sara is running 40 secs || 6984 markings, 10180 edges, 155 markings/sec, 40 secs
lola: sara is running 45 secs || 7805 markings, 11384 edges, 164 markings/sec, 45 secs
lola: sara is running 50 secs || 8640 markings, 12610 edges, 167 markings/sec, 50 secs
lola: sara is running 55 secs || 9449 markings, 13815 edges, 162 markings/sec, 55 secs
lola: sara is running 60 secs || 10246 markings, 14953 edges, 159 markings/sec, 60 secs
lola: sara is running 65 secs || 11050 markings, 16116 edges, 161 markings/sec, 65 secs
lola: sara is running 70 secs || 11861 markings, 17327 edges, 162 markings/sec, 70 secs
lola: sara is running 75 secs || 12723 markings, 18567 edges, 172 markings/sec, 75 secs
lola: sara is running 80 secs || 13597 markings, 19829 edges, 175 markings/sec, 80 secs
lola: sara is running 85 secs || 14402 markings, 21027 edges, 161 markings/sec, 85 secs
lola: sara is running 90 secs || 15276 markings, 22324 edges, 175 markings/sec, 90 secs
lola: sara is running 95 secs || 16089 markings, 23522 edges, 163 markings/sec, 95 secs
lola: sara is running 100 secs || 16899 markings, 24715 edges, 162 markings/sec, 100 secs
lola: sara is running 105 secs || 17727 markings, 25909 edges, 166 markings/sec, 105 secs
lola: sara is running 110 secs || 18523 markings, 27091 edges, 159 markings/sec, 110 secs
lola: sara is running 115 secs || 19328 markings, 28322 edges, 161 markings/sec, 115 secs
lola: sara is running 120 secs || 20126 markings, 29487 edges, 160 markings/sec, 120 secs
lola: sara is running 125 secs || 20963 markings, 30691 edges, 167 markings/sec, 125 secs
lola: sara is running 130 secs || 21814 markings, 31924 edges, 170 markings/sec, 130 secs
lola: sara is running 135 secs || 22624 markings, 33145 edges, 162 markings/sec, 135 secs
lola: sara is running 140 secs || 23468 markings, 34398 edges, 169 markings/sec, 140 secs
lola: sara is running 145 secs || 24321 markings, 35665 edges, 171 markings/sec, 145 secs
lola: sara is running 150 secs || 25099 markings, 36816 edges, 156 markings/sec, 150 secs
lola: sara is running 155 secs || 25911 markings, 37980 edges, 162 markings/sec, 155 secs
lola: sara is running 160 secs || 26715 markings, 39157 edges, 161 markings/sec, 160 secs
lola: sara is running 165 secs || 27535 markings, 40345 edges, 164 markings/sec, 165 secs
lola: sara is running 170 secs || 28358 markings, 41658 edges, 165 markings/sec, 170 secs
lola: sara is running 175 secs || 29176 markings, 42933 edges, 164 markings/sec, 175 secs
lola: sara is running 180 secs || 30012 markings, 44191 edges, 167 markings/sec, 180 secs
lola: sara is running 185 secs || 30812 markings, 45363 edges, 160 markings/sec, 185 secs
lola: sara is running 190 secs || 31658 markings, 46634 edges, 169 markings/sec, 190 secs
lola: sara is running 195 secs || 32478 markings, 47862 edges, 164 markings/sec, 195 secs
lola: sara is running 200 secs || 33285 markings, 49080 edges, 161 markings/sec, 200 secs
lola: sara is running 205 secs || 34124 markings, 50275 edges, 168 markings/sec, 205 secs
lola: sara is running 210 secs || 34989 markings, 51566 edges, 173 markings/sec, 210 secs
lola: sara is running 215 secs || 35792 markings, 52761 edges, 161 markings/sec, 215 secs
lola: sara is running 220 secs || 36578 markings, 53960 edges, 157 markings/sec, 220 secs
lola: sara is running 225 secs || 37338 markings, 55162 edges, 152 markings/sec, 225 secs
lola: sara is running 230 secs || 38088 markings, 56267 edges, 150 markings/sec, 230 secs
lola: sara is running 235 secs || 38866 markings, 57408 edges, 156 markings/sec, 235 secs
lola: sara is running 240 secs || 39722 markings, 58684 edges, 171 markings/sec, 240 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 246 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p44 + p34 + p24 + p14 <= 2) OR ((2 <= p60 + p61 + p62 + p63 + p64) AND (3 <= p65 + p66 + p67 + p68 + p69 + p70 + p71 + p... (shortened)
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 220 bytes per marking, with 0 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 GlobalResAllocation-COL-05-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 269 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p0 + p1 + p2 + p3 + p4 + 1 <= p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74) OR (p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 <= 0) OR (3 <= p60 + p61 + p62 + p63 + p64))))
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 220 bytes per marking, with 0 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 GlobalResAllocation-COL-05-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= p0 + p1 + p2 + p3 + p4) AND (1 <= p60 + p61 + p62 + p63 + p64)) OR ((3 <= p0 + p1 + p2 + p3 + p4) AND (2 <= p60 + p61 + p62 + p63 + p64)) OR (2 <= p60 + p61 + p62 + p63 + p64) OR (p60 + p61 + p62 + p63 + p64 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p35 + p36 + p37... (shortened)
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 220 bytes per marking, with 0 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 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 18 markings, 18 edges, 4 markings/sec, 0 secs
lola: sara is running 5 secs || 147 markings, 183 edges, 26 markings/sec, 5 secs
lola: sara is running 10 secs || 297 markings, 398 edges, 30 markings/sec, 10 secs
lola: sara is running 15 secs || 435 markings, 582 edges, 28 markings/sec, 15 secs
lola: sara is running 20 secs || 558 markings, 746 edges, 25 markings/sec, 20 secs
lola: sara is running 25 secs || 689 markings, 926 edges, 26 markings/sec, 25 secs
lola: sara is running 30 secs || 822 markings, 1104 edges, 27 markings/sec, 30 secs
lola: sara is running 35 secs || 948 markings, 1278 edges, 25 markings/sec, 35 secs
lola: sara is running 40 secs || 1050 markings, 1427 edges, 20 markings/sec, 40 secs
lola: sara is running 45 secs || 1194 markings, 1619 edges, 29 markings/sec, 45 secs
lola: sara is running 50 secs || 1309 markings, 1768 edges, 23 markings/sec, 50 secs
lola: sara is running 55 secs || 1436 markings, 1944 edges, 25 markings/sec, 55 secs
lola: sara is running 60 secs || 1551 markings, 2108 edges, 23 markings/sec, 60 secs
lola: sara is running 65 secs || 1691 markings, 2288 edges, 28 markings/sec, 65 secs
lola: sara is running 70 secs || 1822 markings, 2465 edges, 26 markings/sec, 70 secs
lola: sara is running 75 secs || 1972 markings, 2672 edges, 30 markings/sec, 75 secs
lola: sara is running 80 secs || 2414 markings, 3266 edges, 88 markings/sec, 80 secs
lola: sara is running 85 secs || 2536 markings, 3435 edges, 24 markings/sec, 85 secs
lola: sara is running 90 secs || 2666 markings, 3613 edges, 26 markings/sec, 90 secs
lola: sara is running 95 secs || 2870 markings, 3899 edges, 41 markings/sec, 95 secs
lola: sara is running 100 secs || 3264 markings, 4486 edges, 79 markings/sec, 100 secs
lola: sara is running 105 secs || 3389 markings, 4661 edges, 25 markings/sec, 105 secs
lola: sara is running 110 secs || 3523 markings, 4833 edges, 27 markings/sec, 110 secs
lola: sara is running 115 secs || 3636 markings, 4981 edges, 23 markings/sec, 115 secs
lola: sara is running 120 secs || 3774 markings, 5176 edges, 28 markings/sec, 120 secs
lola: sara is running 125 secs || 3885 markings, 5340 edges, 22 markings/sec, 125 secs
lola: sara is running 130 secs || 4042 markings, 5593 edges, 31 markings/sec, 130 secs
lola: sara is running 135 secs || 4504 markings, 6213 edges, 92 markings/sec, 135 secs
lola: sara is running 140 secs || 4963 markings, 6812 edges, 92 markings/sec, 140 secs
lola: sara is running 145 secs || 5418 markings, 7411 edges, 91 markings/sec, 145 secs
lola: sara is running 150 secs || 5859 markings, 8001 edges, 88 markings/sec, 150 secs
lola: sara is running 155 secs || 6296 markings, 8599 edges, 87 markings/sec, 155 secs
lola: sara is running 160 secs || 6736 markings, 9189 edges, 88 markings/sec, 160 secs
lola: sara is running 165 secs || 7172 markings, 9804 edges, 87 markings/sec, 165 secs
lola: sara is running 170 secs || 7655 markings, 10431 edges, 97 markings/sec, 170 secs
lola: sara is running 175 secs || 8103 markings, 11050 edges, 90 markings/sec, 175 secs
lola: sara is running 180 secs || 8561 markings, 11689 edges, 92 markings/sec, 180 secs
lola: sara is running 185 secs || 9060 markings, 12351 edges, 100 markings/sec, 185 secs
lola: sara is running 190 secs || 9372 markings, 12782 edges, 62 markings/sec, 190 secs
lola: sara is running 195 secs || 9684 markings, 13205 edges, 62 markings/sec, 195 secs
lola: sara is running 200 secs || 10184 markings, 13879 edges, 100 markings/sec, 200 secs
lola: sara is running 205 secs || 10632 markings, 14493 edges, 90 markings/sec, 205 secs
lola: sara is running 210 secs || 10770 markings, 14669 edges, 28 markings/sec, 210 secs
lola: sara is running 215 secs || 10907 markings, 14848 edges, 27 markings/sec, 215 secs
lola: sara is running 220 secs || 11045 markings, 15034 edges, 28 markings/sec, 220 secs
lola: sara is running 225 secs || 11267 markings, 15349 edges, 44 markings/sec, 225 secs
lola: sara is running 230 secs || 11405 markings, 15551 edges, 28 markings/sec, 230 secs
lola: sara is running 235 secs || 11541 markings, 15747 edges, 27 markings/sec, 235 secs
lola: sara is running 240 secs || 11682 markings, 15931 edges, 28 markings/sec, 240 secs
lola: sara is running 245 secs || 11824 markings, 16112 edges, 28 markings/sec, 245 secs
lola: sara is running 250 secs || 11943 markings, 16287 edges, 24 markings/sec, 250 secs
lola: sara is running 255 secs || 12067 markings, 16464 edges, 25 markings/sec, 255 secs
lola: sara is running 260 secs || 12199 markings, 16661 edges, 26 markings/sec, 260 secs
lola: sara is running 265 secs || 12451 markings, 17064 edges, 50 markings/sec, 265 secs
lola: sara is running 270 secs || 12589 markings, 17255 edges, 28 markings/sec, 270 secs
lola: sara is running 275 secs || 12711 markings, 17411 edges, 24 markings/sec, 275 secs
lola: sara is running 280 secs || 12827 markings, 17582 edges, 23 markings/sec, 280 secs
lola: sara is running 285 secs || 12968 markings, 17769 edges, 28 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p60 + p61 + p62 + p63 + p64)))
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 220 bytes per marking, with 0 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 GlobalResAllocation-COL-05-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 332 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p59 + p58 + p57 + p56 + p55 <= 2) OR (p0 + p1 + p2 + p3 + p4 <= 2) OR (p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 <= 0))))
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 220 bytes per marking, with 0 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 GlobalResAllocation-COL-05-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 380 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74)))
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 220 bytes per marking, with 0 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 GlobalResAllocation-COL-05-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 443 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74)))
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 220 bytes per marking, with 0 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 GlobalResAllocation-COL-05-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 531 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-05-ReachabilityCardinality.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: ========================================
lola: subprocess 12 will run for 664 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p59 + p58 + p57 + p56 + p55 + 1 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p44 + p34 + p24 + p14) AND (p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 ... (shortened)
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 220 bytes per marking, with 0 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 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-05-ReachabilityCardinality.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: ========================================
lola: subprocess 14 will run for 1328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 <= 2) AND ((1 <= p0 + p1 + p2 + p3 + p4) OR (3 <= p59 + p58 + p57 + p56 + p55)) AND (3 <= p0 + p1 + p2 + p3 + p4))))
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 220 bytes per marking, with 0 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 2 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2656 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
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 220 bytes per marking, with 0 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: SUBRESULT
lola: state equation: State predicate is contradiction.
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: RESULT
lola:
SUMMARY: no yes unknown unknown no no unknown no no no no no yes yes yes yes
lola: ========================================
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496375497514

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="S_GlobalResAllocation-COL-05"
export BK_EXAMINATION="ReachabilityCardinality"
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/S_GlobalResAllocation-COL-05.tgz
mv S_GlobalResAllocation-COL-05 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_GlobalResAllocation-COL-05, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r108-blw3-149441612400439"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;