About the Execution of LoLA for CircadianClock-PT-001000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15951.750 | 616189.00 | 616419.00 | 2145.40 | ??TFTTF?T?TTTFF? | 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-001000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-csrt-149436126500588
=====================================================================
--------------------
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-001000-CTLCardinality-0
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-1
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-10
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-11
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-12
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-13
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-14
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-15
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-2
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-3
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-4
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-5
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-6
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-7
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-8
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1494621140620
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ CircadianClock-PT-001000 @ 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-001000-CTLCardinality.task
lola: ((((c <= ma_cap) AND (da_a <= 1)) AND (A (G ((1 <= dr))) OR A (F ((r <= a_cap))))) AND NOT(E (((c <= ma) U (c_cap <= ma))))) : E (F ((E (G ((1 <= a_cap))) AND ((r_cap <= ma_cap) AND (mr_cap <= da_a) AND (3 <= ma) AND (2 <= mr_cap))))) : ((E (G ((mr_cap + 1 <= da_a))) OR A (G (((ma <= r) AND (2 <= c))))) OR A (G (E (X (TRUE))))) : (A (F (((c <= 0) AND (dr_a <= 0)))) AND A (G (E (X ((dr_a <= c)))))) : (NOT(E (F (((ma <= ma_cap) OR (ma_cap <= a))))) OR A (G (A (F (TRUE))))) : E (F (NOT(E (X ((2 <= a_cap)))))) : E (F ((A (G (TRUE)) OR ((2 <= da) OR (mr_cap <= 0))))) : ((E (G (((2 <= dr) OR (c <= mr)))) AND E (F (((2 <= mr_cap) OR (r_cap <= mr_cap))))) AND A (G ((1 <= a_cap)))) : (A (F ((((2 <= r) OR (da <= ma_cap)) AND ((2 <= da) OR (ma_cap <= da))))) OR ((3 <= dr) OR A (G ((mr + 1 <= a_cap))))) : E (((r <= 2) U ((3 <= dr_a) AND (c <= 2)))) : A (G (A (G (((dr <= mr_cap) OR (2 <= mr)))))) : E (F (((c_cap <= 0) AND (c <= 2) AND (r + 1 <= c_cap)))) : (E (((da_a <= dr_a) U ((3 <= c_cap) OR (r_cap <= da)))) AND (A (F ((r_cap <= da_a))) OR NOT(A (G ((2 <= ma_cap)))))) : A (G (((c <= a) OR (ma <= mr_cap) OR (1 <= c) OR (1 <= ma) OR (r + 1 <= a)))) : (((3 <= ma) AND (A (F ((3 <= mr_cap))) AND ((r <= 1) OR (ma_cap <= 2)))) OR A (G (A (G ((3 <= r_cap)))))) : A (G (E (F ((3 <= 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: ((((c <= ma_cap) AND (da_a <= 1)) AND (A (G ((1 <= dr))) OR A (F ((r <= a_cap))))) AND NOT(E (((c <= ma) U (c_cap <= ma)))))
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: ((c <= ma_cap) AND (da_a <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((c <= ma_cap) AND (da_a <= 1))
lola: processed formula length: 31
lola: 5 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= dr)))
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((r <= a_cap)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (r <= a_cap))
lola: processed formula length: 22
lola: 6 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((ma + 1 <= c) R (ma + 1 <= c_cap)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E((c <= ma) U (c_cap <= ma)))
lola: processed formula length: 33
lola: 8 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-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: 4741626 markings, 8979727 edges, 3689348869717491712 markings/sec, 0 secs
lola: 8878367 markings, 17251378 edges, 827348 markings/sec, 5 secs
lola: 13394498 markings, 26280565 edges, 903226 markings/sec, 10 secs
lola: 17730538 markings, 34951104 edges, 867208 markings/sec, 15 secs
lola: 22146458 markings, 43779481 edges, 883184 markings/sec, 20 secs
lola: 26188291 markings, 51861028 edges, 808367 markings/sec, 25 secs
lola: 30578802 markings, 60641126 edges, 878102 markings/sec, 30 secs
lola: 34857787 markings, 69197016 edges, 855797 markings/sec, 35 secs
lola: 39334093 markings, 78147034 edges, 895261 markings/sec, 40 secs
lola: 43860252 markings, 87197973 edges, 905232 markings/sec, 45 secs
lola: 48278982 markings, 96032127 edges, 883746 markings/sec, 50 secs
lola: 52811063 markings, 105095147 edges, 906416 markings/sec, 55 secs
lola: 57199101 markings, 113866824 edges, 877608 markings/sec, 60 secs
lola: 61431084 markings, 122329133 edges, 846397 markings/sec, 65 secs
lola: 65822628 markings, 131111260 edges, 878309 markings/sec, 70 secs
lola: 70242868 markings, 139948624 edges, 884048 markings/sec, 75 secs
lola: 74584678 markings, 148630548 edges, 868362 markings/sec, 80 secs
lola: 78965021 markings, 157390127 edges, 876069 markings/sec, 85 secs
lola: 83395949 markings, 166248537 edges, 886186 markings/sec, 90 secs
lola: 86542715 markings, 172540538 edges, 629353 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 1 will run for 229 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((1 <= a_cap))) AND ((r_cap <= ma_cap) AND (mr_cap <= da_a) AND (3 <= ma) AND (2 <= mr_cap)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(A(TRUE U (a_cap <= 0))) AND ((r_cap <= ma_cap) AND (mr_cap <= da_a) AND (3 <= ma) AND (2 <= mr_cap))))
lola: processed formula length: 116
lola: 3 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-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: 3267524 markings, 12563503 edges, 3096146678491643904 markings/sec, 0 secs
lola: 6150465 markings, 24090515 edges, 576588 markings/sec, 5 secs
lola: 8890380 markings, 35048194 edges, 547983 markings/sec, 10 secs
lola: 11651357 markings, 46087206 edges, 552195 markings/sec, 15 secs
lola: 14451877 markings, 57282576 edges, 560104 markings/sec, 20 secs
lola: 17087028 markings, 67818113 edges, 527030 markings/sec, 25 secs
lola: 19705032 markings, 78288300 edges, 523601 markings/sec, 30 secs
lola: 22388039 markings, 89016666 edges, 536601 markings/sec, 35 secs
lola: 25148105 markings, 100052870 edges, 552013 markings/sec, 40 secs
lola: 27853131 markings, 110870299 edges, 541005 markings/sec, 45 secs
lola: 30559387 markings, 121690282 edges, 541251 markings/sec, 50 secs
lola: 33339991 markings, 132808801 edges, 556121 markings/sec, 55 secs
lola: 36136656 markings, 143990307 edges, 559333 markings/sec, 60 secs
lola: 38965152 markings, 155302666 edges, 565699 markings/sec, 65 secs
lola: 41671286 markings, 166121736 edges, 541227 markings/sec, 70 secs
lola: 44392073 markings, 176999505 edges, 544157 markings/sec, 75 secs
lola: 47137138 markings, 187975165 edges, 549013 markings/sec, 80 secs
lola: 49935082 markings, 199164552 edges, 559589 markings/sec, 85 secs
lola: 52592507 markings, 209790165 edges, 531485 markings/sec, 90 secs
lola: 55197957 markings, 220207309 edges, 521090 markings/sec, 95 secs
lola: 57781301 markings, 230537896 edges, 516669 markings/sec, 100 secs
lola: 60342983 markings, 240780135 edges, 512336 markings/sec, 105 secs
lola: 62972103 markings, 251293197 edges, 525824 markings/sec, 110 secs
lola: 65689108 markings, 262155743 edges, 543401 markings/sec, 115 secs
lola: 68442949 markings, 273168075 edges, 550768 markings/sec, 120 secs
lola: 71197118 markings, 284177966 edges, 550834 markings/sec, 125 secs
lola: 73887594 markings, 294939440 edges, 538095 markings/sec, 130 secs
lola: 76541901 markings, 305549849 edges, 530861 markings/sec, 135 secs
lola: 79190008 markings, 316139437 edges, 529621 markings/sec, 140 secs
lola: 81877870 markings, 326888768 edges, 537572 markings/sec, 145 secs
lola: 84575124 markings, 337673072 edges, 539451 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 233 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (G ((mr_cap + 1 <= da_a))) OR A (G (((ma <= r) AND (2 <= c))))) OR A (G (E (X (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 8 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-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 3 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((c <= 0) AND (dr_a <= 0)))) AND A (G (E (X ((dr_a <= c))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 3 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((c <= 0) AND (dr_a <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((c <= 0) AND (dr_a <= 0)))
lola: processed formula length: 36
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((dr_a <= c)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((dr_a <= c)))))
lola: processed formula length: 35
lola: 2 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-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: 4503410 markings, 8503153 edges, 2750789801329295360 markings/sec, 0 secs
lola: 8491111 markings, 16476832 edges, 797540 markings/sec, 5 secs
lola: 12389840 markings, 24271404 edges, 779746 markings/sec, 10 secs
lola: 16284179 markings, 32057881 edges, 778868 markings/sec, 15 secs
lola: 20219167 markings, 39926462 edges, 786998 markings/sec, 20 secs
lola: 24031543 markings, 47550560 edges, 762475 markings/sec, 25 secs
lola: 27851725 markings, 55188819 edges, 764036 markings/sec, 30 secs
lola: 31607843 markings, 62698786 edges, 751224 markings/sec, 35 secs
lola: 35475373 markings, 70431160 edges, 773506 markings/sec, 40 secs
lola: 39099178 markings, 77675989 edges, 724761 markings/sec, 45 secs
lola: 42644721 markings, 84766922 edges, 709109 markings/sec, 50 secs
lola: 46340363 markings, 92155371 edges, 739128 markings/sec, 55 secs
lola: 49810009 markings, 99094498 edges, 693929 markings/sec, 60 secs
lola: 53311701 markings, 106094812 edges, 700338 markings/sec, 65 secs
lola: 56891533 markings, 113253782 edges, 715966 markings/sec, 70 secs
lola: 60551023 markings, 120570602 edges, 731898 markings/sec, 75 secs
lola: 63954999 markings, 127376834 edges, 680795 markings/sec, 80 secs
lola: 67749551 markings, 134963949 edges, 758910 markings/sec, 85 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 4 will run for 264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (NOT(E (F (((ma <= ma_cap) OR (ma_cap <= a))))) OR A (G (A (F (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 9 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-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 5 will run for 289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(E (X ((2 <= a_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((a_cap <= 1)))
lola: processed formula length: 26
lola: 5 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: subprocess 6 will run for 317 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((A (G (TRUE)) OR ((2 <= da) OR (mr_cap <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 6 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-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 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (G (((2 <= dr) OR (c <= mr)))) AND E (F (((2 <= mr_cap) OR (r_cap <= mr_cap))))) AND A (G ((1 <= a_cap))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((2 <= dr) OR (c <= mr))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((dr <= 1) AND (mr + 1 <= c))))
lola: processed formula length: 44
lola: 3 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 397 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= mr_cap) OR (r_cap <= mr_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 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 454 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((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 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 397 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((((2 <= r) OR (da <= ma_cap)) AND ((2 <= da) OR (ma_cap <= da))))) OR ((3 <= dr) OR A (G ((mr + 1 <= a_cap)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 397 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((2 <= r) OR (da <= ma_cap)) AND ((2 <= da) OR (ma_cap <= da)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((2 <= r) OR (da <= ma_cap)) AND ((2 <= da) OR (ma_cap <= da))))
lola: processed formula length: 76
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-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 9 will run for 454 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= dr)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= dr)
lola: processed formula length: 9
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-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 529 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((mr + 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-001000-CTLCardinality-10.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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 454 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((r <= 2) U ((3 <= dr_a) AND (c <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((r <= 2) U ((3 <= dr_a) AND (c <= 2)))
lola: processed formula length: 40
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-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: 4903081 markings, 9185626 edges, 2546440892382707712 markings/sec, 0 secs
lola: 8885623 markings, 16648626 edges, 796508 markings/sec, 5 secs
lola: 12579862 markings, 23573650 edges, 738848 markings/sec, 10 secs
lola: 16314590 markings, 30573098 edges, 746946 markings/sec, 15 secs
lola: 19908718 markings, 37308187 edges, 718826 markings/sec, 20 secs
lola: 23788930 markings, 44582374 edges, 776042 markings/sec, 25 secs
lola: 27591359 markings, 51706772 edges, 760486 markings/sec, 30 secs
lola: 31620400 markings, 59260392 edges, 805808 markings/sec, 35 secs
lola: 35399026 markings, 66340467 edges, 755725 markings/sec, 40 secs
lola: 39387030 markings, 73816191 edges, 797601 markings/sec, 45 secs
lola: 43147074 markings, 80861100 edges, 752009 markings/sec, 50 secs
lola: 47108908 markings, 88287467 edges, 792367 markings/sec, 55 secs
lola: 50956019 markings, 95496514 edges, 769422 markings/sec, 60 secs
lola: 54885534 markings, 102862497 edges, 785903 markings/sec, 65 secs
lola: 58735553 markings, 110077395 edges, 770004 markings/sec, 70 secs
lola: 62640637 markings, 117396480 edges, 781017 markings/sec, 75 secs
lola: 66472431 markings, 124576037 edges, 766359 markings/sec, 80 secs
lola: 70397597 markings, 131934562 edges, 785033 markings/sec, 85 secs
lola: 74211203 markings, 139079888 edges, 762721 markings/sec, 90 secs
lola: 78111857 markings, 146391905 edges, 780131 markings/sec, 95 secs
lola: 82016742 markings, 153709799 edges, 780977 markings/sec, 100 secs
lola: 85921943 markings, 161028648 edges, 781040 markings/sec, 105 secs
lola: 89846477 markings, 168384574 edges, 784907 markings/sec, 110 secs
lola: 92607609 markings, 173558142 edges, 552226 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 509 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (G (((dr <= mr_cap) OR (2 <= mr))))))
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 1 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-001000-CTLCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-001000-CTLCardinality-10.sara.
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 611 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((c_cap <= 0) AND (c <= 2) AND (r + 1 <= c_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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-001000-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-001000-CTLCardinality-11.sara.
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 764 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((da_a <= dr_a) U ((3 <= c_cap) OR (r_cap <= da)))) AND (A (F ((r_cap <= da_a))) OR NOT(A (G ((2 <= ma_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 764 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((da_a <= dr_a) U ((3 <= c_cap) OR (r_cap <= da))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((da_a <= dr_a) U ((3 <= c_cap) OR (r_cap <= da)))
lola: processed formula length: 52
lola: 4 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 1018 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((r_cap <= da_a)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (r_cap <= da_a))
lola: processed formula length: 25
lola: 4 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-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 14 will run for 1528 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((ma_cap <= 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 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-001000-CTLCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-001000-CTLCardinality-14.sara.
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 13 will run for 1018 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((c <= a) OR (ma <= mr_cap) OR (1 <= c) OR (1 <= ma) OR (r + 1 <= 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 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-001000-CTLCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-001000-CTLCardinality-13.sara.
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 14 will run for 1528 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((3 <= ma) AND (A (F ((3 <= mr_cap))) AND ((r <= 1) OR (ma_cap <= 2)))) OR A (G (A (G ((3 <= r_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1528 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= ma)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= ma)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-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 15 will run for 3056 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= 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-001000-CTLCardinality-15.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: ========================================SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3056 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((3 <= ma)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (3 <= ma)))))
lola: processed formula length: 39
lola: 2 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-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: 3004006 markings, 12333307 edges, 3689348869717491712 markings/sec, 0 secs
lola: 6357642 markings, 24073317 edges, 670727 markings/sec, 5 secs
lola: 10036050 markings, 35105710 edges, 735682 markings/sec, 10 secs
lola: 13385611 markings, 45153963 edges, 669912 markings/sec, 15 secs
lola: 16742901 markings, 55225143 edges, 671458 markings/sec, 20 secs
lola: 20160801 markings, 65475852 edges, 683580 markings/sec, 25 secs
lola: 23418116 markings, 75246829 edges, 651463 markings/sec, 30 secs
lola: 26719654 markings, 85149852 edges, 660308 markings/sec, 35 secs
lola: 29944534 markings, 94823445 edges, 644976 markings/sec, 40 secs
lola: 33203844 markings, 104598527 edges, 651862 markings/sec, 45 secs
lola: 36570706 markings, 114698012 edges, 673372 markings/sec, 50 secs
lola: 39866658 markings, 124584563 edges, 659190 markings/sec, 55 secs
lola: 43119960 markings, 134341815 edges, 650660 markings/sec, 60 secs
lola: 46369538 markings, 144089064 edges, 649916 markings/sec, 65 secs
lola: 49781049 markings, 154322199 edges, 682302 markings/sec, 70 secs
lola: 52905121 markings, 163694025 edges, 624814 markings/sec, 75 secs
lola: 55979836 markings, 172916549 edges, 614943 markings/sec, 80 secs
lola: 59221699 markings, 182638849 edges, 648373 markings/sec, 85 secs
lola: 62441012 markings, 192295915 edges, 643863 markings/sec, 90 secs
lola: 65721540 markings, 202135933 edges, 656106 markings/sec, 95 secs
lola: 69086277 markings, 212228916 edges, 672947 markings/sec, 100 secs
lola: 72367077 markings, 222069015 edges, 656160 markings/sec, 105 secs
lola: 75832526 markings, 232464193 edges, 693090 markings/sec, 110 secs
lola: 79238035 markings, 242678115 edges, 681102 markings/sec, 115 secs
lola: 82482829 markings, 252411145 edges, 648959 markings/sec, 120 secs
lola: 85713509 markings, 262101699 edges, 646136 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown unknown yes unknown yes yes yes no no unknown yes no yes yes no unknown
FORMULA CircadianClock-PT-001000-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1494621756809
--------------------
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-001000"
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-001000.tgz
mv CircadianClock-PT-001000 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-001000, 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-149436126500588"
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 '
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 ;