fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r128-smll-149441681500401
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
1023.280 445531.00 448900.00 1467.60 FFTFFFFTFFFTFF?T 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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-149441681500401
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496432871668


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 LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
LTLCardinality @ S_PolyORBLF-COL-S06J06T04 @ 3538 seconds
----- 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-LTLCardinality.task
lola: A ((((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 + p97 + p98 + p99) U (2 <= p33)) U (1 <= p391 + p392 + p393 + p394))) : A (F (F ((3 <= p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486)))) : A (F (G (F (X ((3 <= p68 + p67 + p66 + p69)))))) : A (X (X (((p487 <= p210 + p211 + p212 + p213) U (1 <= p275 + p276 + p277 + p278 + p279 + p280 + p281))))) : A (X ((F ((p89 + p90 + p91 + p92 + p93 + p94 <= p33)) U (p77 + p78 + p79 + p80 + p81 + p82 + p83 <= p488)))) : A (X ((p208 <= p395 + p396 + p397 + p398))) : A ((X (X ((1 <= p34 + p35 + p36 + p37 + p38 + p39))) U (2 <= p489))) : A ((1 <= p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426)) : A (((2 <= p84 + p85 + p86 + p87) U ((3 <= p319) U (1 <= p199)))) : A ((p199 <= p209)) : A ((G (X ((2 <= p214))) U F (F ((p71 + p70 + p72 + p73 + p74 + p75 + p76 <= p77 + p78 + p79 + p80 + p81 + p82 + p83))))) : A ((2 <= p161)) : A (X (F ((2 <= p209)))) : A (X (F ((p84 + p85 + p86 + p87 <= p454 + p455 + p456 + p457)))) : A (((p431 <= p391 + p392 + p393 + p394) U F (X ((p274 <= p199))))) : A ((p208 <= p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((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 + p97 + p98 + p99) U (2 <= p33)) U (1 <= p391 + p392 + p393 + p394)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((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 + p97 + p98 + p99) U (2 <= p33)) U (1 <= p391 + p392 + p393 + p394)))
lola: processed formula: A ((((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 + p97 + p98 + p99) U (2 <= p33)) U (1 <= p391 + p392 + p393 + p394)))
lola: processed formula length: 253
lola: 0 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1812 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F ((3 <= p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((3 <= p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486)))
lola: processed formula: A (F ((3 <= p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486)))
lola: processed formula length: 180
lola: 1 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1812 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (F (X ((3 <= p68 + p67 + p66 + p69))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (X ((3 <= p68 + p67 + p66 + p69)))))
lola: processed formula: A (G (F (X ((3 <= p68 + p67 + p66 + p69)))))
lola: processed formula length: 44
lola: 1 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1812 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (((p487 <= p210 + p211 + p212 + p213) U (1 <= p275 + p276 + p277 + p278 + p279 + p280 + p281)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((p487 <= p210 + p211 + p212 + p213) U (1 <= p275 + p276 + p277 + p278 + p279 + p280 + p281)))))
lola: processed formula: A (X (X (((p487 <= p210 + p211 + p212 + p213) U (1 <= p275 + p276 + p277 + p278 + p279 + p280 + p281)))))
lola: processed formula length: 105
lola: 0 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1812 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((p89 + p90 + p91 + p92 + p93 + p94 <= p33)) U (p77 + p78 + p79 + p80 + p81 + p82 + p83 <= p488))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((p89 + p90 + p91 + p92 + p93 + p94 <= p33)) U (p77 + p78 + p79 + p80 + p81 + p82 + p83 <= p488))))
lola: processed formula: A (X ((F ((p89 + p90 + p91 + p92 + p93 + p94 <= p33)) U (p77 + p78 + p79 + p80 + p81 + p82 + p83 <= p488))))
lola: processed formula length: 108
lola: 0 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1812 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p208 <= p395 + p396 + p397 + p398)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p208 <= p395 + p396 + p397 + p398)))
lola: processed formula: A (X ((p208 <= p395 + p396 + p397 + p398)))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1812 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((1 <= p34 + p35 + p36 + p37 + p38 + p39))) U (2 <= p489)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X ((1 <= p34 + p35 + p36 + p37 + p38 + p39))) U (2 <= p489)))
lola: processed formula: A ((X (X ((1 <= p34 + p35 + p36 + p37 + p38 + p39))) U (2 <= p489)))
lola: processed formula length: 68
lola: 0 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1812 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426)
lola: processed formula length: 200
lola: 1 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-LTLCardinality.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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p84 + p85 + p86 + p87) U ((3 <= p319) U (1 <= p199))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((2 <= p84 + p85 + p86 + p87) U ((3 <= p319) U (1 <= p199))))
lola: processed formula: A (((2 <= p84 + p85 + p86 + p87) U ((3 <= p319) U (1 <= p199))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1812 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 10955 markings, 15642 edges, 2191 markings/sec, 0 secs
lola: 21861 markings, 32540 edges, 2181 markings/sec, 5 secs
lola: 33715 markings, 50168 edges, 2371 markings/sec, 10 secs
lola: 43880 markings, 65987 edges, 2033 markings/sec, 15 secs
lola: 52331 markings, 83454 edges, 1690 markings/sec, 20 secs
lola: 64973 markings, 101646 edges, 2528 markings/sec, 25 secs
lola: 76735 markings, 120281 edges, 2352 markings/sec, 30 secs
lola: 89341 markings, 138744 edges, 2521 markings/sec, 35 secs
lola: 100036 markings, 158044 edges, 2139 markings/sec, 40 secs
lola: 111475 markings, 177053 edges, 2288 markings/sec, 45 secs
lola: 123829 markings, 196395 edges, 2471 markings/sec, 50 secs
lola: 136476 markings, 216552 edges, 2529 markings/sec, 55 secs
lola: 148225 markings, 233485 edges, 2350 markings/sec, 60 secs
lola: 158681 markings, 253218 edges, 2091 markings/sec, 65 secs
lola: 170456 markings, 271126 edges, 2355 markings/sec, 70 secs
lola: 182093 markings, 289050 edges, 2327 markings/sec, 75 secs
lola: 193752 markings, 306305 edges, 2332 markings/sec, 80 secs
lola: 203729 markings, 325290 edges, 1995 markings/sec, 85 secs
lola: 212107 markings, 344919 edges, 1676 markings/sec, 90 secs
lola: 220269 markings, 366488 edges, 1632 markings/sec, 95 secs
lola: 231843 markings, 383276 edges, 2315 markings/sec, 100 secs
lola: 243355 markings, 401009 edges, 2302 markings/sec, 105 secs
lola: 254815 markings, 418124 edges, 2292 markings/sec, 110 secs
lola: 264801 markings, 434739 edges, 1997 markings/sec, 115 secs
lola: 275012 markings, 453435 edges, 2042 markings/sec, 120 secs
lola: 286904 markings, 471577 edges, 2378 markings/sec, 125 secs
lola: 298531 markings, 489343 edges, 2325 markings/sec, 130 secs
lola: 310609 markings, 507111 edges, 2416 markings/sec, 135 secs
lola: 321021 markings, 527084 edges, 2082 markings/sec, 140 secs
lola: 332009 markings, 544557 edges, 2198 markings/sec, 145 secs
lola: 344233 markings, 563540 edges, 2445 markings/sec, 150 secs
lola: 356589 markings, 583085 edges, 2471 markings/sec, 155 secs
lola: 368055 markings, 600109 edges, 2293 markings/sec, 160 secs
lola: 378163 markings, 619248 edges, 2022 markings/sec, 165 secs
lola: 389150 markings, 636090 edges, 2197 markings/sec, 170 secs
lola: 400350 markings, 653390 edges, 2240 markings/sec, 175 secs
lola: 411876 markings, 670372 edges, 2305 markings/sec, 180 secs
lola: 421692 markings, 688232 edges, 1963 markings/sec, 185 secs
lola: 430309 markings, 708334 edges, 1723 markings/sec, 190 secs
lola: 438671 markings, 729451 edges, 1672 markings/sec, 195 secs
lola: 450014 markings, 747435 edges, 2269 markings/sec, 200 secs
lola: 460904 markings, 764305 edges, 2178 markings/sec, 205 secs
lola: 472738 markings, 782151 edges, 2367 markings/sec, 210 secs
lola: 483317 markings, 798971 edges, 2116 markings/sec, 215 secs
lola: 493530 markings, 818263 edges, 2043 markings/sec, 220 secs
lola: 505751 markings, 836568 edges, 2444 markings/sec, 225 secs
lola: 517436 markings, 854580 edges, 2337 markings/sec, 230 secs
lola: 529649 markings, 872528 edges, 2443 markings/sec, 235 secs
lola: 540099 markings, 892575 edges, 2090 markings/sec, 240 secs
lola: 551544 markings, 910857 edges, 2289 markings/sec, 245 secs
lola: 564095 markings, 930379 edges, 2510 markings/sec, 250 secs
lola: 576558 markings, 950124 edges, 2493 markings/sec, 255 secs
lola: 588231 markings, 968013 edges, 2335 markings/sec, 260 secs
lola: 599013 markings, 987821 edges, 2156 markings/sec, 265 secs
lola: 610195 markings, 1005330 edges, 2236 markings/sec, 270 secs
lola: 621853 markings, 1022756 edges, 2332 markings/sec, 275 secs
lola: 633666 markings, 1039952 edges, 2363 markings/sec, 280 secs
lola: 643524 markings, 1059855 edges, 1972 markings/sec, 285 secs
lola: 652006 markings, 1080942 edges, 1696 markings/sec, 290 secs
lola: 661644 markings, 1101926 edges, 1928 markings/sec, 295 secs
lola: 672867 markings, 1119239 edges, 2245 markings/sec, 300 secs
lola: 684234 markings, 1136723 edges, 2273 markings/sec, 305 secs
lola: 695797 markings, 1153721 edges, 2313 markings/sec, 310 secs
lola: 706105 markings, 1172682 edges, 2062 markings/sec, 315 secs
lola: 717062 markings, 1190693 edges, 2191 markings/sec, 320 secs
lola: 729027 markings, 1209585 edges, 2393 markings/sec, 325 secs
lola: 741611 markings, 1229607 edges, 2517 markings/sec, 330 secs
lola: 753378 markings, 1246656 edges, 2353 markings/sec, 335 secs
lola: 763893 markings, 1266728 edges, 2103 markings/sec, 340 secs
lola: 776198 markings, 1286509 edges, 2461 markings/sec, 345 secs
lola: 789101 markings, 1305198 edges, 2581 markings/sec, 350 secs
lola: 800814 markings, 1323844 edges, 2343 markings/sec, 355 secs
lola: 811945 markings, 1344929 edges, 2226 markings/sec, 360 secs
lola: 824548 markings, 1363357 edges, 2521 markings/sec, 365 secs
lola: 836355 markings, 1382107 edges, 2361 markings/sec, 370 secs
lola: 848554 markings, 1401504 edges, 2440 markings/sec, 375 secs
lola: 859378 markings, 1419413 edges, 2165 markings/sec, 380 secs
lola: 868501 markings, 1441527 edges, 1825 markings/sec, 385 secs
lola: 878197 markings, 1464616 edges, 1939 markings/sec, 390 secs
lola: 889973 markings, 1481454 edges, 2355 markings/sec, 395 secs
lola: 900850 markings, 1499302 edges, 2175 markings/sec, 400 secs
lola: 912195 markings, 1515788 edges, 2269 markings/sec, 405 secs
lola: 922462 markings, 1534081 edges, 2053 markings/sec, 410 secs
lola: 933450 markings, 1552887 edges, 2198 markings/sec, 415 secs
lola: 944880 markings, 1571017 edges, 2286 markings/sec, 420 secs
lola: 956864 markings, 1588685 edges, 2397 markings/sec, 425 secs
lola: 968572 markings, 1606213 edges, 2342 markings/sec, 430 secs
lola: 978620 markings, 1626899 edges, 2010 markings/sec, 435 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p199 <= p209))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p199 <= p209)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 515 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((2 <= p214))) U F (F ((p71 + p70 + p72 + p73 + p74 + p75 + p76 <= p77 + p78 + p79 + p80 + p81 + p82 + p83)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (X ((2 <= p214))) U F ((p71 + p70 + p72 + p73 + p74 + p75 + p76 <= p77 + p78 + p79 + p80 + p81 + p82 + p83))))
lola: processed formula: A ((G (X ((2 <= p214))) U F ((p71 + p70 + p72 + p73 + p74 + p75 + p76 <= p77 + p78 + p79 + p80 + p81 + p82 + p83))))
lola: processed formula length: 116
lola: 1 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1812 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 11 will run for 618 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p161))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p161)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-LTLCardinality.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 12 will run for 773 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F ((2 <= p209))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((2 <= p209))))
lola: processed formula: A (X (F ((2 <= p209))))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1812 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 13 will run for 1031 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F ((p84 + p85 + p86 + p87 <= p454 + p455 + p456 + p457))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p84 + p85 + p86 + p87 <= p454 + p455 + p456 + p457))))
lola: processed formula: A (X (F ((p84 + p85 + p86 + p87 <= p454 + p455 + p456 + p457))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1812 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 14 will run for 1547 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p431 <= p391 + p392 + p393 + p394) U F (X ((p274 <= p199)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p431 <= p391 + p392 + p393 + p394) U F (X ((p274 <= p199)))))
lola: processed formula: A (((p431 <= p391 + p392 + p393 + p394) U F (X ((p274 <= p199)))))
lola: processed formula length: 66
lola: 0 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1812 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 15 will run for 3094 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p208 <= p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p208 <= p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426)
lola: processed formula length: 203
lola: 1 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-LTLCardinality.task
lola: processed formula with 1 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: RESULT
lola:
SUMMARY: no no no no no yes no no unknown yes yes no no no no yes
lola: ========================================
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496433317199

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_PolyORBLF-COL-S06J06T04"
export BK_EXAMINATION="LTLCardinality"
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 LTLCardinality"
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-149441681500401"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;