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

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


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_PermAdmissibility-PT-05: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_PermAdmissibility-PT-05: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_PermAdmissibility-PT-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: 760/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 168 places, 592 transitions, 136 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 820 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-05-LTLCardinality.task
lola: A ((c18 <= c11)) : A ((out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 <= c19)) : A (G (F ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7)))) : A ((2 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7)) : A (F (F (F (X ((out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5)))))) : A (X (F (X ((2 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7))))) : A (G ((X ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7)) U G ((2 <= c17))))) : A (F (G (X (G ((aux8_2 + aux8_3 + aux8_6 + aux8_7 <= c17)))))) : A ((aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7 <= c8)) : A (F (F (X ((c15 <= c5))))) : A (F (X (F (F ((c19 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)))))) : A (G ((aux7_2 + aux7_3 + aux7_6 + aux7_7 <= c7))) : A ((X ((out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 <= c17)) U F (F ((aux8_2 + aux8_3 + aux8_6 + aux8_7 <= c13))))) : A (X (X (((2 <= c110) U (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= c6))))) : A (F (F (G (X ((3 <= c8)))))) : A (((in1_0 + in1_1 <= c8) U X (X ((1 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7)))))
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 ((c18 <= c11))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (c18 <= c11)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 168 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 ((out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 <= c19))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 <= c19)
lola: processed formula length: 78
lola: 1 rewrites
lola: formula mentions 0 of 168 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 ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7))))
lola: processed formula: A (G (F ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7))))
lola: processed formula length: 156
lola: 0 rewrites
lola: formula mentions 0 of 168 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 548 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: 376658 markings, 2409163 edges, 75332 markings/sec, 0 secs
lola: 737202 markings, 4723591 edges, 72109 markings/sec, 5 secs
lola: 1069625 markings, 6254972 edges, 66485 markings/sec, 10 secs
lola: 1407700 markings, 7702478 edges, 67615 markings/sec, 15 secs
lola: 1736581 markings, 9231908 edges, 65776 markings/sec, 20 secs
lola: 2048959 markings, 10188612 edges, 62476 markings/sec, 25 secs
lola: 2359563 markings, 11318996 edges, 62121 markings/sec, 30 secs
lola: 2667346 markings, 12941256 edges, 61557 markings/sec, 35 secs
lola: 3033379 markings, 15293231 edges, 73207 markings/sec, 40 secs
lola: 3347584 markings, 16742912 edges, 62841 markings/sec, 45 secs
lola: 3632470 markings, 18032065 edges, 56977 markings/sec, 50 secs
lola: 3928876 markings, 19399826 edges, 59281 markings/sec, 55 secs
lola: 4206422 markings, 20391483 edges, 55509 markings/sec, 60 secs
lola: 4502884 markings, 21848066 edges, 59292 markings/sec, 65 secs
lola: 4818352 markings, 23419164 edges, 63094 markings/sec, 70 secs
lola: 5146860 markings, 25365507 edges, 65702 markings/sec, 75 secs
lola: 5479516 markings, 26531953 edges, 66531 markings/sec, 80 secs
lola: 5818082 markings, 28082965 edges, 67713 markings/sec, 85 secs
lola: 6144567 markings, 29559963 edges, 65297 markings/sec, 90 secs
lola: 6465240 markings, 30516614 edges, 64135 markings/sec, 95 secs
lola: 6748067 markings, 31568448 edges, 56565 markings/sec, 100 secs
lola: 7040707 markings, 32929058 edges, 58528 markings/sec, 105 secs
lola: 7338141 markings, 34411628 edges, 59487 markings/sec, 110 secs
lola: 7625328 markings, 35513853 edges, 57437 markings/sec, 115 secs
lola: 7922459 markings, 36909063 edges, 59426 markings/sec, 120 secs
lola: 8193418 markings, 38166154 edges, 54192 markings/sec, 125 secs
lola: 8494979 markings, 39630081 edges, 60312 markings/sec, 130 secs
lola: 8771930 markings, 40981555 edges, 55390 markings/sec, 135 secs
lola: 9113884 markings, 43163055 edges, 68391 markings/sec, 140 secs
lola: 9437775 markings, 44804105 edges, 64778 markings/sec, 145 secs
lola: 9743732 markings, 46216846 edges, 61191 markings/sec, 150 secs
lola: 10048872 markings, 47411090 edges, 61028 markings/sec, 155 secs
lola: 10367042 markings, 49098077 edges, 63634 markings/sec, 160 secs
lola: 10651833 markings, 50464403 edges, 56958 markings/sec, 165 secs
lola: 10958469 markings, 51990155 edges, 61327 markings/sec, 170 secs
lola: 11283460 markings, 53570617 edges, 64998 markings/sec, 175 secs
lola: 11586775 markings, 54782251 edges, 60663 markings/sec, 180 secs
lola: 11891339 markings, 56243391 edges, 60913 markings/sec, 185 secs
lola: 12182422 markings, 57641206 edges, 58217 markings/sec, 190 secs
lola: 12474281 markings, 59186374 edges, 58372 markings/sec, 195 secs
lola: 12825221 markings, 60812178 edges, 70188 markings/sec, 200 secs
lola: 13179220 markings, 62592168 edges, 70800 markings/sec, 205 secs
lola: 13496142 markings, 63757332 edges, 63384 markings/sec, 210 secs
lola: 13812653 markings, 64812355 edges, 63302 markings/sec, 215 secs
lola: 14120559 markings, 66216118 edges, 61581 markings/sec, 220 secs
lola: 14405294 markings, 67372388 edges, 56947 markings/sec, 225 secs
lola: 14695039 markings, 68332218 edges, 57949 markings/sec, 230 secs
lola: 15018661 markings, 69811156 edges, 64724 markings/sec, 235 secs
lola: 15325526 markings, 71173709 edges, 61373 markings/sec, 240 secs
lola: 15634333 markings, 72473856 edges, 61761 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 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7)
lola: processed formula length: 84
lola: 1 rewrites
lola: formula mentions 0 of 168 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 ((out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5))))
lola: processed formula: A (F (X ((out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5))))
lola: processed formula length: 120
lola: 2 rewrites
lola: formula mentions 0 of 168 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 548 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 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (X ((2 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7)))))
lola: processed formula: A (X (F (X ((2 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7)))))
lola: processed formula length: 100
lola: 0 rewrites
lola: formula mentions 0 of 168 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 548 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: 1480580 markings, 1833319 edges, 296116 markings/sec, 0 secs
lola: 2893579 markings, 3663242 edges, 282600 markings/sec, 5 secs
lola: 4306828 markings, 5432967 edges, 282650 markings/sec, 10 secs
lola: 5642659 markings, 7162455 edges, 267166 markings/sec, 15 secs
lola: 6922720 markings, 8799155 edges, 256012 markings/sec, 20 secs
lola: 8161037 markings, 10391903 edges, 247663 markings/sec, 25 secs
lola: 9301158 markings, 11891442 edges, 228024 markings/sec, 30 secs
lola: 10507885 markings, 13454358 edges, 241345 markings/sec, 35 secs
lola: 11747305 markings, 15029025 edges, 247884 markings/sec, 40 secs
lola: 12855525 markings, 16447021 edges, 221644 markings/sec, 45 secs
lola: 13978733 markings, 17898458 edges, 224642 markings/sec, 50 secs
lola: 15132853 markings, 19397393 edges, 230824 markings/sec, 55 secs
lola: 16317285 markings, 20931546 edges, 236886 markings/sec, 60 secs
lola: 17518231 markings, 22494319 edges, 240189 markings/sec, 65 secs
lola: 18698472 markings, 24050223 edges, 236048 markings/sec, 70 secs
lola: 19845005 markings, 25585449 edges, 229307 markings/sec, 75 secs
lola: 21045205 markings, 27149925 edges, 240040 markings/sec, 80 secs
lola: 22214105 markings, 28715591 edges, 233780 markings/sec, 85 secs
lola: 23508871 markings, 30327032 edges, 258953 markings/sec, 90 secs
lola: 24619638 markings, 31794849 edges, 222153 markings/sec, 95 secs
lola: 25787006 markings, 33299592 edges, 233474 markings/sec, 100 secs
lola: 26946760 markings, 34781201 edges, 231951 markings/sec, 105 secs
lola: 28053599 markings, 36246593 edges, 221368 markings/sec, 110 secs
lola: 29241024 markings, 37786462 edges, 237485 markings/sec, 115 secs
lola: 30435711 markings, 39342683 edges, 238937 markings/sec, 120 secs
lola: 31610256 markings, 40882734 edges, 234909 markings/sec, 125 secs
lola: 32761502 markings, 42399486 edges, 230249 markings/sec, 130 secs
lola: 33836147 markings, 43867262 edges, 214929 markings/sec, 135 secs
lola: 34979133 markings, 45398770 edges, 228597 markings/sec, 140 secs
lola: 35974663 markings, 46722673 edges, 199106 markings/sec, 145 secs
lola: 37207301 markings, 48300414 edges, 246528 markings/sec, 150 secs
lola: 38333818 markings, 49750187 edges, 225303 markings/sec, 155 secs
lola: 39443935 markings, 51132976 edges, 222023 markings/sec, 160 secs
lola: 40548513 markings, 52594675 edges, 220916 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 311 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((X ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7)) U G ((2 <= c17)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7)) U G ((2 <= c17)))))
lola: processed formula: A (G ((X ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7)) U G ((2 <= c17)))))
lola: processed formula length: 175
lola: 0 rewrites
lola: formula mentions 0 of 168 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 548 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 346 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (G ((aux8_2 + aux8_3 + aux8_6 + aux8_7 <= c17))))))
lola: ========================================
lola: SUBTASK
lola: lola: ========================================
checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X (G ((aux8_2 + aux8_3 + aux8_6 + aux8_7 <= c17))))))
lola: processed formula: A (F (G (X (G ((aux8_2 + aux8_3 + aux8_6 + aux8_7 <= c17))))))
lola: processed formula length: 62
lola: 0 rewrites
lola: formula mentions 0 of 168 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 548 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: 1152582 markings, 4313269 edges, 230516 markings/sec, 0 secs
lola: 2194672 markings, 8229434 edges, 208418 markings/sec, 5 secs
lola: 3227598 markings, 12134055 edges, 206585 markings/sec, 10 secs
lola: 4346656 markings, 16195491 edges, 223812 markings/sec, 15 secs
lola: 5457292 markings, 20287657 edges, 222127 markings/sec, 20 secs
lola: 6515419 markings, 24215646 edges, 211625 markings/sec, 25 secs
lola: 7594103 markings, 28134427 edges, 215737 markings/sec, 30 secs
lola: 8676601 markings, 32154224 edges, 216500 markings/sec, 35 secs
lola: 9741096 markings, 35997071 edges, 212899 markings/sec, 40 secs
lola: 10736775 markings, 39759515 edges, 199136 markings/sec, 45 secs
lola: 11755670 markings, 43617759 edges, 203779 markings/sec, 50 secs
lola: 12810251 markings, 47612785 edges, 210916 markings/sec, 55 secs
lola: 13876253 markings, 51445470 edges, 213200 markings/sec, 60 secs
lola: 14928261 markings, 55382570 edges, 210402 markings/sec, 65 secs
lola: 15985770 markings, 59341117 edges, 211502 markings/sec, 70 secs
lola: 17030432 markings, 63333003 edges, 208932 markings/sec, 75 secs
lola: 18004918 markings, 66985785 edges, 194897 markings/sec, 80 secs
lola: 18985448 markings, 70638237 edges, 196106 markings/sec, 85 secs
lola: 20053816 markings, 74524451 edges, 213674 markings/sec, 90 secs
lola: 20834630 markings, 78929274 edges, 156163 markings/sec, 95 secs
lola: 21546266 markings, 83179374 edges, 142327 markings/sec, 100 secs
lola: 22126810 markings, 87344740 edges, 116109 markings/sec, 105 secs
lola: 22850819 markings, 90929085 edges, 144802 markings/sec, 110 secs
lola: 23599325 markings, 94773393 edges, 149701 markings/sec, 115 secs
lola: 24184043 markings, 98959461 edges, 116944 markings/sec, 120 secs
lola: 24671475 markings, 102953982 edges, 97486 markings/sec, 125 secs
lola: 25282018 markings, 106990023 edges, 122109 markings/sec, 130 secs
lola: 26054554 markings, 110976185 edges, 154507 markings/sec, 135 secs
lola: 26742892 markings, 115099804 edges, 137668 markings/sec, 140 secs
lola: 27399189 markings, 119200260 edges, 131259 markings/sec, 145 secs
lola: 28070204 markings, 123295046 edges, 134203 markings/sec, 150 secs
lola: 28734207 markings, 127401775 edges, 132801 markings/sec, 155 secs
lola: 29393833 markings, 131190540 edges, 131925 markings/sec, 160 secs
lola: 30105950 markings, 135128607 edges, 142423 markings/sec, 165 secs
lola: 30652055 markings, 139309930 edges, 109221 markings/sec, 170 secs
lola: 31396013 markings, 142820891 edges, 148792 markings/sec, 175 secs
lola: 31987921 markings, 146634038 edges, 118382 markings/sec, 180 secs
lola: 32716172 markings, 150749990 edges, 145650 markings/sec, 185 secs
lola: 33428305 markings, 154736845 edges, 142427 markings/sec, 190 secs
lola: 34125788 markings, 158845984 edges, 139497 markings/sec, 195 secs
lola: 34815124 markings, 162811342 edges, 137867 markings/sec, 200 secs
lola: 35442128 markings, 166737883 edges, 125401 markings/sec, 205 secs
lola: 36075579 markings, 170589005 edges, 126690 markings/sec, 210 secs
lola: 36712254 markings, 174561601 edges, 127335 markings/sec, 215 secs
lola: 37547403 markings, 178442554 edges, 167030 markings/sec, 220 secs
lola: 38282516 markings, 182482807 edges, 147023 markings/sec, 225 secs
lola: 39040751 markings, 186489960 edges, 151647 markings/sec, 230 secs
lola: 39682717 markings, 190300832 edges, 128393 markings/sec, 235 secs
lola: 40243403 markings, 194170022 edges, 112137 markings/sec, 240 secs
lola: 40698308 markings, 198438853 edges, 90981 markings/sec, 245 secs
lola: 41413617 markings, 202319036 edges, 143062 markings/sec, 250 secs
lola: 42155152 markings, 205724544 edges, 148307 markings/sec, 255 secs
lola: 42910557 markings, 209393286 edges, 151081 markings/sec, 260 secs
lola: 43642263 markings, 213143881 edges, 146341 markings/sec, 265 secs
lola: 44179927 markings, 217280753 edges, 107533 markings/sec, 270 secs
lola: 44722921 markings, 221433334 edges, 108599 markings/sec, 275 secs
lola: 45261552 markings, 225505301 edges, 107726 markings/sec, 280 secs
lola: 45672301 markings, 229613884 edges, 82150 markings/sec, 285 secs
lola: 46230031 markings, 233312810 edges, 111546 markings/sec, 290 secs
lola: 46844601 markings, 237000148 edges, 122914 markings/sec, 295 secs
lola: 47647854 markings, 240576432 edges, 160651 markings/sec, 300 secs
lola: 48317349 markings, 244412904 edges, 133899 markings/sec, 305 secs
lola: 48910160 markings, 248379724 edges, 118562 markings/sec, 310 secs
lola: 49495534 markings, 252092425 edges, 117075 markings/sec, 315 secs
lola: 50012658 markings, 256017614 edges, 103425 markings/sec, 320 secs
lola: 50742155 markings, 260124127 edges, 145899 markings/sec, 325 secs
lola: 51438952 markings, 264038053 edges, 139359 markings/sec, 330 secs
lola: 52116717 markings, 267897591 edges, 135553 markings/sec, 335 secs
lola: 52844381 markings, 271803205 edges, 145533 markings/sec, 340 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 346 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7 <= c8))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7 <= c8)
lola: processed formula length: 85
lola: 1 rewrites
lola: formula mentions 0 of 168 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 395 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X ((c15 <= c5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((c15 <= c5))))
lola: processed formula: A (F (X ((c15 <= c5))))
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 168 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 548 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 461 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (F ((c19 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (F ((c19 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)))))
lola: processed formula: A (F (X (F ((c19 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)))))
lola: processed formula length: 94
lola: 1 rewrites
lola: formula mentions 0 of 168 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 548 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 554 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((aux7_2 + aux7_3 + aux7_6 + aux7_7 <= c7)))
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 544 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 692 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 <= c17)) U F (F ((aux8_2 + aux8_3 + aux8_6 + aux8_7 <= c13)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 <= c17)) U F ((aux8_2 + aux8_3 + aux8_6 + aux8_7 <= c13))))
lola: processed formula: A ((X ((out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 <= c17)) U F ((aux8_2 + aux8_3 + aux8_6 + aux8_7 <= c13))))
lola: processed formula length: 137
lola: 1 rewrites
lola: formula mentions 0 of 168 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 548 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 923 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (((2 <= c110) U (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= c6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((2 <= c110) U (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= c6)))))
lola: processed formula: A (X (X (((2 <= c110) U (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= c6)))))
lola: processed formula length: 113
lola: 0 rewrites
lola: formula mentions 0 of 168 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 548 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 1385 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (X ((3 <= c8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X ((3 <= c8)))))
lola: processed formula: A (F (G (X ((3 <= c8)))))
lola: processed formula length: 25
lola: 1 rewrites
lola: formula mentions 0 of 168 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 548 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 2771 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((in1_0 + in1_1 <= c8) U X (X ((1 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((in1_0 + in1_1 <= c8) U X (X ((1 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7)))))
lola: processed formula: A (((in1_0 + in1_1 <= c8) U X (X ((1 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7)))))
lola: processed formula length: 114
lola: 0 rewrites
lola: formula mentions 0 of 168 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 548 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 1496389086734

--------------------
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-PT-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-PT-05.tgz
mv S_PermAdmissibility-PT-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-PT-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-149441650200419"
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 ;