fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r008-csrt-149436126500606
Last Updated
June 27, 2017

About the Execution of LoLA for CircadianClock-PT-100000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15951.430 974932.00 976680.00 1460.10 ??FT?T???T?TT??F 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 CircadianClock-PT-100000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-csrt-149436126500606
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1494621895513


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ CircadianClock-PT-100000 @ 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: 30/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 14 places, 16 transitions, 7 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 26 transition conflict sets
lola: TASK
lola: reading formula from CircadianClock-PT-100000-CTLCardinality.task
lola: E (G (NOT(E (F ((mr_cap <= dr_a)))))) : E (F ((A (G ((1 <= da_a))) OR (2 <= dr)))) : A (G (NOT(E (G ((2 <= c)))))) : NOT(E (F ((2 <= da_a)))) : A (G (E (G ((c <= mr_cap))))) : E (F (NOT(A (G ((1 <= r_cap)))))) : (((dr + 1 <= da) OR ((r_cap + 1 <= a) AND (ma_cap <= 0) AND ((a + 1 <= ma) OR (r + 1 <= r_cap)))) OR A (G (()))) : (A (G (E (X ((2 <= ma_cap))))) OR (((2 <= a) AND (3 <= dr)) OR (dr <= dr_a))) : NOT(A (G (E (F ((2 <= da)))))) : A (G ((dr <= r_cap))) : E ((((mr + 1 <= dr) AND (ma <= 1)) U ((ma_cap + 1 <= c) AND (c_cap <= 0)))) : E (F (((c_cap <= da_a) AND (1 <= ma) AND (dr <= 1) AND (dr <= c_cap) AND (r <= a) AND (da_a + 1 <= mr)))) : E (G (A (G (((c <= c_cap) OR (1 <= c_cap)))))) : E (F (((r_cap + 1 <= ma) OR (mr_cap + 1 <= ma) OR ((ma_cap + 1 <= dr) AND (mr_cap + 1 <= r))))) : NOT(A (G (E (X ((c <= ma)))))) : E (F (A (F ((c_cap <= ma)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(E (F ((mr_cap <= dr_a))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U (mr_cap <= dr_a))))
lola: processed formula length: 41
lola: 7 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 5740139 markings, 8580249 edges, 1148028 markings/sec, 0 secs
lola: 11509312 markings, 17218565 edges, 1153835 markings/sec, 5 secs
lola: 17139102 markings, 25678117 edges, 1125958 markings/sec, 10 secs
lola: 22413007 markings, 33613120 edges, 1054781 markings/sec, 15 secs
lola: 27699124 markings, 41499263 edges, 1057223 markings/sec, 20 secs
lola: 33185916 markings, 49771666 edges, 1097358 markings/sec, 25 secs
lola: 38061165 markings, 57061356 edges, 975050 markings/sec, 30 secs
lola: 43055494 markings, 64555710 edges, 998866 markings/sec, 35 secs
lola: 47679862 markings, 71480100 edges, 924874 markings/sec, 40 secs
lola: 52500678 markings, 78701093 edges, 964163 markings/sec, 45 secs
lola: 57876371 markings, 86776661 edges, 1075139 markings/sec, 50 secs
lola: 63189408 markings, 94778500 edges, 1062607 markings/sec, 55 secs
lola: 68259435 markings, 102359777 edges, 1014005 markings/sec, 60 secs
lola: 73297017 markings, 109897384 edges, 1007516 markings/sec, 65 secs
lola: 78332002 markings, 117463612 edges, 1006997 markings/sec, 70 secs
lola: 83755820 markings, 125611221 edges, 1084764 markings/sec, 75 secs
lola: 89121007 markings, 133641568 edges, 1073037 markings/sec, 80 secs
lola: 94380093 markings, 141559714 edges, 1051817 markings/sec, 85 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 229 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((1 <= da_a))) OR (2 <= dr))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 229 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((1 <= da_a)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (da_a <= 0))))
lola: processed formula length: 36
lola: 4 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 4186564 markings, 10459668 edges, 3225863212045959168 markings/sec, 0 secs
lola: 8408216 markings, 21016474 edges, 844330 markings/sec, 5 secs
lola: 12801754 markings, 32003572 edges, 878708 markings/sec, 10 secs
lola: 17208744 markings, 43017574 edges, 881398 markings/sec, 15 secs
lola: 21500699 markings, 53701987 edges, 858391 markings/sec, 20 secs
lola: 25710516 markings, 64231418 edges, 841963 markings/sec, 25 secs
lola: 30067112 markings, 75134374 edges, 871319 markings/sec, 30 secs
lola: 34332659 markings, 85797803 edges, 853109 markings/sec, 35 secs
lola: 38525460 markings, 96276184 edges, 838560 markings/sec, 40 secs
lola: 42867436 markings, 107135086 edges, 868395 markings/sec, 45 secs
lola: 47079823 markings, 117659880 edges, 842477 markings/sec, 50 secs
lola: 51173825 markings, 127921218 edges, 818800 markings/sec, 55 secs
lola: 55545631 markings, 138836614 edges, 874361 markings/sec, 60 secs
lola: 59877199 markings, 149654697 edges, 866314 markings/sec, 65 secs
lola: 64124570 markings, 160273388 edges, 849474 markings/sec, 70 secs
lola: 68334321 markings, 170802620 edges, 841950 markings/sec, 75 secs
lola: 72390994 markings, 180972617 edges, 811335 markings/sec, 80 secs
lola: 76377764 markings, 190932908 edges, 797354 markings/sec, 85 secs
lola: 80595814 markings, 201487036 edges, 843610 markings/sec, 90 secs
lola: 84798388 markings, 211994739 edges, 840515 markings/sec, 95 secs
lola: 88863060 markings, 222126564 edges, 812934 markings/sec, 100 secs
lola: 92963361 markings, 232389617 edges, 820060 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= dr)))
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 28 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: state equation: write sara problem file to CircadianClock-PT-100000-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-CTLCardinality-2.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(E (G ((2 <= c))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (c <= 1)))))
lola: processed formula length: 38
lola: 5 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 4632817 markings, 11565656 edges, 3223546815924142080 markings/sec, 0 secs
lola: 9253525 markings, 23107095 edges, 924142 markings/sec, 5 secs
lola: 13580054 markings, 33940091 edges, 865306 markings/sec, 10 secs
lola: 18116821 markings, 45250371 edges, 907353 markings/sec, 15 secs
lola: 22516298 markings, 56248779 edges, 879895 markings/sec, 20 secs
lola: 26906585 markings, 67219617 edges, 878057 markings/sec, 25 secs
lola: 31369453 markings, 78408201 edges, 892574 markings/sec, 30 secs
lola: 35785689 markings, 89456885 edges, 883247 markings/sec, 35 secs
lola: 40168195 markings, 100404381 edges, 876501 markings/sec, 40 secs
lola: 44447593 markings, 111095408 edges, 855880 markings/sec, 45 secs
lola: 48368778 markings, 120906090 edges, 784237 markings/sec, 50 secs
lola: 52255050 markings, 130610360 edges, 777254 markings/sec, 55 secs
lola: 56319713 markings, 140758855 edges, 812933 markings/sec, 60 secs
lola: 60346022 markings, 150837763 edges, 805262 markings/sec, 65 secs
lola: 64540292 markings, 161320549 edges, 838854 markings/sec, 70 secs
lola: 68816319 markings, 172032982 edges, 855205 markings/sec, 75 secs
lola: 72670261 markings, 181640885 edges, 770788 markings/sec, 80 secs
lola: 76417015 markings, 191034411 edges, 749351 markings/sec, 85 secs
lola: 80353088 markings, 200858859 edges, 787215 markings/sec, 90 secs
lola: 84193891 markings, 210481248 edges, 768161 markings/sec, 95 secs
lola: 88142703 markings, 220327664 edges, 789762 markings/sec, 100 secs
lola: 91968758 markings, 229905811 edges, 765211 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 247 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((2 <= da_a))))
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 28 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: state equation: write sara problem file to CircadianClock-PT-100000-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-CTLCardinality-3.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 268 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G ((c <= mr_cap)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (mr_cap + 1 <= c))))
lola: processed formula length: 42
lola: 4 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 3147964 markings, 10991836 edges, 619471 markings/sec, 0 secs
lola: 6500066 markings, 22545181 edges, 670420 markings/sec, 5 secs
lola: 9561345 markings, 33445327 edges, 612256 markings/sec, 10 secs
lola: 12718837 markings, 44475280 edges, 631498 markings/sec, 15 secs
lola: 15882770 markings, 55383167 edges, 632787 markings/sec, 20 secs
lola: 19100192 markings, 66650526 edges, 643484 markings/sec, 25 secs
lola: 22314467 markings, 78057753 edges, 642855 markings/sec, 30 secs
lola: 25374407 markings, 88797500 edges, 611988 markings/sec, 35 secs
lola: 28377565 markings, 99310117 edges, 600632 markings/sec, 40 secs
lola: 31395439 markings, 109881597 edges, 603575 markings/sec, 45 secs
lola: 34688613 markings, 121189480 edges, 658635 markings/sec, 50 secs
lola: 37798882 markings, 132295334 edges, 622054 markings/sec, 55 secs
lola: 40983740 markings, 143434750 edges, 636972 markings/sec, 60 secs
lola: 44100442 markings, 154129542 edges, 623340 markings/sec, 65 secs
lola: 47118729 markings, 164874677 edges, 603657 markings/sec, 70 secs
lola: 50108875 markings, 175335248 edges, 598029 markings/sec, 75 secs
lola: 53300534 markings, 186368273 edges, 638332 markings/sec, 80 secs
lola: 56500566 markings, 197545569 edges, 640006 markings/sec, 85 secs
lola: 59607193 markings, 208608686 edges, 621325 markings/sec, 90 secs
lola: 62716009 markings, 219463718 edges, 621763 markings/sec, 95 secs
lola: 65850785 markings, 230352433 edges, 626955 markings/sec, 100 secs
lola: 68903075 markings, 241111952 edges, 610458 markings/sec, 105 secs
lola: 71950658 markings, 251802271 edges, 609517 markings/sec, 110 secs
lola: 74964733 markings, 262358553 edges, 602815 markings/sec, 115 secs
lola: 77992416 markings, 272969271 edges, 605537 markings/sec, 120 secs
lola: 80900810 markings, 282971602 edges, 581679 markings/sec, 125 secs
lola: 83791479 markings, 293265493 edges, 578134 markings/sec, 130 secs
lola: 86700868 markings, 303306986 edges, 581878 markings/sec, 135 secs
lola: 89412415 markings, 312914652 edges, 542309 markings/sec, 140 secs
lola: 92300924 markings, 322815814 edges, 577702 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(A (G ((1 <= r_cap))))))
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 28 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: state equation: write sara problem file to CircadianClock-PT-100000-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-CTLCardinality-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 306 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((dr + 1 <= da) OR ((r_cap + 1 <= a) AND (ma_cap <= 0) AND ((a + 1 <= ma) OR (r + 1 <= r_cap)))) OR A (G (())))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 4 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 340 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (X ((2 <= ma_cap))))) OR (((2 <= a) AND (3 <= dr)) OR (dr <= dr_a)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 340 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((2 <= ma_cap)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((2 <= ma_cap)))))
lola: processed formula length: 37
lola: 2 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 4703376 markings, 7006727 edges, 3221853842895273984 markings/sec, 0 secs
lola: 9243986 markings, 13844031 edges, 908122 markings/sec, 5 secs
lola: 13742461 markings, 20584852 edges, 899695 markings/sec, 10 secs
lola: 18199766 markings, 27299438 edges, 891461 markings/sec, 15 secs
lola: 22691474 markings, 33991587 edges, 898342 markings/sec, 20 secs
lola: 27280052 markings, 40880188 edges, 917716 markings/sec, 25 secs
lola: 31644499 markings, 47444657 edges, 872889 markings/sec, 30 secs
lola: 35967816 markings, 53935451 edges, 864663 markings/sec, 35 secs
lola: 40363185 markings, 60526167 edges, 879074 markings/sec, 40 secs
lola: 45060371 markings, 67560596 edges, 939437 markings/sec, 45 secs
lola: 49595531 markings, 74390813 edges, 907032 markings/sec, 50 secs
lola: 54120906 markings, 81141540 edges, 905075 markings/sec, 55 secs
lola: 58501406 markings, 87702518 edges, 876100 markings/sec, 60 secs
lola: 62935365 markings, 94370413 edges, 886792 markings/sec, 65 secs
lola: 67603725 markings, 101404062 edges, 933672 markings/sec, 70 secs
lola: 72172024 markings, 108243684 edges, 913660 markings/sec, 75 secs
lola: 76768831 markings, 115137277 edges, 919361 markings/sec, 80 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 371 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= a) AND (3 <= dr)) OR (dr <= dr_a))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((2 <= a) AND (3 <= dr)) OR (dr <= dr_a))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-CTLCardinality.task
lola: processed formula with 3 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 8 will run for 371 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: NOT(A (G (E (F ((2 <= da))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: ========================================
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (2 <= da))))
lola: processed formula length: 34
lola: 8 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 6148358 markings, 9196685 edges, 1229662 markings/sec, 0 secs
lola: 12220550 markings, 18320612 edges, 1214438 markings/sec, 5 secs
lola: 18460326 markings, 27660418 edges, 1247955 markings/sec, 10 secs
lola: 24293680 markings, 36393802 edges, 1166671 markings/sec, 15 secs
lola: 30313607 markings, 45427060 edges, 1203985 markings/sec, 20 secs
lola: 36304561 markings, 54408940 edges, 1198191 markings/sec, 25 secs
lola: 42260626 markings, 63360838 edges, 1191213 markings/sec, 30 secs
lola: 47998716 markings, 71997192 edges, 1147618 markings/sec, 35 secs
lola: 53934221 markings, 80868172 edges, 1187101 markings/sec, 40 secs
lola: 59830926 markings, 89731226 edges, 1179341 markings/sec, 45 secs
lola: 65754816 markings, 98609302 edges, 1184778 markings/sec, 50 secs
lola: 71513731 markings, 107227103 edges, 1151783 markings/sec, 55 secs
lola: 76766668 markings, 115132950 edges, 1050587 markings/sec, 60 secs
lola: 82164764 markings, 123229117 edges, 1079619 markings/sec, 65 secs
lola: 87443889 markings, 131144327 edges, 1055825 markings/sec, 70 secs
lola: 93120441 markings, 139640415 edges, 1135310 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((dr <= r_cap)))
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 28 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: state equation: write sara problem file to CircadianClock-PT-100000-CTLCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-CTLCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 481 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((mr + 1 <= dr) AND (ma <= 1)) U ((ma_cap + 1 <= c) AND (c_cap <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((mr + 1 <= dr) AND (ma <= 1)) U ((ma_cap + 1 <= c) AND (c_cap <= 0)))
lola: processed formula length: 72
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 11 will run for 577 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((c_cap <= da_a) AND (1 <= ma) AND (dr <= 1) AND (dr <= c_cap) AND (r <= a) AND (da_a + 1 <= mr))))
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 28 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 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-CTLCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 721 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (G (((c <= c_cap) OR (1 <= c_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U ((c_cap + 1 <= c) AND (c_cap <= 0)))))
lola: processed formula length: 60
lola: 4 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 6188769 markings, 9277507 edges, 1237754 markings/sec, 0 secs
lola: 12307730 markings, 18415396 edges, 1223792 markings/sec, 5 secs
lola: 18434190 markings, 27634283 edges, 1225292 markings/sec, 10 secs
lola: 24385573 markings, 36571024 edges, 1190277 markings/sec, 15 secs
lola: 30341815 markings, 45483478 edges, 1191248 markings/sec, 20 secs
lola: 36232671 markings, 54332853 edges, 1178171 markings/sec, 25 secs
lola: 42168115 markings, 63236019 edges, 1187089 markings/sec, 30 secs
lola: 47869747 markings, 71769987 edges, 1140326 markings/sec, 35 secs
lola: 53584230 markings, 80368192 edges, 1142897 markings/sec, 40 secs
lola: 59737749 markings, 89575198 edges, 1230704 markings/sec, 45 secs
lola: 65705643 markings, 98510957 edges, 1193579 markings/sec, 50 secs
lola: 71480186 markings, 107180544 edges, 1154909 markings/sec, 55 secs
lola: 77220805 markings, 115821191 edges, 1148124 markings/sec, 60 secs
lola: 83110053 markings, 124619690 edges, 1177850 markings/sec, 65 secs
lola: 88807580 markings, 133208025 edges, 1139505 markings/sec, 70 secs
lola: 94281482 markings, 141381953 edges, 1094780 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 935 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((r_cap + 1 <= ma) OR (mr_cap + 1 <= ma) OR ((ma_cap + 1 <= dr) AND (mr_cap + 1 <= r)))))
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 28 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 4 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-CTLCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-CTLCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1403 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (E (X ((c <= ma))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((ma + 1 <= c)))
lola: processed formula length: 27
lola: 7 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 5153571 markings, 7707115 edges, 1030714 markings/sec, 0 secs
lola: 10150943 markings, 15201834 edges, 999474 markings/sec, 5 secs
lola: 14968021 markings, 22435965 edges, 963416 markings/sec, 10 secs
lola: 19917061 markings, 29834021 edges, 989808 markings/sec, 15 secs
lola: 24732493 markings, 37064860 edges, 963086 markings/sec, 20 secs
lola: 29374103 markings, 44048058 edges, 928322 markings/sec, 25 secs
lola: 33864944 markings, 50765113 edges, 898168 markings/sec, 30 secs
lola: 38239607 markings, 57339797 edges, 874933 markings/sec, 35 secs
lola: 42758748 markings, 64117280 edges, 903828 markings/sec, 40 secs
lola: 47562012 markings, 71323785 edges, 960653 markings/sec, 45 secs
lola: 52305449 markings, 78410633 edges, 948687 markings/sec, 50 secs
lola: 57274789 markings, 85875075 edges, 993868 markings/sec, 55 secs
lola: 62144397 markings, 93188480 edges, 973922 markings/sec, 60 secs
lola: 66955641 markings, 100410945 edges, 962249 markings/sec, 65 secs
lola: 71578268 markings, 107356176 edges, 924525 markings/sec, 70 secs
lola: 76063762 markings, 114064141 edges, 897099 markings/sec, 75 secs
lola: 79859714 markings, 119760112 edges, 759190 markings/sec, 80 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2720 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (F ((c_cap <= ma)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (c_cap <= ma)))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 3105452 markings, 10821791 edges, 621077 markings/sec, 0 secs
lola: 6172971 markings, 21591849 edges, 613504 markings/sec, 5 secs
lola: 9270525 markings, 32270757 edges, 619511 markings/sec, 10 secs
lola: 12257627 markings, 42757935 edges, 597420 markings/sec, 15 secs
lola: 15352021 markings, 53708003 edges, 618879 markings/sec, 20 secs
lola: 18338948 markings, 64155698 edges, 597385 markings/sec, 25 secs
lola: 21303431 markings, 74513612 edges, 592897 markings/sec, 30 secs
lola: 24223608 markings, 84724216 edges, 584035 markings/sec, 35 secs
lola: 27138753 markings, 94954873 edges, 583029 markings/sec, 40 secs
lola: 30300304 markings, 105834799 edges, 632310 markings/sec, 45 secs
lola: 33440004 markings, 116940842 edges, 627940 markings/sec, 50 secs
lola: 36707426 markings, 128429518 edges, 653484 markings/sec, 55 secs
lola: 39956027 markings, 139823904 edges, 649720 markings/sec, 60 secs
lola: 43298243 markings, 151299325 edges, 668443 markings/sec, 65 secs
lola: 46500466 markings, 162664226 edges, 640445 markings/sec, 70 secs
lola: 49700498 markings, 173765448 edges, 640006 markings/sec, 75 secs
lola: 52942888 markings, 185271285 edges, 648478 markings/sec, 80 secs
lola: 56300564 markings, 196874903 edges, 671535 markings/sec, 85 secs
lola: 59514263 markings, 208256750 edges, 642740 markings/sec, 90 secs
lola: 62710297 markings, 219440869 edges, 639207 markings/sec, 95 secs
lola: 65937623 markings, 230750160 edges, 645465 markings/sec, 100 secs
lola: 69160410 markings, 242041293 edges, 644557 markings/sec, 105 secs
lola: 72355034 markings, 253219773 edges, 638925 markings/sec, 110 secs
lola: 75539028 markings, 264355731 edges, 636799 markings/sec, 115 secs
lola: 78828399 markings, 275830371 edges, 657874 markings/sec, 120 secs
lola: 82015236 markings, 287017288 edges, 637367 markings/sec, 125 secs
lola: 85184854 markings, 298138989 edges, 633924 markings/sec, 130 secs
lola: 88324838 markings, 309098906 edges, 627997 markings/sec, 135 secs
lola: 91500916 markings, 320193939 edges, 635216 markings/sec, 140 secs
lola: 94287028 markings, 329789386 edges, 557222 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown unknown unknown yes unknown yes yes unknown unknown no no yes unknown yes unknown unknown
FORMULA CircadianClock-PT-100000-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494622870445

--------------------
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="CircadianClock-PT-100000"
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/CircadianClock-PT-100000.tgz
mv CircadianClock-PT-100000 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 CircadianClock-PT-100000, 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 r008-csrt-149436126500606"
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 ;