fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r118-blw7-149441650200365
Last Updated
June 27, 2017

About the Execution of LoLA for S_PermAdmissibility-COL-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15952.800 728317.00 729159.00 557.30 TTTFTTFF?FT?F?TT 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_PermAdmissibility-COL-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441650200365
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496381029298


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_PermAdmissibility-COL-05: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_PermAdmissibility-COL-05: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
LTLCardinality @ S_PermAdmissibility-COL-05 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1232/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 208 places, 1024 transitions, 177 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1460 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-05-LTLCardinality.task
lola: A ((p61 <= p189)) : A ((p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 <= p119)) : A (G (F ((p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))) : A ((2 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33)) : A (F (F (F (X ((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169)))))) : A (X (F (X ((2 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118))))) : A (G ((X ((p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152)) U G ((2 <= p8))))) : A (F (G (X (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p8)))))) : A ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p9)) : A (F (F (X ((p50 <= p178))))) : A (F (X (F (F ((p119 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41)))))) : A (G ((p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 <= p153))) : A ((X ((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= p8)) U F (F ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p86))))) : A (X (X (((2 <= p60) U (p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= p179))))) : A (F (F (G (X ((3 <= p9)))))) : A (((p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 <= p9) U X (X ((1 <= p76 + p75 + p74 + p73 + p72 + p71 + p70 + p77)))))
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 ((p61 <= p189))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p61 <= p189)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 <= p119))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 <= p119)
lola: processed formula length: 55
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))))
lola: processed formula: A (G (F ((p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))))
lola: processed formula length: 108
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: 57976 markings, 457104 edges, 11595 markings/sec, 0 secs
lola: 119360 markings, 958498 edges, 12277 markings/sec, 5 secs
lola: 171770 markings, 1405266 edges, 10482 markings/sec, 10 secs
lola: 223528 markings, 1830101 edges, 10352 markings/sec, 15 secs
lola: 287364 markings, 2355728 edges, 12767 markings/sec, 20 secs
lola: 347713 markings, 2854386 edges, 12070 markings/sec, 25 secs
lola: 412443 markings, 3401117 edges, 12946 markings/sec, 30 secs
lola: 476587 markings, 3938480 edges, 12829 markings/sec, 35 secs
lola: 540946 markings, 4465792 edges, 12872 markings/sec, 40 secs
lola: 599532 markings, 4943319 edges, 11717 markings/sec, 45 secs
lola: 656461 markings, 5425906 edges, 11386 markings/sec, 50 secs
lola: 717773 markings, 5940083 edges, 12262 markings/sec, 55 secs
lola: 781112 markings, 6458166 edges, 12668 markings/sec, 60 secs
lola: 848157 markings, 7006795 edges, 13409 markings/sec, 65 secs
lola: 912681 markings, 7547358 edges, 12905 markings/sec, 70 secs
lola: 973541 markings, 8056490 edges, 12172 markings/sec, 75 secs
lola: 1034640 markings, 8562110 edges, 12220 markings/sec, 80 secs
lola: 1095210 markings, 9065834 edges, 12114 markings/sec, 85 secs
lola: 1161104 markings, 9601643 edges, 13179 markings/sec, 90 secs
lola: 1226113 markings, 10143366 edges, 13002 markings/sec, 95 secs
lola: 1287640 markings, 10678539 edges, 12305 markings/sec, 100 secs
lola: 1353528 markings, 11204949 edges, 13178 markings/sec, 105 secs
lola: 1419117 markings, 11757830 edges, 13118 markings/sec, 110 secs
lola: 1486845 markings, 12305566 edges, 13546 markings/sec, 115 secs
lola: 1551874 markings, 12844050 edges, 13006 markings/sec, 120 secs
lola: 1609840 markings, 13350045 edges, 11593 markings/sec, 125 secs
lola: 1676556 markings, 13886471 edges, 13343 markings/sec, 130 secs
lola: 1737845 markings, 14397450 edges, 12258 markings/sec, 135 secs
lola: 1803915 markings, 14935864 edges, 13214 markings/sec, 140 secs
lola: 1867938 markings, 15470297 edges, 12805 markings/sec, 145 secs
lola: 1927839 markings, 15990540 edges, 11980 markings/sec, 150 secs
lola: 1994261 markings, 16523906 edges, 13284 markings/sec, 155 secs
lola: 2060391 markings, 17073125 edges, 13226 markings/sec, 160 secs
lola: 2127144 markings, 17616811 edges, 13351 markings/sec, 165 secs
lola: 2192503 markings, 18159633 edges, 13072 markings/sec, 170 secs
lola: 2254694 markings, 18696054 edges, 12438 markings/sec, 175 secs
lola: 2321297 markings, 19237266 edges, 13321 markings/sec, 180 secs
lola: 2387438 markings, 19786199 edges, 13228 markings/sec, 185 secs
lola: 2453578 markings, 20325144 edges, 13228 markings/sec, 190 secs
lola: 2518870 markings, 20869133 edges, 13058 markings/sec, 195 secs
lola: 2583648 markings, 21416441 edges, 12956 markings/sec, 200 secs
lola: 2645868 markings, 21934623 edges, 12444 markings/sec, 205 secs
lola: 2712107 markings, 22480280 edges, 13248 markings/sec, 210 secs
lola: 2778948 markings, 23026429 edges, 13368 markings/sec, 215 secs
lola: 2843955 markings, 23570103 edges, 13001 markings/sec, 220 secs
lola: 2907631 markings, 24102576 edges, 12735 markings/sec, 225 secs
lola: 2970120 markings, 24628624 edges, 12498 markings/sec, 230 secs
lola: 3036403 markings, 25167822 edges, 13257 markings/sec, 235 secs
lola: 3102638 markings, 25716800 edges, 13247 markings/sec, 240 secs
lola: 3169490 markings, 26265036 edges, 13370 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33)
lola: processed formula length: 52
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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 4 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F (X ((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169))))
lola: processed formula: A (F (X ((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169))))
lola: processed formula length: 116
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (X ((2 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (X ((2 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118)))))
lola: processed formula: A (X (F (X ((2 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118)))))
lola: processed formula length: 76
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: 1469956 markings, 2280444 edges, 293991 markings/sec, 0 secs
lola: 2876862 markings, 4436631 edges, 281381 markings/sec, 5 secs
lola: 4263893 markings, 6585903 edges, 277406 markings/sec, 10 secs
lola: 5630820 markings, 8716078 edges, 273385 markings/sec, 15 secs
lola: 6995777 markings, 10863311 edges, 272991 markings/sec, 20 secs
lola: 8396534 markings, 13073815 edges, 280151 markings/sec, 25 secs
lola: 9779048 markings, 15313978 edges, 276503 markings/sec, 30 secs
lola: 11164009 markings, 17539470 edges, 276992 markings/sec, 35 secs
lola: 12531454 markings, 19723456 edges, 273489 markings/sec, 40 secs
lola: 13882963 markings, 21831602 edges, 270302 markings/sec, 45 secs
lola: 15216688 markings, 23950481 edges, 266745 markings/sec, 50 secs
lola: 16550422 markings, 26143925 edges, 266747 markings/sec, 55 secs
lola: 17927446 markings, 28288512 edges, 275405 markings/sec, 60 secs
lola: 19282099 markings, 30385882 edges, 270931 markings/sec, 65 secs
lola: 20576886 markings, 32419378 edges, 258957 markings/sec, 70 secs
lola: 21846469 markings, 34395412 edges, 253917 markings/sec, 75 secs
lola: 23116708 markings, 36402111 edges, 254048 markings/sec, 80 secs
lola: 24417920 markings, 38463324 edges, 260242 markings/sec, 85 secs
lola: 25745558 markings, 40544689 edges, 265528 markings/sec, 90 secs
lola: 27157181 markings, 42670213 edges, 282325 markings/sec, 95 secs
lola: 28566114 markings, 44834787 edges, 281787 markings/sec, 100 secs
lola: 29976218 markings, 46981955 edges, 282021 markings/sec, 105 secs
lola: 31345729 markings, 49140420 edges, 273902 markings/sec, 110 secs
lola: 31583945 markings, 49515870 edges, 47643 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 316 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((X ((p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152)) U G ((2 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X ((p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152)) U G ((2 <= p8)))))
lola: processed formula: A (G ((X ((p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152)) U G ((2 <= p8)))))
lola: processed formula length: 134
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-LTLCardinality.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 28 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: subprocess 7 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p8))))))
lola: processed formula: A (F (G (X (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p8))))))
lola: processed formula length: 73
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: ========================================lola:
RUNNING
lola: 549864 markings, 4830214 edges, 109973 markings/sec, 0 secs
lola: 971735 markings, 9501172 edges, 84374 markings/sec, 5 secs
lola: 1434023 markings, 14310832 edges, 92458 markings/sec, 10 secs
lola: 1969066 markings, 19134821 edges, 107009 markings/sec, 15 secs
lola: 2415778 markings, 23756445 edges, 89342 markings/sec, 20 secs
lola: 2863263 markings, 28355763 edges, 89497 markings/sec, 25 secs
lola: 3266923 markings, 32881825 edges, 80732 markings/sec, 30 secs
lola: 3800698 markings, 37650287 edges, 106755 markings/sec, 35 secs
lola: 4187486 markings, 42236648 edges, 77358 markings/sec, 40 secs
lola: 4590453 markings, 46831154 edges, 80593 markings/sec, 45 secs
lola: 5115963 markings, 51629627 edges, 105102 markings/sec, 50 secs
lola: 5544249 markings, 56216574 edges, 85657 markings/sec, 55 secs
lola: 6002333 markings, 60869139 edges, 91617 markings/sec, 60 secs
lola: 6495170 markings, 65442075 edges, 98567 markings/sec, 65 secs
lola: 6932616 markings, 69983117 edges, 87489 markings/sec, 70 secs
lola: 7369938 markings, 74474608 edges, 87464 markings/sec, 75 secs
lola: 7791037 markings, 78893801 edges, 84220 markings/sec, 80 secs
lola: 8249334 markings, 83327161 edges, 91659 markings/sec, 85 secs
lola: 8714057 markings, 87867655 edges, 92945 markings/sec, 90 secs
lola: 9123014 markings, 92287462 edges, 81791 markings/sec, 95 secs
lola: 9528426 markings, 96701927 edges, 81082 markings/sec, 100 secs
lola: 10016088 markings, 101198579 edges, 97532 markings/sec, 105 secs
lola: 10434873 markings, 105430770 edges, 83757 markings/sec, 110 secs
lola: 10854530 markings, 109819698 edges, 83931 markings/sec, 115 secs
lola: 11243447 markings, 114057899 edges, 77783 markings/sec, 120 secs
lola: 11705365 markings, 118695043 edges, 92384 markings/sec, 125 secs
lola: 12100865 markings, 123249464 edges, 79100 markings/sec, 130 secs
lola: 12497686 markings, 127723952 edges, 79364 markings/sec, 135 secs
lola: 12933800 markings, 132277124 edges, 87223 markings/sec, 140 secs
lola: 13308688 markings, 136739542 edges, 74978 markings/sec, 145 secs
lola: 13651306 markings, 141033052 edges, 68524 markings/sec, 150 secs
lola: 14022000 markings, 145479808 edges, 74139 markings/sec, 155 secs
lola: 14387733 markings, 150002871 edges, 73147 markings/sec, 160 secs
lola: 14740378 markings, 154559433 edges, 70529 markings/sec, 165 secs
lola: 15053035 markings, 158928768 edges, 62531 markings/sec, 170 secs
lola: 15320442 markings, 163145079 edges, 53481 markings/sec, 175 secs
lola: 15576514 markings, 167497957 edges, 51214 markings/sec, 180 secs
lola: 15885300 markings, 171935176 edges, 61757 markings/sec, 185 secs
lola: 16132143 markings, 176147402 edges, 49369 markings/sec, 190 secs
lola: 16492434 markings, 180741124 edges, 72058 markings/sec, 195 secs
lola: 16921362 markings, 185314014 edges, 85786 markings/sec, 200 secs
lola: 17349884 markings, 189829298 edges, 85704 markings/sec, 205 secs
lola: 17721185 markings, 194257736 edges, 74260 markings/sec, 210 secs
lola: 18073137 markings, 198635505 edges, 70390 markings/sec, 215 secs
lola: 18513101 markings, 203041094 edges, 87993 markings/sec, 220 secs
lola: 19043031 markings, 207678178 edges, 105986 markings/sec, 225 secs
lola: 19525321 markings, 212313462 edges, 96458 markings/sec, 230 secs
lola: 19910762 markings, 216752792 edges, 77088 markings/sec, 235 secs
lola: 20317626 markings, 221251049 edges, 81373 markings/sec, 240 secs
lola: 20779472 markings, 226051510 edges, 92369 markings/sec, 245 secs
lola: 21179422 markings, 230534227 edges, 79990 markings/sec, 250 secs
lola: 21610297 markings, 235191083 edges, 86175 markings/sec, 255 secs
lola: 22133216 markings, 239864959 edges, 104584 markings/sec, 260 secs
lola: 22687051 markings, 244606244 edges, 110767 markings/sec, 265 secs
lola: 23138267 markings, 248932531 edges, 90243 markings/sec, 270 secs
lola: 23518182 markings, 253225398 edges, 75983 markings/sec, 275 secs
lola: 23963257 markings, 257711221 edges, 89015 markings/sec, 280 secs
lola: 24325920 markings, 262089972 edges, 72533 markings/sec, 285 secs
lola: 24877823 markings, 266522233 edges, 110381 markings/sec, 290 secs
lola: 25351200 markings, 271166350 edges, 94675 markings/sec, 295 secs
lola: 25838658 markings, 275610794 edges, 97492 markings/sec, 300 secs
lola: 26229389 markings, 280010588 edges, 78146 markings/sec, 305 secs
lola: 26614196 markings, 284441093 edges, 76961 markings/sec, 310 secs
lola: 27056420 markings, 288953601 edges, 88445 markings/sec, 315 secs
lola: 27415432 markings, 293290727 edges, 71802 markings/sec, 320 secs
lola: 27886225 markings, 297854504 edges, 94159 markings/sec, 325 secs
lola: 28356037 markings, 302425650 edges, 93962 markings/sec, 330 secs
lola: 28714880 markings, 306884110 edges, 71769 markings/sec, 335 secs
lola: 29059085 markings, 311283533 edges, 68841 markings/sec, 340 secs
lola: 29390148 markings, 315366891 edges, 66213 markings/sec, 345 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p9))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p9)
lola: processed formula length: 45
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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 9 will run for 401 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X ((p50 <= p178)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((p50 <= p178))))
lola: processed formula: A (F (X ((p50 <= p178))))
lola: processed formula length: 25
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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 10 will run for 468 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (F ((p119 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (F ((p119 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41)))))
lola: processed formula: A (F (X (F ((p119 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41)))))
lola: processed formula length: 71
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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 11 will run for 562 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 <= p153)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 703 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= p8)) U F (F ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p86)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= p8)) U F ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p86))))
lola: processed formula: A ((X ((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= p8)) U F ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p86))))
lola: processed formula length: 124
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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 13 will run for 937 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (((2 <= p60) U (p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= p179)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((2 <= p60) U (p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= p179)))))
lola: processed formula: A (X (X (((2 <= p60) U (p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= p179)))))
lola: processed formula length: 82
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 14 will run for 1406 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (X ((3 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X ((3 <= p9)))))
lola: processed formula: A (F (G (X ((3 <= p9)))))
lola: processed formula length: 25
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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 2812 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 <= p9) U X (X ((1 <= p76 + p75 + p74 + p73 + p72 + p71 + p70 + p77)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 <= p9) U X (X ((1 <= p76 + p75 + p74 + p73 + p72 + p71 + p70 + p77)))))
lola: processed formula: A (((p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 <= p9) U X (X ((1 <= p76 + p75 + p74 + p73 + p72 + p71 + p70 + p77)))))
lola: processed formula length: 122
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: RESULT
lola:
SUMMARY: yes yes unknown no yes unknown no unknown yes yes yes no yes yes no no
FORMULA PermAdmissibility-COL-05-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496381757615

--------------------
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_PermAdmissibility-COL-05"
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_PermAdmissibility-COL-05.tgz
mv S_PermAdmissibility-COL-05 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_PermAdmissibility-COL-05, 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 r118-blw7-149441650200365"
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 ;