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_Raft-PT-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-csrt-149443432700004
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496437881793


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


checking for too many tokens
===========================================================================================
S_Raft-PT-02: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLFireability @ S_Raft-PT-02 @ 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: 80/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 28 places, 52 transitions, 24 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 49 transition conflict sets
lola: TASK
lola: reading formula from Raft-PT-02-CTLFireability.task
lola: A (F (A (G ((FIREABLE(t45) OR NOT FIREABLE(t0)))))) : NOT(E (F ((FIREABLE(t36) AND FIREABLE(t43) AND NOT FIREABLE(t35) AND NOT FIREABLE(t15) AND NOT FIREABLE(t19))))) : A (F (E (F (FIREABLE(t51))))) : E (((E (F (FIREABLE(t23))) OR FIREABLE(t48)) U A (G ((FIREABLE(t15) AND FIREABLE(t6)))))) : E (F (A ((FIREABLE(t41) U (FIREABLE(t8) AND FIREABLE(t31)))))) : E (F ((NOT(E (F (FIREABLE(t15)))) AND A (F (FIREABLE(t17)))))) : A (F (A (G (E (F (FIREABLE(t49))))))) : (((A (F (NOT FIREABLE(t1))) OR (NOT FIREABLE(t31) OR FIREABLE(t48) OR FIREABLE(t26))) AND E (G (E (F (FIREABLE(t51)))))) OR (A (X (((FIREABLE(t5) AND FIREABLE(t33)) OR (FIREABLE(t30) AND FIREABLE(t8))))) AND (FIREABLE(t47) OR E (G ((FIREABLE(t29) AND FIREABLE(t5))))))) : E (F ((NOT(E (F (FIREABLE(t47)))) AND NOT(A (X (FIREABLE(t25))))))) : E (X (E ((FIREABLE(t29) U (FIREABLE(t9) AND FIREABLE(t22)))))) : E ((NOT FIREABLE(t37) U A (G ((FIREABLE(t35) AND FIREABLE(t28)))))) : A (G (E (F (FIREABLE(t18))))) : ((E (((FIREABLE(t25) AND FIREABLE(t1)) U (FIREABLE(t1) AND FIREABLE(t25)))) AND FIREABLE(t37)) OR E (X (E ((FIREABLE(t28) U FIREABLE(t51)))))) : FIREABLE(t17) : A (G (NOT(E ((FIREABLE(t39) U FIREABLE(t23)))))) : ((NOT(((NOT FIREABLE(t43) OR NOT FIREABLE(t6)) AND A (G (FIREABLE(t9))))) OR NOT((A (F (FIREABLE(t31))) AND A (G (FIREABLE(t26)))))) AND NOT(E (G ((NOT FIREABLE(t50) OR NOT FIREABLE(t41))))))
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 (F (A (G ((FIREABLE(t45) OR NOT FIREABLE(t0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U (NOT FIREABLE(t45) AND FIREABLE(t0)))))
lola: processed formula length: 61
lola: 3 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file Raft-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 8 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((FIREABLE(t36) AND FIREABLE(t43) AND NOT FIREABLE(t35) AND NOT FIREABLE(t15) AND NOT FIREABLE(t19)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 8 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 invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F (FIREABLE(t51)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U FIREABLE(t51)))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file Raft-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 8 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 (((E (F (FIREABLE(t23))) OR FIREABLE(t48)) U A (G ((FIREABLE(t15) AND FIREABLE(t6))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((E(TRUE U FIREABLE(t23)) OR FIREABLE(t48)) U NOT(E(TRUE U (NOT FIREABLE(t15) OR NOT FIREABLE(t6)))))
lola: processed formula length: 103
lola: 4 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file Raft-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 8 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A ((FIREABLE(t41) U (FIREABLE(t8) AND FIREABLE(t31))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(FIREABLE(t41) U (FIREABLE(t8) AND FIREABLE(t31))))
lola: processed formula length: 61
lola: 2 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file Raft-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 8 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT(E (F (FIREABLE(t15)))) AND A (F (FIREABLE(t17))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(E(TRUE U FIREABLE(t15))) AND A(TRUE U FIREABLE(t17))))
lola: processed formula length: 68
lola: 7 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file Raft-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 8 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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (E (F (FIREABLE(t49)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U NOT(E(TRUE U FIREABLE(t49))))))
lola: processed formula length: 53
lola: 3 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file Raft-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 8 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((A (F (NOT FIREABLE(t1))) OR (NOT FIREABLE(t31) OR FIREABLE(t48) OR FIREABLE(t26))) AND E (G (E (F (FIREABLE(t51)))))) OR (A (X (((FIREABLE(t5) AND FIREABLE(t33)) OR (FIREABLE(t30) AND FIREABLE(t8))))) AND (FIREABLE(t47) OR E (G ((FIREABLE(t29) AND FIREABLE(t5)))))))
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: A (F (NOT FIREABLE(t1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT FIREABLE(t1))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file Raft-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 8 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: E (G (E (F (FIREABLE(t51)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U FIREABLE(t51)))))
lola: processed formula length: 43
lola: 2 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file Raft-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 8 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: SUBRESULT
========================================lola:
result: yes
lola: The Boolean predicate is true.
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT(E (F (FIREABLE(t47)))) AND NOT(A (X (FIREABLE(t25)))))))
lola: ========================================
lola: SUBTASK
lola: lola: ========================================
checking CTL
lola: processed formula: E(TRUE U (NOT(E(TRUE U FIREABLE(t47))) AND EX(NOT FIREABLE(t25))))
lola: processed formula length: 66
lola: 10 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file Raft-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 8 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 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E ((FIREABLE(t29) U (FIREABLE(t9) AND FIREABLE(t22))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(FIREABLE(t29) U (FIREABLE(t9) AND FIREABLE(t22))))
lola: processed formula length: 55
lola: 2 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file Raft-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 8 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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((NOT FIREABLE(t37) U A (G ((FIREABLE(t35) AND FIREABLE(t28))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT FIREABLE(t37) U NOT(E(TRUE U (NOT FIREABLE(t35) OR NOT FIREABLE(t28)))))
lola: processed formula length: 79
lola: 3 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file Raft-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 8 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 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (FIREABLE(t18)))))
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 FIREABLE(t18)))))
lola: processed formula length: 43
lola: 2 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file Raft-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 8 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: ((E (((FIREABLE(t25) AND FIREABLE(t1)) U (FIREABLE(t1) AND FIREABLE(t25)))) AND FIREABLE(t37)) OR E (X (E ((FIREABLE(t28) U FIREABLE(t51))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((FIREABLE(t25) AND FIREABLE(t1)) U (FIREABLE(t1) AND FIREABLE(t25))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((FIREABLE(t25) AND FIREABLE(t1)) U (FIREABLE(t1) AND FIREABLE(t25)))
lola: processed formula length: 70
lola: 1 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file Raft-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 8 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 (X (E ((FIREABLE(t28) U FIREABLE(t51)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(FIREABLE(t28) U FIREABLE(t51)))
lola: processed formula length: 36
lola: 2 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file Raft-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 8 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: SUBRESULT
========================================
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t17)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t17)
lola: processed formula length: 13
lola: 0 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file Raft-PT-02-CTLFireability.task
lola: processed formula with 0 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 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(E ((FIREABLE(t39) U FIREABLE(t23))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U E(FIREABLE(t39) U FIREABLE(t23))))
lola: processed formula length: 47
lola: 9 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file Raft-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 8 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 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(((NOT FIREABLE(t43) OR NOT FIREABLE(t6)) AND A (G (FIREABLE(t9))))) OR NOT((A (F (FIREABLE(t31))) AND A (G (FIREABLE(t26)))))) AND NOT(E (G ((NOT FIREABLE(t50) OR NOT FIREABLE(t41))))))
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: (FIREABLE(t43) AND FIREABLE(t6))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t43) AND FIREABLE(t6))
lola: processed formula length: 32
lola: 16 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file Raft-PT-02-CTLFireability.task
lola: processed formula with 0 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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(t31)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(t31)))
lola: processed formula length: 28
lola: 18 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file Raft-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 8 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 18 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(t26)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 8 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: ========================================
lola: subprocess 19 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t50) AND FIREABLE(t41))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (FIREABLE(t50) AND FIREABLE(t41)))
lola: processed formula length: 43
lola: 17 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file Raft-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 8 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: RESULT
lola:
SUMMARY: yes yes yes no no no no yes no no no no yes no no no
FORMULA Raft-PT-02-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-02-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-02-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-02-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-02-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-02-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-02-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-02-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-02-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-02-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-02-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-02-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-02-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-02-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-02-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-02-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496437882420

--------------------
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_Raft-PT-02"
export BK_EXAMINATION="CTLFireability"
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_Raft-PT-02.tgz
mv S_Raft-PT-02 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_Raft-PT-02, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r148-csrt-149443432700004"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;