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-000001, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-csrt-149436126500579
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494621038658


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ CircadianClock-PT-000001 @ 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-000001-CTLCardinality.task
lola: (A (X (((c_cap <= a) OR (da_a <= 1)))) AND A ((((1 <= ma_cap) OR (mr_cap <= a)) U ((a_cap <= c) AND (c <= r_cap))))) : (A (X (((2 <= c_cap) AND (ma <= da_a) AND ((1 <= a) OR (2 <= r))))) AND (((r_cap + 1 <= mr_cap) OR (mr <= 1) OR ((mr + 1 <= a_cap) AND (a_cap + 1 <= mr_cap))) AND ((da_a <= ma_cap) AND E (G ((mr <= ma_cap)))))) : E (F (A (F ((r <= 0))))) : E (X ((((a_cap + 1 <= mr) AND (dr + 1 <= mr_cap)) OR ((mr_cap <= da_a) AND (1 <= c_cap) AND (da_a + 1 <= r_cap))))) : A (F ((((r <= 0) OR (mr_cap <= a_cap)) AND (da <= 2)))) : E (X (A (((a_cap <= ma_cap) U (3 <= dr_a))))) : NOT(E (F (A (X ((3 <= da_a)))))) : ((ma <= r) AND E (G (((c <= a_cap) OR (1 <= c) OR (r + 1 <= ma_cap))))) : A (X (A (X (((c <= r_cap) OR (3 <= da)))))) : ((2 <= c_cap) AND E ((((mr <= c) OR (r <= dr_a)) U (3 <= a)))) : A (F (((2 <= da) AND (mr <= ma_cap) AND (r <= dr_a)))) : (3 <= da_a) : E (F (E (F ((1 <= r))))) : A (F ((E (G ((3 <= a))) AND E (F ((2 <= da)))))) : (r <= mr) : (3 <= ma_cap)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (((c_cap <= a) OR (da_a <= 1)))) AND A ((((1 <= ma_cap) OR (mr_cap <= a)) U ((a_cap <= c) AND (c <= r_cap)))))
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: A (X (((c_cap <= a) OR (da_a <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((c_cap <= a) OR (da_a <= 1)))
lola: processed formula length: 34
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-000001-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= ma_cap) OR (mr_cap <= a)) U ((a_cap <= c) AND (c <= r_cap))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((1 <= ma_cap) OR (mr_cap <= a)) U ((a_cap <= c) AND (c <= r_cap)))
lola: processed formula length: 70
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-000001-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (((2 <= c_cap) AND (ma <= da_a) AND ((1 <= a) OR (2 <= r))))) AND (((r_cap + 1 <= mr_cap) OR (mr <= 1) OR ((mr + 1 <= a_cap) AND (a_cap + 1 <= mr_cap))) AND ((da_a <= ma_cap) AND E (G ((mr <= ma_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((2 <= c_cap) AND (ma <= da_a) AND ((1 <= a) OR (2 <= r)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((2 <= c_cap) AND (ma <= da_a) AND ((1 <= a) OR (2 <= r))))
lola: processed formula length: 63
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-000001-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (F ((r <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (r <= 0)))
lola: processed formula length: 28
lola: 2 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-000001-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: 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: E (X ((((a_cap + 1 <= mr) AND (dr + 1 <= mr_cap)) OR ((mr_cap <= da_a) AND (1 <= c_cap) AND (da_a + 1 <= r_cap)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((((a_cap + 1 <= mr) AND (dr + 1 <= mr_cap)) OR ((mr_cap <= da_a) AND (1 <= c_cap) AND (da_a + 1 <= r_cap))))
lola: processed formula length: 112
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-000001-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((r <= 0) OR (mr_cap <= a_cap)) AND (da <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((r <= 0) OR (mr_cap <= a_cap)) AND (da <= 2)))
lola: processed formula length: 58
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-000001-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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (((a_cap <= ma_cap) U (3 <= dr_a)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A((a_cap <= ma_cap) U (3 <= dr_a)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-000001-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (A (X ((3 <= da_a))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((da_a <= 2)))))
lola: processed formula length: 35
lola: 7 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-000001-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: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((ma <= r) AND E (G (((c <= a_cap) OR (1 <= c) OR (r + 1 <= ma_cap)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (ma <= r)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ma <= r)
lola: processed formula length: 9
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-000001-CTLCardinality.task
lola: processed formula with 1 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((c <= a_cap) OR (1 <= c) OR (r + 1 <= ma_cap))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((a_cap + 1 <= c) AND (c <= 0) AND (ma_cap <= r))))
lola: processed formula length: 64
lola: 2 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-000001-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: SUBRESULT
lola: lola: result: yes
========================================
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (X (((c <= r_cap) OR (3 <= da))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(AX(((c <= r_cap) OR (3 <= da))))
lola: processed formula length: 36
lola: 2 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-000001-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= c_cap) AND E ((((mr <= c) OR (r <= dr_a)) U (3 <= a))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= c_cap)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= c_cap)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-000001-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: lola: SUBRESULT
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= da) AND (mr <= ma_cap) AND (r <= dr_a))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((2 <= da) AND (mr <= ma_cap) AND (r <= dr_a)))
lola: processed formula length: 56
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-000001-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= da_a)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= da_a)
lola: processed formula length: 11
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-000001-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 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F ((1 <= r)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-000001-CTLCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: lola: The predicate is reachable.state equation: calling and running sara

lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((E (G ((3 <= a))) AND E (F ((2 <= da))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(A(TRUE U (a <= 2))) AND E(TRUE U (2 <= da))))
lola: processed formula length: 59
lola: 4 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-000001-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 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 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (r <= mr)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (r <= mr)
lola: processed formula length: 9
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-000001-CTLCardinality.task
lola: processed formula with 1 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 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= ma_cap)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= ma_cap)
lola: processed formula length: 13
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-000001-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: RESULT
lola:
SUMMARY: no no yes yes yes no yes yes yes no no no yes no yes no
sara: try reading problem file CircadianClock-PT-000001-CTLCardinality-12.sara.

FORMULA CircadianClock-PT-000001-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-000001-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-000001-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-000001-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-000001-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-000001-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-000001-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-000001-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-000001-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-000001-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-000001-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-000001-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-000001-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-000001-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-000001-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-000001-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494621038820

--------------------
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-000001"
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-000001.tgz
mv CircadianClock-PT-000001 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-000001, 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-149436126500579"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;