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_CircadianClock-PT-010000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074700597
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496356097797


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


checking for too many tokens
===========================================================================================
S_CircadianClock-PT-010000: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_CircadianClock-PT-010000 @ 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-010000-CTLCardinality.task
lola: ((2 <= ma) OR E (F ((a_cap <= 0)))) : A (F (NOT(A (G ((da_a <= r_cap)))))) : (A (G ((mr <= c_cap))) OR ((E (X ((1 <= c))) AND ((r_cap <= mr) OR (da_a <= 2))) AND ((3 <= r_cap) OR (mr <= r_cap)))) : A (F (A (G (((3 <= a) OR (dr <= mr_cap)))))) : E (F (NOT(E (G ((1 <= a_cap)))))) : A (G ((E (F ((1 <= mr_cap))) OR ((1 <= dr_a) AND (dr_a <= ma) AND ((1 <= r_cap) OR (dr_a <= ma)))))) : E ((A (F ((a <= da_a))) U A (G ((dr <= a_cap))))) : E (G ((E (F ((3 <= dr_a))) AND ((ma <= c_cap) OR (ma_cap <= mr) OR ((ma <= da_a) AND (3 <= c)))))) : (A (G (A (G ((dr <= ma_cap))))) OR NOT((((mr + 1 <= dr)) AND A (X (TRUE))))) : NOT(A (G (E (X ((da_a <= mr_cap)))))) : NOT((E (F (((3 <= dr_a) OR (a_cap <= a)))) OR A (G ((1 <= c))))) : NOT((E (((1 <= ma_cap) U (c_cap <= mr))) AND ((1 <= da) OR (2 <= ma_cap) OR (1 <= dr_a) OR ((c_cap <= mr_cap) AND (r <= c_cap) AND (dr <= 0))))) : E (F (NOT(E (G ((3 <= mr_cap)))))) : E ((((c <= a) OR (3 <= r_cap) OR (a_cap <= ma)) U E (F ((c_cap <= mr))))) : A (G (E (F (())))) : A (G (NOT(E (F ((c_cap <= da))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= ma) OR E (F ((a_cap <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= ma)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= ma)
lola: processed formula length: 9
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((a_cap <= 0)))
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-010000-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-010000-CTLCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(A (G ((da_a <= r_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (r_cap + 1 <= da_a)))
lola: processed formula length: 39
lola: 5 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-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: 6174684 markings, 9259059 edges, 1234937 markings/sec, 0 secs
lola: 12113567 markings, 18166527 edges, 1187777 markings/sec, 5 secs
lola: 18138039 markings, 27205170 edges, 1204894 markings/sec, 10 secs
lola: 24157755 markings, 36234302 edges, 1203943 markings/sec, 15 secs
lola: 30048757 markings, 45070260 edges, 1178200 markings/sec, 20 secs
lola: 35917826 markings, 53873854 edges, 1173814 markings/sec, 25 secs
lola: 41733021 markings, 62595108 edges, 1163039 markings/sec, 30 secs
lola: 47742792 markings, 71613196 edges, 1201954 markings/sec, 35 secs
lola: 53610902 markings, 80413583 edges, 1173622 markings/sec, 40 secs
lola: 59604520 markings, 89406060 edges, 1198724 markings/sec, 45 secs
lola: 65548415 markings, 98321693 edges, 1188779 markings/sec, 50 secs
lola: 71446971 markings, 107170370 edges, 1179711 markings/sec, 55 secs
lola: 77255802 markings, 115879665 edges, 1161766 markings/sec, 60 secs
lola: 82940824 markings, 124407501 edges, 1137004 markings/sec, 65 secs
lola: 88800972 markings, 133197503 edges, 1172030 markings/sec, 70 secs
lola: 94294347 markings, 141439061 edges, 1098675 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 247 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((mr <= c_cap))) OR ((E (X ((1 <= c))) AND ((r_cap <= mr) OR (da_a <= 2))) AND ((3 <= r_cap) OR (mr <= r_cap))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 247 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((mr <= c_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-010000-CTLCardinality-2.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 266 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((1 <= c)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((1 <= c))
lola: processed formula length: 12
lola: 2 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-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 0 significant temporal operators and needs 0 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 266 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((3 <= a) OR (dr <= mr_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U ((a <= 2) AND (mr_cap + 1 <= dr)))))
lola: processed formula length: 58
lola: 3 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-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: 6556218 markings, 9832108 edges, 3225863212045959168 markings/sec, 0 secs
lola: 12954006 markings, 19427364 edges, 1279558 markings/sec, 5 secs
lola: 19299814 markings, 28948662 edges, 1269162 markings/sec, 10 secs
lola: 25652018 markings, 38473301 edges, 1270441 markings/sec, 15 secs
lola: 31905505 markings, 47857101 edges, 1250697 markings/sec, 20 secs
lola: 38212033 markings, 57313943 edges, 1261306 markings/sec, 25 secs
lola: 44576442 markings, 66860653 edges, 1272882 markings/sec, 30 secs
lola: 50816193 markings, 76219845 edges, 1247950 markings/sec, 35 secs
lola: 56597358 markings, 84891886 edges, 1156233 markings/sec, 40 secs
lola: 62275586 markings, 93408699 edges, 1135646 markings/sec, 45 secs
lola: 68042840 markings, 102062278 edges, 1153451 markings/sec, 50 secs
lola: 74177879 markings, 111262049 edges, 1227008 markings/sec, 55 secs
lola: 79973473 markings, 119957472 edges, 1159119 markings/sec, 60 secs
lola: 85845910 markings, 128767526 edges, 1174487 markings/sec, 65 secs
lola: 91702096 markings, 137549606 edges, 1171237 markings/sec, 70 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 281 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(E (G ((1 <= a_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (a_cap <= 0)))
lola: processed formula length: 32
lola: 5 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-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: 3410342 markings, 11916228 edges, 682068 markings/sec, 0 secs
lola: 6800316 markings, 23800923 edges, 677995 markings/sec, 5 secs
lola: 10231024 markings, 35800504 edges, 686142 markings/sec, 10 secs
lola: 13731219 markings, 48034652 edges, 700039 markings/sec, 15 secs
lola: 17120262 markings, 59920191 edges, 677809 markings/sec, 20 secs
lola: 20453547 markings, 71583164 edges, 666657 markings/sec, 25 secs
lola: 24053413 markings, 84182450 edges, 719973 markings/sec, 30 secs
lola: 27552756 markings, 96411256 edges, 699869 markings/sec, 35 secs
lola: 30910329 markings, 108168057 edges, 671515 markings/sec, 40 secs
lola: 34290346 markings, 119998919 edges, 676003 markings/sec, 45 secs
lola: 37613762 markings, 131627259 edges, 664683 markings/sec, 50 secs
lola: 40798747 markings, 142792947 edges, 636997 markings/sec, 55 secs
lola: 44174418 markings, 154592227 edges, 675134 markings/sec, 60 secs
lola: 47361604 markings, 165764046 edges, 637437 markings/sec, 65 secs
lola: 50450143 markings, 176562756 edges, 617708 markings/sec, 70 secs
lola: 53596889 markings, 187584875 edges, 629349 markings/sec, 75 secs
lola: 56655666 markings, 198271481 edges, 611755 markings/sec, 80 secs
lola: 59753544 markings, 209118482 edges, 619576 markings/sec, 85 secs
lola: 62816282 markings, 219839941 edges, 612548 markings/sec, 90 secs
lola: 65936594 markings, 230755417 edges, 624062 markings/sec, 95 secs
lola: 68996900 markings, 241470745 edges, 612061 markings/sec, 100 secs
lola: 72165455 markings, 252578209 edges, 633711 markings/sec, 105 secs
lola: 75387041 markings, 263854393 edges, 644317 markings/sec, 110 secs
lola: 78537854 markings, 274876565 edges, 630163 markings/sec, 115 secs
lola: 81598160 markings, 285585695 edges, 612061 markings/sec, 120 secs
lola: 84998500 markings, 297482863 edges, 680068 markings/sec, 125 secs
lola: 88378838 markings, 309300931 edges, 676068 markings/sec, 130 secs
lola: 91664698 markings, 320824207 edges, 657172 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((1 <= mr_cap))) OR ((1 <= dr_a) AND (dr_a <= ma) AND ((1 <= r_cap) OR (dr_a <= ma))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(E(TRUE U (1 <= mr_cap))) AND ((dr_a <= 0) OR (ma + 1 <= dr_a) OR ((r_cap <= 0) AND (ma + 1 <= dr_a))))))
lola: processed formula length: 124
lola: 4 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-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: 4527646 markings, 11315516 edges, 2852915739852013568 markings/sec, 0 secs
lola: 8860770 markings, 22151866 edges, 866625 markings/sec, 5 secs
lola: 13201028 markings, 33002423 edges, 868052 markings/sec, 10 secs
lola: 17234248 markings, 43081881 edges, 806644 markings/sec, 15 secs
lola: 21233468 markings, 53079338 edges, 799844 markings/sec, 20 secs
lola: 25370114 markings, 63421496 edges, 827329 markings/sec, 25 secs
lola: 29478856 markings, 73695092 edges, 821748 markings/sec, 30 secs
lola: 33464609 markings, 83660891 edges, 797151 markings/sec, 35 secs
lola: 37396874 markings, 93488751 edges, 786453 markings/sec, 40 secs
lola: 41357261 markings, 103389713 edges, 792077 markings/sec, 45 secs
lola: 45652031 markings, 114126344 edges, 858954 markings/sec, 50 secs
lola: 49848271 markings, 124619033 edges, 839248 markings/sec, 55 secs
lola: 54044329 markings, 135110282 edges, 839212 markings/sec, 60 secs
lola: 58172727 markings, 145428361 edges, 825680 markings/sec, 65 secs
lola: 62260307 markings, 155647805 edges, 817516 markings/sec, 70 secs
lola: 66402816 markings, 166005126 edges, 828502 markings/sec, 75 secs
lola: 70458920 markings, 176143235 edges, 811221 markings/sec, 80 secs
lola: 74686849 markings, 186716811 edges, 845586 markings/sec, 85 secs
lola: 78726125 markings, 196814436 edges, 807855 markings/sec, 90 secs
lola: 82475749 markings, 206185619 edges, 749925 markings/sec, 95 secs
lola: 86555459 markings, 216385245 edges, 815942 markings/sec, 100 secs
lola: 90646156 markings, 226613935 edges, 818139 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 311 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (F ((a <= da_a))) U A (G ((dr <= a_cap)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(A(TRUE U (a <= da_a)) U NOT(E(TRUE U (a_cap + 1 <= dr))))
lola: processed formula length: 59
lola: 4 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 6819711 markings, 10229079 edges, 2314786986549837824 markings/sec, 0 secs
lola: 13377848 markings, 20065027 edges, 1311627 markings/sec, 5 secs
lola: 19828276 markings, 29739267 edges, 1290086 markings/sec, 10 secs
lola: 26404960 markings, 39606280 edges, 1315337 markings/sec, 15 secs
lola: 32861646 markings, 49291648 edges, 1291337 markings/sec, 20 secs
lola: 39039865 markings, 58557778 edges, 1235644 markings/sec, 25 secs
lola: 45041129 markings, 67560005 edges, 1200253 markings/sec, 30 secs
lola: 50844922 markings, 76267301 edges, 1160759 markings/sec, 35 secs
lola: 56690301 markings, 85033136 edges, 1169076 markings/sec, 40 secs
lola: 62379740 markings, 93566360 edges, 1137888 markings/sec, 45 secs
lola: 68177652 markings, 102261894 edges, 1159582 markings/sec, 50 secs
lola: 74254891 markings, 111378603 edges, 1215448 markings/sec, 55 secs
lola: 80381190 markings, 120568360 edges, 1225260 markings/sec, 60 secs
lola: 86796370 markings, 130190710 edges, 1283036 markings/sec, 65 secs
lola: 93249687 markings, 139874350 edges, 1290663 markings/sec, 70 secs
lola: 94314519 markings, 141469234 edges, 212966 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 337 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((3 <= dr_a))) AND ((ma <= c_cap) OR (ma_cap <= mr) OR ((ma <= da_a) AND (3 <= c))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(E(TRUE U (3 <= dr_a))) OR ((c_cap + 1 <= ma) AND (mr + 1 <= ma_cap) AND ((da_a + 1 <= ma) OR (c <= 2))))))
lola: processed formula length: 125
lola: 4 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-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: 6415804 markings, 9621287 edges, 3225412962034384896 markings/sec, 0 secs
lola: 12393173 markings, 18585726 edges, 1195474 markings/sec, 5 secs
lola: 18268793 markings, 27399707 edges, 1175124 markings/sec, 10 secs
lola: 24180801 markings, 36270392 edges, 1182402 markings/sec, 15 secs
lola: 29974051 markings, 44956601 edges, 1158650 markings/sec, 20 secs
lola: 35737874 markings, 53603959 edges, 1152765 markings/sec, 25 secs
lola: 41399902 markings, 62097734 edges, 1132406 markings/sec, 30 secs
lola: 47361815 markings, 71041261 edges, 1192383 markings/sec, 35 secs
lola: 53075549 markings, 79608443 edges, 1142747 markings/sec, 40 secs
lola: 58717022 markings, 88071107 edges, 1128295 markings/sec, 45 secs
lola: 64370270 markings, 96553489 edges, 1130650 markings/sec, 50 secs
lola: 70023267 markings, 105033033 edges, 1130599 markings/sec, 55 secs
lola: 75545691 markings, 113317604 edges, 1104485 markings/sec, 60 secs
lola: 81035565 markings, 121549617 edges, 1097975 markings/sec, 65 secs
lola: 86856642 markings, 130280985 edges, 1164215 markings/sec, 70 secs
lola: 92630919 markings, 138945550 edges, 1154855 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 369 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (A (G ((dr <= ma_cap))))) OR NOT((((mr + 1 <= dr)) AND A (X (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 369 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((dr <= ma_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-010000-CTLCardinality-8.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 9 will run for 422 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: ========================================
...considering subproblem: ((dr <= mr))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((dr <= mr))
lola: processed formula length: 12
lola: 6 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-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: subprocess 9 will run for 422 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (E (X ((da_a <= mr_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: E(TRUE U AX((mr_cap + 1 <= da_a)))
lola: processed formula length: 34
lola: 7 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-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: 5506741 markings, 8257015 edges, 1101348 markings/sec, 0 secs
lola: 10632785 markings, 15945035 edges, 1025209 markings/sec, 5 secs
lola: 15641645 markings, 23462426 edges, 1001772 markings/sec, 10 secs
lola: 20467907 markings, 30698929 edges, 965252 markings/sec, 15 secs
lola: 25537017 markings, 38302755 edges, 1013822 markings/sec, 20 secs
lola: 30368213 markings, 45549730 edges, 966239 markings/sec, 25 secs
lola: 35518047 markings, 53274316 edges, 1029967 markings/sec, 30 secs
lola: 40291523 markings, 60433537 edges, 954695 markings/sec, 35 secs
lola: 45263722 markings, 67895180 edges, 994440 markings/sec, 40 secs
lola: 50113930 markings, 75166435 edges, 970042 markings/sec, 45 secs
lola: 54955529 markings, 82428309 edges, 968320 markings/sec, 50 secs
lola: 59717583 markings, 89572177 edges, 952411 markings/sec, 55 secs
lola: 64524545 markings, 96785863 edges, 961392 markings/sec, 60 secs
lola: 69291013 markings, 103934477 edges, 953294 markings/sec, 65 secs
lola: 73993360 markings, 110987059 edges, 940469 markings/sec, 70 secs
lola: 78655853 markings, 117979785 edges, 932499 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 478 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F (((3 <= dr_a) OR (a_cap <= a)))) OR A (G ((1 <= c)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 478 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((dr_a <= 2) AND (a + 1 <= a_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 2 literals and 2 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 11 will run for 574 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: NOT((E (((1 <= ma_cap) U (c_cap <= mr))) AND ((1 <= da) OR (2 <= ma_cap) OR (1 <= dr_a) OR ((c_cap <= mr_cap) AND (r <= c_cap) AND (dr <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 574 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((ma_cap <= 0) R (mr + 1 <= c_cap)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E((1 <= ma_cap) U (c_cap <= mr)))
lola: processed formula length: 37
lola: 9 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-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: 6122370 markings, 9182676 edges, 3689348869717491712 markings/sec, 0 secs
lola: 12095871 markings, 18141134 edges, 1194700 markings/sec, 5 secs
lola: 18244405 markings, 27365317 edges, 1229707 markings/sec, 10 secs
lola: 24452607 markings, 36673990 edges, 1241640 markings/sec, 15 secs
lola: 30204814 markings, 45306323 edges, 1150441 markings/sec, 20 secs
lola: 36028726 markings, 54040527 edges, 1164782 markings/sec, 25 secs
lola: 42263748 markings, 63395381 edges, 1247004 markings/sec, 30 secs
lola: 48594480 markings, 72886908 edges, 1266146 markings/sec, 35 secs
lola: 54793282 markings, 82186020 edges, 1239760 markings/sec, 40 secs
lola: 60699091 markings, 91045145 edges, 1181162 markings/sec, 45 secs
lola: 66588409 markings, 99881738 edges, 1177864 markings/sec, 50 secs
lola: 72553817 markings, 108827444 edges, 1193082 markings/sec, 55 secs
lola: 78497948 markings, 117741968 edges, 1188826 markings/sec, 60 secs
lola: 84545531 markings, 126816834 edges, 1209517 markings/sec, 65 secs
lola: 90963216 markings, 136441883 edges, 1283537 markings/sec, 70 secs
lola: 94293611 markings, 141438325 edges, 666079 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 697 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((da <= 0) AND (ma_cap <= 1) AND (dr_a <= 0) AND ((mr_cap + 1 <= c_cap) OR (c_cap + 1 <= r) OR (1 <= dr)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((da <= 0) AND (ma_cap <= 1) AND (dr_a <= 0) AND ((mr_cap + 1 <= c_cap) OR (c_cap + 1 <= r) OR (1 <= dr)))
lola: processed formula length: 108
lola: 6 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-CTLCardinality.task
lola: processed formula with 6 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 12 will run for 697 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (NOT(E (G ((3 <= mr_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (mr_cap <= 2)))
lola: processed formula length: 33
lola: 5 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-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: 3715142 markings, 13000381 edges, 743028 markings/sec, 0 secs
lola: 7294642 markings, 25528199 edges, 715900 markings/sec, 5 secs
lola: 10856509 markings, 37995490 edges, 712373 markings/sec, 10 secs
lola: 14422922 markings, 50476529 edges, 713283 markings/sec, 15 secs
lola: 17873807 markings, 62554332 edges, 690177 markings/sec, 20 secs
lola: 21383043 markings, 74838391 edges, 701847 markings/sec, 25 secs
lola: 25026030 markings, 87582287 edges, 728597 markings/sec, 30 secs
lola: 28573783 markings, 100003699 edges, 709551 markings/sec, 35 secs
lola: 31993200 markings, 111964432 edges, 683883 markings/sec, 40 secs
lola: 35392871 markings, 123851718 edges, 679934 markings/sec, 45 secs
lola: 38721460 markings, 135523900 edges, 665718 markings/sec, 50 secs
lola: 42008384 markings, 147018886 edges, 657385 markings/sec, 55 secs
lola: 45196283 markings, 158182869 edges, 637580 markings/sec, 60 secs
lola: 48514852 markings, 169784734 edges, 663714 markings/sec, 65 secs
lola: 51557498 markings, 180447412 edges, 608529 markings/sec, 70 secs
lola: 54855486 markings, 191975166 edges, 659598 markings/sec, 75 secs
lola: 58259851 markings, 203906488 edges, 680873 markings/sec, 80 secs
lola: 61582932 markings, 215538645 edges, 664616 markings/sec, 85 secs
lola: 65118656 markings, 227911364 edges, 707145 markings/sec, 90 secs
lola: 68536854 markings, 239873023 edges, 683640 markings/sec, 95 secs
lola: 71757176 markings, 251138685 edges, 644064 markings/sec, 100 secs
lola: 75097510 markings, 262817011 edges, 668067 markings/sec, 105 secs
lola: 78327391 markings, 274145645 edges, 645976 markings/sec, 110 secs
lola: 81461689 markings, 285112681 edges, 626860 markings/sec, 115 secs
lola: 84829110 markings, 296900317 edges, 673484 markings/sec, 120 secs
lola: 88283095 markings, 308987962 edges, 690797 markings/sec, 125 secs
lola: 91661538 markings, 320811565 edges, 675689 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 882 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((c <= a) OR (3 <= r_cap) OR (a_cap <= ma)) U E (F ((c_cap <= mr)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((c <= a) OR (3 <= r_cap) OR (a_cap <= ma)) U E(TRUE U (c_cap <= mr)))
lola: processed formula length: 74
lola: 2 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-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: 6732762 markings, 10095185 edges, 3225863212045959168 markings/sec, 0 secs
lola: 13259636 markings, 19888607 edges, 1305375 markings/sec, 5 secs
lola: 19802878 markings, 29703869 edges, 1308648 markings/sec, 10 secs
lola: 26505826 markings, 39757152 edges, 1340590 markings/sec, 15 secs
lola: 32495191 markings, 48738757 edges, 1197873 markings/sec, 20 secs
lola: 38963706 markings, 58445464 edges, 1293703 markings/sec, 25 secs
lola: 45534621 markings, 68296963 edges, 1314183 markings/sec, 30 secs
lola: 51948557 markings, 77921155 edges, 1282787 markings/sec, 35 secs
lola: 58162350 markings, 87241791 edges, 1242759 markings/sec, 40 secs
lola: 64546483 markings, 96819711 edges, 1276827 markings/sec, 45 secs
lola: 70725607 markings, 106087678 edges, 1235825 markings/sec, 50 secs
lola: 76685662 markings, 115027489 edges, 1192011 markings/sec, 55 secs
lola: 82576956 markings, 123861085 edges, 1178259 markings/sec, 60 secs
lola: 88910203 markings, 133364649 edges, 1266649 markings/sec, 65 secs
lola: 94339876 markings, 141505035 edges, 1085935 markings/sec, 70 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (()))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-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: subprocess 15 will run for 2573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(E (F ((c_cap <= da))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
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-010000-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-010000-CTLCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes unknown no unknown unknown unknown unknown unknown no unknown no unknown unknown unknown yes no
FORMULA CircadianClock-PT-010000-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496357065074

--------------------
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_CircadianClock-PT-010000"
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_CircadianClock-PT-010000.tgz
mv S_CircadianClock-PT-010000 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_CircadianClock-PT-010000, 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 r088-csrt-149441074700597"
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 ;