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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441650200417
=====================================================================

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


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 CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ 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-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: 2660476 markings, 2741923 edges, 3225752436249460736 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: 2302563 markings, 2794613 edges, 2317244669915824128 markings/sec, 0 secs
lola: 4586796 markings, 5769759 edges, 456847 markings/sec, 5 secs
lola: 6830201 markings, 8798166 edges, 448681 markings/sec, 10 secs
lola: 9136852 markings, 11798854 edges, 461330 markings/sec, 15 secs
lola: 11457004 markings, 14930383 edges, 464030 markings/sec, 20 secs
lola: 13895192 markings, 18292545 edges, 487638 markings/sec, 25 secs
lola: 16001425 markings, 21267238 edges, 421247 markings/sec, 30 secs
lola: 18073101 markings, 24107343 edges, 414335 markings/sec, 35 secs
lola: 20067567 markings, 26894953 edges, 398893 markings/sec, 40 secs
lola: 21977923 markings, 29553494 edges, 382071 markings/sec, 45 secs
lola: 23989142 markings, 32331845 edges, 402244 markings/sec, 50 secs
lola: 26054715 markings, 35224078 edges, 413115 markings/sec, 55 secs
lola: 28104520 markings, 38146968 edges, 409961 markings/sec, 60 secs
lola: 30045434 markings, 40883842 edges, 388183 markings/sec, 65 secs
lola: 31853460 markings, 43475570 edges, 361605 markings/sec, 70 secs
lola: 33918288 markings, 46391680 edges, 412966 markings/sec, 75 secs
lola: 35849165 markings, 49147490 edges, 386175 markings/sec, 80 secs
lola: 37705101 markings, 51788363 edges, 371187 markings/sec, 85 secs
lola: 39658170 markings, 54594781 edges, 390614 markings/sec, 90 secs
lola: 41457433 markings, 57241577 edges, 359853 markings/sec, 95 secs
lola: 43362109 markings, 59891714 edges, 380935 markings/sec, 100 secs
lola: 45212917 markings, 62558703 edges, 370162 markings/sec, 105 secs
lola: 46867283 markings, 65070413 edges, 330873 markings/sec, 110 secs
lola: 48527017 markings, 67550030 edges, 331947 markings/sec, 115 secs
lola: 50132953 markings, 70036307 edges, 321187 markings/sec, 120 secs
lola: 52039008 markings, 72719476 edges, 381211 markings/sec, 125 secs
lola: 53925752 markings, 75472265 edges, 377349 markings/sec, 130 secs
lola: 55633212 markings, 78038320 edges, 341492 markings/sec, 135 secs
lola: 57344275 markings, 80652491 edges, 342213 markings/sec, 140 secs
lola: 59025340 markings, 83212840 edges, 336213 markings/sec, 145 secs
lola: 60561234 markings, 85741362 edges, 307179 markings/sec, 150 secs
lola: 62758214 markings, 88728379 edges, 439396 markings/sec, 155 secs
lola: 64723868 markings, 91479478 edges, 393131 markings/sec, 160 secs
lola: 66553649 markings, 94115924 edges, 365956 markings/sec, 165 secs
lola: 68691668 markings, 96998005 edges, 427604 markings/sec, 170 secs
lola: 70499000 markings, 99529667 edges, 361466 markings/sec, 175 secs
lola: 72315262 markings, 102152365 edges, 363252 markings/sec, 180 secs
lola: 74689194 markings, 105307999 edges, 474786 markings/sec, 185 secs
lola: 76781290 markings, 108196653 edges, 418419 markings/sec, 190 secs
lola: 78561068 markings, 110727638 edges, 355956 markings/sec, 195 secs
lola: 80396221 markings, 113392682 edges, 367031 markings/sec, 200 secs
lola: 82304903 markings, 116097322 edges, 381736 markings/sec, 205 secs
lola: 84273433 markings, 118784607 edges, 393706 markings/sec, 210 secs
lola: 87312231 markings, 122612871 edges, 607760 markings/sec, 215 secs
lola: 89795809 markings, 126037040 edges, 496716 markings/sec, 220 secs
lola: 92318690 markings, 129409110 edges, 504576 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: 2435604 markings, 3118167 edges, 2904570796124930048 markings/sec, 0 secs
lola: 4551189 markings, 5819266 edges, 423117 markings/sec, 5 secs
lola: 6833849 markings, 8815217 edges, 456532 markings/sec, 10 secs
lola: 8864115 markings, 11435810 edges, 406053 markings/sec, 15 secs
lola: 11089858 markings, 14420421 edges, 445149 markings/sec, 20 secs
lola: 13206846 markings, 17290162 edges, 423398 markings/sec, 25 secs
lola: 15269494 markings, 20110290 edges, 412530 markings/sec, 30 secs
lola: 17322272 markings, 22969953 edges, 410556 markings/sec, 35 secs
lola: 19426580 markings, 25946597 edges, 420862 markings/sec, 40 secs
lola: 21460375 markings, 29210060 edges, 406759 markings/sec, 45 secs
lola: 23264186 markings, 32083243 edges, 360762 markings/sec, 50 secs
lola: 24962901 markings, 34841093 edges, 339743 markings/sec, 55 secs
lola: 26892636 markings, 37699677 edges, 385947 markings/sec, 60 secs
lola: 29057815 markings, 40511770 edges, 433036 markings/sec, 65 secs
lola: 31163775 markings, 43290136 edges, 421192 markings/sec, 70 secs
lola: 33081333 markings, 45890669 edges, 383512 markings/sec, 75 secs
lola: 35160267 markings, 48786527 edges, 415787 markings/sec, 80 secs
lola: 37185656 markings, 51995751 edges, 405078 markings/sec, 85 secs
lola: 38885365 markings, 54730191 edges, 339942 markings/sec, 90 secs
lola: 41150448 markings, 57863390 edges, 453017 markings/sec, 95 secs
lola: 43435500 markings, 61181667 edges, 457010 markings/sec, 100 secs
lola: 45729604 markings, 64451530 edges, 458821 markings/sec, 105 secs
lola: 47870340 markings, 67525331 edges, 428147 markings/sec, 110 secs
lola: 50019988 markings, 70726136 edges, 429930 markings/sec, 115 secs
lola: 52240607 markings, 73919559 edges, 444124 markings/sec, 120 secs
lola: 54309701 markings, 76810242 edges, 413819 markings/sec, 125 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: 1252569 markings, 3474995 edges, 2976403265157070848 markings/sec, 0 secs
lola: 2439493 markings, 6724432 edges, 237385 markings/sec, 5 secs
lola: 3609614 markings, 9926931 edges, 234024 markings/sec, 10 secs
lola: 4760863 markings, 13101537 edges, 230250 markings/sec, 15 secs
lola: 5911613 markings, 16293658 edges, 230150 markings/sec, 20 secs
lola: 6966400 markings, 19524341 edges, 210957 markings/sec, 25 secs
lola: 7754151 markings, 22916010 edges, 157550 markings/sec, 30 secs
lola: 8409484 markings, 26380923 edges, 131067 markings/sec, 35 secs
lola: 9177015 markings, 29657731 edges, 153506 markings/sec, 40 secs
lola: 9915563 markings, 33052330 edges, 147710 markings/sec, 45 secs
lola: 10645786 markings, 36240635 edges, 146045 markings/sec, 50 secs
lola: 11438180 markings, 39695590 edges, 158479 markings/sec, 55 secs
lola: 12171062 markings, 42990276 edges, 146576 markings/sec, 60 secs
lola: 13039645 markings, 46329269 edges, 173717 markings/sec, 65 secs
lola: 13739084 markings, 49859069 edges, 139888 markings/sec, 70 secs
lola: 14539049 markings, 52850066 edges, 159993 markings/sec, 75 secs
lola: 15158791 markings, 56498797 edges, 123948 markings/sec, 80 secs
lola: 15846367 markings, 59609809 edges, 137515 markings/sec, 85 secs
lola: 16520122 markings, 62760246 edges, 134751 markings/sec, 90 secs
lola: 17263378 markings, 66127006 edges, 148651 markings/sec, 95 secs
lola: 18095396 markings, 69518872 edges, 166404 markings/sec, 100 secs
lola: 18869965 markings, 73006965 edges, 154914 markings/sec, 105 secs
lola: 19598955 markings, 76618783 edges, 145798 markings/sec, 110 secs
lola: 20317558 markings, 79940036 edges, 143721 markings/sec, 115 secs
lola: 21088363 markings, 83379680 edges, 154161 markings/sec, 120 secs
lola: 21801839 markings, 86945911 edges, 142695 markings/sec, 125 secs
lola: 22516340 markings, 90312415 edges, 142900 markings/sec, 130 secs
lola: 23390655 markings, 93873751 edges, 174863 markings/sec, 135 secs
lola: 24133185 markings, 97672740 edges, 148506 markings/sec, 140 secs
lola: 24959581 markings, 101065219 edges, 165279 markings/sec, 145 secs
lola: 25581518 markings, 104932445 edges, 124387 markings/sec, 150 secs
lola: 26402712 markings, 108304442 edges, 164239 markings/sec, 155 secs
lola: 27152283 markings, 111761426 edges, 149914 markings/sec, 160 secs
lola: 27914528 markings, 115322741 edges, 152449 markings/sec, 165 secs
lola: 28651392 markings, 118803551 edges, 147373 markings/sec, 170 secs
lola: 29429943 markings, 122397658 edges, 155710 markings/sec, 175 secs
lola: 30236597 markings, 126090604 edges, 161331 markings/sec, 180 secs
lola: 31042136 markings, 129602400 edges, 161108 markings/sec, 185 secs
lola: 31784658 markings, 132979593 edges, 148504 markings/sec, 190 secs
lola: 32594331 markings, 136453056 edges, 161935 markings/sec, 195 secs
lola: 33365806 markings, 140076136 edges, 154295 markings/sec, 200 secs
lola: 34336164 markings, 143092737 edges, 194072 markings/sec, 205 secs
lola: 35355069 markings, 145876312 edges, 203781 markings/sec, 210 secs
lola: 36375381 markings, 148661770 edges, 204062 markings/sec, 215 secs
lola: 37322537 markings, 151421495 edges, 189431 markings/sec, 220 secs
lola: 38330474 markings, 154253497 edges, 201587 markings/sec, 225 secs
lola: 39298818 markings, 157011939 edges, 193669 markings/sec, 230 secs
lola: 39995460 markings, 160451550 edges, 139328 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 292 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
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: 1293836 markings, 3581036 edges, 2933393943691264000 markings/sec, 0 secs
lola: 2534082 markings, 6973525 edges, 248049 markings/sec, 5 secs
lola: 3750434 markings, 10329634 edges, 243270 markings/sec, 10 secs
lola: 4962235 markings, 13653682 edges, 242360 markings/sec, 15 secs
lola: 6176934 markings, 17026172 edges, 242940 markings/sec, 20 secs
lola: 7202629 markings, 20612512 edges, 205139 markings/sec, 25 secs
lola: 8029573 markings, 24307172 edges, 165389 markings/sec, 30 secs
lola: 8804074 markings, 28006130 edges, 154900 markings/sec, 35 secs
lola: 9616865 markings, 31700363 edges, 162558 markings/sec, 40 secs
lola: 10418429 markings, 35225253 edges, 160313 markings/sec, 45 secs
lola: 11275856 markings, 38853225 edges, 171485 markings/sec, 50 secs
lola: 12078405 markings, 42528969 edges, 160510 markings/sec, 55 secs
lola: 12989518 markings, 46152011 edges, 182223 markings/sec, 60 secs
lola: 13745953 markings, 49893554 edges, 151287 markings/sec, 65 secs
lola: 14601092 markings, 53137731 edges, 171028 markings/sec, 70 secs
lola: 15226202 markings, 57019053 edges, 125022 markings/sec, 75 secs
lola: 16008158 markings, 60224798 edges, 156391 markings/sec, 80 secs
lola: 16694073 markings, 63698684 edges, 137183 markings/sec, 85 secs
lola: 17516209 markings, 67134673 edges, 164427 markings/sec, 90 secs
lola: 18344609 markings, 70809926 edges, 165680 markings/sec, 95 secs
lola: 19130272 markings, 74474705 edges, 157133 markings/sec, 100 secs
lola: 19888036 markings, 78004954 edges, 151553 markings/sec, 105 secs
lola: 20657663 markings, 81534110 edges, 153925 markings/sec, 110 secs
lola: 21431354 markings, 85106709 edges, 154738 markings/sec, 115 secs
lola: 22138149 markings, 88591949 edges, 141359 markings/sec, 120 secs
lola: 22934946 markings, 91988999 edges, 159359 markings/sec, 125 secs
lola: 23749835 markings, 95768058 edges, 162978 markings/sec, 130 secs
lola: 24595808 markings, 99244351 edges, 169195 markings/sec, 135 secs
lola: 25296118 markings, 102992268 edges, 140062 markings/sec, 140 secs
lola: 26007227 markings, 106562543 edges, 142222 markings/sec, 145 secs
lola: 26734753 markings, 110060160 edges, 145505 markings/sec, 150 secs
lola: 27527133 markings, 113577524 edges, 158476 markings/sec, 155 secs
lola: 28272958 markings, 117058412 edges, 149165 markings/sec, 160 secs
lola: 29041605 markings, 120623379 edges, 153729 markings/sec, 165 secs
lola: 29836961 markings, 124278513 edges, 159071 markings/sec, 170 secs
lola: 30653179 markings, 127897204 edges, 163244 markings/sec, 175 secs
lola: 31405377 markings, 131390181 edges, 150440 markings/sec, 180 secs
lola: 32227334 markings, 134862069 edges, 164391 markings/sec, 185 secs
lola: 33007341 markings, 138391433 edges, 156001 markings/sec, 190 secs
lola: 33877004 markings, 141798497 edges, 173933 markings/sec, 195 secs
lola: 34942833 markings, 144744666 edges, 213166 markings/sec, 200 secs
lola: 36005692 markings, 147649352 edges, 212572 markings/sec, 205 secs
lola: 37041368 markings, 150597126 edges, 207135 markings/sec, 210 secs
lola: 38082690 markings, 153555750 edges, 208264 markings/sec, 215 secs
lola: 39124504 markings, 156501668 edges, 208363 markings/sec, 220 secs
lola: 39918346 markings, 159940133 edges, 158768 markings/sec, 225 secs
lola: 40611983 markings, 163097435 edges, 138727 markings/sec, 230 secs
lola: 41202168 markings, 166448569 edges, 118037 markings/sec, 235 secs
lola: 41848450 markings, 169588541 edges, 129256 markings/sec, 240 secs
lola: 42503629 markings, 172920412 edges, 131036 markings/sec, 245 secs
lola: 43168970 markings, 176301358 edges, 133068 markings/sec, 250 secs
lola: 43883941 markings, 179569099 edges, 142994 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 295 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: 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: ========================================
lola: subprocess 7 will run for 295 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: subprocess 7 will run for 295 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: 1041348 markings, 2917681 edges, 3689348319961677824 markings/sec, 0 secs
lola: 2057137 markings, 5654528 edges, 203158 markings/sec, 5 secs
lola: 3049555 markings, 8362277 edges, 198484 markings/sec, 10 secs
lola: 4015380 markings, 11050098 edges, 193165 markings/sec, 15 secs
lola: 5009958 markings, 13810065 edges, 198916 markings/sec, 20 secs
lola: 5997963 markings, 16532513 edges, 197601 markings/sec, 25 secs
lola: 6892397 markings, 19229805 edges, 178887 markings/sec, 30 secs
lola: 7605707 markings, 22406519 edges, 142662 markings/sec, 35 secs
lola: 8248044 markings, 25632639 edges, 128467 markings/sec, 40 secs
lola: 8936561 markings, 28598729 edges, 137703 markings/sec, 45 secs
lola: 9597752 markings, 31632412 edges, 132238 markings/sec, 50 secs
lola: 10260144 markings, 34693354 edges, 132478 markings/sec, 55 secs
lola: 10958147 markings, 37547887 edges, 139601 markings/sec, 60 secs
lola: 11658532 markings, 40668395 edges, 140077 markings/sec, 65 secs
lola: 12303989 markings, 43512354 edges, 129091 markings/sec, 70 secs
lola: 13082796 markings, 46495320 edges, 155761 markings/sec, 75 secs
lola: 13703648 markings, 49752333 edges, 124170 markings/sec, 80 secs
lola: 14441765 markings, 52454804 edges, 147623 markings/sec, 85 secs
lola: 15044160 markings, 55663610 edges, 120479 markings/sec, 90 secs
lola: 15527985 markings, 58469885 edges, 96765 markings/sec, 95 secs
lola: 16160470 markings, 61028471 edges, 126497 markings/sec, 100 secs
lola: 16679055 markings, 63635586 edges, 103717 markings/sec, 105 secs
lola: 17309626 markings, 66280061 edges, 126114 markings/sec, 110 secs
lola: 18027175 markings, 69167897 edges, 143510 markings/sec, 115 secs
lola: 18725534 markings, 72187319 edges, 139672 markings/sec, 120 secs
lola: 19317614 markings, 75475176 edges, 118416 markings/sec, 125 secs
lola: 19984519 markings, 78437846 edges, 133381 markings/sec, 130 secs
lola: 20650228 markings, 81485862 edges, 133142 markings/sec, 135 secs
lola: 21321295 markings, 84478498 edges, 134213 markings/sec, 140 secs
lola: 21947728 markings, 87472620 edges, 125287 markings/sec, 145 secs
lola: 22544185 markings, 90481194 edges, 119291 markings/sec, 150 secs
lola: 23294211 markings, 93521716 edges, 150005 markings/sec, 155 secs
lola: 23910594 markings, 96818846 edges, 123277 markings/sec, 160 secs
lola: 24652837 markings, 99449590 edges, 148449 markings/sec, 165 secs
lola: 25256094 markings, 102704431 edges, 120651 markings/sec, 170 secs
lola: 25763006 markings, 105695707 edges, 101382 markings/sec, 175 secs
lola: 26464222 markings, 108610224 edges, 140243 markings/sec, 180 secs
lola: 27103594 markings, 111592508 edges, 127874 markings/sec, 185 secs
lola: 27754457 markings, 114617704 edges, 130173 markings/sec, 190 secs
lola: 28388859 markings, 117596278 edges, 126880 markings/sec, 195 secs
lola: 29038568 markings, 120612507 edges, 129942 markings/sec, 200 secs
lola: 29711200 markings, 123719787 edges, 134526 markings/sec, 205 secs
lola: 30328244 markings, 126472305 edges, 123409 markings/sec, 210 secs
lola: 31009517 markings, 129483533 edges, 136255 markings/sec, 215 secs
lola: 31644111 markings, 132439572 edges, 126919 markings/sec, 220 secs
lola: 32346779 markings, 135387761 edges, 140534 markings/sec, 225 secs
lola: 33021519 markings, 138449184 edges, 134948 markings/sec, 230 secs
lola: 33739560 markings, 141459910 edges, 143608 markings/sec, 235 secs
lola: 34636272 markings, 143923009 edges, 179342 markings/sec, 240 secs
lola: 35535885 markings, 146342945 edges, 179923 markings/sec, 245 secs
lola: 36413465 markings, 148772644 edges, 175516 markings/sec, 250 secs
lola: 37262519 markings, 151223845 edges, 169811 markings/sec, 255 secs
lola: 38144697 markings, 153732310 edges, 176436 markings/sec, 260 secs
lola: 39012874 markings, 156189819 edges, 173635 markings/sec, 265 secs
lola: 39744349 markings, 159002631 edges, 146295 markings/sec, 270 secs
lola: 40321169 markings, 162045777 edges, 115364 markings/sec, 275 secs
lola: 40943222 markings, 164865063 edges, 124411 markings/sec, 280 secs
lola: 41444011 markings, 167900783 edges, 100158 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 295 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 337 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 337 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 393 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: subprocess 10 will run for 393 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: ========================================
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 471 seconds at most (--localtimelimit=-1)
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: 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).
lola: 2510611 markings, 2624498 edges, 3225752436249460736 markings/sec, 0 secs
lola: 4906698 markings, 5130720 edges, 479217 markings/sec, 5 secs
lola: 7193953 markings, 7531160 edges, 457451 markings/sec, 10 secs
lola: 9552428 markings, 10050219 edges, 471695 markings/sec, 15 secs
lola: 11946787 markings, 12714414 edges, 478872 markings/sec, 20 secs
lola: 14178496 markings, 15164098 edges, 446342 markings/sec, 25 secs
lola: 16501211 markings, 17756560 edges, 464543 markings/sec, 30 secs
lola: 18814128 markings, 20275151 edges, 462583 markings/sec, 35 secs
lola: 21131717 markings, 22820808 edges, 463518 markings/sec, 40 secs
lola: 23452891 markings, 25324973 edges, 464235 markings/sec, 45 secs
lola: 25679774 markings, 27810230 edges, 445377 markings/sec, 50 secs
lola: 27883386 markings, 30309385 edges, 440722 markings/sec, 55 secs
lola: 29912886 markings, 32599255 edges, 405900 markings/sec, 60 secs
lola: 32039851 markings, 34888003 edges, 425393 markings/sec, 65 secs
lola: 34210870 markings, 37299855 edges, 434204 markings/sec, 70 secs
lola: 36216904 markings, 39546485 edges, 401207 markings/sec, 75 secs
lola: 38349906 markings, 41895924 edges, 426600 markings/sec, 80 secs
lola: 40614123 markings, 44418382 edges, 452843 markings/sec, 85 secs
lola: 42842653 markings, 46912860 edges, 445706 markings/sec, 90 secs
lola: 45030533 markings, 49357299 edges, 437576 markings/sec, 95 secs
lola: 47147180 markings, 51714655 edges, 423329 markings/sec, 100 secs
lola: 49306195 markings, 54178606 edges, 431803 markings/sec, 105 secs
lola: 51680053 markings, 56780854 edges, 474772 markings/sec, 110 secs
lola: 54104173 markings, 59310845 edges, 484824 markings/sec, 115 secs
lola: 56501177 markings, 61822011 edges, 479401 markings/sec, 120 secs
lola: 58856938 markings, 64310476 edges, 471152 markings/sec, 125 secs
lola: 61259746 markings, 66943669 edges, 480562 markings/sec, 130 secs
lola: 63610944 markings, 69585514 edges, 470240 markings/sec, 135 secs
lola: 65922970 markings, 72157626 edges, 462405 markings/sec, 140 secs
lola: 68195291 markings, 74734693 edges, 454464 markings/sec, 145 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: 2585663 markings, 2701719 edges, 3067840576268271616 markings/sec, 0 secs
lola: 5100097 markings, 5334170 edges, 502887 markings/sec, 5 secs
lola: 7529592 markings, 7887586 edges, 485899 markings/sec, 10 secs
lola: 10010590 markings, 10559092 edges, 496200 markings/sec, 15 secs
lola: 12479569 markings, 13279051 edges, 493796 markings/sec, 20 secs
lola: 14833256 markings, 15895578 edges, 470737 markings/sec, 25 secs
lola: 17159615 markings, 18460304 edges, 465272 markings/sec, 30 secs
lola: 19448304 markings, 20970950 edges, 457738 markings/sec, 35 secs
lola: 21760369 markings, 23522436 edges, 462413 markings/sec, 40 secs
lola: 24134543 markings, 26061525 edges, 474835 markings/sec, 45 secs
lola: 26396457 markings, 28634340 edges, 452383 markings/sec, 50 secs
lola: 28577996 markings, 31092381 edges, 436308 markings/sec, 55 secs
lola: 30823420 markings, 33578434 edges, 449085 markings/sec, 60 secs
lola: 33082088 markings, 36045546 edges, 451734 markings/sec, 65 secs
lola: 35268176 markings, 38492586 edges, 437218 markings/sec, 70 secs
lola: 37409301 markings, 40859350 edges, 428225 markings/sec, 75 secs
lola: 39584319 markings, 43258308 edges, 435004 markings/sec, 80 secs
lola: 41696025 markings, 45637643 edges, 422341 markings/sec, 85 secs
lola: 43791885 markings, 47977134 edges, 419172 markings/sec, 90 secs
lola: 45956190 markings, 50389644 edges, 432861 markings/sec, 95 secs
lola: 48150376 markings, 52843078 edges, 438837 markings/sec, 100 secs
lola: 50357500 markings, 55391718 edges, 441425 markings/sec, 105 secs
lola: 52871829 markings, 58026787 edges, 502866 markings/sec, 110 secs
lola: 55253777 markings, 60517716 edges, 476390 markings/sec, 115 secs
lola: 57632741 markings, 63013664 edges, 475793 markings/sec, 120 secs
lola: 59997058 markings, 65543334 edges, 472863 markings/sec, 125 secs
lola: 62273393 markings, 68105889 edges, 455267 markings/sec, 130 secs
lola: 64582247 markings, 70643854 edges, 461771 markings/sec, 135 secs
lola: 66903958 markings, 73271735 edges, 464342 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 686 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: 1994534 markings, 2227589 edges, 3225752436249460736 markings/sec, 0 secs
lola: 3953872 markings, 4511042 edges, 391868 markings/sec, 5 secs
lola: 5802508 markings, 6597502 edges, 369727 markings/sec, 10 secs
lola: 7731074 markings, 8851638 edges, 385713 markings/sec, 15 secs
lola: 9568241 markings, 11004900 edges, 367433 markings/sec, 20 secs
lola: 11217175 markings, 12936547 edges, 329787 markings/sec, 25 secs
lola: 12895376 markings, 14893741 edges, 335640 markings/sec, 30 secs
lola: 14511564 markings, 16713664 edges, 323238 markings/sec, 35 secs
lola: 16159333 markings, 18659110 edges, 329554 markings/sec, 40 secs
lola: 17812140 markings, 20600912 edges, 330561 markings/sec, 45 secs
lola: 19574555 markings, 22715682 edges, 352483 markings/sec, 50 secs
lola: 21377694 markings, 24880896 edges, 360628 markings/sec, 55 secs
lola: 23112471 markings, 26916269 edges, 346955 markings/sec, 60 secs
lola: 24819248 markings, 28949984 edges, 341355 markings/sec, 65 secs
lola: 26534434 markings, 31005338 edges, 343037 markings/sec, 70 secs
lola: 28180567 markings, 33024721 edges, 329227 markings/sec, 75 secs
lola: 29848746 markings, 35144981 edges, 333636 markings/sec, 80 secs
lola: 31559923 markings, 37352688 edges, 342235 markings/sec, 85 secs
lola: 33330055 markings, 39445098 edges, 354026 markings/sec, 90 secs
lola: 35042714 markings, 41449374 edges, 342532 markings/sec, 95 secs
lola: 36745518 markings, 43485820 edges, 340561 markings/sec, 100 secs
lola: 38442774 markings, 45503737 edges, 339451 markings/sec, 105 secs
lola: 40096208 markings, 47446451 edges, 330687 markings/sec, 110 secs
lola: 41698002 markings, 49405880 edges, 320359 markings/sec, 115 secs
lola: 43245341 markings, 51278762 edges, 309468 markings/sec, 120 secs
lola: 44862284 markings, 53252156 edges, 323389 markings/sec, 125 secs
lola: 46517927 markings, 55274617 edges, 331129 markings/sec, 130 secs
lola: 48076044 markings, 57237481 edges, 311623 markings/sec, 135 secs
lola: 49681894 markings, 59342436 edges, 321170 markings/sec, 140 secs
lola: 51356938 markings, 61306821 edges, 335009 markings/sec, 145 secs
lola: 52981393 markings, 63252325 edges, 324891 markings/sec, 150 secs
lola: 54584126 markings, 65141509 edges, 320547 markings/sec, 155 secs
lola: 56133008 markings, 67022476 edges, 309776 markings/sec, 160 secs
lola: 57705085 markings, 68930061 edges, 314415 markings/sec, 165 secs
lola: 59234062 markings, 70781387 edges, 305795 markings/sec, 170 secs
lola: 60748592 markings, 72735961 edges, 302906 markings/sec, 175 secs
lola: 62410372 markings, 74719078 edges, 332356 markings/sec, 180 secs
lola: 64115525 markings, 76696616 edges, 341031 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 932 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 932 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: subprocess 15 will run for 1864 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (in3_4 + in3_5 <= c17)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: ========================================
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 1864 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: lola:
SUMMARY: no unknown unknown unknown yes unknown yes unknown yes no no unknown unknown unknown no yes
========================================
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 1496389896922

--------------------
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="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/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 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 r118-blw7-149441650200417"
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 ;