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 244K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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 6.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K 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.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 61K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is QuasiCertifProtocol-COL-06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578700019
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526905886784

info: Time: 3600 - MCC
===========================================================================================
prep: translating QuasiCertifProtocol-COL-06 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating QuasiCertifProtocol-COL-06 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking ReachabilityCardinality @ QuasiCertifProtocol-COL-06 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 386/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8640
lola: finding significant places
lola: 270 places, 116 transitions, 115 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 151 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-06-ReachabilityCardinality.task
lola: LP says that atomic proposition is always false: (2 <= p269)
lola: LP says that atomic proposition is always false: (2 <= p181)
lola: LP says that atomic proposition is always true: (p268 <= p173 + p179 + p178 + p177 + p176 + p175 + p174)
lola: LP says that atomic proposition is always false: (3 <= p268)
lola: LP says that atomic proposition is always false: (2 <= p23)
lola: A (G (((2 <= p36 + p35 + p34 + p33 + p32 + p31 + p37) OR (p117 + p118 + p119 + p120 + p121 + p122 + p123 <= p88 + p89 + p90 + p91 + p92 + p93 + p94) OR (p267 + p266 + p265 + p264 + p263 + p262 + p261 + 1 <= p260 + p259 + p258 + p257 + p256 + p255 + p254) OR ((2 <= p29 + p28 + p27 + p26 + p25 + p24 + p30) AND (p100 + p101 + p95 + p96 + p97 + p98 + p99 <= p15 + p16 + p17 + p18 + p19 + p20 + p21)) OR (p22 <= p253)))) : A (G (((p22 <= p244 + p243 + p242 + p241 + p240 + p239 + p238) AND (((p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p138 + p145 + p152 + p159 + p166 + p172 + p171 + p170 + p169 + p168 + p167 + p165 + p164 + p163 + p162 + p161 + p160 + p158 + p157 + p156 + p155 + p154 + p153 + p151 + p150 + p149 + p148 + p147 + p146 + p144 + p143 + p142 + p141 + p140 + p139 + p137 + p136 + p135 + p134 + p133 + p132 <= p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + 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) AND (p22 <= p100 + p101 + p95 + p96 + p97 + p98 + p99)) OR ((2 <= p244 + p243 + p242 + p241 + p240 + p239 + p238) AND (2 <= p267 + p266 + p265 + p264 + p263 + p262 + p261)))))) : E (F ((((p260 + p259 + p258 + p257 + p256 + p255 + p254 + 1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7) OR (1 <= p36 + p35 + p34 + p33 + p32 + p31 + p37)) AND (1 <= p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p138 + p145 + p152 + p159 + p166 + p172 + p171 + p170 + p169 + p168 + p167 + p165 + p164 + p163 + p162 + p161 + p160 + p158 + p157 + p156 + p155 + p154 + p153 + p151 + p150 + p149 + p148 + p147 + p146 + p144 + p143 + p142 + p141 + p140 + p139 + p137 + p136 + p135 + p134 + p133 + p132)))) : A (G (((p0 + 1 <= p180) OR (p36 + p35 + p34 + p33 + p32 + p31 + p37 <= 0) OR ((p181 + 1 <= p102 + p103 + p104 + p105 + p106 + p107 + p108) AND (p22 + 1 <= p117 + p118 + p119 + p120 + p121 + p122 + p123))))) : E (F (((p1 + p2 + p3 + p4 + p5 + p6 + p7 <= 0) AND (p23 + 1 <= p260 + p259 + p258 + p257 + p256 + p255 + p254) AND (((3 <= p15 + p16 + p17 + p18 + p19 + p20 + p21) AND (p0 <= p181)) OR ((3 <= p36 + p35 + p34 + p33 + p32 + p31 + p37) AND (2 <= p36 + p35 + p34 + p33 + p32 + p31 + p37)))))) : E (F ((p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p138 + p145 + p152 + p159 + p166 + p172 + p171 + p170 + p169 + p168 + p167 + p165 + p164 + p163 + p162 + p161 + p160 + p158 + p157 + p156 + p155 + p154 + p153 + p151 + p150 + p149 + p148 + p147 + p146 + p144 + p143 + p142 + p141 + p140 + p139 + p137 + p136 + p135 + p134 + p133 + p132 + 1 <= p8 + p9 + p14 + p13 + p12 + p11 + p10))) : A (G ((p180 <= p29 + p28 + p27 + p26 + p25 + p24 + p30))) : E (F (())) : E (F (((1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116) AND ((2 <= p8 + p9 + p14 + p13 + p12 + p11 + p10) OR (1 <= p252) OR (p268 <= p180))))) : E (F (((p267 + p266 + p265 + p264 + p263 + p262 + p261 <= p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (p180 + 1 <= p267 + p266 + p265 + p264 + p263 + p262 + p261)))) : E (F (((3 <= p8 + p9 + p14 + p13 + p12 + p11 + p10) AND (1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (3 <= p15 + p16 + p17 + p18 + p19 + p20 + p21) AND (p100 + p101 + p95 + p96 + p97 + p98 + p99 <= p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (p8 + p9 + p14 + p13 + p12 + p11 + p10 + 1 <= p36 + p35 + p34 + p33 + p32 + p31 + p37)))) : A (G (())) : A (G (((p251 + p250 + p249 + p248 + p247 + p246 + p245 <= p269) OR ((p260 + p259 + p258 + p257 + p256 + p255 + p254 + 1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116) AND (p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p138 + p145 + p152 + p159 + p166 + p172 + p171 + p170 + p169 + p168 + p167 + p165 + p164 + p163 + p162 + p161 + p160 + p158 + p157 + p156 + p155 + p154 + p153 + p151 + p150 + p149 + p148 + p147 + p146 + p144 + p143 + p142 + p141 + p140 + p139 + p137 + p136 + p135 + p134 + p133 + p132 <= 0))))) : E (F (((2 <= p29 + p28 + p27 + p26 + p25 + p24 + p30) AND (3 <= p182 + p189 + p196 + p224 + p217 + p203 + p210 + p205 + p206 + p207 + p208 + p209 + p204 + p211 + p212 + p213 + p214 + p215 + p216 + p202 + p218 + p219 + p220 + p221 + p222 + p223 + p201 + p225 + p226 + p227 + p228 + p229 + p230 + p200 + p199 + p198 + p197 + p195 + p194 + p193 + p192 + p191 + p190 + p188 + p187 + p186 + p185 + p184 + p183) AND (p0 <= 0) AND ((3 <= p88 + p89 + p90 + p91 + p92 + p93 + p94) OR ((p117 + p118 + p119 + p120 + p121 + p122 + p123 <= p269) AND (p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + 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 <= p100 + p101 + p95 + p96 + p97 + p98 + p99)))))) : A (G ((((p36 + p35 + p34 + p33 + p32 + p31 + p37 <= 1) AND (p110 + p111 + p112 + p113 + p114 + p115 + p116 <= 0)) OR ((2 <= p237 + p236 + p235 + p234 + p233 + p232 + p231) AND (p23 <= p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + 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) AND (1 <= p0))))) : A (G ((p244 + p243 + p242 + p241 + p240 + p239 + p238 <= p237 + p236 + p235 + p234 + p233 + p232 + p231)))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 6 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 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: 6 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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
lola: ========================================

FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p180 <= p29 + p28 + p27 + p26 + p25 + p24 + p30)))
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 ((p180 <= p29 + p28 + p27 + p26 + p25 + p24 + p30)))
lola: processed formula length: 57
lola: 8 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: (p29 + p28 + p27 + p26 + p25 + p24 + p30 + 1 <= p180)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-06-ReachabilityCardinality-2-0.sara
lola: ========================================

FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-06-ReachabilityCardinality-2-0.sara.
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: ...considering subproblem: A (G ((p244 + p243 + p242 + p241 + p240 + p239 + p238 <= p237 + p236 + p235 + p234 + p233 + p232 + p231)))
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 ((p244 + p243 + p242 + p241 + p240 + p239 + p238 <= p237 + p236 + p235 + p234 + p233 + p232 + p231)))
lola: processed formula length: 106
lola: 8 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: (p237 + p236 + p235 + p234 + p233 + p232 + p231 + 1 <= p244 + p243 + p242 + p241 + p240 + p239 + p238)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-06-ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara

sara: try reading problem file QuasiCertifProtocol-COL-06-ReachabilityCardinality-3-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p267 + p266 + p265 + p264 + p263 + p262 + p261 <= p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (p180 + 1 <= p267 + p266 + p265 + p264 + p263 + p262 + p261))))
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 (((p267 + p266 + p265 + p264 + p263 + p262 + p261 <= p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (p180 + 1 <= p267 + p266 + p265 + p264 + p263 + p262 + p261))))
lola: processed formula length: 159
lola: 7 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: ((p267 + p266 + p265 + p264 + p263 + p262 + p261 <= p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (p180 + 1 <= p267 + p266 + p265 + p264 + p263 + p262 + p261))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-06-ReachabilityCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-06-ReachabilityCardinality-4-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.
lola: ========================================

FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116) AND ((2 <= p8 + p9 + p14 + p13 + p12 + p11 + p10) OR (1 <= p252) OR (p268 <= p180)))))
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 (((1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116) AND ((2 <= p8 + p9 + p14 + p13 + p12 + p11 + p10) OR (1 <= p252) OR (p268 <= p180)))))
lola: processed formula length: 149
lola: 7 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: ((1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116) AND ((2 <= p8 + p9 + p14 + p13 + p12 + p11 + p10) OR (1 <= p252) OR (p268 <= p180)))
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-06-ReachabilityCardinality-5-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges

FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: state equation: calling and running saralola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================

lola: ...considering subproblem: A (G (((p0 + 1 <= p180) OR (p36 + p35 + p34 + p33 + p32 + p31 + p37 <= 0) OR ((p181 + 1 <= p102 + p103 + p104 + p105 + p106 + p107 + p108) AND (p22 + 1 <= p117 + p118 + p119 + p120 + p121 + p122 + p123)))))
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 (((p0 + 1 <= p180) OR (p36 + p35 + p34 + p33 + p32 + p31 + p37 <= 0) OR ((p181 + 1 <= p102 + p103 + p104 + p105 + p106 + p107 + p108) AND (p22 + 1 <= p117 + p118 + p119 + p120 + p121 + p122 + p123)))))
lola: processed formula length: 208
lola: 8 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: ((p180 <= p0) AND (1 <= p36 + p35 + p34 + p33 + p32 + p31 + p37) AND ((p102 + p103 + p104 + p105 + p106 + p107 + p108 <= p181) OR (p117 + p118 + p119 + p120 + p121 + p122 + p123 <= p22)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 42 markings, 41 edges
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
sara: try reading problem file QuasiCertifProtocol-COL-06-ReachabilityCardinality-5-0.sara.
lola: ========================================

FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: place or transition ordering is non-deterministic
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p1 + p2 + p3 + p4 + p5 + p6 + p7 <= 0) AND (p23 + 1 <= p260 + p259 + p258 + p257 + p256 + p255 + p254) AND (((3 <= p15 + p16 + p17 + p18 + p19 + p20 + p21) AND (p0 <= p181)) OR ((3 <= p36 + p35 + p34 + p33 + p32 + p31 + p37) AND (2 <= p36 + p35 + p34 + p33 + p32 + p31 + p37))))))
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 (((p1 + p2 + p3 + p4 + p5 + p6 + p7 <= 0) AND (p23 + 1 <= p260 + p259 + p258 + p257 + p256 + p255 + p254) AND (((3 <= p15 + p16 + p17 + p18 + p19 + p20 + p21) AND (p0 <= p181)) OR ((3 <= p36 + p35 + p34 + p33 + p32 + p31 + p37) AND (2 <= p36 + p35 + p34 + p33 + p32 + p31 + p37))))))
lola: processed formula length: 289
lola: 7 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: ((p1 + p2 + p3 + p4 + p5 + p6 + p7 <= 0) AND (p23 + 1 <= p260 + p259 + p258 + p257 + p256 + p255 + p254) AND (((3 <= p15 + p16 + p17 + p18 + p19 + p20 + p21) AND (p0 <= p181)) OR ((3 <= p36 + p35 + p34 + p33 + p32 + p31 + p37) AND (2 <= p36 + p35 + p34 + p33 + p32 + p31 + p37))))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-06-ReachabilityCardinality-7-0.sara

lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p8 + p9 + p14 + p13 + p12 + p11 + p10) AND (1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (3 <= p15 + p16 + p17 + p18 + p19 + p20 + p21) AND (p100 + p101 + p95 + p96 + p97 + p98 + p99 <= p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (p8 + p9 + p14 + p13 + p12 + p11 + p10 + 1 <= p36 + p35 + p34 + p33 + p32 + p31 + p37))))
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 <= p8 + p9 + p14 + p13 + p12 + p11 + p10) AND (1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (3 <= p15 + p16 + p17 + p18 + p19 + p20 + p21) AND (p100 + p101 + p95 + p96 + p97 + p98 + p99 <= p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (p8 + p9 + p14 + p13 + p12 + p11 + p10 + 1 <= p36 + p35 + p34 + p33 + p32 + p31 + p37))))
lola: processed formula length: 324
lola: 7 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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 <= p8 + p9 + p14 + p13 + p12 + p11 + p10) AND (1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (3 <= p15 + p16 + p17 + p18 + p19 + p20 + p21) AND (p100 + p101 + p95 + p96 + p97 + p98 + p99 <= p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (p8 + p9 + p14 + p13 + p12 + p11 + p10 + 1 <= p36 + p35 + p34 + p33 + p32 + p31 + p37))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-06-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 7409 markings, 23826 edges

FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p138 + p145 + p152 + p159 + p166 + p172 + p171 + p170 + p169 + p168 + p167 + p165 + p164 + p163 + p162 + p161 + p160 + p158 + p157 + p156 + p155 + p154 + p153 + p151 + p150 + p149 + p148 + p147 + p146 + p144 + p143 + p142 + p141 + p140 + p139 + p137 + p136 + p135 + p134 + p133 + p132 + 1 <= p8 + p9 + p14 + p13 + p12 + p11 + p10)))
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 ((p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p138 + p145 + p152 + p159 + p166 + p172 + p171 + p170 + p169 + p168 + p167 + p165 + p164 + p163 + p162 + p161 + p160 + p158 + p157 + p156 + p155 + p154 + p153 + p151 + p150 + p149 + p148 + p147 + p146 + p144 + p143 + p142 + p141 + p140 + p139 + p137 + p136 + p135 + p134 + p133 + p132 + 1 <= p8 + p9 + p14 + p13 + p12 + p11 + p10)))
lola: processed formula length: 395
lola: 7 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: (p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p138 + p145 + p152 + p159 + p166 + p172 + p171 + p170 + p169 + p168 + p167 + p165 + p164 + p163 + p162 + p161 + p160 + p158 + p157 + p156 + p155 + p154 + p153 + p151 + p150 + p149 + p148 + p147 + p146 + p144 + p143 + p142 + p141 + p140 + p139 + p137 + p136 + p135 + p134 + p133 + p132 + 1 <= p8 + p9 + p14 + p13 + p12 + p11 + p10)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-06-ReachabilityCardinality-9-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: ========================================
lola: ========================================

FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p36 + p35 + p34 + p33 + p32 + p31 + p37) OR (p117 + p118 + p119 + p120 + p121 + p122 + p123 <= p88 + p89 + p90 + p91 + p92 + p93 + p94) OR (p267 + p266 + p265 + p264 + p263 + p262 + p261 + 1 <= p260 + p259 + p258 + p257 + p256 + p255 + p254) OR ((2 <= p29 + p28 + p27 + p26 + p25 + p24 + p30) AND (p100 + p101 + p95 + p96 + p97 + p98 + p99 <= p15 + p16 + p17 + p18 + p19 + p20 + p21))... (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 <= p36 + p35 + p34 + p33 + p32 + p31 + p37) OR (p117 + p118 + p119 + p120 + p121 + p122 + p123 <= p88 + p89 + p90 + p91 + p92 + p93 + p94) OR (p267 + p266 + p265 + p264 + p263 + p262 + p261 + 1 <= p260 + p259 + p258 + p257 + p256 + p255 + p254) OR ((2 <= p29 + p28 + p27 + p26 + p25 + p24 + p30) AND (p100 + p101 + p95 + p96 + p97 + p98 + p99 <= p15 + p16 + p17 + p18 + p19 + p20 + p21))... (shortened)
lola: processed formula length: 421
lola: 8 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: ((p36 + p35 + p34 + p33 + p32 + p31 + p37 <= 1) AND (p88 + p89 + p90 + p91 + p92 + p93 + p94 + 1 <= p117 + p118 + p119 + p120 + p121 + p122 + p123) AND (p260 + p259 + p258 + p257 + p256 + p255 + p254 <= p267 + p266 + p265 + p264 + p263 + p262 + p261) AND ((p29 + p28 + p27 + p26 + p25 + p24 + p30 <= 1) OR (p15 + p16 + p17 + p18 + p19 + p20 + p21 + 1 <= p100 + p101 + p95 + p96 + p97 + p98 + p99)) AND (p253 + 1 <= p22))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-06-ReachabilityCardinality-10-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 62 markings, 61 edges

FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p260 + p259 + p258 + p257 + p256 + p255 + p254 + 1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7) OR (1 <= p36 + p35 + p34 + p33 + p32 + p31 + p37)) AND (1 <= p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p138 + p145 + p152 + p159 + p166 + p172 + p171 + p170 + p169 + p168 + p167 + p165 + p164 + p163 + p162 + p161 + p160 + p158 + p157 + p156 + p155 + p154 + p153 + p151 + p150 + p149 + p14... (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 ((((p260 + p259 + p258 + p257 + p256 + p255 + p254 + 1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7) OR (1 <= p36 + p35 + p34 + p33 + p32 + p31 + p37)) AND (1 <= p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p138 + p145 + p152 + p159 + p166 + p172 + p171 + p170 + p169 + p168 + p167 + p165 + p164 + p163 + p162 + p161 + p160 + p158 + p157 + p156 + p155 + p154 + p153 + p151 + p150 + p149 + p14... (shortened)
lola: processed formula length: 503
lola: 7 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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
sara: try reading problem file QuasiCertifProtocol-COL-06-ReachabilityCardinality-9-0.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (((p260 + p259 + p258 + p257 + p256 + p255 + p254 + 1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7) OR (1 <= p36 + p35 + p34 + p33 + p32 + p31 + p37)) AND (1 <= p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p138 + p145 + p152 + p159 + p166 + p172 + p171 + p170 + p169 + p168 + p167 + p165 + p164 + p163 + p162 + p161 + p160 + p158 + p157 + p156 + p155 + p154 + p153 + p151 + p150 + p149 + p148 + p147 + p146 + p144 + p143 + p142 + p141 + p140 + p139 + p137 + p136 + p135 + p134 + p133 + p132))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-06-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic

lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-06-ReachabilityCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic
sara: try reading problem file QuasiCertifProtocol-COL-06-ReachabilityCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 158132 markings, 564335 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 888 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p251 + p250 + p249 + p248 + p247 + p246 + p245 <= p269) OR ((p260 + p259 + p258 + p257 + p256 + p255 + p254 + 1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116) AND (p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p138 + p145 + p152 + p159 + p166 + p172 + p171 + p170 + p169 + p168 + p167 + p165 + p164 + p163 + p162 + p161 + p160 + p158 + p157 + p156 + p155 + p154 + p153 + p151 +... (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 (((p251 + p250 + p249 + p248 + p247 + p246 + p245 <= p269) OR ((p260 + p259 + p258 + p257 + p256 + p255 + p254 + 1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116) AND (p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p138 + p145 + p152 + p159 + p166 + p172 + p171 + p170 + p169 + p168 + p167 + p165 + p164 + p163 + p162 + p161 + p160 + p158 + p157 + p156 + p155 + p154 + p153 + p151 +... (shortened)
lola: processed formula length: 527
lola: 8 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: ((p269 + 1 <= p251 + p250 + p249 + p248 + p247 + p246 + p245) AND ((p110 + p111 + p112 + p113 + p114 + p115 + p116 <= p260 + p259 + p258 + p257 + p256 + p255 + p254) OR (1 <= p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p138 + p145 + p152 + p159 + p166 + p172 + p171 + p170 + p169 + p168 + p167 + p165 + p164 + p163 + p162 + p161 + p160 + p158 + p157 + p156 + p155 + p154 + p153 + p151 + p150 + p149 + p148 + p147 + p146 + p144 + p143 + p142 + p141 + p140 + p139 + p137 + p136 + p135 + p134 + p133 + p132)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-06-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-06-ReachabilityCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6840 markings, 13375 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p36 + p35 + p34 + p33 + p32 + p31 + p37 <= 1) AND (p110 + p111 + p112 + p113 + p114 + p115 + p116 <= 0)) OR ((2 <= p237 + p236 + p235 + p234 + p233 + p232 + p231) AND (p23 <= p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 +... (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 ((((p36 + p35 + p34 + p33 + p32 + p31 + p37 <= 1) AND (p110 + p111 + p112 + p113 + p114 + p115 + p116 <= 0)) OR ((2 <= p237 + p236 + p235 + p234 + p233 + p232 + p231) AND (p23 <= p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 +... (shortened)
lola: processed formula length: 495
lola: 8 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: (((2 <= p36 + p35 + p34 + p33 + p32 + p31 + p37) OR (1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116)) AND ((p237 + p236 + p235 + p234 + p233 + p232 + p231 <= 1) OR (p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + 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 + 1 <= p23) OR (p0 <= 0)))
lola: state equation: Generated DNF with 12 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-06-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-06-ReachabilityCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18647 markings, 65788 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1777 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p22 <= p244 + p243 + p242 + p241 + p240 + p239 + p238) AND (((p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p138 + p145 + p152 + p159 + p166 + p172 + p171 + p170 + p169 + p168 + p167 + p165 + p164 + p163 + p162 + p161 + p160 + p158 + p157 + p156 + p155 + p154 + p153 + p151 + p150 + p149 + p148 + p147 + p146 + p144 + p143 + p142 + p141 + p140 + p139 + p137 + p136 + p135 + p134 + p... (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 (((p22 <= p244 + p243 + p242 + p241 + p240 + p239 + p238) AND (((p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p138 + p145 + p152 + p159 + p166 + p172 + p171 + p170 + p169 + p168 + p167 + p165 + p164 + p163 + p162 + p161 + p160 + p158 + p157 + p156 + p155 + p154 + p153 + p151 + p150 + p149 + p148 + p147 + p146 + p144 + p143 + p142 + p141 + p140 + p139 + p137 + p136 + p135 + p134 + p... (shortened)
lola: processed formula length: 884
lola: 8 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: ((p244 + p243 + p242 + p241 + p240 + p239 + p238 + 1 <= p22) OR (((p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + 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 + 1 <= p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p138 + p145 + p152 + p159 + p166 + p172 + p171 + p170 + p169 + p168 + p167 + p165 + p164 + p163 + p162 + p161 + p160 + p158 + p157 + p156 + p155 + p154 + p153 + p151 + p150 + p149 + p148 + p147 + p146 + p144 + p143 + p142 + p141 + p140 + p139 + p137 + p136 + p135 + p134 + p133 + p132) OR (p100 + p101 + p95 + p96 + p97 + p98 + p99 + 1 <= p22)) AND ((p244 + p243 + p242 + p241 + p240 + p239 + p238 <= 1) OR (p267 + p266 + p265 + p264 + p263 + p262 + p261 <= 1))))
lola: state equation: Generated DNF with 9 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-06-ReachabilityCardinality-14-0.sara
lola: 28 markings, 27 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 15 will run for 3555 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p29 + p28 + p27 + p26 + p25 + p24 + p30) AND (3 <= p182 + p189 + p196 + p224 + p217 + p203 + p210 + p205 + p206 + p207 + p208 + p209 + p204 + p211 + p212 + p213 + p214 + p215 + p216 + p202 + p218 + p219 + p220 + p221 + p222 + p223 + p201 + p225 + p226 + p227 + p228 + p229 + p230 + p200 + p199 + p198 + p197 + p195 + p194 + p193 + p192 + p191 + p190 + p188 + p187 + p186 + p185 + p184 + ... (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 <= p29 + p28 + p27 + p26 + p25 + p24 + p30) AND (3 <= p182 + p189 + p196 + p224 + p217 + p203 + p210 + p205 + p206 + p207 + p208 + p209 + p204 + p211 + p212 + p213 + p214 + p215 + p216 + p202 + p218 + p219 + p220 + p221 + p222 + p223 + p201 + p225 + p226 + p227 + p228 + p229 + p230 + p200 + p199 + p198 + p197 + p195 + p194 + p193 + p192 + p191 + p190 + p188 + p187 + p186 + p185 + p184 + ... (shortened)
lola: processed formula length: 881
lola: 7 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-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: sara: state space: using reachability graph (--search=depth)try reading problem file QuasiCertifProtocol-COL-06-ReachabilityCardinality-14-0.sara.

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 <= p29 + p28 + p27 + p26 + p25 + p24 + p30) AND (3 <= p182 + p189 + p196 + p224 + p217 + p203 + p210 + p205 + p206 + p207 + p208 + p209 + p204 + p211 + p212 + p213 + p214 + p215 + p216 + p202 + p218 + p219 + p220 + p221 + p222 + p223 + p201 + p225 + p226 + p227 + p228 + p229 + p230 + p200 + p199 + p198 + p197 + p195 + p194 + p193 + p192 + p191 + p190 + p188 + p187 + p186 + p185 + p184 + p183) AND (p0 <= 0) AND ((3 <= p88 + p89 + p90 + p91 + p92 + p93 + p94) OR ((p117 + p118 + p119 + p120 + p121 + p122 + p123 <= p269) AND (p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + 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 <= p100 + p101 + p95 + p96 + p97 + p98 + p99))))
lola: state equation: Generated DNF with 9 literals and 2 conjunctive subformulas
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 40 markings, 39 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no yes yes no no yes no no yes no yes no no
lola:
preliminary result: no no no no yes yes no no yes no no yes no yes no no

lola: memory consumption: 27680 KB
lola: time consumption: 14 seconds

BK_STOP 1526905922083

--------------------
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="QuasiCertifProtocol-COL-06"
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/QuasiCertifProtocol-COL-06.tgz
mv QuasiCertifProtocol-COL-06 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 QuasiCertifProtocol-COL-06, 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 r136-qhx2-152673578700019"
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 ;