About the Execution of LoLA for S_CircadianClock-PT-001000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15951.130 | 638390.00 | 632379.00 | 2674.00 | ??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 S_CircadianClock-PT-001000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074600588
=====================================================================
--------------------
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 1496355671740
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_CircadianClock-PT-001000: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_CircadianClock-PT-001000: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_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: state equation: write sara problem file to CircadianClock-PT-001000-CTLCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.lola:
state equation: calling and running sara
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).
sara: try reading problem file CircadianClock-PT-001000-CTLCardinality.sara.
lola: 4889275 markings, 9275598 edges, 3689348869717491712 markings/sec, 0 secs
lola: 9613216 markings, 18720022 edges, 944788 markings/sec, 5 secs
lola: 14382979 markings, 28257441 edges, 953953 markings/sec, 10 secs
lola: 19139965 markings, 37768506 edges, 951397 markings/sec, 15 secs
lola: 23769130 markings, 47024930 edges, 925833 markings/sec, 20 secs
lola: 28403010 markings, 56290492 edges, 926776 markings/sec, 25 secs
lola: 32996857 markings, 65476909 edges, 918769 markings/sec, 30 secs
lola: 37753529 markings, 74987032 edges, 951334 markings/sec, 35 secs
lola: 42406677 markings, 84290435 edges, 930630 markings/sec, 40 secs
lola: 46962059 markings, 93399427 edges, 911076 markings/sec, 45 secs
lola: 51584351 markings, 102641649 edges, 924458 markings/sec, 50 secs
lola: 56110210 markings, 111689523 edges, 905172 markings/sec, 55 secs
lola: 60633313 markings, 120735171 edges, 904621 markings/sec, 60 secs
lola: 65180192 markings, 129825860 edges, 909376 markings/sec, 65 secs
lola: 69845702 markings, 139155538 edges, 933102 markings/sec, 70 secs
lola: 73938279 markings, 147339072 edges, 818515 markings/sec, 75 secs
lola: 78131032 markings, 155721011 edges, 838551 markings/sec, 80 secs
lola: 82353032 markings, 164163221 edges, 844400 markings/sec, 85 secs
lola: 86520817 markings, 172496811 edges, 833557 markings/sec, 90 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: 3211940 markings, 12341500 edges, 3108142075472773120 markings/sec, 0 secs
lola: 6022840 markings, 23580200 edges, 562180 markings/sec, 5 secs
lola: 8662418 markings, 34136042 edges, 527916 markings/sec, 10 secs
lola: 11327319 markings, 44790530 edges, 532980 markings/sec, 15 secs
lola: 14042496 markings, 55646471 edges, 543035 markings/sec, 20 secs
lola: 16694073 markings, 66250324 edges, 530315 markings/sec, 25 secs
lola: 19267416 markings, 76538884 edges, 514669 markings/sec, 30 secs
lola: 21813954 markings, 86723385 edges, 509308 markings/sec, 35 secs
lola: 24338041 markings, 96812171 edges, 504817 markings/sec, 40 secs
lola: 26887045 markings, 107008419 edges, 509801 markings/sec, 45 secs
lola: 29404908 markings, 117072064 edges, 503573 markings/sec, 50 secs
lola: 31887052 markings, 126999520 edges, 496429 markings/sec, 55 secs
lola: 34400057 markings, 137046274 edges, 502601 markings/sec, 60 secs
lola: 36796849 markings, 146632263 edges, 479358 markings/sec, 65 secs
lola: 39347774 markings, 156830696 edges, 510185 markings/sec, 70 secs
lola: 41869068 markings, 166912451 edges, 504259 markings/sec, 75 secs
lola: 44243167 markings, 176404608 edges, 474820 markings/sec, 80 secs
lola: 46600077 markings, 185827845 edges, 471382 markings/sec, 85 secs
lola: 48978067 markings, 195336622 edges, 475598 markings/sec, 90 secs
lola: 51402067 markings, 205030186 edges, 484800 markings/sec, 95 secs
lola: 53778057 markings, 214531692 edges, 475198 markings/sec, 100 secs
lola: 56134093 markings, 223948685 edges, 471207 markings/sec, 105 secs
lola: 58803088 markings, 234624357 edges, 533799 markings/sec, 110 secs
lola: 61458401 markings, 245239697 edges, 531063 markings/sec, 115 secs
lola: 64008577 markings, 255437705 edges, 510035 markings/sec, 120 secs
lola: 66748027 markings, 266389270 edges, 547890 markings/sec, 125 secs
lola: 69444779 markings, 277172073 edges, 539350 markings/sec, 130 secs
lola: 72115494 markings, 287854295 edges, 534143 markings/sec, 135 secs
lola: 74650553 markings, 297989378 edges, 507012 markings/sec, 140 secs
lola: 77126209 markings, 307889363 edges, 495131 markings/sec, 145 secs
lola: 79489132 markings, 317334002 edges, 472585 markings/sec, 150 secs
lola: 82017431 markings, 327446785 edges, 505660 markings/sec, 155 secs
lola: 84552903 markings, 337583935 edges, 507094 markings/sec, 160 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: 4428498 markings, 8353111 edges, 2806861595810988032 markings/sec, 0 secs
lola: 8163643 markings, 15820872 edges, 747029 markings/sec, 5 secs
lola: 11863416 markings, 23219986 edges, 739955 markings/sec, 10 secs
lola: 15493820 markings, 30478625 edges, 726081 markings/sec, 15 secs
lola: 18872306 markings, 37234136 edges, 675697 markings/sec, 20 secs
lola: 22390525 markings, 44268050 edges, 703644 markings/sec, 25 secs
lola: 25863063 markings, 51211858 edges, 694508 markings/sec, 30 secs
lola: 29253771 markings, 57991051 edges, 678142 markings/sec, 35 secs
lola: 32570882 markings, 64624342 edges, 663422 markings/sec, 40 secs
lola: 35970456 markings, 71422355 edges, 679915 markings/sec, 45 secs
lola: 39245429 markings, 77968963 edges, 654995 markings/sec, 50 secs
lola: 42498377 markings, 84473673 edges, 650590 markings/sec, 55 secs
lola: 45733307 markings, 90942298 edges, 646986 markings/sec, 60 secs
lola: 48978834 markings, 97432733 edges, 649105 markings/sec, 65 secs
lola: 52319207 markings, 104110603 edges, 668075 markings/sec, 70 secs
lola: 55557949 markings, 110586912 edges, 647748 markings/sec, 75 secs
lola: 58830398 markings, 117130155 edges, 654490 markings/sec, 80 secs
lola: 62136725 markings, 123740075 edges, 661265 markings/sec, 85 secs
lola: 65448603 markings, 130362674 edges, 662376 markings/sec, 90 secs
lola: 68822475 markings, 137109328 edges, 674774 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: 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 288 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 316 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 352 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 352 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 396 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 9 will run for 452 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 396 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 396 seconds at most (--localtimelimit=-1)
lola: 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 452 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 528 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 452 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: 5145638 markings, 9641422 edges, 3092994103776903168 markings/sec, 0 secs
lola: 9325510 markings, 17473511 edges, 835974 markings/sec, 5 secs
lola: 13186626 markings, 24710011 edges, 772223 markings/sec, 10 secs
lola: 17090141 markings, 32026024 edges, 780703 markings/sec, 15 secs
lola: 21002276 markings, 39358554 edges, 782427 markings/sec, 20 secs
lola: 24854355 markings, 46577869 edges, 770416 markings/sec, 25 secs
lola: 28674752 markings, 53737598 edges, 764079 markings/sec, 30 secs
lola: 32539707 markings, 60981339 edges, 772991 markings/sec, 35 secs
lola: 36427674 markings, 68268154 edges, 777593 markings/sec, 40 secs
lola: 40108192 markings, 75165718 edges, 736104 markings/sec, 45 secs
lola: 43503958 markings, 81529485 edges, 679153 markings/sec, 50 secs
lola: 47086658 markings, 88246217 edges, 716540 markings/sec, 55 secs
lola: 50641448 markings, 94906981 edges, 710958 markings/sec, 60 secs
lola: 54536780 markings, 102209069 edges, 779066 markings/sec, 65 secs
lola: 58300731 markings, 109261268 edges, 752790 markings/sec, 70 secs
lola: 62103445 markings, 116390023 edges, 760543 markings/sec, 75 secs
lola: 65856610 markings, 123422602 edges, 750633 markings/sec, 80 secs
lola: 69689465 markings, 130607584 edges, 766571 markings/sec, 85 secs
lola: 73512241 markings, 137771464 edges, 764555 markings/sec, 90 secs
lola: 77318166 markings, 144903360 edges, 761185 markings/sec, 95 secs
lola: 81226654 markings, 152229369 edges, 781698 markings/sec, 100 secs
lola: 85104638 markings, 159496731 edges, 775597 markings/sec, 105 secs
lola: 89005820 markings, 166809238 edges, 780236 markings/sec, 110 secs
lola: 92565474 markings, 173480801 edges, 711931 markings/sec, 115 secs
lola: 92569553 markings, 173488381 edges, 816 markings/sec, 120 secs
lola: 92608700 markings, 173561142 edges, 7829 markings/sec, 125 secs
lola: 92617574 markings, 173578426 edges, 1775 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 505 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 605 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 757 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 757 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 1009 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 1514 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
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 1009 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 1514 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 1514 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 3029 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: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: SUBRESULT
lola: lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3029 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, 11799655 edges, 3689348869717491712 markings/sec, 0 secs
lola: 6249583 markings, 23749037 edges, 649115 markings/sec, 5 secs
lola: 9886707 markings, 34659736 edges, 727425 markings/sec, 10 secs
lola: 13581911 markings, 45743455 edges, 739041 markings/sec, 15 secs
lola: 17152700 markings, 56452606 edges, 714158 markings/sec, 20 secs
lola: 20695364 markings, 67080244 edges, 708533 markings/sec, 25 secs
lola: 24108088 markings, 77314902 edges, 682545 markings/sec, 30 secs
lola: 27451613 markings, 87345001 edges, 668705 markings/sec, 35 secs
lola: 30632331 markings, 96885632 edges, 636144 markings/sec, 40 secs
lola: 33932772 markings, 106785898 edges, 660088 markings/sec, 45 secs
lola: 37476909 markings, 117415479 edges, 708827 markings/sec, 50 secs
lola: 40978322 markings, 127919065 edges, 700283 markings/sec, 55 secs
lola: 44173131 markings, 137500960 edges, 638962 markings/sec, 60 secs
lola: 47315256 markings, 146925275 edges, 628425 markings/sec, 65 secs
lola: 50557307 markings, 156650879 edges, 648410 markings/sec, 70 secs
lola: 53757607 markings, 166250311 edges, 640060 markings/sec, 75 secs
lola: 56960251 markings, 175856677 edges, 640529 markings/sec, 80 secs
lola: 60422599 markings, 186241241 edges, 692470 markings/sec, 85 secs
lola: 63822047 markings, 196439121 edges, 679890 markings/sec, 90 secs
lola: 67537337 markings, 207581831 edges, 743058 markings/sec, 95 secs
lola: 71128288 markings, 218352666 edges, 718190 markings/sec, 100 secs
lola: 74606564 markings, 228786311 edges, 695655 markings/sec, 105 secs
lola: 78045620 markings, 239102682 edges, 687811 markings/sec, 110 secs
lola: 81503250 markings, 249472368 edges, 691526 markings/sec, 115 secs
lola: 84976861 markings, 259893008 edges, 694722 markings/sec, 120 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 1496356310130
--------------------
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-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/S_CircadianClock-PT-001000.tgz
mv S_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 S_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 r088-csrt-149441074600588"
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 ;