fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r128-smll-149441681500399
Last Updated
June 27, 2017

About the Execution of LoLA for S_PolyORBLF-COL-S06J06T04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15944.730 268178.00 270540.00 1098.90 ???????????????? normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_PolyORBLF-COL-S06J06T04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-149441681500399
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496431635834


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_PolyORBLF-COL-S06J06T04: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_PolyORBLF-COL-S06J06T04: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
CTLCardinality @ S_PolyORBLF-COL-S06J06T04 @ 3538 seconds
Makefile:224: recipe for target 'verify' failed
----- Start make result stdout -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 7660/65536 symbol table entries, 2241 collisions
lola: preprocessing...
lola: finding significant places
lola: 506 places, 7154 transitions, 452 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2111 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: E (X (A (G (((3 <= p422) OR (p129 + p130 + p131 + p132 + p133 + p134 <= p181)))))) : NOT(((p0 + p1 + p2 + p3 <= p422) AND A (((p487 + p488 + p489 + p490 <= p217 + p218 + p219 + p220 + p221 + p222) U (2 <= p159))))) : (A (F ((p4 + p5 + p6 + p7 <= p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341))) OR NOT(NOT(E (G ((1 <= p287)))))) : NOT((NOT(E (G ((2 <= p483 + p484 + p485 + p486)))) AND E (G ((p465 <= 1))))) : (NOT(A (G (((p160 <= p217 + p218 + p219 + p220 + p221 + p222) OR (p487 + p488 + p489 + p490 <= p385 + p386 + p387 + p388))))) OR A (G (A (X ((2 <= p293 + p294 + p295 + p296)))))) : NOT((E (G (((p161 + p162 + p163 + p164 <= p342) OR (1 <= p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250)))) OR (((p422 <= 0) OR (p288 <= 1)) AND ((p466 + 1 <= p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158) OR (p160 + 1 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35))))) : A (F (((p421 <= p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341) AND (p289 + p290 + p291 + p292 <= p466) AND (2 <= p305 + p306 + p307 + p308) AND (1 <= p287) AND ((p161 + p162 + p163 + p164 + 1 <= p475) OR (p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + 1 <= p181))))) : A ((A (G ((p190 <= p160))) U A (G ((p487 + p488 + p489 + p490 <= p480))))) : A (F (NOT(E (F ((p182 + p183 + p184 + p185 <= p310 + p311 + p312 + p313)))))) : E ((A (F ((p465 <= p251 + p252 + p253 + p254))) U (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p93 + p94 + p95 + p96 + p97 + p98 + p99))) : E ((A (F ((p39 + p38 + p37 + p36 <= p124 + p125 + p126 + p127))) U ((p251 + p252 + p253 + p254 + 1 <= p423 + p424 + p425 + p426 + p427 + p429 + p430 + p431 + p432 + p433 + p435 + p436 + p437 + p438 + p439 + p441 + p442 + p443 + p444 + p445 + p447 + p448 + p449 + p450 + p451 + p453 + p454 + p455 + p456 + p457 + p464 + p463 + p462 + p461 + p460 + p459 + p458 + p452 + p446 + p440 + p434 + p428) AND (2 <= p483 + p484 + p485 + p486)))) : (NOT((A (F ((1 <= p480))) OR ((3 <= p314 + p315 + p316 + p317) OR (p112 + p113 + p114 + p115 <= 0)))) OR A (G (A (G ((p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 <= p159)))))) : E (F ((2 <= p161 + p162 + p163 + p164))) : A (F (((p377 + 1 <= p422) AND (p347 <= 0) AND (2 <= p481)))) : E (F (A (((p169 + p170 + p171 + p172 <= p396) U (1 <= p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420))))) : E (G (((p195 + p196 + p197 + p198 <= 2) AND ((p169 + p170 + p171 + p172 + 1 <= p195 + p196 + p197 + p198) OR (p289 + p290 + p291 + p292 <= 1)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (((3 <= p422) OR (p129 + p130 + p131 + p132 + p133 + p134 <= p181))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U ((p422 <= 2) AND (p181 + 1 <= p129 + p130 + p131 + p132 + p133 + p134)))))
lola: processed formula length: 90
lola: 3 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((p0 + p1 + p2 + p3 <= p422) AND A (((p487 + p488 + p489 + p490 <= p217 + p218 + p219 + p220 + p221 + p222) U (2 <= p159)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p422 + 1 <= p0 + p1 + p2 + p3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p422 + 1 <= p0 + p1 + p2 + p3)
lola: processed formula length: 31
lola: 6 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p217 + p218 + p219 + p220 + p221 + p222 + 1 <= p487 + p488 + p489 + p490) R (p159 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((p487 + p488 + p489 + p490 <= p217 + p218 + p219 + p220 + p221 + p222) U (2 <= p159)))
lola: processed formula length: 92
lola: 9 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: lola: SUBRESULT
========================================
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((p4 + p5 + p6 + p7 <= p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341))) OR NOT(NOT(E (G ((1 <= p287))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p4 + p5 + p6 + p7 <= p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (p4 + p5 + p6 + p7 <= p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341))
lola: processed formula length: 198
lola: 7 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p287)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p287 <= 0)))
lola: processed formula length: 26
lola: 8 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yeslola:
========================================
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((NOT(E (G ((2 <= p483 + p484 + p485 + p486)))) AND E (G ((p465 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((2 <= p483 + p484 + p485 + p486)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p483 + p484 + p485 + p486 <= 1)))
lola: processed formula length: 47
lola: 12 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p465)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (2 <= p465))
lola: processed formula length: 21
lola: 11 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: lola: SUBRESULT
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (G (((p160 <= p217 + p218 + p219 + p220 + p221 + p222) OR (p487 + p488 + p489 + p490 <= p385 + p386 + p387 + p388))))) OR A (G (A (X ((2 <= p293 + p294 + p295 + p296))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p217 + p218 + p219 + p220 + p221 + p222 + 1 <= p160) AND (p385 + p386 + p387 + p388 + 1 <= p487 + p488 + p489 + p490))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S06J06T04-CTLCardinality-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: SUBRESULT
========================================lola:
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G (((p161 + p162 + p163 + p164 <= p342) OR (1 <= p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250)))) OR (((p422 <= 0) OR (p288 <= 1)) AND ((p466 + 1 <= p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p342 + 1 <= p161 + p162 + p163 + p164) AND (p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((p342 + 1 <= p161 + p162 + p163 + p164) AND (p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 <= 0)))
lola: processed formula length: 256
lola: 6 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p421 <= p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341) AND (p289 + p290 + p291 + p292 <= p466) AND (2 <= p305 + p306 + p307 + p308) AND (1 <= p287) AND ((p161 + p162 + p163 + p164 + 1 <= p475) OR (p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((p421 <= p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341) AND (p289 + p290 + p291 + p292 <= p466) AND (2 <= p305 + p306 + p307 + p308) AND (1 <= p287) AND ((p161 + p162 + p163 + p164 + 1 <= p475) OR (p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p... (shortened)
lola: processed formula length: 508
lola: 1 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (G ((p190 <= p160))) U A (G ((p487 + p488 + p489 + p490 <= p480)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(E(TRUE U (p160 + 1 <= p190))) U NOT(E(TRUE U (p480 + 1 <= p487 + p488 + p489 + p490))))
lola: processed formula length: 93
lola: 5 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(E (F ((p182 + p183 + p184 + p185 <= p310 + p311 + p312 + p313))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U (p182 + p183 + p184 + p185 <= p310 + p311 + p312 + p313))))
lola: processed formula length: 81
lola: 6 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (F ((p465 <= p251 + p252 + p253 + p254))) U (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p93 + p94 + p95 + p96 + p97 + p98 + p99)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(A(TRUE U (p465 <= p251 + p252 + p253 + p254)) U (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p93 + p94 + p95 + p96 + p97 + p98 + p99))
lola: processed formula length: 235
lola: 2 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 402661 markings, 652438 edges, 2976872481744224256 markings/sec, 0 secs
lola: 1042313 markings, 1617997 edges, 127930 markings/sec, 5 secs
lola: 1625799 markings, 2577902 edges, 116697 markings/sec, 10 secs
lola: 2254793 markings, 3531547 edges, 125799 markings/sec, 15 secs
lola: 2727962 markings, 4338814 edges, 94634 markings/sec, 20 secs
lola: 3381690 markings, 5329887 edges, 130746 markings/sec, 25 secs
lola: 3996500 markings, 6338117 edges, 122962 markings/sec, 30 secs
lola: 4647307 markings, 7317513 edges, 130161 markings/sec, 35 secs
lola: 5273087 markings, 8330349 edges, 125156 markings/sec, 40 secs
lola: 5909944 markings, 9294451 edges, 127371 markings/sec, 45 secs
lola: 6520073 markings, 10293293 edges, 122026 markings/sec, 50 secs
lola: 7128474 markings, 11219462 edges, 121680 markings/sec, 55 secs
lola: 7702709 markings, 12161069 edges, 114847 markings/sec, 60 secs
lola: 8329601 markings, 13117970 edges, 125378 markings/sec, 65 secs
lola: 8887215 markings, 14031005 edges, 111523 markings/sec, 70 secs
lola: 9490823 markings, 14941154 edges, 120722 markings/sec, 75 secs
lola: 10079398 markings, 15905038 edges, 117715 markings/sec, 80 secs
lola: 10673014 markings, 16799552 edges, 118723 markings/sec, 85 secs
lola: 11287656 markings, 17801378 edges, 122928 markings/sec, 90 secs
lola: 11908368 markings, 18773237 edges, 124142 markings/sec, 95 secs
lola: 12480448 markings, 19687255 edges, 114416 markings/sec, 100 secs
lola: 13079670 markings, 20601352 edges, 119844 markings/sec, 105 secs
lola: 13716885 markings, 21620362 edges, 127443 markings/sec, 110 secs
lola: 14307265 markings, 22583728 edges, 118076 markings/sec, 115 secs
lola: 14972492 markings, 23598030 edges, 133045 markings/sec, 120 secs
lola: 15566798 markings, 24560363 edges, 118861 markings/sec, 125 secs
lola: 16214941 markings, 25539833 edges, 129629 markings/sec, 130 secs
lola: 16775328 markings, 26458239 edges, 112077 markings/sec, 135 secs
lola: 17444430 markings, 27471940 edges, 133820 markings/sec, 140 secs
lola: 18051765 markings, 28462515 edges, 121467 markings/sec, 145 secs
lola: 18675385 markings, 29410083 edges, 124724 markings/sec, 150 secs
lola: 19269768 markings, 30372309 edges, 118877 markings/sec, 155 secs
lola: 19922366 markings, 31358637 edges, 130520 markings/sec, 160 secs
lola: 20536338 markings, 32353722 edges, 122794 markings/sec, 165 secs
lola: 21187377 markings, 33348502 edges, 130208 markings/sec, 170 secs
lola: 21813057 markings, 34356485 edges, 125136 markings/sec, 175 secs
lola: 22440178 markings, 35307388 edges, 125424 markings/sec, 180 secs
lola: 23018306 markings, 36250735 edges, 115626 markings/sec, 185 secs
lola: 23609659 markings, 37147726 edges, 118271 markings/sec, 190 secs
lola: 24211582 markings, 38123676 edges, 120385 markings/sec, 195 secs
lola: 24831344 markings, 39062768 edges, 123952 markings/sec, 200 secs
lola: 25438132 markings, 40050347 edges, 121358 markings/sec, 205 secs
lola: 26048358 markings, 40972254 edges, 122045 markings/sec, 210 secs
lola: 26665972 markings, 41976048 edges, 123523 markings/sec, 215 secs
lola: 27268668 markings, 42910685 edges, 120539 markings/sec, 220 secs
lola: 27894661 markings, 43899934 edges, 125199 markings/sec, 225 secs
lola: 28480070 markings, 44846459 edges, 117082 markings/sec, 230 secs
lola: 29055692 markings, 45742410 edges, 115124 markings/sec, 235 secs
lola: 29656125 markings, 46681354 edges, 120087 markings/sec, 240 secs
lola: 30290916 markings, 47677526 edges, 126958 markings/sec, 245 secs
lola: 30872874 markings, 48627879 edges, 116392 markings/sec, 250 secs
lola: 31419364 markings, 49478188 edges, 109298 markings/sec, 255 secs
Killed
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496431904012

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

----- Start make prepare stderr -----
----- Start make result stderr -----
make: [verify] Error 137 (ignored)
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_PolyORBLF-COL-S06J06T04"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/S_PolyORBLF-COL-S06J06T04.tgz
mv S_PolyORBLF-COL-S06J06T04 execution

# this is for BenchKit: explicit launching of the test

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