Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
................
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 32K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PhilosophersDyn-COL-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666470000845
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527062772453

info: Time: 3600 - MCC
===========================================================================================
prep: translating PhilosophersDyn-COL-10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PhilosophersDyn-COL-10 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking ReachabilityCardinality @ PhilosophersDyn-COL-10 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2480/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: Size of bit vector: 5440
lola: finding significant places
lola: 170 places, 2310 transitions, 131 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4366 transition conflict sets
lola: TASK
lola: reading formula from PhilosophersDyn-COL-10-ReachabilityCardinality.task
lola: LP says that atomic proposition is always true: (p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: LP says that atomic proposition is always true: (p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: always true
lola: E (F (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137 <= p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20) AND (p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 <= 1) AND (1 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)))) : A (G ((((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= 0) AND (p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + 1 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)) OR ((2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137) AND (p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) AND (p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159))))) : E (F ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))) : A (G (())) : E (F ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137 <= p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20))) : A (G ((((p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND (p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + 1 <= p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20)) OR ((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= 2) AND (p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= 1))))) : A (G (((2 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) OR (p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169) OR (p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 <= 1) OR (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) OR ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))))) : A (G ((p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 <= 2))) : E (F ((3 <= p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169))) : E (F (((2 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) AND ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 2) OR (p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137 <= 1))))) : A (G ((p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= 2))) : A (G ((1 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137))) : A (G ((((2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137) OR (p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) OR (1 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)) AND ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137) OR (p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) OR ((2 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) AND (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)))))) : E (F (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 0) AND (p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137 <= p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20)))) : E (F (((2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137) AND ((3 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) OR (3 <= p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20)) AND (p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) AND (p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) AND (2 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) AND (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)))) : E (F (((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137 <= 1) AND (p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= 0))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 210 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: closed formula file PhilosophersDyn-COL-10-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
check_solution: Constraint R1 = 0 is above its upper bound -2
check_solution: Constraint R42 = 0 is above its equality of -1
check_solution: Constraint R43 = 0 is above its equality of -1
check_solution: Constraint R44 = 0 is above its equality of -1
check_solution: Constraint R45 = 0 is above its equality of -1
check_solution: Constraint R46 = 0 is above its equality of -1
check_solution: Constraint R47 = 0 is above its equality of -1
check_solution: Constraint R48 = 0 is above its equality of -1
check_solution: Constraint R158 = 0 is above its equality of -1
check_solution: Constraint R159 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 2 (rel. error 1)
check_solution: Constraint R42 = 0 is above its equality of -1
check_solution: Constraint R43 = 0 is above its equality of -1
check_solution: Constraint R44 = 0 is above its equality of -1
check_solution: Constraint R45 = 0 is above its equality of -1
check_solution: Constraint R46 = 0 is above its equality of -1
check_solution: Constraint R47 = 0 is above its equality of -1
check_solution: Constraint R48 = 0 is above its equality of -1
check_solution: Constraint R158 = 0 is above its equality of -1
check_solution: Constraint R159 = 0 is above its equality of -1
check_solution: Constraint R160 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 1 (rel. error 1)
check_solution: Constraint R4 = 1e+30 is above its equality of 0
check_solution: Constraint R5 = 1e+30 is above its equality of 0
check_solution: Constraint R6 = 1e+30 is above its equality of 0
check_solution: Constraint R7 = 1e+30 is above its equality of 0
check_solution: Constraint R8 = 1e+30 is above its equality of 0
check_solution: Constraint R9 = 1e+30 is above its equality of 0
check_solution: Constraint R10 = 1e+30 is above its equality of 0
check_solution: Constraint R11 = 1e+30 is above its equality of 0
check_solution: Constraint R12 = 1e+30 is above its equality of 0
check_solution: Constraint R13 = 1e+30 is above its equality of 0

Seriously low accuracy found ||*|| = 1e+30 (rel. error 1)
check_solution: Constraint R1 = 6.94550509228e-310 is below its lower bound 1
check_solution: Constraint R4 = 0.82120841297 is above its equality of 0
check_solution: Constraint R5 = 0.82120841297 is above its equality of 0
check_solution: Constraint R8 = 0.82120841297 is above its equality of 0
check_solution: Constraint R9 = 0.82120841297 is above its equality of 0
check_solution: Constraint R10 = 0.82120841297 is above its equality of 0
check_solution: Constraint R11 = 0.82120841297 is above its equality of 0
check_solution: Constraint R12 = 0.82120841297 is above its equality of 0
check_solution: Constraint R14 = -0.921983284479 is below its equality of 0
check_solution: Constraint R19 = 0.921983284479 is above its equality of 0

Seriously low accuracy found ||*|| = 3.76595 (rel. error 3.76595)

FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 <= 2)))
lola: processed formula length: 72
lola: 5 rewrites
lola: closed formula file PhilosophersDyn-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (3 <= p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-10-ReachabilityCardinality-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 14258 markings, 31998 edges, 2852 markings/sec, 0 secs
lola: sara is running 5 secs || 28190 markings, 66468 edges, 2786 markings/sec, 5 secs
lola: sara is running 10 secs || 42393 markings, 101055 edges, 2841 markings/sec, 10 secs
lola: sara is running 15 secs || 56810 markings, 137311 edges, 2883 markings/sec, 15 secs
lola: sara is running 20 secs || 71370 markings, 175354 edges, 2912 markings/sec, 20 secs
lola: sara is running 25 secs || 85002 markings, 211240 edges, 2726 markings/sec, 25 secs
lola: sara is running 30 secs || 98850 markings, 248430 edges, 2770 markings/sec, 30 secs
lola: sara is running 35 secs || 112919 markings, 286677 edges, 2814 markings/sec, 35 secs
lola: sara is running 40 secs || 126983 markings, 324629 edges, 2813 markings/sec, 40 secs
lola: sara is running 45 secs || 140599 markings, 361197 edges, 2723 markings/sec, 45 secs
lola: sara is running 50 secs || 154401 markings, 398861 edges, 2760 markings/sec, 50 secs
lola: sara is running 55 secs || 168674 markings, 437291 edges, 2855 markings/sec, 55 secs
lola: sara is running 60 secs || 182575 markings, 475115 edges, 2780 markings/sec, 60 secs
lola: sara is running 65 secs || 196491 markings, 512546 edges, 2783 markings/sec, 65 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 199051 markings, 519690 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((3 <= p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169)))
lola: processed formula length: 82
lola: 4 rewrites
lola: closed formula file PhilosophersDyn-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (3 <= p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges

FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= 2)))
lola: processed formula length: 82
lola: 5 rewrites
lola: closed formula file PhilosophersDyn-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (3 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-10-ReachabilityCardinality-3-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 16737 markings, 44885 edges, 3347 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((1 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137)))
lola: processed formula length: 82
lola: 5 rewrites
lola: closed formula file PhilosophersDyn-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137 <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-10-ReachabilityCardinality-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 17731 markings, 44574 edges, 3546 markings/sec, 0 secs
lola: sara is running 5 secs || 35928 markings, 91207 edges, 3639 markings/sec, 5 secs
lola: sara is running 10 secs || 54441 markings, 139472 edges, 3703 markings/sec, 10 secs
lola: sara is running 15 secs || 73527 markings, 192114 edges, 3817 markings/sec, 15 secs
lola: sara is running 20 secs || 90499 markings, 239128 edges, 3394 markings/sec, 20 secs
lola: sara is running 25 secs || 108654 markings, 289872 edges, 3631 markings/sec, 25 secs
lola: sara is running 30 secs || 126107 markings, 338928 edges, 3491 markings/sec, 30 secs
lola: sara is running 35 secs || 144430 markings, 390029 edges, 3665 markings/sec, 35 secs
lola: sara is running 40 secs || 162574 markings, 440379 edges, 3629 markings/sec, 40 secs
lola: sara is running 45 secs || 178381 markings, 484151 edges, 3161 markings/sec, 45 secs
lola: sara is running 50 secs || 195175 markings, 530494 edges, 3359 markings/sec, 50 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 199051 markings, 541408 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)))
lola: processed formula length: 148
lola: 4 rewrites
lola: closed formula file PhilosophersDyn-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-10-ReachabilityCardinality-5-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 18921 markings, 47704 edges, 3784 markings/sec, 0 secs
lola: sara is running 5 secs || 37178 markings, 94782 edges, 3651 markings/sec, 5 secs
lola: sara is running 10 secs || 55785 markings, 142946 edges, 3721 markings/sec, 10 secs
lola: sara is running 15 secs || 74998 markings, 196279 edges, 3843 markings/sec, 15 secs
lola: sara is running 20 secs || 93084 markings, 246381 edges, 3617 markings/sec, 20 secs
lola: sara is running 25 secs || 111232 markings, 296334 edges, 3630 markings/sec, 25 secs
lola: sara is running 30 secs || 130239 markings, 349500 edges, 3801 markings/sec, 30 secs
lola: sara is running 35 secs || 149040 markings, 401479 edges, 3760 markings/sec, 35 secs
lola: sara is running 40 secs || 167501 markings, 451959 edges, 3692 markings/sec, 40 secs
lola: sara is running 45 secs || 185630 markings, 501394 edges, 3626 markings/sec, 45 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 199051 markings, 538046 edges

FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137 <= p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137 <= p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20)))
lola: processed formula length: 138
lola: 4 rewrites
lola: closed formula file PhilosophersDyn-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137 <= p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-10-ReachabilityCardinality-6-0.sara.
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 16173 markings, 37165 edges, 3235 markings/sec, 0 secs
lola: sara is running 5 secs || 33184 markings, 78583 edges, 3402 markings/sec, 5 secs
lola: sara is running 10 secs || 49095 markings, 117477 edges, 3182 markings/sec, 10 secs
lola: sara is running 15 secs || 65662 markings, 160703 edges, 3313 markings/sec, 15 secs
lola: sara is running 20 secs || 81996 markings, 203365 edges, 3267 markings/sec, 20 secs
lola: sara is running 25 secs || 98536 markings, 247823 edges, 3308 markings/sec, 25 secs
lola: sara is running 30 secs || 114788 markings, 291659 edges, 3250 markings/sec, 30 secs
lola: sara is running 35 secs || 131051 markings, 335589 edges, 3253 markings/sec, 35 secs
lola: sara is running 40 secs || 147548 markings, 380190 edges, 3299 markings/sec, 40 secs
lola: sara is running 45 secs || 163540 markings, 423502 edges, 3198 markings/sec, 45 secs
lola: sara is running 50 secs || 179606 markings, 466939 edges, 3213 markings/sec, 50 secs
lola: sara is running 55 secs || 196011 markings, 511328 edges, 3281 markings/sec, 55 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 199051 markings, 519690 edges

FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 345 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137 <= 1) AND (p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137 <= 1) AND (p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= 0))))
lola: processed formula length: 153
lola: 4 rewrites
lola: closed formula file PhilosophersDyn-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137 <= 1) AND (p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= 0))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-10-ReachabilityCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 18760 markings, 48981 edges, 3752 markings/sec, 0 secs
lola: sara is running 5 secs || 37241 markings, 98893 edges, 3696 markings/sec, 5 secs
lola: sara is running 10 secs || 54378 markings, 145545 edges, 3427 markings/sec, 10 secs
lola: sara is running 15 secs || 72789 markings, 198908 edges, 3682 markings/sec, 15 secs
lola: sara is running 20 secs || 90107 markings, 249186 edges, 3464 markings/sec, 20 secs
lola: sara is running 25 secs || 107257 markings, 299480 edges, 3430 markings/sec, 25 secs
lola: sara is running 30 secs || 124862 markings, 351458 edges, 3521 markings/sec, 30 secs
lola: sara is running 35 secs || 142144 markings, 401806 edges, 3456 markings/sec, 35 secs
lola: sara is running 40 secs || 159695 markings, 452735 edges, 3510 markings/sec, 40 secs
lola: sara is running 45 secs || 176897 markings, 502629 edges, 3440 markings/sec, 45 secs
lola: sara is running 50 secs || 193801 markings, 551537 edges, 3381 markings/sec, 50 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 199051 markings, 566986 edges

FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) AND ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 2) OR (p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((2 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) AND ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 2) OR (p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137 <= 1)))))
lola: processed formula length: 214
lola: 4 rewrites
lola: closed formula file PhilosophersDyn-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= 0) AND (p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + 1 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)) OR ((2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137) AND (p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 <= p140 + p141 + p142 + p143 + p14... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= 0) AND (p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + 1 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)) OR ((2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137) AND (p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 <= p140 + p141 + p142 + p143 + p14... (shortened)
lola: processed formula length: 576
lola: 5 rewrites
lola: closed formula file PhilosophersDyn-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 13 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p3... (shortened)
lola: processed formula length: 779
lola: 4 rewrites
lola: closed formula file PhilosophersDyn-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 0) AND (p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137 <= p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-10-ReachabilityCardinality-10-0.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.

FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 611 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 ... (shortened)
lola: processed formula length: 995
lola: 5 rewrites
lola: closed formula file PhilosophersDyn-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) OR (p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)) AND ((3 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) OR (2 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-11-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 763 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137) OR (p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) OR (1 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)) AND ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p130 + p131 + p132 + p133 + p134 + p135 + p13... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137) OR (p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) OR (1 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)) AND ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p130 + p131 + p132 + p133 + p134 + p135 + p13... (shortened)
lola: processed formula length: 1272
lola: 5 rewrites
lola: closed formula file PhilosophersDyn-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137 <= 1) AND (p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + 1 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) AND (p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= 0)) OR ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + 1 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) AND ((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= 1) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 2))))
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-10-ReachabilityCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 15057 markings, 40068 edges, 3011 markings/sec, 0 secs
lola: sara is running 5 secs || 31198 markings, 84704 edges, 3228 markings/sec, 5 secs
lola: sara is running 10 secs || 47166 markings, 129524 edges, 3194 markings/sec, 10 secs
lola: sara is running 15 secs || 63057 markings, 176721 edges, 3178 markings/sec, 15 secs
lola: sara is running 20 secs || 79201 markings, 224579 edges, 3229 markings/sec, 20 secs
lola: sara is running 25 secs || 95198 markings, 272693 edges, 3199 markings/sec, 25 secs
lola: sara is running 30 secs || 110727 markings, 318773 edges, 3106 markings/sec, 30 secs
lola: sara is running 35 secs || 125308 markings, 363487 edges, 2916 markings/sec, 35 secs
lola: sara is running 40 secs || 139487 markings, 406094 edges, 2836 markings/sec, 40 secs
lola: sara is running 45 secs || 153107 markings, 446858 edges, 2724 markings/sec, 45 secs
lola: sara is running 50 secs || 167315 markings, 490044 edges, 2842 markings/sec, 50 secs
lola: sara is running 55 secs || 182000 markings, 533351 edges, 2937 markings/sec, 55 secs
lola: sara is running 60 secs || 196870 markings, 578070 edges, 2974 markings/sec, 60 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 199051 markings, 584931 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 996 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) OR (p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169) OR (p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 <= 1) OR (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p11... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((2 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) OR (p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169) OR (p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 <= 1) OR (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p11... (shortened)
lola: processed formula length: 1723
lola: 5 rewrites
lola: closed formula file PhilosophersDyn-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= 1) AND (p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + 1 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) AND (2 <= p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169) AND (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 0) AND (p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + 1 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) AND ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 1)))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-10-ReachabilityCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1494 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p3... (shortened)
lola: processed formula length: 973
lola: 4 rewrites
lola: closed formula file PhilosophersDyn-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137 <= p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20) AND (p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 <= 1) AND (1 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-10-ReachabilityCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 15983 markings, 44549 edges, 3197 markings/sec, 0 secs
lola: sara is running 5 secs || 32919 markings, 94949 edges, 3387 markings/sec, 5 secs
lola: sara is running 10 secs || 49793 markings, 143955 edges, 3375 markings/sec, 10 secs
lola: sara is running 15 secs || 66206 markings, 195468 edges, 3283 markings/sec, 15 secs
lola: sara is running 20 secs || 82516 markings, 246293 edges, 3262 markings/sec, 20 secs
lola: sara is running 25 secs || 98993 markings, 297966 edges, 3295 markings/sec, 25 secs
lola: sara is running 30 secs || 115536 markings, 349908 edges, 3309 markings/sec, 30 secs
lola: sara is running 35 secs || 131962 markings, 401716 edges, 3285 markings/sec, 35 secs
lola: sara is running 40 secs || 148715 markings, 454968 edges, 3351 markings/sec, 40 secs
lola: sara is running 45 secs || 165620 markings, 508925 edges, 3381 markings/sec, 45 secs
lola: sara is running 50 secs || 182754 markings, 563242 edges, 3427 markings/sec, 50 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 199051 markings, 614582 edges
lola:
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 15 will run for 2928 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137) AND ((3 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) OR (3 <= p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20)) AND (p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) AND (p150 + p151 + p152 + p153 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137) AND ((3 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) OR (3 <= p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20)) AND (p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) AND (p150 + p151 + p152 + p153 + ... (shortened)
lola: processed formula length: 1222
lola: 4 rewrites
lola: closed formula file PhilosophersDyn-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p138 + p137) AND ((3 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) OR (3 <= p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20)) AND (p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159) AND (p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) AND (2 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) AND (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-10-ReachabilityCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 16983 markings, 46922 edges, 3397 markings/sec, 0 secs
lola: sara is running 5 secs || 34268 markings, 96050 edges, 3457 markings/sec, 5 secs
lola: sara is running 10 secs || 51192 markings, 144401 edges, 3385 markings/sec, 10 secs
lola: sara is running 15 secs || 68103 markings, 195460 edges, 3382 markings/sec, 15 secs
lola: sara is running 20 secs || 84772 markings, 245672 edges, 3334 markings/sec, 20 secs
lola: sara is running 25 secs || 101382 markings, 296627 edges, 3322 markings/sec, 25 secs
lola: sara is running 30 secs || 118418 markings, 348743 edges, 3407 markings/sec, 30 secs
lola: sara is running 35 secs || 134918 markings, 399223 edges, 3300 markings/sec, 35 secs
lola: sara is running 40 secs || 151595 markings, 450231 edges, 3335 markings/sec, 40 secs
lola: sara is running 45 secs || 167509 markings, 498751 edges, 3183 markings/sec, 45 secs
lola: sara is running 50 secs || 183408 markings, 547090 edges, 3180 markings/sec, 50 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 199051 markings, 594290 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes no no yes yes yes yes yes yes yes no no no
lola:
preliminary result: no no no yes no no yes yes yes yes yes yes yes no no no
lola: memory consumption: 79968 KB
lola: time consumption: 701 seconds

BK_STOP 1527063473924

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-COL-10"
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/PhilosophersDyn-COL-10.tgz
mv PhilosophersDyn-COL-10 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is PhilosophersDyn-COL-10, 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 r112-csrt-152666470000845"
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 ;