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_PermAdmissibility-COL-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441650200367
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496381223279


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_PermAdmissibility-COL-05: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_PermAdmissibility-COL-05: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
ReachabilityCardinality @ S_PermAdmissibility-COL-05 @ 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-05-ReachabilityCardinality.task
lola: E (F (((1 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) AND ((p90 + p89 + p91 + p92 + p93 + p94 + p95 + p96 + 1 <= p158) OR ((3 <= p78) AND (p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p156)))))) : E (F ((2 <= p79))) : A (G (((p76 <= 1) OR (p87 + p86 + p85 + p84 + p83 + p82 + p81 + p88 <= 0) OR (((p51 <= p156) OR (3 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16)) AND (p100 + p101 + p102 + p103 + p104 + p97 + p98 + p99 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))))) : A (G ((((p87 + p86 + p85 + p84 + p83 + p82 + p81 + p88 <= p78) OR (p199 <= p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123) OR (p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112)) AND ((2 <= p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166) OR (p113 <= p51) OR (p158 <= p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123) OR (p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))))) : E (F (((p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 <= p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166) AND (((p8 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207) AND (3 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67)) OR ((2 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75) AND (p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p115)))))) : E (F ((3 <= p50))) : A (G (((2 <= p8) OR (p77 <= p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131)))) : A (G (((p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24) OR (3 <= p199) OR ((p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 <= p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131) AND (1 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)) OR ((p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174) AND (2 <= p90 + p89 + p91 + p92 + p93 + p94 + p95 + p96) AND (p157 + 1 <= p87 + p86 + p85 + p84 + p83 + p82 + p81 + p88))))) : A (G ((p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 <= p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182))) : E (F (((3 <= p115) AND (p157 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) AND (3 <= p156) AND (3 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174) AND ((p79 <= p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32) OR (1 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) OR (3 <= p158))))) : E (F ((((2 <= p114) OR (2 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + 1 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)) AND ((p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147) OR (p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= p156) OR (p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59))))) : A (G (((p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 <= p80) OR (1 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112)))) : A (G (((2 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59) OR (p115 <= p156) OR ((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= p78) AND (2 <= p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32)) OR (p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 <= 1) OR (p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= 2)))) : A (G (((1 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174) OR (p199 + 1 <= p33) OR ((3 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198) AND (p51 <= p8) AND (2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147) AND (3 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174))))) : E (F (((p87 + p86 + p85 + p84 + p83 + p82 + p81 + p88 <= 2) AND (3 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75) AND ((1 <= p87 + p86 + p85 + p84 + p83 + p82 + p81 + p88) OR ((p158 <= p115) AND (3 <= p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155)))))) : A (G ((p158 <= p90 + p89 + p91 + p92 + p93 + p94 + p95 + p96)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) AND ((p90 + p89 + p91 + p92 + p93 + p94 + p95 + p96 + 1 <= p158) OR ((3 <= p78) AND (p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p156))))))
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 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p79)))
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-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 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p76 <= 1) OR (p87 + p86 + p85 + p84 + p83 + p82 + p81 + p88 <= 0) OR (((p51 <= p156) OR (3 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16)) AND (p100 + p101 + p102 + p103 + p104 + p97 + p98 + p99 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))))
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 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-2.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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p87 + p86 + p85 + p84 + p83 + p82 + p81 + p88 <= p78) OR (p199 <= p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123) OR (p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112)) AND ((2 <= p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166) OR (p113 <= p51) OR (p158 <= p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123) OR (p6... (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 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-3.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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 <= p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166) AND (((p8 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207) AND (3 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67)) OR ((2 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75) AND (p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p115))))))
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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-4.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p50)))
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-05-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p8) OR (p77 <= p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131))))
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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-6.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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24) OR (3 <= p199) OR ((p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 <= p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131) AND (1 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)) OR ((p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 <= p167 + p168 + p169 + p170 + p171 + p172 +... (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 24 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-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 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 <= p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182)))
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-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 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p115) AND (p157 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) AND (3 <= p156) AND (3 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174) AND ((p79 <= p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32) OR (1 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) OR (3 <= p158)))))
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 15 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-05-ReachabilityCardinality-9.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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p114) OR (2 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + 1 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)) AND ((p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147) OR (p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= p156) OR (p175 + p176 + p177 + p178 + p179 + p180 + ... (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 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 9 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 <= p80) OR (1 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112))))
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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-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 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59) OR (p115 <= p156) OR ((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= p78) AND (2 <= p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32)) OR (p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 <= 1) OR (p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= 2))))
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 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174) OR (p199 + 1 <= p33) OR ((3 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198) AND (p51 <= p8) AND (2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147) AND (3 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174)))))
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 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-13.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: lola: ========================================
state equation: calling and running sara
...considering subproblem: E (F (((p87 + p86 + p85 + p84 + p83 + p82 + p81 + p88 <= 2) AND (3 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75) AND ((1 <= p87 + p86 + p85 + p84 + p83 + p82 + p81 + p88) OR ((p158 <= p115) AND (3 <= p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155))))))
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 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
sara: try reading problem file PermAdmissibility-COL-05-ReachabilityCardinality-13.sara.
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p158 <= p90 + p89 + p91 + p92 + p93 + p94 + p95 + p96)))
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-05-ReachabilityCardinality-15.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no yes yes no no no no yes no no no yes no
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496381223829

--------------------
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_PermAdmissibility-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_PermAdmissibility-COL-05.tgz
mv S_PermAdmissibility-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_PermAdmissibility-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 r118-blw7-149441650200367"
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 ;