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 PermAdmissibility-COL-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440484900365
=====================================================================

--------------------
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 1494650712207


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ 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 ((p119 <= p43)) : A ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p9)) : A (G (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p82 + p81 + p80 + p79 + p78 + p77 + p76 + p83)))) : A ((2 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59)) : A (F (F (F (X ((p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33)))))) : A (X (F (X ((2 <= p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181))))) : A (G ((X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135)) U G ((2 <= p8))))) : A (F (G (X (G ((p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p8)))))) : A ((p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 <= p92)) : A (F (F (X ((p171 <= p136))))) : A (F (X (F (F ((p9 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189)))))) : A (G ((p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 <= p146))) : A ((X ((p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 <= p8)) U F (F ((p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p173))))) : A (X (X (((2 <= p137) U (p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 <= p102))))) : A (F (F (G (X ((3 <= p92)))))) : A (((p89 + p88 + p87 + p86 + p85 + p84 + p90 + p91 <= p92) U X (X ((1 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)))))
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 ((p119 <= p43))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p119 <= p43)
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 ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p9))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p9)
lola: processed formula length: 53
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 ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p82 + p81 + p80 + p79 + p78 + p77 + p76 + p83))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p82 + p81 + p80 + p79 + p78 + p77 + p76 + p83))))
lola: processed formula: A (G (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p82 + p81 + p80 + p79 + p78 + p77 + p76 + p83))))
lola: processed formula length: 100
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: 51467 markings, 414357 edges, 10293 markings/sec, 0 secs
lola: 100201 markings, 823204 edges, 9747 markings/sec, 5 secs
lola: 146973 markings, 1261028 edges, 9354 markings/sec, 10 secs
lola: 197342 markings, 1681072 edges, 10074 markings/sec, 15 secs
lola: 247206 markings, 2097426 edges, 9973 markings/sec, 20 secs
lola: 294488 markings, 2526862 edges, 9456 markings/sec, 25 secs
lola: 342624 markings, 2955854 edges, 9627 markings/sec, 30 secs
lola: 393559 markings, 3372077 edges, 10187 markings/sec, 35 secs
lola: 440297 markings, 3795688 edges, 9348 markings/sec, 40 secs
lola: 487464 markings, 4227110 edges, 9433 markings/sec, 45 secs
lola: 539284 markings, 4649270 edges, 10364 markings/sec, 50 secs
lola: 588061 markings, 5069592 edges, 9755 markings/sec, 55 secs
lola: 633308 markings, 5497661 edges, 9049 markings/sec, 60 secs
lola: 684364 markings, 5918334 edges, 10211 markings/sec, 65 secs
lola: 730838 markings, 6309359 edges, 9295 markings/sec, 70 secs
lola: 774211 markings, 6721652 edges, 8675 markings/sec, 75 secs
lola: 824209 markings, 7135046 edges, 10000 markings/sec, 80 secs
lola: 872208 markings, 7540841 edges, 9600 markings/sec, 85 secs
lola: 919316 markings, 7972346 edges, 9422 markings/sec, 90 secs
lola: 968682 markings, 8393057 edges, 9873 markings/sec, 95 secs
lola: 1018049 markings, 8803933 edges, 9873 markings/sec, 100 secs
lola: 1064216 markings, 9224186 edges, 9233 markings/sec, 105 secs
lola: 1110421 markings, 9627470 edges, 9241 markings/sec, 110 secs
lola: 1157527 markings, 10017006 edges, 9421 markings/sec, 115 secs
lola: 1201069 markings, 10421789 edges, 8708 markings/sec, 120 secs
lola: 1248152 markings, 10825155 edges, 9417 markings/sec, 125 secs
lola: 1294853 markings, 11213847 edges, 9340 markings/sec, 130 secs
lola: 1340960 markings, 11639287 edges, 9221 markings/sec, 135 secs
lola: 1387937 markings, 12039979 edges, 9395 markings/sec, 140 secs
lola: 1433055 markings, 12419816 edges, 9024 markings/sec, 145 secs
lola: 1475032 markings, 12817636 edges, 8395 markings/sec, 150 secs
lola: 1525405 markings, 13235894 edges, 10075 markings/sec, 155 secs
lola: 1571151 markings, 13619607 edges, 9149 markings/sec, 160 secs
lola: 1614797 markings, 14034028 edges, 8729 markings/sec, 165 secs
lola: 1662587 markings, 14430689 edges, 9558 markings/sec, 170 secs
lola: 1711349 markings, 14839745 edges, 9752 markings/sec, 175 secs
lola: 1751578 markings, 15232072 edges, 8046 markings/sec, 180 secs
lola: 1802362 markings, 15647279 edges, 10157 markings/sec, 185 secs
lola: 1851219 markings, 16056541 edges, 9771 markings/sec, 190 secs
lola: 1895958 markings, 16477724 edges, 8948 markings/sec, 195 secs
lola: 1945664 markings, 16893004 edges, 9941 markings/sec, 200 secs
lola: 1994618 markings, 17302292 edges, 9791 markings/sec, 205 secs
lola: 2040467 markings, 17725049 edges, 9170 markings/sec, 210 secs
lola: 2088963 markings, 18139273 edges, 9699 markings/sec, 215 secs
lola: 2137817 markings, 18544632 edges, 9771 markings/sec, 220 secs
lola: 2183918 markings, 18966169 edges, 9220 markings/sec, 225 secs
lola: 2231403 markings, 19380586 edges, 9497 markings/sec, 230 secs
lola: 2275816 markings, 19568752 edges, 8883 markings/sec, 235 secs
lola: 2320413 markings, 19666374 edges, 8919 markings/sec, 240 secs
lola: 2357524 markings, 19748802 edges, 7422 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 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59)
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 ((p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33))))
lola: processed formula: A (F (X ((p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33))))
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 <= p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (X ((2 <= p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181)))))
lola: processed formula: A (X (F (X ((2 <= p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181)))))
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: 1310799 markings, 1884146 edges, 262160 markings/sec, 0 secs
lola: 2571659 markings, 3725230 edges, 252172 markings/sec, 5 secs
lola: 3741335 markings, 5440859 edges, 233935 markings/sec, 10 secs
lola: 4958101 markings, 7485994 edges, 243353 markings/sec, 15 secs
lola: 6379740 markings, 9734678 edges, 284328 markings/sec, 20 secs
lola: 7641400 markings, 11557765 edges, 252332 markings/sec, 25 secs
lola: 8879466 markings, 13379706 edges, 247613 markings/sec, 30 secs
lola: 10092473 markings, 15190858 edges, 242601 markings/sec, 35 secs
lola: 11266157 markings, 17340823 edges, 234737 markings/sec, 40 secs
lola: 12598437 markings, 19553451 edges, 266456 markings/sec, 45 secs
lola: 13834320 markings, 21349189 edges, 247177 markings/sec, 50 secs
lola: 15007072 markings, 23074720 edges, 234550 markings/sec, 55 secs
lola: 16186118 markings, 24809209 edges, 235809 markings/sec, 60 secs
lola: 17323432 markings, 26831232 edges, 227463 markings/sec, 65 secs
lola: 18540177 markings, 28951810 edges, 243349 markings/sec, 70 secs
lola: 19740722 markings, 30716082 edges, 240109 markings/sec, 75 secs
lola: 20858489 markings, 32669943 edges, 223553 markings/sec, 80 secs
lola: 22052208 markings, 34539329 edges, 238744 markings/sec, 85 secs
lola: 23098431 markings, 36061560 edges, 209245 markings/sec, 90 secs
lola: 24204209 markings, 37677331 edges, 221156 markings/sec, 95 secs
lola: 25306359 markings, 39378588 edges, 220430 markings/sec, 100 secs
lola: 26443196 markings, 41377071 edges, 227367 markings/sec, 105 secs
lola: 27671073 markings, 43296601 edges, 245575 markings/sec, 110 secs
lola: 28835695 markings, 45004150 edges, 232924 markings/sec, 115 secs
lola: 29962646 markings, 46668054 edges, 225390 markings/sec, 120 secs
lola: 30995616 markings, 48444659 edges, 206594 markings/sec, 125 secs
lola: 32045330 markings, 50372662 edges, 209943 markings/sec, 130 secs
lola: 33178450 markings, 52257868 edges, 226624 markings/sec, 135 secs
lola: 34283192 markings, 53896810 edges, 220948 markings/sec, 140 secs
lola: 35353007 markings, 55467058 edges, 213963 markings/sec, 145 secs
lola: 36384326 markings, 57029709 edges, 206264 markings/sec, 150 secs
lola: 37303753 markings, 58759465 edges, 183885 markings/sec, 155 secs
lola: 38339002 markings, 60560502 edges, 207050 markings/sec, 160 secs
lola: 39465412 markings, 62375347 edges, 225282 markings/sec, 165 secs
lola: 40500016 markings, 64023483 edges, 206921 markings/sec, 170 secs
lola: 41606921 markings, 65956529 edges, 221381 markings/sec, 175 secs
lola: 42796553 markings, 67853359 edges, 237926 markings/sec, 180 secs
lola: 43981781 markings, 69604417 edges, 237046 markings/sec, 185 secs
lola: 45036055 markings, 71341919 edges, 210855 markings/sec, 190 secs
lola: 46009924 markings, 73100738 edges, 194774 markings/sec, 195 secs
lola: 47029307 markings, 74772374 edges, 203877 markings/sec, 200 secs
lola: 48083237 markings, 76322141 edges, 210786 markings/sec, 205 secs
lola: 48728629 markings, 77478121 edges, 129078 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 307 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135)) 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 ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135)) U G ((2 <= p8)))))
lola: processed formula: A (G ((X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135)) U G ((2 <= p8)))))
lola: processed formula length: 126
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 341 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (G ((p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X (G ((p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p8))))))
lola: ========================================
lola: processed formula: A (F (G (X (G ((p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p8))))))
lola: processed formula length: 81
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: 832449 markings, 4036657 edges, 166490 markings/sec, 0 secs
lola: 1587230 markings, 8258669 edges, 150956 markings/sec, 5 secs
lola: 2175494 markings, 12102471 edges, 117653 markings/sec, 10 secs
lola: 2694620 markings, 15984982 edges, 103825 markings/sec, 15 secs
lola: 3339869 markings, 20250130 edges, 129050 markings/sec, 20 secs
lola: 3983356 markings, 24312737 edges, 128697 markings/sec, 25 secs
lola: 4638233 markings, 28238083 edges, 130975 markings/sec, 30 secs
lola: 5282265 markings, 32313262 edges, 128806 markings/sec, 35 secs
lola: 5900983 markings, 36210396 edges, 123744 markings/sec, 40 secs
lola: 6527733 markings, 40180463 edges, 125350 markings/sec, 45 secs
lola: 7237096 markings, 43994065 edges, 141873 markings/sec, 50 secs
lola: 7946745 markings, 48040372 edges, 141930 markings/sec, 55 secs
lola: 8648461 markings, 52174868 edges, 140343 markings/sec, 60 secs
lola: 9258033 markings, 56225144 edges, 121914 markings/sec, 65 secs
lola: 9847430 markings, 60367482 edges, 117879 markings/sec, 70 secs
lola: 10528133 markings, 64319981 edges, 136141 markings/sec, 75 secs
lola: 11151188 markings, 68265687 edges, 124611 markings/sec, 80 secs
lola: 11640350 markings, 72292769 edges, 97832 markings/sec, 85 secs
lola: 12202218 markings, 76432553 edges, 112374 markings/sec, 90 secs
lola: 12796466 markings, 80390691 edges, 118850 markings/sec, 95 secs
lola: 13369514 markings, 84233476 edges, 114610 markings/sec, 100 secs
lola: 13965274 markings, 88082521 edges, 119152 markings/sec, 105 secs
lola: 14573641 markings, 92038864 edges, 121673 markings/sec, 110 secs
lola: 15121994 markings, 95838756 edges, 109671 markings/sec, 115 secs
lola: 15694958 markings, 99724786 edges, 114593 markings/sec, 120 secs
lola: 16272729 markings, 103448762 edges, 115554 markings/sec, 125 secs
lola: 16800756 markings, 107275777 edges, 105605 markings/sec, 130 secs
lola: 17366551 markings, 111009472 edges, 113159 markings/sec, 135 secs
lola: 17990443 markings, 114982811 edges, 124778 markings/sec, 140 secs
lola: 18534799 markings, 118833226 edges, 108871 markings/sec, 145 secs
lola: 19048969 markings, 122767335 edges, 102834 markings/sec, 150 secs
lola: 19845651 markings, 126660428 edges, 159336 markings/sec, 155 secs
lola: 20547402 markings, 130542880 edges, 140350 markings/sec, 160 secs
lola: 21156262 markings, 134408093 edges, 121772 markings/sec, 165 secs
lola: 21687858 markings, 138407366 edges, 106319 markings/sec, 170 secs
lola: 22287513 markings, 142350907 edges, 119931 markings/sec, 175 secs
lola: 22849065 markings, 146320160 edges, 112310 markings/sec, 180 secs
lola: 23386814 markings, 150046082 edges, 107550 markings/sec, 185 secs
lola: 23949709 markings, 153759717 edges, 112579 markings/sec, 190 secs
lola: 24516876 markings, 157564974 edges, 113433 markings/sec, 195 secs
lola: 25044627 markings, 161083308 edges, 105550 markings/sec, 200 secs
lola: 25743351 markings, 164768058 edges, 139745 markings/sec, 205 secs
lola: 26410554 markings, 168555757 edges, 133441 markings/sec, 210 secs
lola: 27105222 markings, 172332308 edges, 138934 markings/sec, 215 secs
lola: 27617060 markings, 176188282 edges, 102368 markings/sec, 220 secs
lola: 28222341 markings, 180108158 edges, 121056 markings/sec, 225 secs
lola: 28831028 markings, 183914763 edges, 121737 markings/sec, 230 secs
lola: 29428262 markings, 187650902 edges, 119447 markings/sec, 235 secs
lola: 29898647 markings, 191524782 edges, 94077 markings/sec, 240 secs
lola: 30445089 markings, 195531738 edges, 109288 markings/sec, 245 secs
lola: 30947922 markings, 199426843 edges, 100567 markings/sec, 250 secs
lola: 31447393 markings, 203223951 edges, 99894 markings/sec, 255 secs
lola: 31920592 markings, 206838603 edges, 94640 markings/sec, 260 secs
lola: 32454487 markings, 210512433 edges, 106779 markings/sec, 265 secs
lola: 32946821 markings, 214146483 edges, 98467 markings/sec, 270 secs
lola: 33456609 markings, 217943117 edges, 101958 markings/sec, 275 secs
lola: 33971153 markings, 221578288 edges, 102909 markings/sec, 280 secs
lola: 34463113 markings, 225206448 edges, 98392 markings/sec, 285 secs
lola: 35017587 markings, 228807844 edges, 110895 markings/sec, 290 secs
lola: 35543977 markings, 232621422 edges, 105278 markings/sec, 295 secs
lola: 36026473 markings, 236256553 edges, 96499 markings/sec, 300 secs
lola: 36565831 markings, 240367364 edges, 107872 markings/sec, 305 secs
lola: 37065456 markings, 244541736 edges, 99925 markings/sec, 310 secs
lola: 37660105 markings, 248487189 edges, 118930 markings/sec, 315 secs
lola: 38187976 markings, 252445167 edges, 105574 markings/sec, 320 secs
lola: 38715038 markings, 256369995 edges, 105412 markings/sec, 325 secs
lola: 39353270 markings, 260334020 edges, 127646 markings/sec, 330 secs
lola: 39952731 markings, 264163537 edges, 119892 markings/sec, 335 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 341 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 <= p92))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 <= p92)
lola: processed formula length: 54
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 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X ((p171 <= p136)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((p171 <= p136))))
lola: processed formula: A (F (X ((p171 <= p136))))
lola: processed formula length: 26
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 455 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (F ((p9 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (F ((p9 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189)))))
lola: processed formula: A (F (X (F ((p9 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189)))))
lola: processed formula length: 77
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 546 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 <= p146)))
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 682 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 <= p8)) U F (F ((p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p173)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 <= p8)) U F ((p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p173))))
lola: processed formula: A ((X ((p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 <= p8)) U F ((p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p173))))
lola: processed formula length: 141
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 910 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (((2 <= p137) U (p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 <= p102)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((2 <= p137) U (p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 <= p102)))))
lola: processed formula: A (X (X (((2 <= p137) U (p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 <= p102)))))
lola: processed formula length: 83
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 1365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (X ((3 <= p92))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X ((3 <= p92)))))
lola: processed formula: A (F (G (X ((3 <= p92)))))
lola: processed formula length: 26
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 2731 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p89 + p88 + p87 + p86 + p85 + p84 + p90 + p91 <= p92) U X (X ((1 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p89 + p88 + p87 + p86 + p85 + p84 + p90 + p91 <= p92) U X (X ((1 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)))))
lola: processed formula: A (((p89 + p88 + p87 + p86 + p85 + p84 + p90 + p91 <= p92) U X (X ((1 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)))))
lola: processed formula length: 131
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: RESULT
lola:
SUMMARY: yes yes unknown no yes unknown no unknown yes yes yes no yes yes no no
lola: ========================================
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 1494651521631

--------------------
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="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/PermAdmissibility-COL-05.tgz
mv 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 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 r038-blw7-149440484900365"
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 ;