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

About the Execution of LoLA for PermAdmissibility-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15938.780 1671517.00 1677232.00 347.90 F?F???FT??T?T?TF 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 PermAdmissibility-PT-05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440485000417
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1494657650914


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ 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-CTLCardinality.task
lola: A (F (A (F (((out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= in3_4 + in3_5) AND (c5 <= c8)))))) : NOT(E (X (A (F ((c5 <= c12)))))) : NOT(E ((((c13 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7) OR (1 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)) U (1 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)))) : A (F (A (G (((c18 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7) AND (in4_6 + in4_7 <= c6)))))) : (A ((((3 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7) AND (aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7)) U (c14 + 1 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7))) OR (((3 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7) AND (2 <= aux8_2 + aux8_3 + aux8_6 + aux8_7) AND ((aux6_0 + aux6_1 + aux6_4 + aux6_5 <= c19) OR (1 <= aux7_2 + aux7_3 + aux7_6 + aux7_7)) AND (2 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7)) OR E (F (((c20 <= c18) AND (2 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7)))))) : A ((((2 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7) OR (c12 <= aux6_0 + aux6_1 + aux6_4 + aux6_5)) U A (G ((1 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7))))) : (NOT(A (G (((out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7) OR (2 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7))))) AND (A (G ((c12 + 1 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7))) OR ((((aux8_2 + aux8_3 + aux8_6 + aux8_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5) OR (3 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7)) AND (c15 <= c5)) OR A (X ((2 <= in3_4 + in3_5)))))) : (A (F (A (X ((3 <= c9))))) OR NOT((E (G ((out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7))) OR E (G ((3 <= c12)))))) : A (F ((E (F ((2 <= c19))) OR E (F ((3 <= c11)))))) : ((c15 + 1 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) OR A (G (((c19 <= 0) OR (c5 + 1 <= c9))))) : A (G ((aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7 <= c6))) : E (G ((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= 0))) : A (F ((c7 + 1 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7))) : E (G (A (F ((out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 + 1 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7))))) : (NOT(E (((c16 <= c9) U (3 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7)))) OR (in3_4 + in3_5 <= c17)) : A (X (E (G ((c8 <= 2)))))
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 (F (A (F (((out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= in3_4 + in3_5) AND (c5 <= c8))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= in3_4 + in3_5) AND (c5 <= c8)))
lola: processed formula length: 115
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3108348 markings, 3264855 edges, 2317188319944900608 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (X (A (F ((c5 <= c12))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (c5 <= c12))))
lola: processed formula length: 30
lola: 8 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2355760 markings, 2859634 edges, 3223546815924142080 markings/sec, 0 secs
lola: 4779347 markings, 6035064 edges, 484717 markings/sec, 5 secs
lola: 6908085 markings, 8909448 edges, 425748 markings/sec, 10 secs
lola: 9207076 markings, 11885574 edges, 459798 markings/sec, 15 secs
lola: 11431333 markings, 14895401 edges, 444851 markings/sec, 20 secs
lola: 13863613 markings, 18248609 edges, 486456 markings/sec, 25 secs
lola: 16018860 markings, 21294191 edges, 431049 markings/sec, 30 secs
lola: 18110024 markings, 24163624 edges, 418233 markings/sec, 35 secs
lola: 19968089 markings, 26763734 edges, 371613 markings/sec, 40 secs
lola: 22000235 markings, 29584818 edges, 406429 markings/sec, 45 secs
lola: 24029200 markings, 32384780 edges, 405793 markings/sec, 50 secs
lola: 26004791 markings, 35160566 edges, 395118 markings/sec, 55 secs
lola: 28098864 markings, 38139458 edges, 418815 markings/sec, 60 secs
lola: 30039296 markings, 40875000 edges, 388086 markings/sec, 65 secs
lola: 31911450 markings, 43554424 edges, 374431 markings/sec, 70 secs
lola: 34004967 markings, 46505316 edges, 418703 markings/sec, 75 secs
lola: 35930317 markings, 49251525 edges, 385070 markings/sec, 80 secs
lola: 37789126 markings, 51906985 edges, 371762 markings/sec, 85 secs
lola: 39761852 markings, 54759313 edges, 394545 markings/sec, 90 secs
lola: 41558418 markings, 57388410 edges, 359313 markings/sec, 95 secs
lola: 43365123 markings, 59896881 edges, 361341 markings/sec, 100 secs
lola: 45027734 markings, 62286952 edges, 332522 markings/sec, 105 secs
lola: 46545406 markings, 64587660 edges, 303534 markings/sec, 110 secs
lola: 48050664 markings, 66838988 edges, 301052 markings/sec, 115 secs
lola: 49424455 markings, 68943865 edges, 274758 markings/sec, 120 secs
lola: 51176052 markings, 71466816 edges, 350319 markings/sec, 125 secs
lola: 53070181 markings, 74207670 edges, 378826 markings/sec, 130 secs
lola: 54707420 markings, 76672392 edges, 327448 markings/sec, 135 secs
lola: 56306570 markings, 79054620 edges, 319830 markings/sec, 140 secs
lola: 58006958 markings, 81685615 edges, 340078 markings/sec, 145 secs
lola: 59700618 markings, 84298938 edges, 338732 markings/sec, 150 secs
lola: 61246910 markings, 86684804 edges, 309258 markings/sec, 155 secs
lola: 63255450 markings, 89432638 edges, 401708 markings/sec, 160 secs
lola: 64983259 markings, 91855263 edges, 345562 markings/sec, 165 secs
lola: 66640255 markings, 94222625 edges, 331399 markings/sec, 170 secs
lola: 68757708 markings, 97089227 edges, 423491 markings/sec, 175 secs
lola: 70628669 markings, 99715422 edges, 374192 markings/sec, 180 secs
lola: 72464243 markings, 102359231 edges, 367115 markings/sec, 185 secs
lola: 74930970 markings, 105631884 edges, 493345 markings/sec, 190 secs
lola: 77027617 markings, 108549524 edges, 419329 markings/sec, 195 secs
lola: 78786967 markings, 111062876 edges, 351870 markings/sec, 200 secs
lola: 80615381 markings, 113722369 edges, 365683 markings/sec, 205 secs
lola: 82645584 markings, 116553669 edges, 406041 markings/sec, 210 secs
lola: 84890685 markings, 119570592 edges, 449020 markings/sec, 215 secs
lola: 87924140 markings, 123370408 edges, 606691 markings/sec, 220 secs
lola: 90558779 markings, 126996193 edges, 526928 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E ((((c13 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7) OR (1 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)) U (1 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(((c13 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7) OR (1 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)) U (1 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)))
lola: processed formula length: 256
lola: 7 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2437584 markings, 3120381 edges, 2904570796124930048 markings/sec, 0 secs
lola: 4500281 markings, 5752523 edges, 412539 markings/sec, 5 secs
lola: 6654306 markings, 8587003 edges, 430805 markings/sec, 10 secs
lola: 8588212 markings, 11072008 edges, 386781 markings/sec, 15 secs
lola: 10734289 markings, 13941000 edges, 429215 markings/sec, 20 secs
lola: 12604112 markings, 16472879 edges, 373965 markings/sec, 25 secs
lola: 14605294 markings, 19183886 edges, 400236 markings/sec, 30 secs
lola: 16546890 markings, 21874161 edges, 388319 markings/sec, 35 secs
lola: 18528864 markings, 24634686 edges, 396395 markings/sec, 40 secs
lola: 20595344 markings, 27731700 edges, 413296 markings/sec, 45 secs
lola: 22481711 markings, 30876493 edges, 377273 markings/sec, 50 secs
lola: 24216708 markings, 33642243 edges, 346999 markings/sec, 55 secs
lola: 25709964 markings, 36089616 edges, 298651 markings/sec, 60 secs
lola: 27802207 markings, 38864366 edges, 418449 markings/sec, 65 secs
lola: 29883301 markings, 41576296 edges, 416219 markings/sec, 70 secs
lola: 31935537 markings, 44340210 edges, 410447 markings/sec, 75 secs
lola: 33937322 markings, 47076496 edges, 400357 markings/sec, 80 secs
lola: 35786442 markings, 49702149 edges, 369824 markings/sec, 85 secs
lola: 37628652 markings, 52677533 edges, 368442 markings/sec, 90 secs
lola: 39325166 markings, 55376657 edges, 339303 markings/sec, 95 secs
lola: 41660574 markings, 58606285 edges, 467082 markings/sec, 100 secs
lola: 43978755 markings, 61920689 edges, 463636 markings/sec, 105 secs
lola: 46225192 markings, 65224214 edges, 449287 markings/sec, 110 secs
lola: 48405742 markings, 68356747 edges, 436110 markings/sec, 115 secs
lola: 50593996 markings, 71617572 edges, 437651 markings/sec, 120 secs
lola: 52804010 markings, 74681068 edges, 442003 markings/sec, 125 secs
lola: 54837817 markings, 77611261 edges, 406761 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 243 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((c18 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7) AND (in4_6 + in4_7 <= c6))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U ((out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 + 1 <= c18) OR (c6 + 1 <= in4_6 + in4_7)))))
lola: processed formula length: 139
lola: 3 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1265260 markings, 3507395 edges, 3225400867406479360 markings/sec, 0 secs
lola: 2504259 markings, 6896449 edges, 247800 markings/sec, 5 secs
lola: 3718029 markings, 10238583 edges, 242754 markings/sec, 10 secs
lola: 4923457 markings, 13542572 edges, 241086 markings/sec, 15 secs
lola: 6131157 markings, 16886577 edges, 241540 markings/sec, 20 secs
lola: 7167176 markings, 20450144 edges, 207204 markings/sec, 25 secs
lola: 7986389 markings, 24091982 edges, 163843 markings/sec, 30 secs
lola: 8748517 markings, 27759966 edges, 152426 markings/sec, 35 secs
lola: 9548438 markings, 31464641 edges, 159984 markings/sec, 40 secs
lola: 10348573 markings, 35005244 edges, 160027 markings/sec, 45 secs
lola: 11196351 markings, 38577053 edges, 169556 markings/sec, 50 secs
lola: 12005503 markings, 42236767 edges, 161830 markings/sec, 55 secs
lola: 12907863 markings, 45858006 edges, 180472 markings/sec, 60 secs
lola: 13664246 markings, 49648230 edges, 151277 markings/sec, 65 secs
lola: 14542222 markings, 52864454 edges, 175595 markings/sec, 70 secs
lola: 15193355 markings, 56742426 edges, 130227 markings/sec, 75 secs
lola: 15982467 markings, 60104281 edges, 157822 markings/sec, 80 secs
lola: 16695110 markings, 63703945 edges, 142529 markings/sec, 85 secs
lola: 17548791 markings, 67252981 edges, 170736 markings/sec, 90 secs
lola: 18388730 markings, 71001882 edges, 167988 markings/sec, 95 secs
lola: 19163100 markings, 74688656 edges, 154874 markings/sec, 100 secs
lola: 19938132 markings, 78244260 edges, 155006 markings/sec, 105 secs
lola: 20722951 markings, 81866240 edges, 156964 markings/sec, 110 secs
lola: 21494790 markings, 85412511 edges, 154368 markings/sec, 115 secs
lola: 22200920 markings, 88921744 edges, 141226 markings/sec, 120 secs
lola: 23022058 markings, 92374255 edges, 164228 markings/sec, 125 secs
lola: 23815691 markings, 96245221 edges, 158727 markings/sec, 130 secs
lola: 24693158 markings, 99611186 edges, 175493 markings/sec, 135 secs
lola: 25371685 markings, 103526745 edges, 135705 markings/sec, 140 secs
lola: 26135005 markings, 107000414 edges, 152664 markings/sec, 145 secs
lola: 26847172 markings, 110630950 edges, 142433 markings/sec, 150 secs
lola: 27676875 markings, 114160782 edges, 165941 markings/sec, 155 secs
lola: 28428613 markings, 117791013 edges, 150348 markings/sec, 160 secs
lola: 29221675 markings, 121411166 edges, 158612 markings/sec, 165 secs
lola: 30047606 markings, 125226066 edges, 165186 markings/sec, 170 secs
lola: 30856808 markings, 128863160 edges, 161840 markings/sec, 175 secs
lola: 31618747 markings, 132313658 edges, 152388 markings/sec, 180 secs
lola: 32443660 markings, 135831496 edges, 164983 markings/sec, 185 secs
lola: 33255159 markings, 139504273 edges, 162300 markings/sec, 190 secs
lola: 34243277 markings, 142823156 edges, 197624 markings/sec, 195 secs
lola: 35319754 markings, 145781850 edges, 215295 markings/sec, 200 secs
lola: 36397707 markings, 148728053 edges, 215591 markings/sec, 205 secs
lola: 37421465 markings, 151679830 edges, 204752 markings/sec, 210 secs
lola: 38498122 markings, 154699003 edges, 215331 markings/sec, 215 secs
lola: 39464152 markings, 157770236 edges, 193206 markings/sec, 220 secs
lola: 40162222 markings, 161329768 edges, 139614 markings/sec, 225 secs
lola: 40895992 markings, 164566232 edges, 146754 markings/sec, 230 secs
lola: 41484747 markings, 168105416 edges, 117751 markings/sec, 235 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 243 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((((3 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7) AND (aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7)) U (c14 + 1 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7))) OR (((3 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 243 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7) AND (aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7)) U (c14 + 1 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((3 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7) AND (aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7)) U (c14 + 1 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7))
lola: processed formula length: 331
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 5 will run for 265 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7) AND (2 <= aux8_2 + aux8_3 + aux8_6 + aux8_7) AND ((aux6_0 + aux6_1 + aux6_4 + aux6_5 <= c19) OR (1 <= aux7_2 + aux7_3 + aux7_6 + aux7_7)) AND (2 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7) AND (2 <= aux8_2 + aux8_3 + aux8_6 + aux8_7) AND ((aux6_0 + aux6_1 + aux6_4 + aux6_5 <= c19) OR (1 <= aux7_2 + aux7_3 + aux7_6 + aux7_7)) AND (2 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7))
lola: processed formula length: 306
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
lola: processed formula with 5 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 6 will run for 291 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((c20 <= c18) AND (2 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 265 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7) OR (c12 <= aux6_0 + aux6_1 + aux6_4 + aux6_5)) U A (G ((1 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((2 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7) OR (c12 <= aux6_0 + aux6_1 + aux6_4 + aux6_5)) U NOT(E(TRUE U (out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 <= 0))))
lola: processed formula length: 222
lola: 3 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1286762 markings, 3561961 edges, 2933393943691264000 markings/sec, 0 secs
lola: 2543664 markings, 6997573 edges, 251380 markings/sec, 5 secs
lola: 3773244 markings, 10388030 edges, 245916 markings/sec, 10 secs
lola: 4986514 markings, 13736035 edges, 242654 markings/sec, 15 secs
lola: 6206564 markings, 17101055 edges, 244010 markings/sec, 20 secs
lola: 7219569 markings, 20711316 edges, 202601 markings/sec, 25 secs
lola: 8056112 markings, 24428523 edges, 167309 markings/sec, 30 secs
lola: 8839995 markings, 28159593 edges, 156777 markings/sec, 35 secs
lola: 9662962 markings, 31850401 edges, 164593 markings/sec, 40 secs
lola: 10477332 markings, 35438917 edges, 162874 markings/sec, 45 secs
lola: 11345723 markings, 39189297 edges, 173678 markings/sec, 50 secs
lola: 12155275 markings, 42910698 edges, 161910 markings/sec, 55 secs
lola: 13093268 markings, 46538279 edges, 187599 markings/sec, 60 secs
lola: 13851534 markings, 50369862 edges, 151653 markings/sec, 65 secs
lola: 14698066 markings, 53705680 edges, 169306 markings/sec, 70 secs
lola: 15315827 markings, 57671939 edges, 123552 markings/sec, 75 secs
lola: 16156578 markings, 61013952 edges, 168150 markings/sec, 80 secs
lola: 16921630 markings, 64629478 edges, 153010 markings/sec, 85 secs
lola: 17797606 markings, 68157808 edges, 175195 markings/sec, 90 secs
lola: 18644141 markings, 71877547 edges, 169307 markings/sec, 95 secs
lola: 19369992 markings, 75688832 edges, 145170 markings/sec, 100 secs
lola: 20175085 markings, 79312001 edges, 161019 markings/sec, 105 secs
lola: 20962003 markings, 82900822 edges, 157384 markings/sec, 110 secs
lola: 21738602 markings, 86523775 edges, 155320 markings/sec, 115 secs
lola: 22448521 markings, 89951625 edges, 141984 markings/sec, 120 secs
lola: 23305389 markings, 93560434 edges, 171374 markings/sec, 125 secs
lola: 24076263 markings, 97441730 edges, 154175 markings/sec, 130 secs
lola: 24930682 markings, 100865992 edges, 170884 markings/sec, 135 secs
lola: 25543367 markings, 104835574 edges, 122537 markings/sec, 140 secs
lola: 26384707 markings, 108225735 edges, 168268 markings/sec, 145 secs
lola: 27147784 markings, 111748196 edges, 152615 markings/sec, 150 secs
lola: 27928552 markings, 115377910 edges, 156154 markings/sec, 155 secs
lola: 28678581 markings, 118946475 edges, 150006 markings/sec, 160 secs
lola: 29466324 markings, 122563199 edges, 157549 markings/sec, 165 secs
lola: 30278500 markings, 126256150 edges, 162435 markings/sec, 170 secs
lola: 31082191 markings, 129807756 edges, 160738 markings/sec, 175 secs
lola: 31843709 markings, 133190723 edges, 152304 markings/sec, 180 secs
lola: 32662803 markings, 136703828 edges, 163819 markings/sec, 185 secs
lola: 33423141 markings, 140373154 edges, 152068 markings/sec, 190 secs
lola: 34478708 markings, 143497680 edges, 211113 markings/sec, 195 secs
lola: 35558083 markings, 146411797 edges, 215875 markings/sec, 200 secs
lola: 36615209 markings, 149355716 edges, 211425 markings/sec, 205 secs
lola: 37644224 markings, 152321647 edges, 205803 markings/sec, 210 secs
lola: 38730211 markings, 155369412 edges, 217197 markings/sec, 215 secs
lola: 39643674 markings, 158551869 edges, 182693 markings/sec, 220 secs
lola: 40343440 markings, 162111773 edges, 139953 markings/sec, 225 secs
lola: 41057721 markings, 165483035 edges, 142856 markings/sec, 230 secs
lola: 41687752 markings, 168914855 edges, 126006 markings/sec, 235 secs
lola: 42346247 markings, 172240173 edges, 131699 markings/sec, 240 secs
lola: 43044104 markings, 175539872 edges, 139571 markings/sec, 245 secs
lola: 43726409 markings, 178852910 edges, 136461 markings/sec, 250 secs
lola: 44446383 markings, 182309808 edges, 143995 markings/sec, 255 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 265 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (G (((out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7) OR (2 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7))))) AND (A (G ((c12 + 1 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7))) OR ((((aux8_2 + aux8_3 + aux8_6 + aux8_7 <= aux5_0 + a... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 265 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7 + 1 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) AND (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((c12 + 1 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((aux8_2 + aux8_3 + aux8_6 + aux8_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5) OR (3 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7)) AND (c15 <= c5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((aux8_2 + aux8_3 + aux8_6 + aux8_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5) OR (3 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7)) AND (c15 <= c5))
lola: processed formula length: 181
lola: 3 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
lola: processed formula with 3 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 7 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (X ((3 <= c9))))) OR NOT((E (G ((out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7))) OR E (G ((3 <= c12))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: lola: subprocess 7 will run for 294 seconds at most (--localtimelimit=-1)========================================

lola: ========================================
lola: ...considering subproblem: A (F (A (X ((3 <= c9)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((3 <= c9)))
lola: processed formula length: 23
lola: 9 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1039189 markings, 2911435 edges, 3689348319961677824 markings/sec, 0 secs
lola: 2058214 markings, 5657580 edges, 203805 markings/sec, 5 secs
lola: 3020779 markings, 8282947 edges, 192513 markings/sec, 10 secs
lola: 3951001 markings, 10895678 edges, 186044 markings/sec, 15 secs
lola: 4910579 markings, 13506413 edges, 191916 markings/sec, 20 secs
lola: 5847796 markings, 16123471 edges, 187443 markings/sec, 25 secs
lola: 6794496 markings, 18796253 edges, 189340 markings/sec, 30 secs
lola: 7480088 markings, 21979447 edges, 137118 markings/sec, 35 secs
lola: 8160379 markings, 25019097 edges, 136058 markings/sec, 40 secs
lola: 8803904 markings, 28004570 edges, 128705 markings/sec, 45 secs
lola: 9475374 markings, 31106693 edges, 134294 markings/sec, 50 secs
lola: 10157173 markings, 34083187 edges, 136360 markings/sec, 55 secs
lola: 10821802 markings, 36987431 edges, 132926 markings/sec, 60 secs
lola: 11524050 markings, 40058224 edges, 140450 markings/sec, 65 secs
lola: 12189551 markings, 43069646 edges, 133100 markings/sec, 70 secs
lola: 12956999 markings, 46028146 edges, 153490 markings/sec, 75 secs
lola: 13575199 markings, 49285361 edges, 123640 markings/sec, 80 secs
lola: 14298157 markings, 51932288 edges, 144592 markings/sec, 85 secs
lola: 14930780 markings, 55062934 edges, 126525 markings/sec, 90 secs
lola: 15481112 markings, 58268155 edges, 110066 markings/sec, 95 secs
lola: 16157162 markings, 61016127 edges, 135210 markings/sec, 100 secs
lola: 16785954 markings, 64019331 edges, 125758 markings/sec, 105 secs
lola: 17484751 markings, 67025231 edges, 139759 markings/sec, 110 secs
lola: 18204661 markings, 70113602 edges, 143982 markings/sec, 115 secs
lola: 18897316 markings, 73142807 edges, 138531 markings/sec, 120 secs
lola: 19522260 markings, 76245210 edges, 124989 markings/sec, 125 secs
lola: 20177728 markings, 79328182 edges, 131094 markings/sec, 130 secs
lola: 20843959 markings, 82320693 edges, 133246 markings/sec, 135 secs
lola: 21496064 markings, 85421156 edges, 130421 markings/sec, 140 secs
lola: 22108235 markings, 88389179 edges, 122434 markings/sec, 145 secs
lola: 22751418 markings, 91321896 edges, 128637 markings/sec, 150 secs
lola: 23512529 markings, 94457116 edges, 152222 markings/sec, 155 secs
lola: 24141660 markings, 97714485 edges, 125826 markings/sec, 160 secs
lola: 24886932 markings, 100547897 edges, 149054 markings/sec, 165 secs
lola: 25436919 markings, 104016143 edges, 109997 markings/sec, 170 secs
lola: 26085299 markings, 106822484 edges, 129676 markings/sec, 175 secs
lola: 26704332 markings, 109834214 edges, 123807 markings/sec, 180 secs
lola: 27380568 markings, 112795234 edges, 135247 markings/sec, 185 secs
lola: 28013308 markings, 115810473 edges, 126548 markings/sec, 190 secs
lola: 28638524 markings, 118734971 edges, 125043 markings/sec, 195 secs
lola: 29298890 markings, 121759729 edges, 132073 markings/sec, 200 secs
lola: 29975503 markings, 124903625 edges, 135323 markings/sec, 205 secs
lola: 30654484 markings, 127903661 edges, 135796 markings/sec, 210 secs
lola: 31307553 markings, 130855224 edges, 130614 markings/sec, 215 secs
lola: 31954233 markings, 133668520 edges, 129336 markings/sec, 220 secs
lola: 32620867 markings, 136555350 edges, 133327 markings/sec, 225 secs
lola: 33262653 markings, 139542710 edges, 128357 markings/sec, 230 secs
lola: 34044868 markings, 142308996 edges, 156443 markings/sec, 235 secs
lola: 34925158 markings, 144694212 edges, 176058 markings/sec, 240 secs
lola: 35804227 markings, 147095011 edges, 175814 markings/sec, 245 secs
lola: 36660824 markings, 149493176 edges, 171319 markings/sec, 250 secs
lola: 37503577 markings, 151935207 edges, 168551 markings/sec, 255 secs
lola: 38387118 markings, 154404175 edges, 176708 markings/sec, 260 secs
lola: 39230923 markings, 156805356 edges, 168761 markings/sec, 265 secs
lola: 39886533 markings, 159791617 edges, 131122 markings/sec, 270 secs
lola: 40470385 markings, 162544871 edges, 116770 markings/sec, 275 secs
lola: 41037895 markings, 165391738 edges, 113502 markings/sec, 280 secs
lola: 41533172 markings, 168324517 edges, 99055 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((E (F ((2 <= c19))) OR E (F ((3 <= c11))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (E(TRUE U (2 <= c19)) OR E(TRUE U (3 <= c11))))
lola: processed formula length: 56
lola: 3 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 336 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((c15 + 1 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) OR A (G (((c19 <= 0) OR (c5 + 1 <= c9)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 336 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (c15 + 1 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (c15 + 1 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7)
lola: processed formula length: 90
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((c19 <= 0) OR (c5 + 1 <= c9))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7 <= c6)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to PermAdmissibility-COL-05-CTLCardinality-10.sara
lola: The predicate is not invariant.
lola: subprocess 11 will run for 471 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= 0)))
lola: ========================================
lola: SUBTASK
lola: state equation: calling and running saralola:
checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7)))
lola: processed formula length: 91
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: try reading problem file PermAdmissibility-COL-05-CTLCardinality-10.sara.
sara: place or transition ordering is non-deterministic

lola: 2609898 markings, 2726593 edges, 3225752436249460736 markings/sec, 0 secs
lola: 5016744 markings, 5246615 edges, 481369 markings/sec, 5 secs
lola: 7475792 markings, 7829750 edges, 491810 markings/sec, 10 secs
lola: 9939990 markings, 10479028 edges, 492840 markings/sec, 15 secs
lola: 12400753 markings, 13195473 edges, 492153 markings/sec, 20 secs
lola: 14816690 markings, 15877109 edges, 483187 markings/sec, 25 secs
lola: 17169772 markings, 18471224 edges, 470616 markings/sec, 30 secs
lola: 19496543 markings, 21024719 edges, 465354 markings/sec, 35 secs
lola: 21798121 markings, 23562974 edges, 460316 markings/sec, 40 secs
lola: 24162781 markings, 26093251 edges, 472932 markings/sec, 45 secs
lola: 26468340 markings, 28716816 edges, 461112 markings/sec, 50 secs
lola: 28688926 markings, 31213997 edges, 444117 markings/sec, 55 secs
lola: 30929617 markings, 33691844 edges, 448138 markings/sec, 60 secs
lola: 33237455 markings, 36209694 edges, 461568 markings/sec, 65 secs
lola: 35472589 markings, 38725002 edges, 447027 markings/sec, 70 secs
lola: 37677617 markings, 41150993 edges, 441006 markings/sec, 75 secs
lola: 39934926 markings, 43648968 edges, 451462 markings/sec, 80 secs
lola: 42169268 markings, 46176903 edges, 446868 markings/sec, 85 secs
lola: 44358865 markings, 48616513 edges, 437919 markings/sec, 90 secs
lola: 46541871 markings, 51047889 edges, 436601 markings/sec, 95 secs
lola: 48724273 markings, 53509407 edges, 436480 markings/sec, 100 secs
lola: 51032531 markings, 56102894 edges, 461652 markings/sec, 105 secs
lola: 53538705 markings, 58719865 edges, 501235 markings/sec, 110 secs
lola: 55968727 markings, 61263415 edges, 486004 markings/sec, 115 secs
lola: 58346728 markings, 63770056 edges, 475600 markings/sec, 120 secs
lola: 60753318 markings, 66382303 edges, 481318 markings/sec, 125 secs
lola: 63136092 markings, 69079857 edges, 476555 markings/sec, 130 secs
lola: 65463545 markings, 71635625 edges, 465491 markings/sec, 135 secs
lola: 67773476 markings, 74257159 edges, 461986 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 552 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((c7 + 1 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (c7 + 1 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7))
lola: processed formula length: 91
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2572651 markings, 2688425 edges, 3067840576268271616 markings/sec, 0 secs
lola: 5067632 markings, 5300192 edges, 498996 markings/sec, 5 secs
lola: 7526741 markings, 7884466 edges, 491822 markings/sec, 10 secs
lola: 9997578 markings, 10544234 edges, 494167 markings/sec, 15 secs
lola: 12454903 markings, 13252926 edges, 491465 markings/sec, 20 secs
lola: 14884832 markings, 15952343 edges, 485986 markings/sec, 25 secs
lola: 17255095 markings, 18564077 edges, 474053 markings/sec, 30 secs
lola: 19585644 markings, 21126052 edges, 466110 markings/sec, 35 secs
lola: 21914319 markings, 23686193 edges, 465735 markings/sec, 40 secs
lola: 24277498 markings, 26229204 edges, 472636 markings/sec, 45 secs
lola: 26586086 markings, 28850308 edges, 461718 markings/sec, 50 secs
lola: 28783258 markings, 31321735 edges, 439434 markings/sec, 55 secs
lola: 31035996 markings, 33805069 edges, 450548 markings/sec, 60 secs
lola: 33353767 markings, 36334970 edges, 463554 markings/sec, 65 secs
lola: 35599171 markings, 38868595 edges, 449081 markings/sec, 70 secs
lola: 37818190 markings, 41305490 edges, 443804 markings/sec, 75 secs
lola: 40085537 markings, 43818519 edges, 453469 markings/sec, 80 secs
lola: 42332951 markings, 46349558 edges, 449483 markings/sec, 85 secs
lola: 44533736 markings, 48814560 edges, 440157 markings/sec, 90 secs
lola: 46648925 markings, 51170203 edges, 423038 markings/sec, 95 secs
lola: 48827643 markings, 53628353 edges, 435744 markings/sec, 100 secs
lola: 51056057 markings, 56127251 edges, 445683 markings/sec, 105 secs
lola: 53559126 markings, 58741310 edges, 500614 markings/sec, 110 secs
lola: 55984846 markings, 61280432 edges, 485144 markings/sec, 115 secs
lola: 58366883 markings, 63791397 edges, 476407 markings/sec, 120 secs
lola: 60774719 markings, 66407109 edges, 481567 markings/sec, 125 secs
lola: 63145295 markings, 69089549 edges, 474115 markings/sec, 130 secs
lola: 65471743 markings, 71644527 edges, 465290 markings/sec, 135 secs
lola: 67757387 markings, 74239196 edges, 457129 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 687 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 + 1 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 + 1 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7)))))
lola: processed formula length: 178
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2108919 markings, 2354842 edges, 3225752436249460736 markings/sec, 0 secs
lola: 4034187 markings, 4598983 edges, 385054 markings/sec, 5 secs
lola: 5954659 markings, 6775952 edges, 384094 markings/sec, 10 secs
lola: 7869734 markings, 9020483 edges, 383015 markings/sec, 15 secs
lola: 9730248 markings, 11192161 edges, 372103 markings/sec, 20 secs
lola: 11515186 markings, 13270542 edges, 356988 markings/sec, 25 secs
lola: 13226606 markings, 15282469 edges, 342284 markings/sec, 30 secs
lola: 14954658 markings, 17227523 edges, 345610 markings/sec, 35 secs
lola: 16657990 markings, 19265042 edges, 340666 markings/sec, 40 secs
lola: 18358009 markings, 21302293 edges, 340004 markings/sec, 45 secs
lola: 20245533 markings, 23529189 edges, 377505 markings/sec, 50 secs
lola: 22021759 markings, 25646348 edges, 355245 markings/sec, 55 secs
lola: 23754228 markings, 27681677 edges, 346494 markings/sec, 60 secs
lola: 25477342 markings, 29713166 edges, 344623 markings/sec, 65 secs
lola: 27124541 markings, 31721059 edges, 329440 markings/sec, 70 secs
lola: 28752673 markings, 33750869 edges, 325626 markings/sec, 75 secs
lola: 30458157 markings, 35912472 edges, 341097 markings/sec, 80 secs
lola: 32190916 markings, 38092049 edges, 346552 markings/sec, 85 secs
lola: 33961724 markings, 40168638 edges, 354162 markings/sec, 90 secs
lola: 35697816 markings, 42259684 edges, 347218 markings/sec, 95 secs
lola: 37400519 markings, 44276894 edges, 340541 markings/sec, 100 secs
lola: 39081623 markings, 46239049 edges, 336221 markings/sec, 105 secs
lola: 40708271 markings, 48195046 edges, 325330 markings/sec, 110 secs
lola: 42294102 markings, 50128147 edges, 317166 markings/sec, 115 secs
lola: 43927066 markings, 52124366 edges, 326593 markings/sec, 120 secs
lola: 45515545 markings, 54043663 edges, 317696 markings/sec, 125 secs
lola: 47133819 markings, 56033853 edges, 323655 markings/sec, 130 secs
lola: 48721003 markings, 58066610 edges, 317437 markings/sec, 135 secs
lola: 50273096 markings, 60037441 edges, 310419 markings/sec, 140 secs
lola: 51914601 markings, 61971938 edges, 328301 markings/sec, 145 secs
lola: 53525882 markings, 63898511 edges, 322256 markings/sec, 150 secs
lola: 55081568 markings, 65737525 edges, 311137 markings/sec, 155 secs
lola: 56593450 markings, 67566522 edges, 302376 markings/sec, 160 secs
lola: 58162961 markings, 69488489 edges, 313902 markings/sec, 165 secs
lola: 59705912 markings, 71371912 edges, 308590 markings/sec, 170 secs
lola: 61229530 markings, 73380712 edges, 304724 markings/sec, 175 secs
lola: 62950146 markings, 75360308 edges, 344123 markings/sec, 180 secs
lola: 64623246 markings, 77278546 edges, 334620 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 934 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (((c16 <= c9) U (3 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7)))) OR (in3_4 + in3_5 <= c17))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 934 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((c9 + 1 <= c16) R (out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E((c16 <= c9) U (3 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7)))
lola: processed formula length: 98
lola: 7 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 1868 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (in3_4 + in3_5 <= c17)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (in3_4 + in3_5 <= c17)
lola: processed formula length: 22
lola: 4 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 1868 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((c8 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (3 <= c8))))
lola: processed formula length: 28
lola: 3 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: RESULT
lola:
SUMMARY: no unknown unknown unknown yes unknown yes unknown yes no no unknown unknown unknown no yes
lola: ========================================
FORMULA PermAdmissibility-COL-05-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494659322431

--------------------
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-PT-05"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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