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_BridgeAndVehicles-COL-V50P50N50, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074400372
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496343280277


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_BridgeAndVehicles-COL-V50P50N50: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_BridgeAndVehicles-COL-V50P50N50: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
CTLCardinality @ S_BridgeAndVehicles-COL-V50P50N50 @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 5576/65536 symbol table entries, 1422 collisions
lola: preprocessing...
lola: finding significant places
lola: 168 places, 5408 transitions, 161 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5813 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: NOT(A (G (((p52 + p53 + 1 <= p51) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p98 + p97 + p96 + p95 + p94 + p93 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= 1))))) : (NOT((A (G ((p109 <= p51))) OR ((p111 <= p55) OR (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50) OR (p56 + p57 <= p165)))) OR E (F (((p110 <= 1))))) : NOT(A (G ((((p51 <= p52 + p53) AND (p165 <= p52 + p53)) OR (p55 + 1 <= p109))))) : (E (F (((p52 + p53 <= p56 + p57) AND (2 <= p55) AND (p54 + 1 <= p52 + p53)))) AND ((2 <= p110) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p98 + p97 + p96 + p95 + p94 + p93 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 + 1 <= p164) OR (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p98 + p97 + p96 + p95 + p94 + p93 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) OR (p54 <= p165))) : A (G (A (((p55 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162) U TRUE)))) : A (F (E (F (((1 <= p111) AND (3 <= p166 + p167)))))) : ((E (F ((p55 + 1 <= p51))) OR E (F ((p56 + p57 <= p163)))) AND A (G (A (F ((2 <= p52 + p53)))))) : ((((p54 <= p163) AND (p54 <= p164)) AND NOT(A (X ((1 <= p111))))) AND (E (G ((p110 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p98 + p97 + p96 + p95 + p94 + p93 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99))) OR ((((p110 <= p165) AND (p54 <= p165)) OR (p52 + p53 + 1 <= p109)) AND E (G ((p110 <= p109)))))) : (((p109 <= p163) AND (p111 + 1 <= p51)) OR A (X (A (F ((2 <= p51)))))) : ((((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= p164) OR (p109 <= p164)) OR A (((3 <= p52 + p53) U (p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p164)))) AND A (F ((1 <= p51)))) : ((((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= 1) OR (p164 <= 0) OR (p111 + 1 <= p56 + p57) OR (p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= 0)) AND ((3 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162) OR (p51 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50))) AND E (F (A (X ((p109 <= p51)))))) : A ((A (X ((p166 + p167 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162))) U E (F ((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p98 + p97 + p96 + p95 + p94 + p93 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99))))) : A (X (A (F (((1 <= p54) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p98 + p97 + p96 + p95 + p94 + p93 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p55)))))) : NOT(A (G (((p56 + p57 + 1 <= p164) OR (p55 <= 1))))) : E (F (((p51 <= 2) AND (p164 + 1 <= p111) AND ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p98 + p97 + p96 + p95 + p94 + p93 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p51) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p98 + p97 + p96 + p95 + p94 + p93 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p56 + p57) OR ((p52 + p53 <= p51)))))) : A (F (E (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + 1 <= p111)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (((p52 + p53 + 1 <= p51) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p98 + p97 + p96 + p95 + p94 + p93 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= 1)))))
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 644 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N50-CTLCardinality.sara
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: state equation: calling and running sara
lola: ...considering subproblem: (NOT((A (G ((p109 <= p51))) OR ((p111 <= p55) OR (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50) OR (p56 + p57 <= p165)))) OR E (F (((p110 <= 1))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p51 + 1 <= p109)))
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 644 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)
sara: try reading problem file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.sara.
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N50-CTLCardinality.sara
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p55 + 1 <= p111) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= 0) AND (p165 + 1 <= p56 + p57))
lola: ========================================
lola: lola: SUBTASK
lola: ========================================
checking initial satisfaction
lola: processed formula: ((p55 + 1 <= p111) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= 0) AND (p165 + 1 <= p56 + p57))
lola: processed formula length: 352
lola: 5 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.sara.
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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p110 <= 1))))
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 644 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 BridgeAndVehicles-COL-V50P50N50-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N50-CTLCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: SUBRESULT
lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G ((((p51 <= p52 + p53) AND (p165 <= p52 + p53)) OR (p55 + 1 <= p109)))))
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 644 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 BridgeAndVehicles-COL-V50P50N50-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N50-CTLCardinality-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((p52 + p53 <= p56 + p57) AND (2 <= p55) AND (p54 + 1 <= p52 + p53)))) AND ((2 <= p110) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p98 + p97 + p96 + p95 + p94 + p93 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p52 + p53 <= p56 + p57) AND (2 <= p55) AND (p54 + 1 <= p52 + p53))))
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 644 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 BridgeAndVehicles-COL-V50P50N50-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N50-CTLCardinality-3.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 1708 markings, 2712 edges, 342 markings/sec, 0 secs
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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (((p55 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162) U TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F (((1 <= p111) AND (3 <= p166 + p167))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U ((1 <= p111) AND (3 <= p166 + p167))))
lola: processed formula length: 56
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 174104 markings, 525056 edges, 2073447895104749568 markings/sec, 0 secs
lola: 367585 markings, 1102119 edges, 38696 markings/sec, 5 secs
lola: 565181 markings, 1690565 edges, 39519 markings/sec, 10 secs
lola: 757733 markings, 2244852 edges, 38510 markings/sec, 15 secs
lola: 944228 markings, 2750183 edges, 37299 markings/sec, 20 secs
lola: 1121202 markings, 3241212 edges, 35395 markings/sec, 25 secs
lola: 1288495 markings, 3715645 edges, 33459 markings/sec, 30 secs
lola: 1474590 markings, 4201030 edges, 37219 markings/sec, 35 secs
lola: 1660756 markings, 4723847 edges, 37233 markings/sec, 40 secs
lola: 1843393 markings, 5242781 edges, 36527 markings/sec, 45 secs
lola: 2039146 markings, 5759566 edges, 39151 markings/sec, 50 secs
lola: 2244943 markings, 6304061 edges, 41159 markings/sec, 55 secs
lola: 2437537 markings, 6877573 edges, 38519 markings/sec, 60 secs
lola: 2632558 markings, 7412832 edges, 39004 markings/sec, 65 secs
lola: 2830439 markings, 7945851 edges, 39576 markings/sec, 70 secs
lola: 3032263 markings, 8479037 edges, 40365 markings/sec, 75 secs
lola: 3223612 markings, 9056525 edges, 38270 markings/sec, 80 secs
lola: 3421746 markings, 9619426 edges, 39627 markings/sec, 85 secs
lola: 3616071 markings, 10155460 edges, 38865 markings/sec, 90 secs
lola: 3812745 markings, 10682090 edges, 39335 markings/sec, 95 secs
lola: 4007501 markings, 11215182 edges, 38951 markings/sec, 100 secs
lola: 4193936 markings, 11781012 edges, 37287 markings/sec, 105 secs
lola: 4381277 markings, 12326313 edges, 37468 markings/sec, 110 secs
lola: 4565754 markings, 12846244 edges, 36895 markings/sec, 115 secs
lola: 4740908 markings, 13338629 edges, 35031 markings/sec, 120 secs
lola: 4930828 markings, 13856808 edges, 37984 markings/sec, 125 secs
lola: 5115335 markings, 14361006 edges, 36901 markings/sec, 130 secs
lola: 5289481 markings, 14892922 edges, 34829 markings/sec, 135 secs
lola: 5461859 markings, 15414893 edges, 34476 markings/sec, 140 secs
lola: 5640206 markings, 15937114 edges, 35669 markings/sec, 145 secs
lola: 5826745 markings, 16472561 edges, 37308 markings/sec, 150 secs
lola: 6016198 markings, 17008203 edges, 37891 markings/sec, 155 secs
lola: 6202724 markings, 17534108 edges, 37305 markings/sec, 160 secs
lola: 6383185 markings, 18036633 edges, 36092 markings/sec, 165 secs
lola: 6567773 markings, 18570301 edges, 36918 markings/sec, 170 secs
lola: 6743894 markings, 19118572 edges, 35224 markings/sec, 175 secs
lola: 6924060 markings, 19668562 edges, 36033 markings/sec, 180 secs
lola: 7105022 markings, 20208011 edges, 36192 markings/sec, 185 secs
lola: 7289077 markings, 20740698 edges, 36811 markings/sec, 190 secs
lola: 7460755 markings, 21252893 edges, 34336 markings/sec, 195 secs
lola: 7644604 markings, 21775986 edges, 36770 markings/sec, 200 secs
lola: 7829038 markings, 22304054 edges, 36887 markings/sec, 205 secs
lola: 8015547 markings, 22843179 edges, 37302 markings/sec, 210 secs
lola: 8206466 markings, 23392664 edges, 38184 markings/sec, 215 secs
lola: 8381817 markings, 23944122 edges, 35070 markings/sec, 220 secs
lola: 8555223 markings, 24483794 edges, 34681 markings/sec, 225 secs
lola: 8725608 markings, 24997897 edges, 34077 markings/sec, 230 secs
lola: 8893203 markings, 25502088 edges, 33519 markings/sec, 235 secs
lola: 9059871 markings, 25999061 edges, 33334 markings/sec, 240 secs
lola: 9231976 markings, 26507999 edges, 34421 markings/sec, 245 secs
lola: 9415048 markings, 27046004 edges, 36614 markings/sec, 250 secs
lola: 9591255 markings, 27580768 edges, 35241 markings/sec, 255 secs
lola: 9774004 markings, 28092771 edges, 36550 markings/sec, 260 secs
lola: 9950641 markings, 28604752 edges, 35327 markings/sec, 265 secs
lola: 10130751 markings, 29147988 edges, 36022 markings/sec, 270 secs
lola: 10303020 markings, 29697050 edges, 34454 markings/sec, 275 secs
lola: 10472584 markings, 30229690 edges, 33913 markings/sec, 280 secs
lola: 10646251 markings, 30775743 edges, 34733 markings/sec, 285 secs
lola: 10810794 markings, 31280012 edges, 32909 markings/sec, 290 secs
lola: 10974389 markings, 31781738 edges, 32719 markings/sec, 295 secs
lola: 11137796 markings, 32281778 edges, 32681 markings/sec, 300 secs
lola: 11304224 markings, 32773834 edges, 33286 markings/sec, 305 secs
lola: 11474929 markings, 33287094 edges, 34141 markings/sec, 310 secs
lola: 11638746 markings, 33781558 edges, 32763 markings/sec, 315 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F ((p55 + 1 <= p51))) OR E (F ((p56 + p57 <= p163)))) AND A (G (A (F ((2 <= p52 + p53))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p55 + 1 <= p51)))
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 644 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 BridgeAndVehicles-COL-V50P50N50-CTLCardinality-6.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 7 will run for 356 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((2 <= p52 + p53)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (2 <= p52 + p53)))))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 356 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p54 <= p163) AND (p54 <= p164)) AND NOT(A (X ((1 <= p111))))) AND (E (G ((p110 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p98 + p97 + p96 + p95 + p94 + p93 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 356 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p54 <= p163) AND (p54 <= p164))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p54 <= p163) AND (p54 <= p164))
lola: processed formula length: 33
lola: 4 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: processed formula with 2 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 8 will run for 401 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((p111 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((p111 <= 0))
lola: processed formula length: 15
lola: 5 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 458 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p110 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p98 + p97 + p96 + p95 + p94 + p93 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p98 + p97 + p96 + p95 + p94 + p93 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 + 1 <= p110)))
lola: processed formula length: 341
lola: 6 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 10 will run for 534 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p110 <= p165) AND (p54 <= p165)) OR (p52 + p53 + 1 <= p109))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p110 <= p165) AND (p54 <= p165)) OR (p52 + p53 + 1 <= p109))
lola: processed formula length: 64
lola: 4 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: processed formula with 3 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 11 will run for 641 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p110 <= p109)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p109 + 1 <= p110)))
lola: processed formula length: 33
lola: 6 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 401 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p109 <= p163) AND (p111 + 1 <= p51)) OR A (X (A (F ((2 <= p51))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 401 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p109 <= p163) AND (p111 + 1 <= p51))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p109 <= p163) AND (p111 + 1 <= p51))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: processed formula with 2 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 9 will run for 458 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((2 <= p51)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (2 <= p51)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 458 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= p164) OR (p109 <= p164)) OR A (((3 <= p52 + p53) U (p112 + p113 + p114 + p115 + p116 + p117 + p118... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 458 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= p164) OR (p109 <= p164))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= p164) OR (p109 <= p164))
lola: processed formula length: 324
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: processed formula with 2 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 10 will run for 534 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p51)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (1 <= p51))
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 534 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= 1) OR (p164 <= 0) OR (p111 + 1 <= p56 + p57) OR (p112 + p113 + p114 + p115 + p116 + p117 + p118 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 534 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= 1) OR (p164 <= 0) OR (p111 + 1 <= p56 + p57) OR (p112 + p113 + p114 + p115 + p116 + p117 + p118 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= 1) OR (p164 <= 0) OR (p111 + 1 <= p56 + p57) OR (p112 + p113 + p114 + p115 + p116 + p117 + p118 +... (shortened)
lola: processed formula length: 1389
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: processed formula with 6 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 11 will run for 641 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((p109 <= p51)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((p109 <= p51)))
lola: processed formula length: 27
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 641 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (X ((p166 + p167 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162))) U E (F ((3 <= p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(AX((p166 + p167 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162)) U E(TRUE U (3 <= p100 ... (shortened)
lola: processed formula length: 710
lola: 3 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 225859 markings, 675664 edges, 2976872481744224256 markings/sec, 0 secs
lola: 514576 markings, 1580008 edges, 57743 markings/sec, 5 secs
lola: 871971 markings, 2620245 edges, 71479 markings/sec, 10 secs
lola: 1204951 markings, 3688066 edges, 66596 markings/sec, 15 secs
lola: 1527008 markings, 4754219 edges, 64411 markings/sec, 20 secs
lola: 1872315 markings, 5905113 edges, 69061 markings/sec, 25 secs
lola: 2236373 markings, 7124535 edges, 72812 markings/sec, 30 secs
lola: 2614938 markings, 8411357 edges, 75713 markings/sec, 35 secs
lola: 2965538 markings, 9620238 edges, 70120 markings/sec, 40 secs
lola: 3326043 markings, 10861167 edges, 72101 markings/sec, 45 secs
lola: 3701785 markings, 12167072 edges, 75148 markings/sec, 50 secs
lola: 4085358 markings, 13513195 edges, 76715 markings/sec, 55 secs
lola: 4478188 markings, 14900353 edges, 78566 markings/sec, 60 secs
lola: 4876285 markings, 16309295 edges, 79619 markings/sec, 65 secs
lola: 5224649 markings, 17516233 edges, 69673 markings/sec, 70 secs
lola: 5575689 markings, 18746075 edges, 70208 markings/sec, 75 secs
lola: 5931724 markings, 20006615 edges, 71207 markings/sec, 80 secs
lola: 6288622 markings, 21276930 edges, 71380 markings/sec, 85 secs
lola: 6651884 markings, 22579700 edges, 72652 markings/sec, 90 secs
lola: 6989183 markings, 23783248 edges, 67460 markings/sec, 95 secs
lola: 7339812 markings, 25050632 edges, 70126 markings/sec, 100 secs
lola: 7713528 markings, 26397914 edges, 74743 markings/sec, 105 secs
lola: 8067211 markings, 27649690 edges, 70737 markings/sec, 110 secs
lola: 8397776 markings, 28808498 edges, 66113 markings/sec, 115 secs
lola: 8739296 markings, 30022885 edges, 68304 markings/sec, 120 secs
lola: 9075776 markings, 31226204 edges, 67296 markings/sec, 125 secs
lola: 9421085 markings, 32471943 edges, 69062 markings/sec, 130 secs
lola: 9769873 markings, 33727719 edges, 69758 markings/sec, 135 secs
lola: 10125635 markings, 35024348 edges, 71152 markings/sec, 140 secs
lola: 10489006 markings, 36349345 edges, 72674 markings/sec, 145 secs
lola: 10856175 markings, 37687517 edges, 73434 markings/sec, 150 secs
lola: 11231866 markings, 39075222 edges, 75138 markings/sec, 155 secs
lola: 11601322 markings, 40393730 edges, 73891 markings/sec, 160 secs
lola: 11938973 markings, 41574243 edges, 67530 markings/sec, 165 secs
lola: 12272206 markings, 42755532 edges, 66647 markings/sec, 170 secs
lola: 12604581 markings, 43945141 edges, 66475 markings/sec, 175 secs
lola: 12933504 markings, 45133138 edges, 65785 markings/sec, 180 secs
lola: 13267983 markings, 46357339 edges, 66896 markings/sec, 185 secs
lola: 13607146 markings, 47596503 edges, 67833 markings/sec, 190 secs
lola: 13945416 markings, 48834518 edges, 67654 markings/sec, 195 secs
lola: 14276626 markings, 50044028 edges, 66242 markings/sec, 200 secs
lola: 14612311 markings, 51268935 edges, 67137 markings/sec, 205 secs
lola: 14955775 markings, 52543251 edges, 68693 markings/sec, 210 secs
lola: 15306298 markings, 53843819 edges, 70105 markings/sec, 215 secs
lola: 15668036 markings, 55159854 edges, 72348 markings/sec, 220 secs
lola: 16024222 markings, 56440201 edges, 71237 markings/sec, 225 secs
lola: 16348677 markings, 57578268 edges, 64891 markings/sec, 230 secs
lola: 16670363 markings, 58725542 edges, 64337 markings/sec, 235 secs
lola: 16989453 markings, 59872399 edges, 63818 markings/sec, 240 secs
lola: 17303111 markings, 61003298 edges, 62732 markings/sec, 245 secs
lola: 17616877 markings, 62151453 edges, 62753 markings/sec, 250 secs
lola: 17931948 markings, 63303711 edges, 63014 markings/sec, 255 secs
lola: 18241689 markings, 64432847 edges, 61948 markings/sec, 260 secs
lola: 18528075 markings, 65496576 edges, 57277 markings/sec, 265 secs
lola: 18846539 markings, 66657819 edges, 63693 markings/sec, 270 secs
lola: 19167346 markings, 67851729 edges, 64161 markings/sec, 275 secs
lola: 19503147 markings, 69099705 edges, 67160 markings/sec, 280 secs
lola: 19824675 markings, 70269421 edges, 64306 markings/sec, 285 secs
lola: 20161387 markings, 71522423 edges, 67342 markings/sec, 290 secs
lola: 20501868 markings, 72789622 edges, 68096 markings/sec, 295 secs
lola: 20866970 markings, 74138502 edges, 73020 markings/sec, 300 secs
lola: 21202736 markings, 75334859 edges, 67153 markings/sec, 305 secs
lola: 21522186 markings, 76462240 edges, 63890 markings/sec, 310 secs
lola: 21834084 markings, 77575483 edges, 62380 markings/sec, 315 secs
lola: 22136889 markings, 78661754 edges, 60561 markings/sec, 320 secs
lola: 22446137 markings, 79787440 edges, 61850 markings/sec, 325 secs
lola: 22756853 markings, 80922215 edges, 62143 markings/sec, 330 secs
lola: 23062008 markings, 82038431 edges, 61031 markings/sec, 335 secs
lola: 23350436 markings, 83088637 edges, 57686 markings/sec, 340 secs
lola: 23623132 markings, 84100913 edges, 54539 markings/sec, 345 secs
lola: 23933005 markings, 85227735 edges, 61975 markings/sec, 350 secs
lola: 24246589 markings, 86397009 edges, 62717 markings/sec, 355 secs
lola: 24559778 markings, 87562829 edges, 62638 markings/sec, 360 secs
lola: 24876532 markings, 88741967 edges, 63351 markings/sec, 365 secs
lola: 25203183 markings, 89957520 edges, 65330 markings/sec, 370 secs
lola: 25528889 markings, 91169567 edges, 65141 markings/sec, 375 secs
lola: 25854375 markings, 92382749 edges, 65097 markings/sec, 380 secs
lola: 26151803 markings, 93489591 edges, 59486 markings/sec, 385 secs
lola: 26447309 markings, 94585732 edges, 59101 markings/sec, 390 secs
lola: 26782055 markings, 95813905 edges, 66949 markings/sec, 395 secs
lola: 27087766 markings, 96909466 edges, 61142 markings/sec, 400 secs
lola: 27381304 markings, 97944490 edges, 58708 markings/sec, 405 secs
lola: 27672296 markings, 98981632 edges, 58198 markings/sec, 410 secs
lola: 27975859 markings, 100070180 edges, 60713 markings/sec, 415 secs
lola: 28280631 markings, 101173574 edges, 60954 markings/sec, 420 secs
lola: 28590863 markings, 102307659 edges, 62046 markings/sec, 425 secs
lola: 28885588 markings, 103382874 edges, 58945 markings/sec, 430 secs
lola: 29173137 markings, 104427710 edges, 57510 markings/sec, 435 secs
lola: 29460548 markings, 105497236 edges, 57482 markings/sec, 440 secs
lola: 29758317 markings, 106578202 edges, 59554 markings/sec, 445 secs
lola: 30062497 markings, 107709844 edges, 60836 markings/sec, 450 secs
lola: 30364870 markings, 108836278 edges, 60475 markings/sec, 455 secs
lola: 30676928 markings, 109998840 edges, 62412 markings/sec, 460 secs
lola: 30987085 markings, 111152930 edges, 62031 markings/sec, 465 secs
lola: 31296567 markings, 112305354 edges, 61896 markings/sec, 470 secs
lola: 31608771 markings, 113467326 edges, 62441 markings/sec, 475 secs
lola: 31926640 markings, 114650628 edges, 63574 markings/sec, 480 secs
lola: 32231284 markings, 115781371 edges, 60929 markings/sec, 485 secs
lola: 32549391 markings, 116964036 edges, 63621 markings/sec, 490 secs
lola: 32871672 markings, 118188883 edges, 64456 markings/sec, 495 secs
lola: 33223960 markings, 119513798 edges, 70458 markings/sec, 500 secs
lola: 33597684 markings, 120866699 edges, 74745 markings/sec, 505 secs
lola: 33919993 markings, 122011481 edges, 64462 markings/sec, 510 secs
lola: 34213726 markings, 123048247 edges, 58747 markings/sec, 515 secs
lola: 34505981 markings, 124100505 edges, 58451 markings/sec, 520 secs
lola: 34779520 markings, 125079443 edges, 54708 markings/sec, 525 secs
lola: 35066958 markings, 126127555 edges, 57488 markings/sec, 530 secs
lola: 35334455 markings, 127097915 edges, 53499 markings/sec, 535 secs
lola: 35618548 markings, 128129077 edges, 56819 markings/sec, 540 secs
lola: 35914087 markings, 129221516 edges, 59108 markings/sec, 545 secs
lola: 36188610 markings, 130221792 edges, 54905 markings/sec, 550 secs
lola: 36477031 markings, 131295031 edges, 57684 markings/sec, 555 secs
lola: 36774035 markings, 132400165 edges, 59401 markings/sec, 560 secs
lola: 37070600 markings, 133499153 edges, 59313 markings/sec, 565 secs
lola: 37358582 markings, 134564158 edges, 57596 markings/sec, 570 secs
lola: 37656411 markings, 135671799 edges, 59566 markings/sec, 575 secs
lola: 37962000 markings, 136816756 edges, 61118 markings/sec, 580 secs
lola: 38251801 markings, 137894955 edges, 57960 markings/sec, 585 secs
lola: 38547597 markings, 138994142 edges, 59159 markings/sec, 590 secs
lola: 38851578 markings, 140123135 edges, 60796 markings/sec, 595 secs
lola: 39161766 markings, 141274123 edges, 62038 markings/sec, 600 secs
lola: 39470806 markings, 142448864 edges, 61808 markings/sec, 605 secs
lola: 39785370 markings, 143631561 edges, 62913 markings/sec, 610 secs
lola: 40084006 markings, 144738615 edges, 59727 markings/sec, 615 secs
lola: 40388537 markings, 145865270 edges, 60906 markings/sec, 620 secs
lola: 40705528 markings, 147086533 edges, 63398 markings/sec, 625 secs
lola: 41066290 markings, 148401023 edges, 72152 markings/sec, 630 secs
lola: 41376084 markings, 149510814 edges, 61959 markings/sec, 635 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 642 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((1 <= p54) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p98 + p97 + p96 + p95 + p94 + p93 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p55))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U ((1 <= p54) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p98 + p97 + p96 + p95 + p94 + p93 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p55))))
lola: processed formula length: 352
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 855 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (((p56 + p57 + 1 <= p164) OR (p55 <= 1)))))
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 644 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 BridgeAndVehicles-COL-V50P50N50-CTLCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N50-CTLCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1282 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p51 <= 2) AND (p164 + 1 <= p111) AND ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p98 + p97 + p96 + p95 + p94 + p93 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p51) OR (p100 + p101 + p102 + p103 +... (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 644 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 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N50-CTLCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N50-CTLCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2565 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + 1 <= p111)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (p111 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50))))
lola: processed formula length: 328
lola: 3 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: RESULT
lola:
SUMMARY: no yes yes no yes unknown no yes no yes yes unknown yes yes yes no
lola: ========================================
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N50-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496344255884

--------------------
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_BridgeAndVehicles-COL-V50P50N50"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/S_BridgeAndVehicles-COL-V50P50N50.tgz
mv S_BridgeAndVehicles-COL-V50P50N50 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_BridgeAndVehicles-COL-V50P50N50, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r088-csrt-149441074400372"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;