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 FlexibleBarrier-PT-04b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-blw3-149581034100013
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496481381363


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


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-04b: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLFireability @ FlexibleBarrier-PT-04b @ 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: 573/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 268 places, 305 transitions, 262 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 315 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-04b-CTLFireability.task
lola: A (F (((FIREABLE(t230) OR FIREABLE(t151)) AND (FIREABLE(t213) OR NOT FIREABLE(t48))))) : ((NOT((A (X (FIREABLE(t230))) AND FIREABLE(t76))) OR E (X (FIREABLE(t232)))) AND NOT(E (F (A (G (FIREABLE(t94))))))) : NOT((FIREABLE(t186) OR A (F ((FIREABLE(t290) OR (FIREABLE(t189) AND FIREABLE(t204))))))) : A (F (FIREABLE(t102))) : A (((E (G (FIREABLE(t242))) OR (NOT FIREABLE(t249) AND NOT FIREABLE(t288))) U A (G (NOT FIREABLE(t58))))) : NOT(A ((NOT FIREABLE(t264) U E (F (FIREABLE(t7)))))) : NOT(A (F (((NOT FIREABLE(t19) OR NOT FIREABLE(t260)) AND FIREABLE(t96))))) : A (G ((A (F ((FIREABLE(t70) AND FIREABLE(t11)))) OR E (F (FIREABLE(t196)))))) : E (F (FIREABLE(t273))) : E ((E (X (NOT FIREABLE(t287))) U (A (X (FIREABLE(t138))) OR E (X (FIREABLE(t239)))))) : A (F (A (((FIREABLE(t68) OR FIREABLE(t179)) U FIREABLE(t50))))) : E (F (FIREABLE(t189))) : A (F (E (G (FIREABLE(t180))))) : A ((E (G (FIREABLE(t299))) U E (F ((FIREABLE(t31) AND FIREABLE(t175)))))) : (A (F (A ((FIREABLE(t173) U FIREABLE(t176))))) AND E (G (((NOT FIREABLE(t207) OR NOT FIREABLE(t87)) AND (NOT FIREABLE(t19) OR NOT FIREABLE(t1)))))) : (A (((NOT FIREABLE(t202) OR NOT FIREABLE(t61)) U FIREABLE(t105))) OR (A (G (A (X (FIREABLE(t302))))) AND FIREABLE(t195)))
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 (((FIREABLE(t230) OR FIREABLE(t151)) AND (FIREABLE(t213) OR NOT FIREABLE(t48)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((FIREABLE(t230) OR FIREABLE(t151)) AND (FIREABLE(t213) OR NOT FIREABLE(t48))))
lola: processed formula length: 90
lola: 1 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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: ((NOT((A (X (FIREABLE(t230))) AND FIREABLE(t76))) OR E (X (FIREABLE(t232)))) AND NOT(E (F (A (G (FIREABLE(t94)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT FIREABLE(t230)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT FIREABLE(t230))
lola: processed formula length: 22
lola: 12 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (NOT FIREABLE(t94)))))
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 NOT FIREABLE(t94)))))
lola: processed formula length: 47
lola: 13 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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: 1160994 markings, 3472806 edges, 3689348869717491712 markings/sec, 0 secs
lola: 2185527 markings, 6956531 edges, 204907 markings/sec, 5 secs
lola: 3090825 markings, 10201076 edges, 181060 markings/sec, 10 secs
lola: 3937576 markings, 13408675 edges, 169350 markings/sec, 15 secs
lola: 4749549 markings, 16485406 edges, 162395 markings/sec, 20 secs
lola: 5572012 markings, 19590027 edges, 164493 markings/sec, 25 secs
lola: 6341667 markings, 22537851 edges, 153931 markings/sec, 30 secs
lola: 7199221 markings, 25532079 edges, 171511 markings/sec, 35 secs
lola: 7959514 markings, 28528359 edges, 152059 markings/sec, 40 secs
lola: 8738793 markings, 31520983 edges, 155856 markings/sec, 45 secs
lola: 9471229 markings, 34368602 edges, 146487 markings/sec, 50 secs
lola: 10241515 markings, 37136530 edges, 154057 markings/sec, 55 secs
lola: 10954606 markings, 39938121 edges, 142618 markings/sec, 60 secs
lola: 11607306 markings, 42685416 edges, 130540 markings/sec, 65 secs
lola: 12164743 markings, 44829227 edges, 111487 markings/sec, 70 secs
lola: 12831558 markings, 47551135 edges, 133363 markings/sec, 75 secs
lola: 13490133 markings, 50325156 edges, 131715 markings/sec, 80 secs
lola: 14180156 markings, 53028952 edges, 138005 markings/sec, 85 secs
lola: 14729467 markings, 55241368 edges, 109862 markings/sec, 90 secs
lola: 15396904 markings, 57766069 edges, 133487 markings/sec, 95 secs
lola: 16045665 markings, 60488505 edges, 129752 markings/sec, 100 secs
lola: 16709305 markings, 63227768 edges, 132728 markings/sec, 105 secs
lola: 17352974 markings, 66009772 edges, 128734 markings/sec, 110 secs
lola: 18081669 markings, 68961639 edges, 145739 markings/sec, 115 secs
lola: 18698060 markings, 71646117 edges, 123278 markings/sec, 120 secs
lola: 19276379 markings, 74315249 edges, 115664 markings/sec, 125 secs
lola: 19692727 markings, 76320207 edges, 83270 markings/sec, 130 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 2 will run for 242 seconds at most (--localtimelimit=-1)
lola: lola: ========================================
========================================
lola: ...considering subproblem: NOT((FIREABLE(t186) OR A (F ((FIREABLE(t290) OR (FIREABLE(t189) AND FIREABLE(t204)))))))
lola: ========================================
lola: SUBTASK
lola: lola: ========================================checking a Boolean combination of formulas

lola: RUNNING
lola: subprocess 2 will run for 242 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t186)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t186)
lola: processed formula length: 18
lola: 5 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-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 3 will run for 261 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(t290) AND (NOT FIREABLE(t189) OR NOT FIREABLE(t204)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (FIREABLE(t290) OR (FIREABLE(t189) AND FIREABLE(t204)))))
lola: processed formula length: 71
lola: 7 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 261 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t102)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U FIREABLE(t102))
lola: processed formula length: 24
lola: 1 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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 4 will run for 283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((E (G (FIREABLE(t242))) OR (NOT FIREABLE(t249) AND NOT FIREABLE(t288))) U A (G (NOT FIREABLE(t58)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((NOT(A(TRUE U NOT FIREABLE(t242))) OR (NOT FIREABLE(t249) AND NOT FIREABLE(t288))) U NOT(E(TRUE U FIREABLE(t58))))
lola: processed formula length: 116
lola: 5 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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 5 will run for 309 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A ((NOT FIREABLE(t264) U E (F (FIREABLE(t7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(NOT FIREABLE(t264) U E(TRUE U FIREABLE(t7))))
lola: processed formula length: 51
lola: 11 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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 6 will run for 340 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (((NOT FIREABLE(t19) OR NOT FIREABLE(t260)) AND FIREABLE(t96)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((NOT FIREABLE(t19) OR NOT FIREABLE(t260)) AND FIREABLE(t96))))
lola: processed formula length: 77
lola: 5 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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 7 will run for 377 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F ((FIREABLE(t70) AND FIREABLE(t11)))) OR E (F (FIREABLE(t196))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(A(TRUE U (FIREABLE(t70) AND FIREABLE(t11)))) AND NOT(E(TRUE U FIREABLE(t196))))))
lola: processed formula length: 99
lola: 4 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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 8 will run for 424 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t273)))
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 36 bytes per marking, with 26 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 9 will run for 485 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (X (NOT FIREABLE(t287))) U (A (X (FIREABLE(t138))) OR E (X (FIREABLE(t239))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(EX(NOT FIREABLE(t287)) U (AX(FIREABLE(t138)) OR EX(FIREABLE(t239))))
lola: processed formula length: 70
lola: 4 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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 10 will run for 566 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (((FIREABLE(t68) OR FIREABLE(t179)) U FIREABLE(t50)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U A((FIREABLE(t68) OR FIREABLE(t179)) U FIREABLE(t50)))
lola: processed formula length: 63
lola: 2 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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 679 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t189)))
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 36 bytes per marking, with 26 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 12 will run for 849 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (FIREABLE(t180)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U NOT FIREABLE(t180))))
lola: processed formula length: 43
lola: 3 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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 13 will run for 1133 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (G (FIREABLE(t299))) U E (F ((FIREABLE(t31) AND FIREABLE(t175))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(A(TRUE U NOT FIREABLE(t299))) U E(TRUE U (FIREABLE(t31) AND FIREABLE(t175))))
lola: processed formula length: 83
lola: 4 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 14 will run for 1698 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A ((FIREABLE(t173) U FIREABLE(t176))))) AND E (G (((NOT FIREABLE(t207) OR NOT FIREABLE(t87)) AND (NOT FIREABLE(t19) OR NOT FIREABLE(t1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1698 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A ((FIREABLE(t173) U FIREABLE(t176)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U A(FIREABLE(t173) U FIREABLE(t176)))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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: subprocess 15 will run for 3396 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (((NOT FIREABLE(t202) OR NOT FIREABLE(t61)) U FIREABLE(t105))) OR (A (G (A (X (FIREABLE(t302))))) AND FIREABLE(t195)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 15 will run for 3396 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((NOT FIREABLE(t202) OR NOT FIREABLE(t61)) U FIREABLE(t105)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((NOT FIREABLE(t202) OR NOT FIREABLE(t61)) U FIREABLE(t105))
lola: processed formula length: 62
lola: 1 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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: RESULT
lola:
SUMMARY: no yes yes no no no yes no yes yes no yes no yes no yes
lola: ========================================
FORMULA FlexibleBarrier-PT-04b-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496481525410

--------------------
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="FlexibleBarrier-PT-04b"
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/FlexibleBarrier-PT-04b.tgz
mv FlexibleBarrier-PT-04b 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 FlexibleBarrier-PT-04b, 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 r188-blw3-149581034100013"
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 ;