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 PermAdmissibility-COL-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440484900358
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494650128493


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ PermAdmissibility-COL-02 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1232/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 208 places, 1024 transitions, 177 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1460 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-02-ReachabilityCardinality.task
lola: A (G (((p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + 1 <= p169) OR (p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 <= 0) OR (2 <= p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185)))) : E (F ((p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 <= p52))) : E (F ((3 <= p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85))) : A (G ((p26 <= p88 + p87 + p86 + p89 + p90 + p91 + p92 + p93))) : E (F (((3 <= p190) OR (3 <= p188) OR ((3 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) AND (p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 <= p27)) OR ((1 <= p17) AND (1 <= p53) AND (p95 + 1 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69))))) : E (F ((((3 <= p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51) AND (3 <= p190) AND ((2 <= p95) OR (p17 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))) OR ((p199 + 1 <= p8) AND ((1 <= p187) OR (2 <= p187)))))) : A (G ((1 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25))) : A (G ((p190 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61))) : A (G ((((p52 + 1 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135) OR (p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 <= 2)) AND (p26 <= p88 + p87 + p86 + p89 + p90 + p91 + p92 + p93)))) : A (G ((((3 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25) AND (p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152) AND (2 <= p27)) OR (((p189 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135) OR (p88 + p87 + p86 + p89 + p90 + p91 + p92 + p93 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16)) AND ((p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61) OR (1 <= p52)))))) : E (F ((1 <= p76 + p75 + p74 + p73 + p72 + p71 + p70 + p77))) : A (G (((p17 + 1 <= p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185) OR (p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 <= 1) OR ((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= 2) AND (p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + 1 <= p27))))) : E (F ((((p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 <= 0) AND (p8 + 1 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61)) OR (3 <= p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85)))) : E (F (((p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + 1 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198) AND ((p169 <= 1) OR (p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 <= 2))))) : E (F ((3 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35))) : A (G ((p26 <= p187)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + 1 <= p169) OR (p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 <= 0) OR (2 <= p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185))))
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 708 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 PermAdmissibility-COL-02-ReachabilityCardinality.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 <= p52)))
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 708 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 PermAdmissibility-COL-02-ReachabilityCardinality.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85)))
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 708 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 PermAdmissibility-COL-02-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-02-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p26 <= p88 + p87 + p86 + p89 + p90 + p91 + p92 + p93)))
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 708 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 PermAdmissibility-COL-02-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-02-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p190) OR (3 <= p188) OR ((3 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) AND (p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 <= p27)) OR ((1 <= p17) AND (1 <= p53) AND (p95 + 1 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69)))))
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 708 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 4 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-02-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-02-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 154976 markings, 344049 edges, 30995 markings/sec, 0 secs
lola: sara is running 5 secs || 298092 markings, 677377 edges, 28623 markings/sec, 5 secs
lola: sara is running 10 secs || 447874 markings, 1041584 edges, 29956 markings/sec, 10 secs
lola: sara is running 15 secs || 600727 markings, 1491083 edges, 30571 markings/sec, 15 secs
lola: sara is running 20 secs || 751393 markings, 1945835 edges, 30133 markings/sec, 20 secs
lola: sara is running 25 secs || 905927 markings, 2346569 edges, 30907 markings/sec, 25 secs
lola: sara is running 30 secs || 1061902 markings, 2726511 edges, 31195 markings/sec, 30 secs
lola: sara is running 35 secs || 1217631 markings, 3089603 edges, 31146 markings/sec, 35 secs
lola: sara is running 40 secs || 1372101 markings, 3448441 edges, 30894 markings/sec, 40 secs
lola: sara is running 45 secs || 1523430 markings, 3828687 edges, 30266 markings/sec, 45 secs
lola: sara is running 50 secs || 1676950 markings, 4190399 edges, 30704 markings/sec, 50 secs
lola: sara is running 55 secs || 1830205 markings, 4542874 edges, 30651 markings/sec, 55 secs
lola: sara is running 60 secs || 1980996 markings, 4921588 edges, 30158 markings/sec, 60 secs
lola: sara is running 65 secs || 2133262 markings, 5279497 edges, 30453 markings/sec, 65 secs
lola: sara is running 70 secs || 2286215 markings, 5631347 edges, 30591 markings/sec, 70 secs
lola: sara is running 75 secs || 2435627 markings, 6005223 edges, 29882 markings/sec, 75 secs
lola: sara is running 80 secs || 2587075 markings, 6365748 edges, 30290 markings/sec, 80 secs
lola: sara is running 85 secs || 2743205 markings, 6726937 edges, 31226 markings/sec, 85 secs
lola: sara is running 90 secs || 2891225 markings, 7055522 edges, 29604 markings/sec, 90 secs
lola: sara is running 95 secs || 3045717 markings, 7431834 edges, 30898 markings/sec, 95 secs
lola: sara is running 100 secs || 3188974 markings, 7766755 edges, 28651 markings/sec, 100 secs
lola: sara is running 105 secs || 3335060 markings, 8112093 edges, 29217 markings/sec, 105 secs
lola: sara is running 110 secs || 3484926 markings, 8527294 edges, 29973 markings/sec, 110 secs
lola: sara is running 115 secs || 3635538 markings, 8974590 edges, 30122 markings/sec, 115 secs
lola: sara is running 120 secs || 3784788 markings, 9422171 edges, 29850 markings/sec, 120 secs
lola: sara is running 125 secs || 3927398 markings, 9858458 edges, 28522 markings/sec, 125 secs
lola: sara is running 130 secs || 4078213 markings, 10259241 edges, 30163 markings/sec, 130 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 309 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51) AND (3 <= p190) AND ((2 <= p95) OR (p17 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))) OR ((p199 + 1 <= p8) AND ((1 <= p187) OR (2 <= p187))))))
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 708 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 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-02-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 340 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25)))
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 708 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 PermAdmissibility-COL-02-ReachabilityCardinality-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 378 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p190 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61)))
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 708 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 PermAdmissibility-COL-02-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-02-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 425 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p52 + 1 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135) OR (p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 <= 2)) AND (p26 <= p88 + p87 + p86 + p89 + p90 + p91 + p92 + p93))))
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 708 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 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-02-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-02-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 486 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25) AND (p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152) AND (2 <= p27)) OR (((p189 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135) OR (p88 + p87 + p86 + p89 + p90 + p91 + p92 + p93 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16)) AND ((p153 + p154 + p155 + p156 + 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 708 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 18 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-02-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 567 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p76 + p75 + p74 + p73 + p72 + p71 + p70 + p77)))
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 708 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 PermAdmissibility-COL-02-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 11 will run for 680 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p17 + 1 <= p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185) OR (p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 <= 1) OR ((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= 2) AND (p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + 1 <= p27)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 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 PermAdmissibility-COL-02-ReachabilityCardinality-11.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 850 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 <= 0) AND (p8 + 1 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61)) OR (3 <= p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85))))
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 708 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 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-02-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 1134 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + 1 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198) AND ((p169 <= 1) OR (p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 <= 2)))))
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 708 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 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-02-ReachabilityCardinality-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1701 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35)))
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 708 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 PermAdmissibility-COL-02-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 3402 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p26 <= p187)))
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 708 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 PermAdmissibility-COL-02-ReachabilityCardinality-15.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: RESULT
lola:
SUMMARY: no yes no yes no yes no no yes no yes no yes yes yes no
lola: ========================================
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494650266350

--------------------
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="PermAdmissibility-COL-02"
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/PermAdmissibility-COL-02.tgz
mv PermAdmissibility-COL-02 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 PermAdmissibility-COL-02, 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 r038-blw7-149440484900358"
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 ;