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 Eratosthenes-PT-010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264200328
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494696046094


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLFireability @ Eratosthenes-PT-010 @ 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: 17/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 9 places, 8 transitions, 5 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10 transition conflict sets
lola: TASK
lola: reading formula from Eratosthenes-PT-010-CTLFireability.task
lola: NOT(((NOT(E (F (FIREABLE(t6.2)))) AND (A (G (FIREABLE(t6.2))) OR (FIREABLE(t8.4) AND FIREABLE(t6.2) AND NOT FIREABLE(t9.3)))) OR A (F (A (G (FIREABLE(t10.5))))))) : E (X (A (F (A (G (FIREABLE(t8.4))))))) : A (F (())) : E (G (E (G ((NOT FIREABLE(t10.5) OR (FIREABLE(t9.3) AND FIREABLE(t8.2))))))) : (FIREABLE(t10.5) AND A (F (A (G (FIREABLE(t9.3)))))) : ((NOT FIREABLE(t10.2) AND ((NOT FIREABLE(t9.3) AND NOT FIREABLE(t4.2)) OR (NOT FIREABLE(t6.2) AND NOT FIREABLE(t4.2)) OR FIREABLE(t8.2))) OR E (G ((NOT FIREABLE(t10.2) OR FIREABLE(t8.4) OR NOT FIREABLE(t9.3))))) : A (F (A (G (E (G (FIREABLE(t6.2))))))) : A (F (E (X (A (G (FIREABLE(t8.4))))))) : (A (G (((NOT FIREABLE(t4.2) AND (FIREABLE(t10.2) OR FIREABLE(t8.4))) OR A (G (FIREABLE(t8.2)))))) OR A (X (E ((FIREABLE(t6.3) U FIREABLE(t10.5)))))) : NOT(A (((NOT FIREABLE(t10.5) AND NOT FIREABLE(t9.3)) U (NOT FIREABLE(t6.2) AND NOT FIREABLE(t10.5))))) : (FIREABLE(t8.4) AND (E (G (FIREABLE(t4.2))) AND E (G (A (F (FIREABLE(t6.2))))))) : A (((A (F (FIREABLE(t4.2))) OR (NOT FIREABLE(t8.2) AND NOT FIREABLE(t10.5))) U E (G ((FIREABLE(t9.3) AND FIREABLE(t4.2)))))) : (FIREABLE(t8.2) AND NOT FIREABLE(t9.3)) : A (F (E (X (A (F (FIREABLE(t9.3))))))) : A (F (E (X ((FIREABLE(t8.4) AND FIREABLE(t4.2) AND (FIREABLE(t6.3) OR FIREABLE(t4.2))))))) : (((FIREABLE(t6.2) OR E ((FIREABLE(t8.4) U FIREABLE(t6.2)))) AND ((FIREABLE(t6.3) OR A (F (FIREABLE(t4.2)))) OR ((FIREABLE(t10.2) OR FIREABLE(t8.4) OR NOT FIREABLE(t10.5)) AND FIREABLE(t4.2)))) OR ((((NOT FIREABLE(t6.2) OR NOT FIREABLE(t10.5)) AND NOT FIREABLE(t10.5)) AND E ((FIREABLE(t6.3) U FIREABLE(t10.2)))) OR A ((FIREABLE(t10.5) U FIREABLE(t10.5)))))
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(((NOT(E (F (FIREABLE(t6.2)))) AND (A (G (FIREABLE(t6.2))) OR (FIREABLE(t8.4) AND FIREABLE(t6.2) AND NOT FIREABLE(t9.3)))) OR A (F (A (G (FIREABLE(t10.5)))))))
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: E (F (FIREABLE(t6.2)))
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 27 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (NOT FIREABLE(t10.5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U NOT FIREABLE(t10.5)))))
lola: processed formula length: 49
lola: 20 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file Eratosthenes-PT-010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 27 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: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (A (G (FIREABLE(t8.4)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U NOT(E(TRUE U NOT FIREABLE(t8.4)))))
lola: processed formula length: 47
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file Eratosthenes-PT-010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 27 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file Eratosthenes-PT-010-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G ((NOT FIREABLE(t10.5) OR (FIREABLE(t9.3) AND FIREABLE(t8.2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (FIREABLE(t10.5) AND (NOT FIREABLE(t9.3) OR NOT FIREABLE(t8.2))))))
lola: processed formula length: 90
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file Eratosthenes-PT-010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 27 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t10.5) AND A (F (A (G (FIREABLE(t9.3))))))
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: FIREABLE(t10.5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t10.5)
lola: processed formula length: 15
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file Eratosthenes-PT-010-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (FIREABLE(t9.3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U NOT FIREABLE(t9.3))))
lola: processed formula length: 43
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file Eratosthenes-PT-010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 27 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: SUBRESULT
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(t10.2) AND ((NOT FIREABLE(t9.3) AND NOT FIREABLE(t4.2)) OR (NOT FIREABLE(t6.2) AND NOT FIREABLE(t4.2)) OR FIREABLE(t8.2))) OR E (G ((NOT FIREABLE(t10.2) OR FIREABLE(t8.4) OR NOT FIREABLE(t9.3)))))
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: (NOT FIREABLE(t10.2) AND ((NOT FIREABLE(t9.3) AND NOT FIREABLE(t4.2)) OR (NOT FIREABLE(t6.2) AND NOT FIREABLE(t4.2)) OR FIREABLE(t8.2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(t10.2) AND ((NOT FIREABLE(t9.3) AND NOT FIREABLE(t4.2)) OR (NOT FIREABLE(t6.2) AND NOT FIREABLE(t4.2)) OR FIREABLE(t8.2)))
lola: processed formula length: 138
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file Eratosthenes-PT-010-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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(t10.2) OR FIREABLE(t8.4) OR NOT FIREABLE(t9.3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (FIREABLE(t10.2) AND NOT FIREABLE(t8.4) AND FIREABLE(t9.3))))
lola: processed formula length: 74
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file Eratosthenes-PT-010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 27 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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (E (G (FIREABLE(t6.2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U A(TRUE U NOT FIREABLE(t6.2)))))
lola: processed formula length: 53
lola: 5 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file Eratosthenes-PT-010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 27 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 (E (X (A (G (FIREABLE(t8.4)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX(NOT(E(TRUE U NOT FIREABLE(t8.4)))))
lola: processed formula length: 47
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file Eratosthenes-PT-010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 27 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((NOT FIREABLE(t4.2) AND (FIREABLE(t10.2) OR FIREABLE(t8.4))) OR A (G (FIREABLE(t8.2)))))) OR A (X (E ((FIREABLE(t6.3) U FIREABLE(t10.5))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t4.2) AND (FIREABLE(t10.2) OR FIREABLE(t8.4))) OR A (G (FIREABLE(t8.2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U ((FIREABLE(t4.2) OR (NOT FIREABLE(t10.2) AND NOT FIREABLE(t8.4))) AND E(TRUE U NOT FIREABLE(t8.2)))))
lola: processed formula length: 115
lola: 6 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file Eratosthenes-PT-010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 27 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E ((FIREABLE(t6.3) U FIREABLE(t10.5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(FIREABLE(t6.3) U FIREABLE(t10.5)))
lola: processed formula length: 39
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file Eratosthenes-PT-010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 27 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: SUBRESULT
========================================
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (((NOT FIREABLE(t10.5) AND NOT FIREABLE(t9.3)) U (NOT FIREABLE(t6.2) AND NOT FIREABLE(t10.5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((NOT FIREABLE(t10.5) AND NOT FIREABLE(t9.3)) U (NOT FIREABLE(t6.2) AND NOT FIREABLE(t10.5))))
lola: processed formula length: 99
lola: 7 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file Eratosthenes-PT-010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 27 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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t8.4) AND (E (G (FIREABLE(t4.2))) AND E (G (A (F (FIREABLE(t6.2)))))))
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: FIREABLE(t8.4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t8.4)
lola: processed formula length: 14
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file Eratosthenes-PT-010-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(t4.2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT FIREABLE(t4.2)))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file Eratosthenes-PT-010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 27 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 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((A (F (FIREABLE(t4.2))) OR (NOT FIREABLE(t8.2) AND NOT FIREABLE(t10.5))) U E (G ((FIREABLE(t9.3) AND FIREABLE(t4.2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((A(TRUE U FIREABLE(t4.2)) OR (NOT FIREABLE(t8.2) AND NOT FIREABLE(t10.5))) U NOT(A(TRUE U (NOT FIREABLE(t9.3) OR NOT FIREABLE(t4.2)))))
lola: processed formula length: 138
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file Eratosthenes-PT-010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 27 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 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t8.2) AND NOT FIREABLE(t9.3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t8.2) AND NOT FIREABLE(t9.3))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file Eratosthenes-PT-010-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 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X (A (F (FIREABLE(t9.3)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX(A(TRUE U FIREABLE(t9.3))))
lola: processed formula length: 38
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file Eratosthenes-PT-010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 27 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((FIREABLE(t8.4) AND FIREABLE(t4.2) AND (FIREABLE(t6.3) OR FIREABLE(t4.2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((FIREABLE(t8.4) AND FIREABLE(t4.2) AND (FIREABLE(t6.3) OR FIREABLE(t4.2)))))
lola: processed formula length: 89
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file Eratosthenes-PT-010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 27 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 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((FIREABLE(t6.2) OR E ((FIREABLE(t8.4) U FIREABLE(t6.2)))) AND ((FIREABLE(t6.3) OR A (F (FIREABLE(t4.2)))) OR ((FIREABLE(t10.2) OR FIREABLE(t8.4) OR NOT FIREABLE(t10.5)) AND FIREABLE(t4.2)))) OR ((((NOT FIREABLE(t6.2) OR NOT FIREABLE(t10.5)) AND NOT FIREABLE(t10.5)) AND E ((FIREABLE(t6.3) U FIREABLE(t10.2)))) OR A ((FIREABLE(t10.5) U FIREABLE(t10.5)))))
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(t6.2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t6.2)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file Eratosthenes-PT-010-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: 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: A (F (FIREABLE(t4.2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U FIREABLE(t4.2))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file Eratosthenes-PT-010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 27 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: RESULT
lola:
SUMMARY: yes no no yes no yes no no no yes no no no yes yes yes
FORMULA Eratosthenes-PT-010-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Eratosthenes-PT-010-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Eratosthenes-PT-010-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Eratosthenes-PT-010-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Eratosthenes-PT-010-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Eratosthenes-PT-010-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Eratosthenes-PT-010-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Eratosthenes-PT-010-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Eratosthenes-PT-010-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Eratosthenes-PT-010-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Eratosthenes-PT-010-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Eratosthenes-PT-010-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Eratosthenes-PT-010-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Eratosthenes-PT-010-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Eratosthenes-PT-010-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Eratosthenes-PT-010-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494696046208

--------------------
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="Eratosthenes-PT-010"
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/Eratosthenes-PT-010.tgz
mv Eratosthenes-PT-010 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 Eratosthenes-PT-010, 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 r028-blw3-149440264200328"
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 ;