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 ERK-PT-000001, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264200354
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494698111353


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ ERK-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: 22/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 11 places, 11 transitions, 6 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10 transition conflict sets
lola: TASK
lola: reading formula from ERK-PT-000001-CTLCardinality.task
lola: NOT(E ((((1 <= MEKPP) OR (MEKPP <= RKIPP_RP)) U ((RKIP <= RKIPP_RP) AND (1 <= RP))))) : (RKIPP <= Raf1Star) : (A (X (A (F ((Raf1Star <= Raf1Star_RKIP_ERKPP))))) OR NOT(((Raf1Star_RKIP <= RP) OR E (F ((3 <= Raf1Star_RKIP_ERKPP)))))) : (2 <= MEKPP_ERK) : ((RKIPP <= 0) OR E (X ((MEKPP_ERK + 1 <= MEKPP)))) : ((A (F ((2 <= RP))) OR ((2 <= RKIPP_RP) AND (RKIPP + 1 <= MEKPP_ERK))) OR (E (G ((RP <= 2))) AND (1 <= ERK))) : (1 <= MEKPP) : (1 <= ERKPP) : A (G (E (((ERK <= RP) U (ERKPP <= RP))))) : ((A (G (())) AND E (((Raf1Star_RKIP_ERKPP <= MEKPP) U (Raf1Star_RKIP_ERKPP <= RP)))) OR ((MEKPP_ERK <= RP) AND (2 <= Raf1Star) AND (2 <= Raf1Star_RKIP) AND (3 <= RKIPP))) : ((E (((2 <= ERK) U (3 <= RKIP))) AND ((1 <= ERKPP) OR (Raf1Star_RKIP_ERKPP <= Raf1Star_RKIP) OR (RKIPP_RP <= 0) OR (MEKPP_ERK <= Raf1Star))) OR (NOT(E (G ((2 <= RP)))) OR ((MEKPP <= ERKPP) AND A (G ((ERK <= MEKPP_ERK)))))) : A ((E (G (TRUE)) U A (G ((MEKPP_ERK <= Raf1Star_RKIP_ERKPP))))) : A ((((RKIPP_RP <= Raf1Star_RKIP) OR (Raf1Star <= MEKPP_ERK) OR ((1 <= MEKPP_ERK) AND (RKIPP_RP <= MEKPP_ERK))) U ((2 <= RP) AND (3 <= ERKPP) AND ((3 <= ERK) OR (RP <= ERK))))) : E (F ((Raf1Star_RKIP <= ERKPP))) : (((E (X ((3 <= RP))) AND (RKIPP <= RKIPP_RP)) AND A (G ((MEKPP <= 2)))) AND A (X (((RP <= 0) AND (RP <= 1))))) : (A (G ((Raf1Star_RKIP_ERKPP <= ERKPP))) AND (A (F (((3 <= Raf1Star_RKIP)))) AND E (F ((RP <= RKIP)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E ((((1 <= MEKPP) OR (MEKPP <= RKIPP_RP)) U ((RKIP <= RKIPP_RP) AND (1 <= RP)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(((1 <= MEKPP) OR (MEKPP <= RKIPP_RP)) U ((RKIP <= RKIPP_RP) AND (1 <= RP))))
lola: processed formula length: 83
lola: 7 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-000001-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (RKIPP <= Raf1Star)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (RKIPP <= Raf1Star)
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (A (F ((Raf1Star <= Raf1Star_RKIP_ERKPP))))) OR NOT(((Raf1Star_RKIP <= RP) OR E (F ((3 <= Raf1Star_RKIP_ERKPP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((Raf1Star <= Raf1Star_RKIP_ERKPP)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (Raf1Star <= Raf1Star_RKIP_ERKPP)))
lola: processed formula length: 47
lola: 7 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-000001-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (RP + 1 <= Raf1Star_RKIP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (RP + 1 <= Raf1Star_RKIP)
lola: processed formula length: 25
lola: 5 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= MEKPP_ERK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= MEKPP_ERK)
lola: processed formula length: 16
lola: 0 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((RKIPP <= 0) OR E (X ((MEKPP_ERK + 1 <= MEKPP))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (RKIPP <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (RKIPP <= 0)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F ((2 <= RP))) OR ((2 <= RKIPP_RP) AND (RKIPP + 1 <= MEKPP_ERK))) OR (E (G ((RP <= 2))) AND (1 <= ERK)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= RP)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (2 <= RP))
lola: processed formula length: 19
lola: 2 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-000001-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= RKIPP_RP) AND (RKIPP + 1 <= MEKPP_ERK))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= RKIPP_RP) AND (RKIPP + 1 <= MEKPP_ERK))
lola: processed formula length: 46
lola: 1 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-000001-CTLCardinality.task
lola: processed formula with 2 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((RP <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= RP)))
lola: processed formula length: 24
lola: 3 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-000001-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= ERK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= ERK)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= MEKPP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= MEKPP)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= ERKPP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= ERKPP)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (((ERK <= RP) U (ERKPP <= RP)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(E((ERK <= RP) U (ERKPP <= RP)))))
lola: processed formula length: 50
lola: 2 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-000001-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (())) AND E (((Raf1Star_RKIP_ERKPP <= MEKPP) U (Raf1Star_RKIP_ERKPP <= RP)))) OR ((MEKPP_ERK <= RP) AND (2 <= Raf1Star) AND (2 <= Raf1Star_RKIP) AND (3 <= RKIPP)))
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: E (((Raf1Star_RKIP_ERKPP <= MEKPP) U (Raf1Star_RKIP_ERKPP <= RP)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((Raf1Star_RKIP_ERKPP <= MEKPP) U (Raf1Star_RKIP_ERKPP <= RP))
lola: processed formula length: 63
lola: 5 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-000001-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (((2 <= ERK) U (3 <= RKIP))) AND ((1 <= ERKPP) OR (Raf1Star_RKIP_ERKPP <= Raf1Star_RKIP) OR (RKIPP_RP <= 0) OR (MEKPP_ERK <= Raf1Star))) OR (NOT(E (G ((2 <= RP)))) OR ((MEKPP <= ERKPP) AND A (G ((ERK <= MEKPP_ERK))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((2 <= ERK) U (3 <= RKIP)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((2 <= ERK) U (3 <= RKIP))
lola: processed formula length: 27
lola: 4 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-000001-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: A (F ((RP <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (RP <= 1))
lola: processed formula length: 19
lola: 4 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-000001-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (G (TRUE)) U A (G ((MEKPP_ERK <= Raf1Star_RKIP_ERKPP)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U (Raf1Star_RKIP_ERKPP + 1 <= MEKPP_ERK))))
lola: processed formula length: 63
lola: 7 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-000001-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((RKIPP_RP <= Raf1Star_RKIP) OR (Raf1Star <= MEKPP_ERK) OR ((1 <= MEKPP_ERK) AND (RKIPP_RP <= MEKPP_ERK))) U ((2 <= RP) AND (3 <= ERKPP) AND ((3 <= ERK) OR (RP <= ERK)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((RKIPP_RP <= Raf1Star_RKIP) OR (Raf1Star <= MEKPP_ERK) OR ((1 <= MEKPP_ERK) AND (RKIPP_RP <= MEKPP_ERK))) U ((2 <= RP) AND (3 <= ERKPP) AND ((3 <= ERK) OR (RP <= ERK))))
lola: processed formula length: 175
lola: 1 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-000001-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Raf1Star_RKIP <= ERKPP)))
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 24 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to ERK-PT-000001-CTLCardinality-13.sara
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (X ((3 <= RP))) AND (RKIPP <= RKIPP_RP)) AND A (G ((MEKPP <= 2)))) AND A (X (((RP <= 0) AND (RP <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((3 <= RP)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((3 <= RP))
lola: processed formula length: 13
lola: 4 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-000001-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((Raf1Star_RKIP_ERKPP <= ERKPP))) AND (A (F (((3 <= Raf1Star_RKIP)))) AND E (F ((RP <= RKIP)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Raf1Star_RKIP_ERKPP <= ERKPP)))
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 24 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: state equation: write sara problem file to ERK-PT-000001-CTLCardinality-15.sara
lola: lola: ========================================
SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: lola: RESULT
lola:
SUMMARY: no yes no no yes yes yes no yes yes yes no no yes no no
========================================
FORMULA ERK-PT-000001-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-000001-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-000001-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-000001-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-000001-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-000001-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-000001-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-000001-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-000001-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-000001-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-000001-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-000001-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-000001-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-000001-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-000001-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-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 1494698111465

--------------------
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="ERK-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/ERK-PT-000001.tgz
mv ERK-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 ERK-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 r028-blw3-149440264200354"
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 ;